{"$schema":"https://json.schemastore.org/sarif-2.1.0.json","version":"2.1.0","runs":[{"tool":{"driver":{"name":"codehealth","informationUri":"https://codehealth.canine.dev","rules":[{"id":"D1","name":"Cyclomatic Complexity","shortDescription":{"text":"Cyclomatic Complexity"},"helpUri":"https://codehealth.canine.dev/dimensions/D1"},{"id":"D2","name":"Cognitive Complexity","shortDescription":{"text":"Cognitive Complexity"},"helpUri":"https://codehealth.canine.dev/dimensions/D2"},{"id":"D3","name":"God Classes","shortDescription":{"text":"God Classes"},"helpUri":"https://codehealth.canine.dev/dimensions/D3"},{"id":"D4","name":"Code Duplication","shortDescription":{"text":"Code Duplication"},"helpUri":"https://codehealth.canine.dev/dimensions/D4"},{"id":"D5","name":"Coupling","shortDescription":{"text":"Coupling"},"helpUri":"https://codehealth.canine.dev/dimensions/D5"},{"id":"D6","name":"Cohesion (LCOM4)","shortDescription":{"text":"Cohesion (LCOM4)"},"helpUri":"https://codehealth.canine.dev/dimensions/D6"},{"id":"D7","name":"Architectural Integrity","shortDescription":{"text":"Architectural Integrity"},"helpUri":"https://codehealth.canine.dev/dimensions/D7"},{"id":"D11","name":"Test Reliability","shortDescription":{"text":"Test Reliability"},"helpUri":"https://codehealth.canine.dev/dimensions/D11"},{"id":"D12","name":"Dependency Hygiene","shortDescription":{"text":"Dependency Hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/D12"},{"id":"D13","name":"Secret Scanning","shortDescription":{"text":"Secret Scanning"},"helpUri":"https://codehealth.canine.dev/dimensions/D13","relationships":[{"target":{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-259","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A07:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-798","CWE-259"],"owasp":"A07:2025"}},{"id":"D14","name":"License Compliance","shortDescription":{"text":"License Compliance"},"helpUri":"https://codehealth.canine.dev/dimensions/D14"},{"id":"D15","name":"Churn \u00D7 Complexity Hotspots","shortDescription":{"text":"Churn \u00D7 Complexity Hotspots"},"helpUri":"https://codehealth.canine.dev/dimensions/D15"},{"id":"D16","name":"Bus Factor","shortDescription":{"text":"Bus Factor"},"helpUri":"https://codehealth.canine.dev/dimensions/D16"},{"id":"D17","name":"Explicit Debt","shortDescription":{"text":"Explicit Debt"},"helpUri":"https://codehealth.canine.dev/dimensions/D17"},{"id":"D19","name":"Documentation Quality","shortDescription":{"text":"Documentation Quality"},"helpUri":"https://codehealth.canine.dev/dimensions/D19"},{"id":"D20","name":"ADR Quality","shortDescription":{"text":"ADR Quality"},"helpUri":"https://codehealth.canine.dev/dimensions/D20"},{"id":"D26","name":"Project Cohesion","shortDescription":{"text":"Project Cohesion"},"helpUri":"https://codehealth.canine.dev/dimensions/D26"},{"id":"D27","name":"Navigability","shortDescription":{"text":"Navigability"},"helpUri":"https://codehealth.canine.dev/dimensions/D27"},{"id":"D28","name":"Secrets (history)","shortDescription":{"text":"Secrets (history)"},"helpUri":"https://codehealth.canine.dev/dimensions/D28","relationships":[{"target":{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-259","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A07:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-798","CWE-259"],"owasp":"A07:2025"}},{"id":"D29","name":"Static Analysis (SAST)","shortDescription":{"text":"Static Analysis (SAST)"},"helpUri":"https://codehealth.canine.dev/dimensions/D29","relationships":[{"target":{"id":"CWE-79","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-89","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-78","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-94","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-77","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-79","CWE-89","CWE-78","CWE-94","CWE-77"],"owasp":"A05:2025"}},{"id":"D30","name":"Dependency Vulnerabilities","shortDescription":{"text":"Dependency Vulnerabilities"},"helpUri":"https://codehealth.canine.dev/dimensions/D30","relationships":[{"target":{"id":"CWE-1395","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-937","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-1395","CWE-937"],"owasp":"A03:2025"}},{"id":"D31","name":"IaC \u0026 Container Security","shortDescription":{"text":"IaC \u0026 Container Security"},"helpUri":"https://codehealth.canine.dev/dimensions/D31","relationships":[{"target":{"id":"CWE-1032","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-732","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-16","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A02:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-1032","CWE-732","CWE-16"],"owasp":"A02:2025"}},{"id":"D34","name":"Knowledge Freshness","shortDescription":{"text":"Knowledge Freshness"},"helpUri":"https://codehealth.canine.dev/dimensions/D34"},{"id":"D35","name":"Change Coupling","shortDescription":{"text":"Change Coupling"},"helpUri":"https://codehealth.canine.dev/dimensions/D35"},{"id":"D36","name":"Supply-chain Provenance \u0026 Signing","shortDescription":{"text":"Supply-chain Provenance \u0026 Signing"},"helpUri":"https://codehealth.canine.dev/dimensions/D36","relationships":[{"target":{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-494","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-1357","CWE-494"],"owasp":"A03:2025"}},{"id":"D40","name":"Network Egress Confinement","shortDescription":{"text":"Network Egress Confinement"},"helpUri":"https://codehealth.canine.dev/dimensions/D40"},{"id":"D41","name":"Kernel \u0026 Syscall Confinement","shortDescription":{"text":"Kernel \u0026 Syscall Confinement"},"helpUri":"https://codehealth.canine.dev/dimensions/D41"},{"id":"D43","name":"Malicious Dependencies","shortDescription":{"text":"Malicious Dependencies"},"helpUri":"https://codehealth.canine.dev/dimensions/D43","relationships":[{"target":{"id":"CWE-506","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A08:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-506"],"owasp":"A08:2025"}},{"id":"D44","name":"Platform End-of-Life","shortDescription":{"text":"Platform End-of-Life"},"helpUri":"https://codehealth.canine.dev/dimensions/D44"},{"id":"AC2","name":"Forms \u0026 labels","shortDescription":{"text":"Forms \u0026 labels"},"helpUri":"https://codehealth.canine.dev/dimensions/AC2"},{"id":"AC6","name":"Visual \u0026 motion safety","shortDescription":{"text":"Visual \u0026 motion safety"},"helpUri":"https://codehealth.canine.dev/dimensions/AC6"},{"id":"AX10","name":"Code composition","shortDescription":{"text":"Code composition"},"helpUri":"https://codehealth.canine.dev/dimensions/AX10"},{"id":"AX3","name":"Project dependency cycles","shortDescription":{"text":"Project dependency cycles"},"helpUri":"https://codehealth.canine.dev/dimensions/AX3"},{"id":"AX4","name":"Dependency direction","shortDescription":{"text":"Dependency direction"},"helpUri":"https://codehealth.canine.dev/dimensions/AX4"},{"id":"AX8","name":"Test isolation","shortDescription":{"text":"Test isolation"},"helpUri":"https://codehealth.canine.dev/dimensions/AX8"},{"id":"AXB2","name":"Runtime readiness","shortDescription":{"text":"Runtime readiness"},"helpUri":"https://codehealth.canine.dev/dimensions/AXB2"},{"id":"C2","name":"Access Controls","shortDescription":{"text":"Access Controls"},"helpUri":"https://codehealth.canine.dev/dimensions/C2"},{"id":"ED5","name":"Idempotency","shortDescription":{"text":"Idempotency"},"helpUri":"https://codehealth.canine.dev/dimensions/ED5"},{"id":"M1","name":"Documentation (README)","shortDescription":{"text":"Documentation (README)"},"helpUri":"https://codehealth.canine.dev/dimensions/M1"},{"id":"M2","name":"Architecture documentation","shortDescription":{"text":"Architecture documentation"},"helpUri":"https://codehealth.canine.dev/dimensions/M2"},{"id":"M3","name":"Folder \u0026 project structure","shortDescription":{"text":"Folder \u0026 project structure"},"helpUri":"https://codehealth.canine.dev/dimensions/M3"},{"id":"M4","name":"Documentation accuracy","shortDescription":{"text":"Documentation accuracy"},"helpUri":"https://codehealth.canine.dev/dimensions/M4"},{"id":"P1","name":"CI/CD gates","shortDescription":{"text":"CI/CD gates"},"helpUri":"https://codehealth.canine.dev/dimensions/P1"},{"id":"P10","name":"Library API \u0026 versioning","shortDescription":{"text":"Library API \u0026 versioning"},"helpUri":"https://codehealth.canine.dev/dimensions/P10"},{"id":"P12","name":"CI test-gate honesty","shortDescription":{"text":"CI test-gate honesty"},"helpUri":"https://codehealth.canine.dev/dimensions/P12"},{"id":"P2","name":"Observability","shortDescription":{"text":"Observability"},"helpUri":"https://codehealth.canine.dev/dimensions/P2"},{"id":"P3","name":"Security \u0026 performance tooling","shortDescription":{"text":"Security \u0026 performance tooling"},"helpUri":"https://codehealth.canine.dev/dimensions/P3"},{"id":"P4","name":"Deployment \u0026 Rollback","shortDescription":{"text":"Deployment \u0026 Rollback"},"helpUri":"https://codehealth.canine.dev/dimensions/P4"},{"id":"P6","name":"Release Hygiene","shortDescription":{"text":"Release Hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/P6"},{"id":"PF1","name":"Benchmark discipline","shortDescription":{"text":"Benchmark discipline"},"helpUri":"https://codehealth.canine.dev/dimensions/PF1"},{"id":"PF3","name":"Async \u0026 latency hygiene","shortDescription":{"text":"Async \u0026 latency hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/PF3"},{"id":"X1","name":"Async correctness","shortDescription":{"text":"Async correctness"},"helpUri":"https://codehealth.canine.dev/dimensions/X1"},{"id":"X10","name":"Duplicated predicate","shortDescription":{"text":"Duplicated predicate"},"helpUri":"https://codehealth.canine.dev/dimensions/X10"},{"id":"X12","name":"Unreachable branch","shortDescription":{"text":"Unreachable branch"},"helpUri":"https://codehealth.canine.dev/dimensions/X12"},{"id":"X13","name":"Undrained process stream","shortDescription":{"text":"Undrained process stream"},"helpUri":"https://codehealth.canine.dev/dimensions/X13"},{"id":"X14","name":"Bypassable address classification","shortDescription":{"text":"Bypassable address classification"},"helpUri":"https://codehealth.canine.dev/dimensions/X14"},{"id":"X15","name":"Unvalidated length from an untrusted reader","shortDescription":{"text":"Unvalidated length from an untrusted reader"},"helpUri":"https://codehealth.canine.dev/dimensions/X15"},{"id":"X17","name":"Uncapped recursion over a caller-supplied document","shortDescription":{"text":"Uncapped recursion over a caller-supplied document"},"helpUri":"https://codehealth.canine.dev/dimensions/X17"},{"id":"X18","name":"Disposal-pattern correctness","shortDescription":{"text":"Disposal-pattern correctness"},"helpUri":"https://codehealth.canine.dev/dimensions/X18"},{"id":"X19","name":"Unrestored process-global state","shortDescription":{"text":"Unrestored process-global state"},"helpUri":"https://codehealth.canine.dev/dimensions/X19"},{"id":"X20","name":"Mistyped argument guard","shortDescription":{"text":"Mistyped argument guard"},"helpUri":"https://codehealth.canine.dev/dimensions/X20"},{"id":"X21","name":"Side-effecting pattern guard","shortDescription":{"text":"Side-effecting pattern guard"},"helpUri":"https://codehealth.canine.dev/dimensions/X21"},{"id":"X22","name":"Contradicted release guard","shortDescription":{"text":"Contradicted release guard"},"helpUri":"https://codehealth.canine.dev/dimensions/X22"},{"id":"X23","name":"Unguarded diagnostic materialisation","shortDescription":{"text":"Unguarded diagnostic materialisation"},"helpUri":"https://codehealth.canine.dev/dimensions/X23"},{"id":"X24","name":"Document value interpolated into markup unescaped","shortDescription":{"text":"Document value interpolated into markup unescaped"},"helpUri":"https://codehealth.canine.dev/dimensions/X24"},{"id":"X25","name":"Inert configuration knob","shortDescription":{"text":"Inert configuration knob"},"helpUri":"https://codehealth.canine.dev/dimensions/X25"},{"id":"X26","name":"Unsynchronised callback handoff","shortDescription":{"text":"Unsynchronised callback handoff"},"helpUri":"https://codehealth.canine.dev/dimensions/X26"},{"id":"X27","name":"Collection changed while being enumerated","shortDescription":{"text":"Collection changed while being enumerated"},"helpUri":"https://codehealth.canine.dev/dimensions/X27"},{"id":"X28","name":"Index access outside its own emptiness guard","shortDescription":{"text":"Index access outside its own emptiness guard"},"helpUri":"https://codehealth.canine.dev/dimensions/X28"},{"id":"X3","name":"Exception handling","shortDescription":{"text":"Exception handling"},"helpUri":"https://codehealth.canine.dev/dimensions/X3"},{"id":"X30","name":"Support guard that admits what it rejects","shortDescription":{"text":"Support guard that admits what it rejects"},"helpUri":"https://codehealth.canine.dev/dimensions/X30"},{"id":"X32","name":"Type resolved by simple name across every loaded assembly","shortDescription":{"text":"Type resolved by simple name across every loaded assembly"},"helpUri":"https://codehealth.canine.dev/dimensions/X32"},{"id":"X4","name":"Structured logging","shortDescription":{"text":"Structured logging"},"helpUri":"https://codehealth.canine.dev/dimensions/X4"},{"id":"X6","name":"Hand-rolled structured-format parsing","shortDescription":{"text":"Hand-rolled structured-format parsing"},"helpUri":"https://codehealth.canine.dev/dimensions/X6"},{"id":"X7","name":"Silent fallback defaults","shortDescription":{"text":"Silent fallback defaults"},"helpUri":"https://codehealth.canine.dev/dimensions/X7"},{"id":"X9","name":"Subsumed condition operand","shortDescription":{"text":"Subsumed condition operand"},"helpUri":"https://codehealth.canine.dev/dimensions/X9"}]}},"results":[{"ruleId":"D1","level":"warning","message":{"text":"tcgen05.mma (cyclomatic 128): tcgen05.mma has cyclomatic complexity 128 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/mosaic/gpu/tcgen05.py"},"region":{"startLine":216}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e1ea3a16b70c76bee5bef5ffb1dceb7b3d09bdba8717cd11d47e9a299c7a33e"}},{"ruleId":"D1","level":"warning","message":{"text":"LaunchContext.async_copy (cyclomatic 110): LaunchContext.async_copy has cyclomatic complexity 110 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/mosaic/gpu/launch_context.py"},"region":{"startLine":1473}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5bf43cb37a7b32ef47aded3fe08440f82114396cc445e3d12f36b2f932cdf00"}},{"ruleId":"D1","level":"warning","message":{"text":"FragmentedArray.astype (cyclomatic 106): FragmentedArray.astype has cyclomatic complexity 106 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/mosaic/gpu/fragmented_array.py"},"region":{"startLine":2507}}}],"partialFingerprints":{"codehealthFindingId/v1":"af5b92db0b8f74de30cfcd043d1e9b49096116106d0f83279abe95ef8463e4b9"}},{"ruleId":"D1","level":"warning","message":{"text":"mlir.lower_jaxpr_to_fun (cyclomatic 103): mlir.lower_jaxpr_to_fun has cyclomatic complexity 103 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/interpreters/mlir.py"},"region":{"startLine":1779}}}],"partialFingerprints":{"codehealthFindingId/v1":"e75ae7c2ac715ecc723fecf0350d420c267108a765e6bce73b045f8365d093fb"}},{"ruleId":"D1","level":"warning","message":{"text":"FragmentedArray.transfer_tiled (cyclomatic 82): FragmentedArray.transfer_tiled has cyclomatic complexity 82 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/mosaic/gpu/fragmented_array.py"},"region":{"startLine":4749}}}],"partialFingerprints":{"codehealthFindingId/v1":"78856959013c55360205dc203011fef315da520a49beb684c37f1d88f58a0c59"}},{"ruleId":"D1","level":"warning","message":{"text":"FragmentedArray.reduce (cyclomatic 71): FragmentedArray.reduce has cyclomatic complexity 71 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/mosaic/gpu/fragmented_array.py"},"region":{"startLine":3299}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a19df1b0dbe75502a1e8907e3c8d626daca666c4cbb5b124e4272a4abac5a52"}},{"ruleId":"D1","level":"warning","message":{"text":"reductions._quantile (cyclomatic 58): reductions._quantile has cyclomatic complexity 58 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/numpy/reductions.py"},"region":{"startLine":2720}}}],"partialFingerprints":{"codehealthFindingId/v1":"270992471817ff9f9feb5225ed0444b062e597f1214bdab253cbb298c5d97cec"}},{"ruleId":"D1","level":"warning","message":{"text":"primitives._copy_gmem_to_smem_lowering (cyclomatic 52): primitives._copy_gmem_to_smem_lowering has cyclomatic complexity 52 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/mosaic_gpu/primitives.py"},"region":{"startLine":975}}}],"partialFingerprints":{"codehealthFindingId/v1":"beb6fad1d2d9bb3a38179eb73ed727d38b2f4e4b0bebe37f64a6ffd77af96275"}},{"ruleId":"D1","level":"warning","message":{"text":"splash_attention_mask_info._process_mask (cyclomatic 49): splash_attention_mask_info._process_mask has cyclomatic complexity 49 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/pallas/ops/tpu/splash_attention/splash_attention_mask_info.py"},"region":{"startLine":518}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0be393b9b9617da29904a9b8f6ddb522f7b165ec9923d5dd072ae275c6440c1"}},{"ruleId":"D1","level":"warning","message":{"text":"interpret_pallas_call._interpret_jaxpr (cyclomatic 48): interpret_pallas_call._interpret_jaxpr has cyclomatic complexity 48 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/mosaic/interpret/interpret_pallas_call.py"},"region":{"startLine":1349}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7cfe4edf72e6b72b03d887dc396289d31ac5fe10f607795e9209d09cca0a4fd"}},{"ruleId":"D1","level":"warning","message":{"text":"signal._spectral_helper (cyclomatic 47): signal._spectral_helper has cyclomatic complexity 47 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/scipy/signal.py"},"region":{"startLine":615}}}],"partialFingerprints":{"codehealthFindingId/v1":"83860423debde4f0ced348a9024981030209954318abdaa421ed15e34e289bb3"}},{"ruleId":"D1","level":"warning","message":{"text":"CustomCallBackendConfig.to_json (cyclomatic 46): CustomCallBackendConfig.to_json has cyclomatic complexity 46 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/tpu_custom_call.py"},"region":{"startLine":251}}}],"partialFingerprints":{"codehealthFindingId/v1":"49719b8c1f67803eef4bde97a2d2d6b73ff29a4278d3f14a98d9b0bb8c166758"}},{"ruleId":"D1","level":"warning","message":{"text":"array_constructors.array (cyclomatic 44): array_constructors.array has cyclomatic complexity 44 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/numpy/array_constructors.py"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"4896daf873148c1ffb90d990f8905dff48b07a83be07ca3412fbc00bfcd558c8"}},{"ruleId":"D1","level":"warning","message":{"text":"lowering.lower_jaxpr_into_pipelined_module (cyclomatic 41): lowering.lower_jaxpr_into_pipelined_module has cyclomatic complexity 41 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/mosaic/lowering.py"},"region":{"startLine":1104}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ec321e2a12a61b31f04ab1b820212b084963238f52acd521935f5d5c4e8a6c9"}},{"ruleId":"D1","level":"warning","message":{"text":"FragmentedArray.to_layout (cyclomatic 41): FragmentedArray.to_layout has cyclomatic complexity 41 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/mosaic/gpu/fragmented_array.py"},"region":{"startLine":1352}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a38f610d085b2cff3f5275d10e2c448675c7965445401c9b744916dcebf9bb4"}},{"ruleId":"D1","level":"warning","message":{"text":"LaunchContext.async_copy_im2col (cyclomatic 37): LaunchContext.async_copy_im2col has cyclomatic complexity 37 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/mosaic/gpu/launch_context.py"},"region":{"startLine":2266}}}],"partialFingerprints":{"codehealthFindingId/v1":"11a716ed1c4b9984db26e19628d25cdf12bcd3d665b9e8220353ca8800daaeb8"}},{"ruleId":"D1","level":"warning","message":{"text":"dispatch._device_put_sharding_impl (cyclomatic 36): dispatch._device_put_sharding_impl has cyclomatic complexity 36 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/dispatch.py"},"region":{"startLine":471}}}],"partialFingerprints":{"codehealthFindingId/v1":"06be10a810ecb9c2b0acf22a8dceb0946f145d78d72723db3f3bcc3527d054cb"}},{"ruleId":"D1","level":"warning","message":{"text":"lax._convert_element_type (cyclomatic 36): lax._convert_element_type has cyclomatic complexity 36 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/lax/lax.py"},"region":{"startLine":1841}}}],"partialFingerprints":{"codehealthFindingId/v1":"50a8c51c2cd85f8b0e7193fcbac75ee4c7a503c6ffb9ad0b424545505e7dbbc3"}},{"ruleId":"D1","level":"warning","message":{"text":"FragmentedArray._store_register_atomic (cyclomatic 36): FragmentedArray._store_register_atomic has cyclomatic complexity 36 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/mosaic/gpu/fragmented_array.py"},"region":{"startLine":4375}}}],"partialFingerprints":{"codehealthFindingId/v1":"ccd87313d99b54415178f1662966717a9432afc497aefe8f47bbd21d6dd15679"}},{"ruleId":"D1","level":"warning","message":{"text":"TMEMRef.load (cyclomatic 36): TMEMRef.load has cyclomatic complexity 36 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/mosaic/gpu/tcgen05.py"},"region":{"startLine":1431}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6ba5fb69fc39b03150361386008f1bcd0361822ce9ccf40e54fc93e804cf4b3"}},{"ruleId":"D1","level":"warning","message":{"text":"constraints.reduce_constraint (cyclomatic 35): constraints.reduce_constraint has cyclomatic complexity 35 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/mosaic/gpu/constraints.py"},"region":{"startLine":939}}}],"partialFingerprints":{"codehealthFindingId/v1":"891c8f7346442c3d6d85acf31532b35ce3151393fbccba365010271169026c0a"}},{"ruleId":"D1","level":"warning","message":{"text":"einsum._einsum (cyclomatic 33): einsum._einsum has cyclomatic complexity 33 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/numpy/einsum.py"},"region":{"startLine":441}}}],"partialFingerprints":{"codehealthFindingId/v1":"5db2b104265a4dff9f9de917f283ce1ac6b8f332f3e623ce9f1d688e8656b272"}},{"ruleId":"D1","level":"warning","message":{"text":"wgmma.wgmma (cyclomatic 32): wgmma.wgmma has cyclomatic complexity 32 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/mosaic/gpu/wgmma.py"},"region":{"startLine":292}}}],"partialFingerprints":{"codehealthFindingId/v1":"23201154c8835abce92cea097f9b19400822422f13775d3f552476caf4dc21a1"}},{"ruleId":"D1","level":"warning","message":{"text":"reductions._reduction (cyclomatic 31): reductions._reduction has cyclomatic complexity 31 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/numpy/reductions.py"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"9fd6435e461da3a6f22466ad0012951e866adee7ebbd9f983b9b8f44594d41e2"}},{"ruleId":"D1","level":"warning","message":{"text":"primitives._tcgen05_mma_lowering (cyclomatic 31): primitives._tcgen05_mma_lowering has cyclomatic complexity 31 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/mosaic_gpu/primitives.py"},"region":{"startLine":2814}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e9e5e41d8cc3365e9efbd4f1e5072e339660281e2779db93573c2cff8a43f14"}},{"ruleId":"D1","level":"warning","message":{"text":"wgmma._wgmma_m64 (cyclomatic 31): wgmma._wgmma_m64 has cyclomatic complexity 31 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/mosaic/gpu/wgmma.py"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"c66595b86867e6576717536aedc331cf4b47bddc0836ea1fedeeedadb65ef591"}},{"ruleId":"D1","level":"warning","message":{"text":"mlir.lower_jaxpr_to_module (cyclomatic 30): mlir.lower_jaxpr_to_module has cyclomatic complexity 30 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/interpreters/mlir.py"},"region":{"startLine":1436}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf2cce79a6982ef34c4f70d0312bd96ec746380b04f006cb2c73cfae7db30f9a"}},{"ruleId":"D1","level":"warning","message":{"text":"lax_numpy.cov (cyclomatic 30): lax_numpy.cov has cyclomatic complexity 30 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/numpy/lax_numpy.py"},"region":{"startLine":9176}}}],"partialFingerprints":{"codehealthFindingId/v1":"b73e0e017ed0a9f9a48fd7d30e35ad2784c0b8a676cb0cfa73491b83d4a43131"}},{"ruleId":"D1","level":"warning","message":{"text":"shard_map_fusion._make_block_extractor (cyclomatic 30): shard_map_fusion._make_block_extractor has cyclomatic complexity 30 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/fuser/shard_map_fusion.py"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"6cc32cec41e02176679dd3916606e6cffe9bd7ea26d2d6275decf05341a9b511"}},{"ruleId":"D1","level":"warning","message":{"text":"core._launch (cyclomatic 30): core._launch has cyclomatic complexity 30 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/mosaic/gpu/core.py"},"region":{"startLine":751}}}],"partialFingerprints":{"codehealthFindingId/v1":"425c479910fa75b0d61d173c816df0aa17889041146e15a2a388944a9780cf7b"}},{"ruleId":"D1","level":"warning","message":{"text":"splash_attention_kernel._splash_attention_forward (cyclomatic 30): splash_attention_kernel._splash_attention_forward has cyclomatic complexity 30 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/pallas/ops/tpu/splash_attention/splash_attention_kernel.py"},"region":{"startLine":912}}}],"partialFingerprints":{"codehealthFindingId/v1":"827f56450b37fdac55bde055df0cd19fdf8bd296a2c8dc600bac13478c8418de"}},{"ruleId":"D1","level":"warning","message":{"text":"mlir._set_up_aliases (cyclomatic 29): mlir._set_up_aliases has cyclomatic complexity 29 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/interpreters/mlir.py"},"region":{"startLine":1604}}}],"partialFingerprints":{"codehealthFindingId/v1":"230460a044a38b474bd833ad0c61ac60fe4c854df8e907ca454d0bebe71adbd2"}},{"ruleId":"D1","level":"warning","message":{"text":"pallas_call_registration.mpmd_map_tpu_lowering_rule (cyclomatic 29): pallas_call_registration.mpmd_map_tpu_lowering_rule has cyclomatic complexity 29 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/mosaic/pallas_call_registration.py"},"region":{"startLine":612}}}],"partialFingerprints":{"codehealthFindingId/v1":"337415ba52174c9ada8bd282e1668505c1b5b4f56005b2d382a826d71fb1ae7a"}},{"ruleId":"D1","level":"warning","message":{"text":"tcgen05._do_mma (cyclomatic 29): tcgen05._do_mma has cyclomatic complexity 29 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/mosaic/gpu/tcgen05.py"},"region":{"startLine":665}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd6bba0a9f2a8c1126a781a302939277ff52e1835e11afc94d871b3595eafb67"}},{"ruleId":"D1","level":"warning","message":{"text":"lowering._dot_general_lowering (cyclomatic 28): lowering._dot_general_lowering has cyclomatic complexity 28 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/triton/lowering.py"},"region":{"startLine":2454}}}],"partialFingerprints":{"codehealthFindingId/v1":"ffa218e0363148927673ed90421a8b3d8f29d2fe3a7035f4ae796457a9c82bb6"}},{"ruleId":"D1","level":"warning","message":{"text":"tpu_custom_call._lowered_to_custom_call_config (cyclomatic 28): tpu_custom_call._lowered_to_custom_call_config has cyclomatic complexity 28 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/tpu_custom_call.py"},"region":{"startLine":739}}}],"partialFingerprints":{"codehealthFindingId/v1":"17a6f921127ae70eb7266212c44612aa015d35cdc5e3d1d3eb554e2dc9c375aa"}},{"ruleId":"D1","level":"warning","message":{"text":"core._mosaic_gpu_lowering_rule (cyclomatic 28): core._mosaic_gpu_lowering_rule has cyclomatic complexity 28 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/mosaic/gpu/core.py"},"region":{"startLine":211}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6350ec5d1328ce97611161f0a5c3d69b2728267a0a6796c97b943b5028396f5"}},{"ruleId":"D1","level":"warning","message":{"text":"LaunchContext._prepare_async_copy (cyclomatic 28): LaunchContext._prepare_async_copy has cyclomatic complexity 28 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/mosaic/gpu/launch_context.py"},"region":{"startLine":1150}}}],"partialFingerprints":{"codehealthFindingId/v1":"56503badc5c9a56d8722dc11b5c52e79a2418c7a2e22f64822d78f9ecca503b5"}},{"ruleId":"D1","level":"warning","message":{"text":"utils.parse_indices (cyclomatic 28): utils.parse_indices has cyclomatic complexity 28 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/mosaic/gpu/utils.py"},"region":{"startLine":1086}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e5c64ad224957299edc7be46b6e2e211bb58b117317307e8a4d80d61570c0ed"}},{"ruleId":"D1","level":"warning","message":{"text":"compiler.get_compile_options (cyclomatic 27): compiler.get_compile_options has cyclomatic complexity 27 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/compiler.py"},"region":{"startLine":187}}}],"partialFingerprints":{"codehealthFindingId/v1":"968cbcb2ece3423eeb7339edd632679e76234bbf2f911d468de1ebe9cbf762f7"}},{"ruleId":"D1","level":"warning","message":{"text":"pxla.lower_sharding_computation (cyclomatic 27): pxla.lower_sharding_computation has cyclomatic complexity 27 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/interpreters/pxla.py"},"region":{"startLine":956}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa567cc445163677329963517e4d975e6c2d43e5f7de254691babf43828707f7"}},{"ruleId":"D1","level":"warning","message":{"text":"indexing._index_to_gather (cyclomatic 27): indexing._index_to_gather has cyclomatic complexity 27 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/numpy/indexing.py"},"region":{"startLine":1405}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e237322dce753372c2398d52fd49a2c886f8687140d6d662ee48b5b366d9088"}},{"ruleId":"D1","level":"warning","message":{"text":"lowering.jaxpr_subcomp (cyclomatic 27): lowering.jaxpr_subcomp has cyclomatic complexity 27 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/mosaic/lowering.py"},"region":{"startLine":1790}}}],"partialFingerprints":{"codehealthFindingId/v1":"5769dcd2ab9dbafe0c2c8e33b00bdedd3a2d6b9251e7d623944b0286618e9fc9"}},{"ruleId":"D1","level":"warning","message":{"text":"lowering._ir_cast (cyclomatic 27): lowering._ir_cast has cyclomatic complexity 27 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/triton/lowering.py"},"region":{"startLine":1684}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ec8e15c07a2436313f2c8622ca1edc968ef466adbb3a1f38f2be60c9dbee88e"}},{"ruleId":"D1","level":"warning","message":{"text":"signal.istft (cyclomatic 27): signal.istft has cyclomatic complexity 27 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/scipy/signal.py"},"region":{"startLine":1051}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4f829000bfe1ca37df2d38ae86483d944e36a3daf3453cdfbf984bf58f1152a"}},{"ruleId":"D1","level":"warning","message":{"text":"paged_attention_kernel.paged_attention (cyclomatic 27): paged_attention_kernel.paged_attention has cyclomatic complexity 27 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/pallas/ops/tpu/paged_attention/paged_attention_kernel.py"},"region":{"startLine":391}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d727557edea0da90831d33953ad1a4b55ff0c55ebabac6cef0f07054552597d"}},{"ruleId":"D1","level":"warning","message":{"text":"_export._export_lowered (cyclomatic 26): _export._export_lowered has cyclomatic complexity 26 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/export/_export.py"},"region":{"startLine":698}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3152a58f3389d6cc7e5d2f296f95900342c9fa91c3a5ed5828461b0f30e968c"}},{"ruleId":"D1","level":"warning","message":{"text":"slicing._dynamic_slice_indices (cyclomatic 26): slicing._dynamic_slice_indices has cyclomatic complexity 26 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/lax/slicing.py"},"region":{"startLine":3922}}}],"partialFingerprints":{"codehealthFindingId/v1":"63c0717668cc4c220e67f70ce11632afd68d3d9669817d901bcf7db91f7f0304"}},{"ruleId":"D1","level":"warning","message":{"text":"NDIndexer.to_dynamic_slice (cyclomatic 26): NDIndexer.to_dynamic_slice has cyclomatic complexity 26 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/numpy/indexing.py"},"region":{"startLine":489}}}],"partialFingerprints":{"codehealthFindingId/v1":"48845232b6f64ae2c6896cbe2d16f48e08b7b54f01a644be40ce4fe020522a38"}},{"ruleId":"D1","level":"warning","message":{"text":"pallas_call_registration._get_memory_space_from_aval (cyclomatic 26): pallas_call_registration._get_memory_space_from_aval has cyclomatic complexity 26 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/mosaic/pallas_call_registration.py"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"447697e2761467f29d45d12b9cd30f4a14648d267e1be1b0cf8bc3a885ed80b6"}},{"ruleId":"D1","level":"warning","message":{"text":"Barrier._wait (cyclomatic 26): Barrier._wait has cyclomatic complexity 26 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/mosaic_gpu/interpret/shared_memory.py"},"region":{"startLine":1380}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee94418cf17c2b662f1a956c716b96b8b218afe1fde090be0baeb514f1a728be"}},{"ruleId":"D1","level":"warning","message":{"text":"lowering._swap_lowering_rule (cyclomatic 26): lowering._swap_lowering_rule has cyclomatic complexity 26 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/mosaic_gpu/lowering.py"},"region":{"startLine":2004}}}],"partialFingerprints":{"codehealthFindingId/v1":"a366e9d5ec72829e71c72b8cd5692518de08089a4074b31de7ef5fd55e184905"}},{"ruleId":"D1","level":"warning","message":{"text":"shard_map._unshard_shaped_array (cyclomatic 26): shard_map._unshard_shaped_array has cyclomatic complexity 26 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/shard_map.py"},"region":{"startLine":980}}}],"partialFingerprints":{"codehealthFindingId/v1":"9cc8b7e607a40768e8197ed2fea2ef08c5e1cfe946a5f2ea218e15ae0590d8c5"}},{"ruleId":"D1","level":"warning","message":{"text":"fused_attention_stablehlo.dot_product_attention (cyclomatic 25): fused_attention_stablehlo.dot_product_attention has cyclomatic complexity 25 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/cudnn/fused_attention_stablehlo.py"},"region":{"startLine":2032}}}],"partialFingerprints":{"codehealthFindingId/v1":"5dcde60cabb31c6e3ab194812556b32cc8dd21e8e30a36ec93052770a38d1b3b"}},{"ruleId":"D1","level":"warning","message":{"text":"State.initialize (cyclomatic 25): State.initialize has cyclomatic complexity 25 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/distributed.py"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"29554eff45826906aed27af6be2c7c12580844972d15969f29e60d491515d6bc"}},{"ruleId":"D1","level":"warning","message":{"text":"linalg.norm (cyclomatic 25): linalg.norm has cyclomatic complexity 25 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/numpy/linalg.py"},"region":{"startLine":1203}}}],"partialFingerprints":{"codehealthFindingId/v1":"310c77bb64b309a9ebb879ec4c340707e5ad58e582d6f7d552f800e79a20de46"}},{"ruleId":"D1","level":"warning","message":{"text":"lowering._lower_jaxpr_to_for_loop (cyclomatic 25): lowering._lower_jaxpr_to_for_loop has cyclomatic complexity 25 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/mosaic/lowering.py"},"region":{"startLine":4610}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a206d42c81b3cadba6255f30ce3e8830df6ac919950160aef592e2f60c3ae82"}},{"ruleId":"D1","level":"warning","message":{"text":"sc_lowering._store_lowering_rule (cyclomatic 25): sc_lowering._store_lowering_rule has cyclomatic complexity 25 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/mosaic/sc_lowering.py"},"region":{"startLine":258}}}],"partialFingerprints":{"codehealthFindingId/v1":"772f3e2fad11b858481df67cc0500d9bdabac75e47e6586e76cb2bd598ea12fc"}},{"ruleId":"D1","level":"warning","message":{"text":"lowering._handle_transforms (cyclomatic 25): lowering._handle_transforms has cyclomatic complexity 25 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/mosaic_gpu/lowering.py"},"region":{"startLine":1664}}}],"partialFingerprints":{"codehealthFindingId/v1":"c936fe787be8a5b0cc35cf86cc5a312ac0bbe8d643837c375c8415bd693e4985"}},{"ruleId":"D1","level":"warning","message":{"text":"mpmd._mpmd_map_abstract_eval (cyclomatic 25): mpmd._mpmd_map_abstract_eval has cyclomatic complexity 25 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/mpmd.py"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7d1407b1dfd65ebf2a10f1aa7fc061a24df391adfe9d895dbbd82f162ff9c20"}},{"ruleId":"D1","level":"warning","message":{"text":"custom_partitioning_sharding_rule._parse_values (cyclomatic 24): custom_partitioning_sharding_rule._parse_values has cyclomatic complexity 24 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/custom_partitioning_sharding_rule.py"},"region":{"startLine":212}}}],"partialFingerprints":{"codehealthFindingId/v1":"432fe2e32a2c2d3e5f89014f19c6d91f20edfe7fc0a5648fd2943d4876857bd6"}},{"ruleId":"D1","level":"warning","message":{"text":"custom_partitioning_sharding_rule.sdy_sharding_rule_to_mlir (cyclomatic 24): custom_partitioning_sharding_rule.sdy_sharding_rule_to_mlir has cyclomatic complexity 24 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/custom_partitioning_sharding_rule.py"},"region":{"startLine":363}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd7eea03c1a22386082a10abd8b982db255af7c179ca3bc055ce161cd7f6b23f"}},{"ruleId":"D1","level":"warning","message":{"text":"pxla._get_and_check_device_assignment (cyclomatic 24): pxla._get_and_check_device_assignment has cyclomatic complexity 24 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/interpreters/pxla.py"},"region":{"startLine":521}}}],"partialFingerprints":{"codehealthFindingId/v1":"e24614b079f97ee9a097b6d632ccfc0f09896f48be52ebbe25a029ab85fd07ca"}},{"ruleId":"D1","level":"warning","message":{"text":"functions.dot_product_attention (cyclomatic 24): functions.dot_product_attention has cyclomatic complexity 24 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/nn/functions.py"},"region":{"startLine":1053}}}],"partialFingerprints":{"codehealthFindingId/v1":"68ba5b57d9634fccaff11df716e4c5015ad091670379956ad29614c10f6dc4f8"}},{"ruleId":"D1","level":"warning","message":{"text":"BlockSpec.to_block_mapping (cyclomatic 24): BlockSpec.to_block_mapping has cyclomatic complexity 24 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/core.py"},"region":{"startLine":688}}}],"partialFingerprints":{"codehealthFindingId/v1":"270c20716fac2befacefb4b7a1bdecda16495f10a339c5b0a43c89ef0c08f97a"}},{"ruleId":"D1","level":"warning","message":{"text":"interpret_pallas_call.interpret_pallas_call (cyclomatic 24): interpret_pallas_call.interpret_pallas_call has cyclomatic complexity 24 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/mosaic/interpret/interpret_pallas_call.py"},"region":{"startLine":2003}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a266de7f9105363fa6cb576b92a4d30f3bfea4b3593e4adb909529855a5a928"}},{"ruleId":"D1","level":"warning","message":{"text":"lowering._convert_element_type_lowering_rule (cyclomatic 24): lowering._convert_element_type_lowering_rule has cyclomatic complexity 24 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/mosaic/lowering.py"},"region":{"startLine":3334}}}],"partialFingerprints":{"codehealthFindingId/v1":"2491fc14c1ab3ebfff743c27653a3d1aef0dfad48eb64b123035afb26ae5e141"}},{"ruleId":"D1","level":"warning","message":{"text":"lowering._run_scoped_lowering_rule (cyclomatic 24): lowering._run_scoped_lowering_rule has cyclomatic complexity 24 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/mosaic_gpu/lowering.py"},"region":{"startLine":3476}}}],"partialFingerprints":{"codehealthFindingId/v1":"d21818694fb183137517e51b3dd624c871182864fe5ffc27afaf4f982fd40751"}},{"ruleId":"D1","level":"warning","message":{"text":"torch._find_mgpu_call (cyclomatic 24): torch._find_mgpu_call has cyclomatic complexity 24 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/mosaic_gpu/torch.py"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f97998f56198e30092510b5b2f7216bad6d134e7a529d03943cf41c03c033fc"}},{"ruleId":"D1","level":"warning","message":{"text":"pallas_call._pallas_call_batching_rule (cyclomatic 24): pallas_call._pallas_call_batching_rule has cyclomatic complexity 24 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/pallas_call.py"},"region":{"startLine":520}}}],"partialFingerprints":{"codehealthFindingId/v1":"62df4893d72f89414777ac33648486faff99f0005e5b984fa4b01a65a27a2d6c"}},{"ruleId":"D1","level":"warning","message":{"text":"splash_attention_kernel._splash_attention_bwd_dkv (cyclomatic 24): splash_attention_kernel._splash_attention_bwd_dkv has cyclomatic complexity 24 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/pallas/ops/tpu/splash_attention/splash_attention_kernel.py"},"region":{"startLine":1871}}}],"partialFingerprints":{"codehealthFindingId/v1":"c61ad4a69e64cb1010f895c2f2aa039828a2cb94a0a1e9af903f9cd59abc0721"}},{"ruleId":"D1","level":"warning","message":{"text":"dlpack.from_dlpack (cyclomatic 23): dlpack.from_dlpack has cyclomatic complexity 23 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/dlpack.py"},"region":{"startLine":234}}}],"partialFingerprints":{"codehealthFindingId/v1":"e77168492edbab5c3167a6a57bd4b3a509832bc5c4d114f2fa4e8d1424098781"}},{"ruleId":"D1","level":"warning","message":{"text":"ad.backward_pass3 (cyclomatic 23): ad.backward_pass3 has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/interpreters/ad.py"},"region":{"startLine":300}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e3868c6ceffd96083d00eb4bcac3d47fe43ebc1b60abc08fab2695a9ae614bd"}},{"ruleId":"D1","level":"warning","message":{"text":"conditionals.cond (cyclomatic 23): conditionals.cond has cyclomatic complexity 23 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/lax/control_flow/conditionals.py"},"region":{"startLine":195}}}],"partialFingerprints":{"codehealthFindingId/v1":"abf4c00a925e825ff9a8e39eb9c251d9e5dac2dcbfb9c99456e1b948d838ef4a"}},{"ruleId":"D1","level":"warning","message":{"text":"lax.broadcasting_sharding_rule (cyclomatic 23): lax.broadcasting_sharding_rule has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/lax/lax.py"},"region":{"startLine":4705}}}],"partialFingerprints":{"codehealthFindingId/v1":"d50e0181fd06e430ef2ff2601691fae186e02ae804be3d52bf90cca180540844"}},{"ruleId":"D1","level":"warning","message":{"text":"lax._dot_general_layout_rule (cyclomatic 23): lax._dot_general_layout_rule has cyclomatic complexity 23 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/lax/lax.py"},"region":{"startLine":7166}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6d6aa5298ef7318cd9035d94fb01d3ae7a33b43cd87e5599f762e5d3db20e3c"}},{"ruleId":"D1","level":"warning","message":{"text":"slicing._gather_shape_rule (cyclomatic 23): slicing._gather_shape_rule has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/lax/slicing.py"},"region":{"startLine":1941}}}],"partialFingerprints":{"codehealthFindingId/v1":"640824bc7450ccb2fad37a00d08cbc69b7da31e8523ba449362552de2f7701f7"}},{"ruleId":"D1","level":"warning","message":{"text":"lowering._masked_swap_lowering_rule (cyclomatic 23): lowering._masked_swap_lowering_rule has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/mosaic/lowering.py"},"region":{"startLine":2658}}}],"partialFingerprints":{"codehealthFindingId/v1":"135d3bdc31ec18b42d3003b4d3088364634602bac79fcdc661c287a6241d0d5c"}},{"ruleId":"D1","level":"warning","message":{"text":"lowering._dot_general_lowering_rule (cyclomatic 23): lowering._dot_general_lowering_rule has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/mosaic/lowering.py"},"region":{"startLine":3013}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe8808860080f3256597f41d9c9073d44818421edfb0dea0496208c1c25b9858"}},{"ruleId":"D1","level":"warning","message":{"text":"lowering._convert_element_type_lowering_rule_wg (cyclomatic 23): lowering._convert_element_type_lowering_rule_wg has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/mosaic_gpu/lowering.py"},"region":{"startLine":2416}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ee2ff657c120cab13d320812b40ad5abf544837494d3f7d4c9e9d408c10b966"}},{"ruleId":"D1","level":"warning","message":{"text":"lowering._compute_offsets_from_indices (cyclomatic 23): lowering._compute_offsets_from_indices has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/triton/lowering.py"},"region":{"startLine":1924}}}],"partialFingerprints":{"codehealthFindingId/v1":"64520324708199820c6128a5945c059d7928b810866d297f6267e5fb85ec54bf"}},{"ruleId":"D1","level":"warning","message":{"text":"FragmentedArray._pointwise (cyclomatic 23): FragmentedArray._pointwise has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/mosaic/gpu/fragmented_array.py"},"region":{"startLine":1629}}}],"partialFingerprints":{"codehealthFindingId/v1":"a847b7760d454f8eaff2d6e05094daac9e724aa168d3d184d7f893313a41a247"}},{"ruleId":"D1","level":"warning","message":{"text":"fragmented_array.plan_gmem_transfer (cyclomatic 23): fragmented_array.plan_gmem_transfer has cyclomatic complexity 23 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/mosaic/gpu/fragmented_array.py"},"region":{"startLine":5426}}}],"partialFingerprints":{"codehealthFindingId/v1":"c54076a9703b8714af91e25f5e64b3e25536994c93162df5e8efe6638293519d"}},{"ruleId":"D1","level":"warning","message":{"text":"mma_utils.create_descriptor (cyclomatic 23): mma_utils.create_descriptor has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/mosaic/gpu/mma_utils.py"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"871498de64b7ceff4fc8df7bdde62e05607c3b1e345b089c3ac34827efba69dc"}},{"ruleId":"D1","level":"warning","message":{"text":"hlo._parse_hlo_new_format (cyclomatic 23): hlo._parse_hlo_new_format has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/source_mapper/hlo.py"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"d226bed3d625dc86360027ec837c8d1f9029c6e10d0c00f3e8d64c7068e5ffe8"}},{"ruleId":"D1","level":"warning","message":{"text":"evaluate_sampler_bias.evaluate_bias (cyclomatic 23): evaluate_sampler_bias.evaluate_bias has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file\u0027s highest cyclomatic complexity: evaluate_sampler_bias.get_scipy_distribution (cyclomatic 24) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/tools/evaluate_sampler_bias.py"},"region":{"startLine":187}}}],"partialFingerprints":{"codehealthFindingId/v1":"df95fa0cb23ff74c73acbe861dad51806a6c83b1cf83a9ce5c0579b199ea815a"}},{"ruleId":"D1","level":"warning","message":{"text":"fused_attention_stablehlo.check_is_flash_attention (cyclomatic 22): fused_attention_stablehlo.check_is_flash_attention has cyclomatic complexity 22 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/cudnn/fused_attention_stablehlo.py"},"region":{"startLine":352}}}],"partialFingerprints":{"codehealthFindingId/v1":"341d828156ff887cf989d9a57165471be435f6355d2b650ccaea329e40247ff4"}},{"ruleId":"D1","level":"warning","message":{"text":"mlir.lower_per_platform (cyclomatic 22): mlir.lower_per_platform has cyclomatic complexity 22 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/interpreters/mlir.py"},"region":{"startLine":2689}}}],"partialFingerprints":{"codehealthFindingId/v1":"e57902a1d6b49da691560e04da8892830602df9547245a3de350acf9979be9e1"}},{"ruleId":"D1","level":"warning","message":{"text":"convolution._conv_general_dilated_batch_rule (cyclomatic 22): convolution._conv_general_dilated_batch_rule has cyclomatic complexity 22 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/lax/convolution.py"},"region":{"startLine":601}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ea2f8c27811664d219bc8fc96ee2a3d06d0e190eee93c8cc4802b49be987bd1"}},{"ruleId":"D1","level":"warning","message":{"text":"lax._get_monoid_reducer (cyclomatic 22): lax._get_monoid_reducer has cyclomatic complexity 22 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/lax/lax.py"},"region":{"startLine":3502}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a9d80abba0c69031dee5d998d5435108f29e125add7c49dc1addab0eda60205"}},{"ruleId":"D1","level":"warning","message":{"text":"slicing._scatter_shape_rule (cyclomatic 22): slicing._scatter_shape_rule has cyclomatic complexity 22 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/lax/slicing.py"},"region":{"startLine":2688}}}],"partialFingerprints":{"codehealthFindingId/v1":"db4fba3362d7322da0220a43382c4c7a07c52edb16040169911ab5233b57c5d5"}},{"ruleId":"D1","level":"warning","message":{"text":"tensor_contractions.matmul (cyclomatic 22): tensor_contractions.matmul has cyclomatic complexity 22 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/numpy/tensor_contractions.py"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ae714a6eeebb52405d0960e27829458e5b3312b8247e5a2d6d90402765fe837"}},{"ruleId":"D1","level":"warning","message":{"text":"lowering._check_block_mappings (cyclomatic 22): lowering._check_block_mappings has cyclomatic complexity 22 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/mosaic/lowering.py"},"region":{"startLine":959}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0006bde93072706e36d69d9eb8830866cafd41e5f0a7178e15f92ebec4d1e71"}},{"ruleId":"D1","level":"warning","message":{"text":"lowering._get_lowering_rule (cyclomatic 22): lowering._get_lowering_rule has cyclomatic complexity 22 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/mosaic_gpu/lowering.py"},"region":{"startLine":1862}}}],"partialFingerprints":{"codehealthFindingId/v1":"1486baa0a04f34587b82a0ecbce43a5cbf658dfbd03d10adcbfd3750230cbec9"}},{"ruleId":"D1","level":"warning","message":{"text":"FragmentedArray.load_tiled (cyclomatic 22): FragmentedArray.load_tiled has cyclomatic complexity 22 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/mosaic/gpu/fragmented_array.py"},"region":{"startLine":4595}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed74349b8742267c39dd69df52e5f54921bb8a7499b63a00af9b0aeb88b19f10"}},{"ruleId":"D1","level":"warning","message":{"text":"fragmented_array.concatenate (cyclomatic 22): fragmented_array.concatenate has cyclomatic complexity 22 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/mosaic/gpu/fragmented_array.py"},"region":{"startLine":6048}}}],"partialFingerprints":{"codehealthFindingId/v1":"33d1c88c851fe715bb3efbeba805fbcafda32af810fa3f7c6f206dd67408ad89"}},{"ruleId":"D1","level":"warning","message":{"text":"utils.multimem_load_reduce (cyclomatic 22): utils.multimem_load_reduce has cyclomatic complexity 22 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/mosaic/gpu/utils.py"},"region":{"startLine":423}}}],"partialFingerprints":{"codehealthFindingId/v1":"15b3854fa6bc06ca63cf6749ddf67ffcd513c017dc3fb6d80f5fcd7f8bea8df3"}},{"ruleId":"D1","level":"warning","message":{"text":"utils.is_known_divisible (cyclomatic 22): utils.is_known_divisible has cyclomatic complexity 22 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/mosaic/gpu/utils.py"},"region":{"startLine":2379}}}],"partialFingerprints":{"codehealthFindingId/v1":"3fe39244b33fbe030dcf7f69f1301502d28dc295befaabb100cc3862f2b90488"}},{"ruleId":"D1","level":"warning","message":{"text":"core._check_jaxpr (cyclomatic 21): core._check_jaxpr has cyclomatic complexity 21 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/core.py"},"region":{"startLine":3708}}}],"partialFingerprints":{"codehealthFindingId/v1":"42eb1c3ca4c2b189897057dba032115c5da7e2ba8730b830f9c452954c382798"}},{"ruleId":"D1","level":"warning","message":{"text":"debugging.visualize_sharding (cyclomatic 21): debugging.visualize_sharding has cyclomatic complexity 21 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/debugging.py"},"region":{"startLine":861}}}],"partialFingerprints":{"codehealthFindingId/v1":"b664a5b88834a8089d5a7099914caa979870dc84887bce9b8b532dcfc4ce58b6"}},{"ruleId":"D1","level":"warning","message":{"text":"dtypes._issubdtype_cached (cyclomatic 21): dtypes._issubdtype_cached has cyclomatic complexity 21 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/dtypes.py"},"region":{"startLine":554}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f1dffb98e9ab4fd62988347a591ae3e2dc3b113e6386b5055d61ab70dd62d0e"}},{"ruleId":"D1","level":"warning","message":{"text":"_export._call_exported_lowering (cyclomatic 21): _export._call_exported_lowering has cyclomatic complexity 21 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/export/_export.py"},"region":{"startLine":1521}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9321702582c60732057f1e3084e263d0fa9055621bf93bc658f0f7415449780"}},{"ruleId":"D1","level":"warning","message":{"text":"loops.fori_loop (cyclomatic 21): loops.fori_loop has cyclomatic complexity 21 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/lax/control_flow/loops.py"},"region":{"startLine":2699}}}],"partialFingerprints":{"codehealthFindingId/v1":"8eb6085b7cd941268fb81c8f2686b3fb63d414bea708067e222d396d5fa75630"}},{"ruleId":"D1","level":"warning","message":{"text":"linalg._eig_gpu_lowering (cyclomatic 21): linalg._eig_gpu_lowering has cyclomatic complexity 21 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/lax/linalg.py"},"region":{"startLine":1104}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad8b1c3a1b5e6b7bb02deec8bc72f1ca64f65b63b3d2115566e926191686ff9e"}},{"ruleId":"D1","level":"warning","message":{"text":"lowering._transform_ref (cyclomatic 21): lowering._transform_ref has cyclomatic complexity 21 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/mosaic/lowering.py"},"region":{"startLine":2317}}}],"partialFingerprints":{"codehealthFindingId/v1":"58119c1ad0a057388bb9038951f0e974483e6b6b1022b6650dd6268e5c5d3266"}},{"ruleId":"D1","level":"warning","message":{"text":"BufferedRef.create (cyclomatic 21): BufferedRef.create has cyclomatic complexity 21 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/mosaic/pipeline.py"},"region":{"startLine":648}}}],"partialFingerprints":{"codehealthFindingId/v1":"7bbf22c5782019926ad64841506ac743e383a7c49fe2edb05d39baa82c91e9a3"}},{"ruleId":"D1","level":"warning","message":{"text":"pipeline._partition_grid (cyclomatic 21): pipeline._partition_grid has cyclomatic complexity 21 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/mosaic/pipeline.py"},"region":{"startLine":1707}}}],"partialFingerprints":{"codehealthFindingId/v1":"e891b06db32b61d80b0a021bc30320842431a3249d43dd930ef7634f3b124310"}},{"ruleId":"D1","level":"warning","message":{"text":"sc_lowering._load_lowering_rule (cyclomatic 21): sc_lowering._load_lowering_rule has cyclomatic complexity 21 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/mosaic/sc_lowering.py"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3f0354e2145e0dd4b53f25ffe8bdf2eee746a55b9e65b9f650b946d23ee18a5"}},{"ruleId":"D1","level":"warning","message":{"text":"pipeline.emit_pipeline_warp_specialized (cyclomatic 21): pipeline.emit_pipeline_warp_specialized has cyclomatic complexity 21 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/mosaic_gpu/pipeline.py"},"region":{"startLine":660}}}],"partialFingerprints":{"codehealthFindingId/v1":"17f7793b3aa8f14bdb86d2e0dfbd5d0b8d9df69310c877fbbca0c19fbce990fe"}},{"ruleId":"D1","level":"warning","message":{"text":"lowering._load (cyclomatic 21): lowering._load has cyclomatic complexity 21 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/triton/lowering.py"},"region":{"startLine":2089}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4636d061343c55540aeff497add4b7c6d9b076e3680c34ca1944eda66905f27"}},{"ruleId":"D1","level":"warning","message":{"text":"discharge._eval_jaxpr_discharge_state (cyclomatic 21): discharge._eval_jaxpr_discharge_state has cyclomatic complexity 21 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/state/discharge.py"},"region":{"startLine":233}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b735207e7feb3ef5fe1bbf687c6152c63a65da913e1b0ee06c92ea15ec10baa"}},{"ruleId":"D1","level":"warning","message":{"text":"thunky._transforms_to_slice_params (cyclomatic 21): thunky._transforms_to_slice_params has cyclomatic complexity 21 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/thunky/thunky.py"},"region":{"startLine":191}}}],"partialFingerprints":{"codehealthFindingId/v1":"06ffa69a3a08ba761822f78e182fefa3f9de3593456c9b69e0c22b209ba0fe89"}},{"ruleId":"D1","level":"warning","message":{"text":"TpuInfo.is_matmul_supported (cyclomatic 21): TpuInfo.is_matmul_supported has cyclomatic complexity 21 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/tpu_info.py"},"region":{"startLine":220}}}],"partialFingerprints":{"codehealthFindingId/v1":"f176f128f4bc214f6d78c18df2c2036036faab0c54ee64dd42a5c4cc2c811b64"}},{"ruleId":"D1","level":"warning","message":{"text":"FragmentedArray.broadcast_in_dim (cyclomatic 21): FragmentedArray.broadcast_in_dim has cyclomatic complexity 21 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/mosaic/gpu/fragmented_array.py"},"region":{"startLine":3958}}}],"partialFingerprints":{"codehealthFindingId/v1":"bfb44e0f36e5d43f3ac9d59e4fcb428983efcb12bd662d2f0f67b4b07ea53c61"}},{"ruleId":"D1","level":"warning","message":{"text":"LaunchContext._prepare_tma (cyclomatic 21): LaunchContext._prepare_tma has cyclomatic complexity 21 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/mosaic/gpu/launch_context.py"},"region":{"startLine":1302}}}],"partialFingerprints":{"codehealthFindingId/v1":"5708f4b5c1a287456fad30f5f146ea96edae96f356a053e8dc1d2d5b5ae51824"}},{"ruleId":"D1","level":"warning","message":{"text":"bcoo._bcoo_spdot_general_abstract_eval (cyclomatic 21): bcoo._bcoo_spdot_general_abstract_eval has cyclomatic complexity 21 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/sparse/bcoo.py"},"region":{"startLine":1195}}}],"partialFingerprints":{"codehealthFindingId/v1":"41c558c835fb730135bfef6cbed5b56ad7f5e9d1158f3579c198942a19624715"}},{"ruleId":"D1","level":"warning","message":{"text":"api.device_put (cyclomatic 20): api.device_put has cyclomatic complexity 20 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/api.py"},"region":{"startLine":2388}}}],"partialFingerprints":{"codehealthFindingId/v1":"10f18db40e0d49206da98af3a891643b356d72e5aacf43b8e51316271feb7aaf"}},{"ruleId":"D1","level":"warning","message":{"text":"slicing._gather_collective_rule (cyclomatic 20): slicing._gather_collective_rule has cyclomatic complexity 20 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/lax/slicing.py"},"region":{"startLine":2590}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ee773c6d2b25b1608b63ba8923b894c9013b4c4c0c2f9d4ee498901228e736b"}},{"ruleId":"D1","level":"warning","message":{"text":"NDIndexer.to_static_slice (cyclomatic 20): NDIndexer.to_static_slice has cyclomatic complexity 20 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/numpy/indexing.py"},"region":{"startLine":388}}}],"partialFingerprints":{"codehealthFindingId/v1":"4883df0b742eec8dadabe1c47424a1b7a898f0b197a283c2b03da09c218a86ee"}},{"ruleId":"D1","level":"warning","message":{"text":"lax_numpy._arange (cyclomatic 20): lax_numpy._arange has cyclomatic complexity 20 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/numpy/lax_numpy.py"},"region":{"startLine":6005}}}],"partialFingerprints":{"codehealthFindingId/v1":"19c753101476664b4f9c66e1377038baec3ec80aa2334f3f4fa7ff1f6fa99f04"}},{"ruleId":"D1","level":"warning","message":{"text":"primitives._wgmma_lowering (cyclomatic 20): primitives._wgmma_lowering has cyclomatic complexity 20 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/mosaic_gpu/primitives.py"},"region":{"startLine":2220}}}],"partialFingerprints":{"codehealthFindingId/v1":"035a98451f45acb7f710f7ddf8d07cfd701231ba518a6a1c67a051538faa229c"}},{"ruleId":"D1","level":"warning","message":{"text":"primitives._multimem_load_reduce_lowering_rule_wg (cyclomatic 20): primitives._multimem_load_reduce_lowering_rule_wg has cyclomatic complexity 20 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/mosaic_gpu/primitives.py"},"region":{"startLine":5685}}}],"partialFingerprints":{"codehealthFindingId/v1":"d15464d53b784d3b7f5da31132fc8a064ce5f2b71eb16772727ecc8a39a519f4"}},{"ruleId":"D1","level":"warning","message":{"text":"utils.pattern_match_while_to_fori_loop (cyclomatic 20): utils.pattern_match_while_to_fori_loop has cyclomatic complexity 20 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/utils.py"},"region":{"startLine":171}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1f1a95578d93b434e2f763fc2bfbd25e1f485fbe904cc8947aa01cc33b559ca"}},{"ruleId":"D1","level":"warning","message":{"text":"bessel._yn_series (cyclomatic 20): bessel._yn_series has cyclomatic complexity 20 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/scipy/bessel.py"},"region":{"startLine":930}}}],"partialFingerprints":{"codehealthFindingId/v1":"856655106b861086a4613b7ebd98b7841980fa9988238f0a78a78fed79016509"}},{"ruleId":"D1","level":"warning","message":{"text":"NDIndexer.from_indices_shape (cyclomatic 20): NDIndexer.from_indices_shape has cyclomatic complexity 20 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/state/indexing.py"},"region":{"startLine":184}}}],"partialFingerprints":{"codehealthFindingId/v1":"c21792b9216b50188365e396af0792ea16bbed990e0759583f5e16070c5dabed"}},{"ruleId":"D1","level":"warning","message":{"text":"layout_inference._check_unsatisfiable_divisibility_constraints (cyclomatic 20): layout_inference._check_unsatisfiable_divisibility_constraints has cyclomatic complexity 20 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/mosaic/gpu/layout_inference.py"},"region":{"startLine":2645}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a5a436dddd6cf8804ee0deb7794bc23b9ebf5f3c630df38a3dde77f9a865f4f"}},{"ruleId":"D1","level":"warning","message":{"text":"mma.mma (cyclomatic 20): mma.mma has cyclomatic complexity 20 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/mosaic/gpu/mma.py"},"region":{"startLine":191}}}],"partialFingerprints":{"codehealthFindingId/v1":"ecc7be0f8c1e71ecdf5a442f0364ee9c99054d1e7c2e9fac124192983c39e650"}},{"ruleId":"D1","level":"warning","message":{"text":"tcgen05._load_32xcols_native (cyclomatic 20): tcgen05._load_32xcols_native has cyclomatic complexity 20 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/mosaic/gpu/tcgen05.py"},"region":{"startLine":1844}}}],"partialFingerprints":{"codehealthFindingId/v1":"909cca53c69f8dedeb756ecb2b273eacf0f878a31fce73736e791bff95fc9746"}},{"ruleId":"D1","level":"warning","message":{"text":"kernel.static_validate_inputs (cyclomatic 20): kernel.static_validate_inputs has cyclomatic complexity 20 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/pallas/ops/tpu/ragged_paged_attention/kernel.py"},"region":{"startLine":216}}}],"partialFingerprints":{"codehealthFindingId/v1":"a94dc23c60b46d03c9cb807d5c386b551f1c1aec12f7523950c3caf7483dd21d"}},{"ruleId":"D1","level":"warning","message":{"text":"splash_attention_mask_info._get_mask_info_for_shard (cyclomatic 20): splash_attention_mask_info._get_mask_info_for_shard has cyclomatic complexity 20 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/pallas/ops/tpu/splash_attention/splash_attention_mask_info.py"},"region":{"startLine":172}}}],"partialFingerprints":{"codehealthFindingId/v1":"ebac8dc5ad7c753bdeab323ed80797760633610bde78e7e8f47b7ae31e04c1e3"}},{"ruleId":"D1","level":"warning","message":{"text":"custom_vjp.__call__ (cyclomatic 19): custom_vjp.__call__ has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/custom_derivatives.py"},"region":{"startLine":806}}}],"partialFingerprints":{"codehealthFindingId/v1":"95119baf4454487da6c8e78adca006e5641d2285dc8d94872b571411eee063bd"}},{"ruleId":"D1","level":"warning","message":{"text":"custom_derivatives._flatten_bwd (cyclomatic 19): custom_derivatives._flatten_bwd has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/custom_derivatives.py"},"region":{"startLine":1074}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2ec8afed3c09b6562d36a43d249d9fb3c2b2e823d1ff219daa120f9c8c38c1b"}},{"ruleId":"D1","level":"warning","message":{"text":"_DecisionByElimination.add_implicit_constraints_term (cyclomatic 19): _DecisionByElimination.add_implicit_constraints_term has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/export/shape_poly_decision.py"},"region":{"startLine":362}}}],"partialFingerprints":{"codehealthFindingId/v1":"02b8ac82166c2e7d7ebae7ec6db92ebf8eaea6e8748d608b42450f8ac972d95a"}},{"ruleId":"D1","level":"warning","message":{"text":"loops.scan (cyclomatic 19): loops.scan has cyclomatic complexity 19 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/lax/control_flow/loops.py"},"region":{"startLine":242}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0251a03020ec841a1ea6c5cf94e5cff59e5aaefce5e2135a6e19d9c192544a5"}},{"ruleId":"D1","level":"warning","message":{"text":"DotAlgorithmPreset._convert_to_hlo_attr (cyclomatic 19): DotAlgorithmPreset._convert_to_hlo_attr has cyclomatic complexity 19 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/lax/lax.py"},"region":{"startLine":2633}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c085e225389ead43ce19e831500c5c4180688e840e0eb657981cc5dbdd41ea2"}},{"ruleId":"D1","level":"warning","message":{"text":"linalg._svd_gpu_sub_lowering (cyclomatic 19): linalg._svd_gpu_sub_lowering has cyclomatic complexity 19 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/lax/linalg.py"},"region":{"startLine":2586}}}],"partialFingerprints":{"codehealthFindingId/v1":"10f633073423633a82369932a61f6f322f3ab09c8eb33942a22470db85a65ebb"}},{"ruleId":"D1","level":"warning","message":{"text":"slicing._scatter_spec_computation (cyclomatic 19): slicing._scatter_spec_computation has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/lax/slicing.py"},"region":{"startLine":2863}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d9007f116423916efe3ea53205d3a6753c3b8c7be48b544a7ea4a00886994ce"}},{"ruleId":"D1","level":"warning","message":{"text":"slicing._scatter_unreduced_rule (cyclomatic 19): slicing._scatter_unreduced_rule has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/lax/slicing.py"},"region":{"startLine":3060}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b5605b808741375cc71abea6c13a281047d9339f5028e42c9292f3e8d6cf462"}},{"ruleId":"D1","level":"warning","message":{"text":"polynomial.polyfit (cyclomatic 19): polynomial.polyfit has cyclomatic complexity 19 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/numpy/polynomial.py"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"95f7429082b67345025bb6918abb61191f1f27d6d8a2133baec3bb1d50051aa3"}},{"ruleId":"D1","level":"warning","message":{"text":"einshape._inverse_block_transform (cyclomatic 19): einshape._inverse_block_transform has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/einshape.py"},"region":{"startLine":535}}}],"partialFingerprints":{"codehealthFindingId/v1":"548d169dfe25b8632c0b3555eea96e1d7ea5216a1014b8b7cc81a257d7c81063"}},{"ruleId":"D1","level":"warning","message":{"text":"hlo_interpreter.pallas_call_hlo_interpret (cyclomatic 19): hlo_interpreter.pallas_call_hlo_interpret has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/hlo_interpreter.py"},"region":{"startLine":316}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9bc371b822c5e9c4369233d17ac99e92eca9443c1ba264c013e182dccd586f0"}},{"ruleId":"D1","level":"warning","message":{"text":"pipeline._emit_pipeline_effectful_abstract_eval (cyclomatic 19): pipeline._emit_pipeline_effectful_abstract_eval has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/mosaic/pipeline.py"},"region":{"startLine":2475}}}],"partialFingerprints":{"codehealthFindingId/v1":"89f3df7bed85b228d5a4ab0551038e0b746783cbd5d2ff51cd5c3cdb237308f1"}},{"ruleId":"D1","level":"warning","message":{"text":"primitives._atomic_lowering_rule (cyclomatic 19): primitives._atomic_lowering_rule has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/triton/primitives.py"},"region":{"startLine":445}}}],"partialFingerprints":{"codehealthFindingId/v1":"1fad4f1a73f1e5fa1d56c2a814bee1d80343d44cc8d2db73abdb49ee0b490aca"}},{"ruleId":"D1","level":"warning","message":{"text":"core._sample_sharding (cyclomatic 19): core._sample_sharding has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/random/core.py"},"region":{"startLine":517}}}],"partialFingerprints":{"codehealthFindingId/v1":"62144a886c789a10992f47deaf132dc83e601c9d4b5068f30174990d718251b5"}},{"ruleId":"D1","level":"warning","message":{"text":"eigh.eigh (cyclomatic 19): eigh.eigh has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/tpu/linalg/eigh.py"},"region":{"startLine":511}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1cf4e8dc0be25a984f4114102e96c0a3d98007b6f73996a1e96edc1829ae53c"}},{"ruleId":"D1","level":"warning","message":{"text":"fragmented_array.plan_tiled_transfer (cyclomatic 19): fragmented_array.plan_tiled_transfer has cyclomatic complexity 19 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/mosaic/gpu/fragmented_array.py"},"region":{"startLine":5582}}}],"partialFingerprints":{"codehealthFindingId/v1":"27ee168d565962ae0acaa5fcff5132060ed9a3a83a5eb3dca0eea1da537d311c"}},{"ruleId":"D1","level":"warning","message":{"text":"splash_attention_kernel._splash_attention_bwd_dq (cyclomatic 19): splash_attention_kernel._splash_attention_bwd_dq has cyclomatic complexity 19 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/pallas/ops/tpu/splash_attention/splash_attention_kernel.py"},"region":{"startLine":1417}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca11815d871e87919b70335a64f179dc561a814099f7ffef56e68496774b956b"}},{"ruleId":"D1","level":"warning","message":{"text":"_DimFactor.evaluate (cyclomatic 18): _DimFactor.evaluate has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/export/shape_poly.py"},"region":{"startLine":228}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b3be9635c485ef3aa62e89edb2f034c58e4dbc13e64804b1f31b69c6c587a67"}},{"ruleId":"D1","level":"warning","message":{"text":"ffi.ffi_batching_rule (cyclomatic 18): ffi.ffi_batching_rule has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/ffi.py"},"region":{"startLine":679}}}],"partialFingerprints":{"codehealthFindingId/v1":"b61fedd3a66769f56c19b171a50842f03818110ef4b41c5181a11bee49384982"}},{"ruleId":"D1","level":"warning","message":{"text":"_reduction_order._check_ring_args (cyclomatic 18): _reduction_order._check_ring_args has cyclomatic complexity 18 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/lax/_reduction_order.py"},"region":{"startLine":300}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb95a78d9eba5f7628661e63e4ed3af49d2837d8d3c1684176555f12a2b2dbd2"}},{"ruleId":"D1","level":"warning","message":{"text":"loops._check_carry_type (cyclomatic 18): loops._check_carry_type has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/lax/control_flow/loops.py"},"region":{"startLine":531}}}],"partialFingerprints":{"codehealthFindingId/v1":"092ae1ae5b2938f0980b8b1af0225ff308ceb22bfa8f09c2d069074655f72257"}},{"ruleId":"D1","level":"warning","message":{"text":"lax._clamp_batch_rule (cyclomatic 18): lax._clamp_batch_rule has cyclomatic complexity 18 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/lax/lax.py"},"region":{"startLine":8584}}}],"partialFingerprints":{"codehealthFindingId/v1":"28206fbd08711d008b48d2b6660b782f8132230c337769b9d48f29df5e70c1a9"}},{"ruleId":"D1","level":"warning","message":{"text":"lax_reference._float64_fma_scalar (cyclomatic 18): lax_reference._float64_fma_scalar has cyclomatic complexity 18 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/lax_reference.py"},"region":{"startLine":252}}}],"partialFingerprints":{"codehealthFindingId/v1":"83d2ca767aebb73ca98b281e5e007731b18394a7b1adc069a9f8695511a17e57"}},{"ruleId":"D1","level":"warning","message":{"text":"IndexType.from_index (cyclomatic 18): IndexType.from_index has cyclomatic complexity 18 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/numpy/indexing.py"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"cccdfed7bc2dd055d56031a3c3c0b7f393bca073a77f13b60618530cc4afed77"}},{"ruleId":"D1","level":"warning","message":{"text":"indexing.take_along_axis (cyclomatic 18): indexing.take_along_axis has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/numpy/indexing.py"},"region":{"startLine":832}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2b71e3c44d31e750511ee8136c7de48479d4591e27276d8003d969fccbed09e"}},{"ruleId":"D1","level":"warning","message":{"text":"setops._unique (cyclomatic 18): setops._unique has cyclomatic complexity 18 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/numpy/setops.py"},"region":{"startLine":616}}}],"partialFingerprints":{"codehealthFindingId/v1":"a941c58f8381775766de5cd6ec7f5c21dfc6617823cb57d472c3b4c79161ff7d"}},{"ruleId":"D1","level":"warning","message":{"text":"lowering._load_lowering_rule (cyclomatic 18): lowering._load_lowering_rule has cyclomatic complexity 18 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/mosaic/lowering.py"},"region":{"startLine":2459}}}],"partialFingerprints":{"codehealthFindingId/v1":"352a35b555d81d909cc18fbfab214dbd7cbc3a20bcad18771aabd1506a3e55a8"}},{"ruleId":"D1","level":"warning","message":{"text":"pipeline._spec_has_trivial_windowing (cyclomatic 18): pipeline._spec_has_trivial_windowing has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/mosaic/pipeline.py"},"region":{"startLine":229}}}],"partialFingerprints":{"codehealthFindingId/v1":"6272f9e4c32e2c7130d693a10dfdd3f528b06e8f6474717ecba941ecaa31dc4f"}},{"ruleId":"D1","level":"warning","message":{"text":"lowering._broadcast_in_dim_lowering_rule (cyclomatic 18): lowering._broadcast_in_dim_lowering_rule has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/mosaic_gpu/lowering.py"},"region":{"startLine":2306}}}],"partialFingerprints":{"codehealthFindingId/v1":"896a07c96fb01db846abc5c78faa064710c7b8ab9b12883ad4fa74eabd9753e8"}},{"ruleId":"D1","level":"warning","message":{"text":"primitives._wgmma_warpgroup_lowering (cyclomatic 18): primitives._wgmma_warpgroup_lowering has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/mosaic_gpu/primitives.py"},"region":{"startLine":2339}}}],"partialFingerprints":{"codehealthFindingId/v1":"86131fd0129ccbe572c64533049aa596859c5000e251ec0efdaab0a0573f3653"}},{"ruleId":"D1","level":"warning","message":{"text":"mpmd._mpmd_map_batching_rule (cyclomatic 18): mpmd._mpmd_map_batching_rule has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/mpmd.py"},"region":{"startLine":519}}}],"partialFingerprints":{"codehealthFindingId/v1":"2485f2750729d345c7f6d0ac3034b9ab36701ab6df913ea74a1548f63d1ed67a"}},{"ruleId":"D1","level":"warning","message":{"text":"lowering._maybe_pattern_match_fori_loop (cyclomatic 18): lowering._maybe_pattern_match_fori_loop has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/triton/lowering.py"},"region":{"startLine":2840}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3d77920776ab6d370df304c6fd64036f8e0342b82aaa57ea856f21905a41d26"}},{"ruleId":"D1","level":"warning","message":{"text":"pjit._get_new_mesh (cyclomatic 18): pjit._get_new_mesh has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pjit.py"},"region":{"startLine":2912}}}],"partialFingerprints":{"codehealthFindingId/v1":"b95c0effc2add478d3aaf006541ef27d69a4ff5860bd4886efce458cbb4d62ee"}},{"ruleId":"D1","level":"warning","message":{"text":"core._multivariate_normal (cyclomatic 18): core._multivariate_normal has cyclomatic complexity 18 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/random/core.py"},"region":{"startLine":1544}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f6e1510ca86029f3adf320663437550b9f9ec6579b94311ffc9d4d425b0b0c4"}},{"ruleId":"D1","level":"warning","message":{"text":"call_tf._mlir_type_to_numpy_dtype (cyclomatic 18): call_tf._mlir_type_to_numpy_dtype has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/jax2tf/call_tf.py"},"region":{"startLine":473}}}],"partialFingerprints":{"codehealthFindingId/v1":"54e7a4ab9d229f3159721fb60f7db249656cdbb1867f30d2afb9ebab984a6ebf"}},{"ruleId":"D1","level":"warning","message":{"text":"_core.jaxpr_type_signature (cyclomatic 18): _core.jaxpr_type_signature has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/key_reuse/_core.py"},"region":{"startLine":329}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d3f57b3caa3c41c2e64dd94d8de1c9737f456526f58abde35387e74ba6e666b"}},{"ruleId":"D1","level":"warning","message":{"text":"dialect_lowering._memref_subview_op_lowering_rule (cyclomatic 18): dialect_lowering._memref_subview_op_lowering_rule has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/mosaic/gpu/dialect_lowering.py"},"region":{"startLine":1936}}}],"partialFingerprints":{"codehealthFindingId/v1":"607e4c099e615507d98ffaca6733dfb1a1b39efd0cc5113ed20ce015598df9cf"}},{"ruleId":"D1","level":"warning","message":{"text":"FragmentedArray.store_tiled (cyclomatic 18): FragmentedArray.store_tiled has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/mosaic/gpu/fragmented_array.py"},"region":{"startLine":4513}}}],"partialFingerprints":{"codehealthFindingId/v1":"bfcf03628808015debd8e4b0843d8dd2de878ae58abf378101aca327c05e2cf7"}},{"ruleId":"D1","level":"warning","message":{"text":"TMEMRef.store (cyclomatic 18): TMEMRef.store has cyclomatic complexity 18 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/mosaic/gpu/tcgen05.py"},"region":{"startLine":1573}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca92d1e51f2aba5f5637ea2164054c7730f8bf9fa3a4fe2d7d54224fe55b2ea2"}},{"ruleId":"D1","level":"warning","message":{"text":"reduce_scatter_mgpu.reduce_scatter (cyclomatic 18): reduce_scatter_mgpu.reduce_scatter has cyclomatic complexity 18 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/pallas/ops/gpu/reduce_scatter_mgpu.py"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a297a214ea9c44d0256b0711fc026247a9cbf616dfdbcf664816df4a284eaf2"}},{"ruleId":"D1","level":"warning","message":{"text":"core._why_alive_container_info (cyclomatic 17): core._why_alive_container_info has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/core.py"},"region":{"startLine":1657}}}],"partialFingerprints":{"codehealthFindingId/v1":"c72cee2ee9331df9c5eeda8bf1707f2f0d02705c846a35ed5c39c5f1c4440291"}},{"ruleId":"D1","level":"warning","message":{"text":"fused_attention_stablehlo._dot_product_attention_bwd_batcher (cyclomatic 17): fused_attention_stablehlo._dot_product_attention_bwd_batcher has cyclomatic complexity 17 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/cudnn/fused_attention_stablehlo.py"},"region":{"startLine":943}}}],"partialFingerprints":{"codehealthFindingId/v1":"236ab00a2b5ef259867936111a30f3dcf68ab77ef2ed9f7fee984ec2d4ed2b3e"}},{"ruleId":"D1","level":"warning","message":{"text":"pxla.maybe_recover_user_shardings (cyclomatic 17): pxla.maybe_recover_user_shardings has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/interpreters/pxla.py"},"region":{"startLine":1405}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2ee2a1801bf243477cb9d37e814e276d216765ba1a05035044c7d089fec3287"}},{"ruleId":"D1","level":"warning","message":{"text":"conditionals._check_branch_outputs (cyclomatic 17): conditionals._check_branch_outputs has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/lax/control_flow/conditionals.py"},"region":{"startLine":337}}}],"partialFingerprints":{"codehealthFindingId/v1":"621b930a70a366cfbc3dcdf941ae1a39614f7e53f2c333ece51c18e74f2b5dd7"}},{"ruleId":"D1","level":"warning","message":{"text":"loops.while_loop (cyclomatic 17): loops.while_loop has cyclomatic complexity 17 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/lax/control_flow/loops.py"},"region":{"startLine":1677}}}],"partialFingerprints":{"codehealthFindingId/v1":"f11ffce91f88e851d5de5502594748c35a1efabfd224da5ce7f691323efa5005"}},{"ruleId":"D1","level":"warning","message":{"text":"indexing._gather (cyclomatic 17): indexing._gather has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/numpy/indexing.py"},"region":{"startLine":1290}}}],"partialFingerprints":{"codehealthFindingId/v1":"7121b7b51e4f2f9b555b8400ae7e94bd31a1a1573f321041de1114104e8366d7"}},{"ruleId":"D1","level":"warning","message":{"text":"lax_numpy._interp (cyclomatic 17): lax_numpy._interp has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/numpy/lax_numpy.py"},"region":{"startLine":2640}}}],"partialFingerprints":{"codehealthFindingId/v1":"5dc79e43d7f86d926f130bb8d7a23624c4f2e9b0874511a7188039bcb9f8f0b6"}},{"ruleId":"D1","level":"warning","message":{"text":"reductions._reduce_minmax (cyclomatic 17): reductions._reduce_minmax has cyclomatic complexity 17 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/numpy/reductions.py"},"region":{"startLine":620}}}],"partialFingerprints":{"codehealthFindingId/v1":"7078df3ede2312be96accebbff9de15b0da8e8e62c940a7e224eccf98c59fdec"}},{"ruleId":"D1","level":"warning","message":{"text":"pallas_call_registration._resolve_memory_spaces (cyclomatic 17): pallas_call_registration._resolve_memory_spaces has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/mosaic/pallas_call_registration.py"},"region":{"startLine":152}}}],"partialFingerprints":{"codehealthFindingId/v1":"81bf07418fa394a4a965800220c8f1ed695db70d0ba6363af58abc7100b00d80"}},{"ruleId":"D1","level":"warning","message":{"text":"pjit._trace_for_jit (cyclomatic 17): pjit._trace_for_jit has cyclomatic complexity 17 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pjit.py"},"region":{"startLine":497}}}],"partialFingerprints":{"codehealthFindingId/v1":"53a9ea32555e8cd8ac595fe128600d03523ebe79ce87ea2becede4282067d152"}},{"ruleId":"D1","level":"warning","message":{"text":"shard_map._shmap_checks (cyclomatic 17): shard_map._shmap_checks has cyclomatic complexity 17 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/shard_map.py"},"region":{"startLine":371}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b7988a6085e5b050f53bb002578d6f3ae4b61cc7668d9c8483c4aa3fa71c6e8"}},{"ruleId":"D1","level":"warning","message":{"text":"discharge.transform_swap_array (cyclomatic 17): discharge.transform_swap_array has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/state/discharge.py"},"region":{"startLine":553}}}],"partialFingerprints":{"codehealthFindingId/v1":"df31dab24d9e92a96583cf9ae1d24f260adda94a9fd5f5bd717df3f0bea550dc"}},{"ruleId":"D1","level":"warning","message":{"text":"NDIndexer.__post_init__ (cyclomatic 17): NDIndexer.__post_init__ has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/state/indexing.py"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"2726953deb4414e4c30bc30f7781de41b2cc5ed357a3073ccd564d5ed4920d37"}},{"ruleId":"D1","level":"warning","message":{"text":"primitives._swap_vmap (cyclomatic 17): primitives._swap_vmap has cyclomatic complexity 17 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/state/primitives.py"},"region":{"startLine":981}}}],"partialFingerprints":{"codehealthFindingId/v1":"410b3f301500f8f290cee5da9aaf066fb94e1100adfdeffdd4f04652c57a5975"}},{"ruleId":"D1","level":"warning","message":{"text":"svd.svd (cyclomatic 17): svd.svd has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/tpu/linalg/svd.py"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ae7637a04c9bdabed37e00108c6b4cac4a415dd94f2bdc8c4a397ccb172ac64"}},{"ruleId":"D1","level":"warning","message":{"text":"tree_util._register_dataclass (cyclomatic 17): tree_util._register_dataclass has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/tree_util.py"},"region":{"startLine":1151}}}],"partialFingerprints":{"codehealthFindingId/v1":"23a0b994065de67946ec92fea5bcab5dfc14a5ff4ed119f431a51078454a3aef"}},{"ruleId":"D1","level":"warning","message":{"text":"layout_inference._extract_layout_candidates_from_tmem_registers_transfer (cyclomatic 17): layout_inference._extract_layout_candidates_from_tmem_registers_transfer has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/mosaic/gpu/layout_inference.py"},"region":{"startLine":297}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb849d94daec3e028775349e7cb29e4c95f8b61624398b3b11ab0c20de919e42"}},{"ruleId":"D1","level":"warning","message":{"text":"tcgen05._create_scaled_instr_descriptor (cyclomatic 17): tcgen05._create_scaled_instr_descriptor has cyclomatic complexity 17 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/mosaic/gpu/tcgen05.py"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"057345cc38f9ab13c0b4b3d8513cfceb6457d84a486bfe433ed322e71587f236"}},{"ruleId":"D1","level":"warning","message":{"text":"bcoo.bcoo_concatenate (cyclomatic 17): bcoo.bcoo_concatenate has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/sparse/bcoo.py"},"region":{"startLine":1767}}}],"partialFingerprints":{"codehealthFindingId/v1":"3bef5024b9ea27fa0002f43bf67fd1b5378596eeaaeee2bb387ba55cb83b782f"}},{"ruleId":"D1","level":"warning","message":{"text":"bcsr._bcsr_dot_general_gpu_lowering (cyclomatic 17): bcsr._bcsr_dot_general_gpu_lowering has cyclomatic complexity 17 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/sparse/bcsr.py"},"region":{"startLine":624}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d8de42453a43a74a819bfe2aebe056e8e8d06c8c99f3c375ec67d74414c1878"}},{"ruleId":"D1","level":"warning","message":{"text":"callback.emit_python_callback (cyclomatic 16): callback.emit_python_callback has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/callback.py"},"region":{"startLine":764}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3772e0f7a6c93e27190cd933f13aadf7da8240586848bb9bfb2002d32077d7e"}},{"ruleId":"D1","level":"warning","message":{"text":"dispatch._device_put_impl (cyclomatic 16): dispatch._device_put_impl has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/dispatch.py"},"region":{"startLine":606}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c68179a3113e42182ce3963097fc3d36e7d62d99c61cf7aa46528de2b1ff5b6"}},{"ruleId":"D1","level":"warning","message":{"text":"dtypes._least_upper_bound (cyclomatic 16): dtypes._least_upper_bound has cyclomatic complexity 16 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/dtypes.py"},"region":{"startLine":823}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ff9a62b4f526c9b5b6371e71ece2a9b5769d79f8cd730170f881ffdba5b99bf"}},{"ruleId":"D1","level":"warning","message":{"text":"loops._scan_batching_rule (cyclomatic 16): loops._scan_batching_rule has cyclomatic complexity 16 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/lax/control_flow/loops.py"},"region":{"startLine":1225}}}],"partialFingerprints":{"codehealthFindingId/v1":"363d1dd7bee932b1cce64bfd895ea83a43f6442b214ec17dbbe3a2fbb360b37b"}},{"ruleId":"D1","level":"warning","message":{"text":"lax._dot_general_shape_rule (cyclomatic 16): lax._dot_general_shape_rule has cyclomatic complexity 16 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/lax/lax.py"},"region":{"startLine":6746}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c3ba6b860009671915b4a993c84da7c65f49193506274dc532aca6d3e91fe52"}},{"ruleId":"D1","level":"warning","message":{"text":"scaled_dot._scaled_dot_validate_inputs (cyclomatic 16): scaled_dot._scaled_dot_validate_inputs has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/lax/scaled_dot.py"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"89a48740d36b5d18c7d0dfd399f921a46e46dd203b50d8cef025f17d2a15056b"}},{"ruleId":"D1","level":"warning","message":{"text":"slicing._gather_spec_computation (cyclomatic 16): slicing._gather_spec_computation has cyclomatic complexity 16 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/lax/slicing.py"},"region":{"startLine":2131}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b7a8ce21ada82041c1f362a3528e349b612c024defb8861a889ed25bc87963f"}},{"ruleId":"D1","level":"warning","message":{"text":"fft._fft_core (cyclomatic 16): fft._fft_core has cyclomatic complexity 16 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/numpy/fft.py"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec10af0a95e47038648754513bba4de836a225be45654e1c4bf028d8372ad133"}},{"ruleId":"D1","level":"warning","message":{"text":"indexing._take (cyclomatic 16): indexing._take has cyclomatic complexity 16 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/numpy/indexing.py"},"region":{"startLine":731}}}],"partialFingerprints":{"codehealthFindingId/v1":"d28e01553df0d0c34902ee95a0fc89bb32489b5f56353b52710365e7e07c3663"}},{"ruleId":"D1","level":"warning","message":{"text":"indexing.rewriting_take (cyclomatic 16): indexing.rewriting_take has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/numpy/indexing.py"},"region":{"startLine":1165}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a124057b44448611c022c099aac5e8bfe812028df9dba4f8bc0ea2cba7d218a"}},{"ruleId":"D1","level":"warning","message":{"text":"lax_numpy._repeat (cyclomatic 16): lax_numpy._repeat has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/numpy/lax_numpy.py"},"region":{"startLine":6484}}}],"partialFingerprints":{"codehealthFindingId/v1":"c695b53234d2633b87ae53e246772d6d518d3451706afaf871e442b45093c4a2"}},{"ruleId":"D1","level":"warning","message":{"text":"ufunc._reduce_via_scan (cyclomatic 16): ufunc._reduce_via_scan has cyclomatic complexity 16 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/numpy/ufunc_api.py"},"region":{"startLine":262}}}],"partialFingerprints":{"codehealthFindingId/v1":"79a3be8c52f4238660447e44fa5872ca7a9d729e4e375c5ff322339b9a735af4"}},{"ruleId":"D1","level":"warning","message":{"text":"shard_map_fusion.fuse_shard_map_jaxpr (cyclomatic 16): shard_map_fusion.fuse_shard_map_jaxpr has cyclomatic complexity 16 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/fuser/shard_map_fusion.py"},"region":{"startLine":219}}}],"partialFingerprints":{"codehealthFindingId/v1":"403893759024167576b874f59c77a869b69b52568ef6f6817a38a8ba40c0ab24"}},{"ruleId":"D1","level":"warning","message":{"text":"interpret_pallas_call.get (cyclomatic 16): interpret_pallas_call.get has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/mosaic/interpret/interpret_pallas_call.py"},"region":{"startLine":631}}}],"partialFingerprints":{"codehealthFindingId/v1":"47c6e683b4949bf299493cfbc9c44b6cd0eb78f8a426934560a696c0fd9dd3ef"}},{"ruleId":"D1","level":"warning","message":{"text":"primitives.dma_start_discharge_rule (cyclomatic 16): primitives.dma_start_discharge_rule has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/mosaic/primitives.py"},"region":{"startLine":508}}}],"partialFingerprints":{"codehealthFindingId/v1":"f23dbc4d1aa641fe427bf5c555d3f11be4bc004826643a59567224ca20d42979"}},{"ruleId":"D1","level":"warning","message":{"text":"lowering.lower_jaxpr_to_module (cyclomatic 16): lowering.lower_jaxpr_to_module has cyclomatic complexity 16 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/mosaic_gpu/lowering.py"},"region":{"startLine":737}}}],"partialFingerprints":{"codehealthFindingId/v1":"1fc6995aa749198e7e554014a3719467058807808a259f28644089ed704dace0"}},{"ruleId":"D1","level":"warning","message":{"text":"pmap._get_in_axes_flat (cyclomatic 16): pmap._get_in_axes_flat has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pmap.py"},"region":{"startLine":561}}}],"partialFingerprints":{"codehealthFindingId/v1":"f646dc845766de80cf5160a9f3dc17f3bc58682c25a469d674e271fb90377dcf"}},{"ruleId":"D1","level":"warning","message":{"text":"pmap.host_local_array_to_global_array (cyclomatic 16): pmap.host_local_array_to_global_array has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pmap.py"},"region":{"startLine":777}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0b8268edda285333252ab1756372a8987758da45b8cf9da04b178cac861941d"}},{"ruleId":"D1","level":"warning","message":{"text":"fft.dctn (cyclomatic 16): fft.dctn has cyclomatic complexity 16 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/scipy/fft.py"},"region":{"startLine":159}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed68af33c8e00b3414a5e06a83bc1e906023bda652af4f8c7ec619558929287b"}},{"ruleId":"D1","level":"warning","message":{"text":"linalg.eigh_tridiagonal (cyclomatic 16): linalg.eigh_tridiagonal has cyclomatic complexity 16 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/scipy/linalg.py"},"region":{"startLine":1736}}}],"partialFingerprints":{"codehealthFindingId/v1":"245b176a3916a51a546540d61c09c8f406258d63c03a999e0ef4265435779c01"}},{"ruleId":"D1","level":"warning","message":{"text":"IsTransferableTmemRegisters.is_valid_tmem_transfer (cyclomatic 16): IsTransferableTmemRegisters.is_valid_tmem_transfer has cyclomatic complexity 16 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/mosaic/gpu/constraints.py"},"region":{"startLine":605}}}],"partialFingerprints":{"codehealthFindingId/v1":"e79a67c9da1a95ae210d200ddb4f81f0dbd22f9328d506f3c12f66c5dbb6f85f"}},{"ruleId":"D1","level":"warning","message":{"text":"FragmentedArray.store_untiled (cyclomatic 16): FragmentedArray.store_untiled has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/mosaic/gpu/fragmented_array.py"},"region":{"startLine":4135}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a26dfc2985ffb9356f3050024a41956a53fe970fa083293fa66ae14f64a9fa5"}},{"ruleId":"D1","level":"warning","message":{"text":"launch_context._tma_dma_type (cyclomatic 16): launch_context._tma_dma_type has cyclomatic complexity 16 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/mosaic/gpu/launch_context.py"},"region":{"startLine":735}}}],"partialFingerprints":{"codehealthFindingId/v1":"d04e0ce036f334d20f0b713edfb4b735b0b74bece5b91e6ec0d4ccd1db7a5aa8"}},{"ruleId":"D1","level":"warning","message":{"text":"ProfilerSpec.dump (cyclomatic 16): ProfilerSpec.dump has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/mosaic/gpu/profiler.py"},"region":{"startLine":255}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b267f37b122baebea28417dd153ac6e86d7180adf2e939597805c3f78798b48"}},{"ruleId":"D1","level":"warning","message":{"text":"utils.bitcast (cyclomatic 16): utils.bitcast has cyclomatic complexity 16 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/mosaic/gpu/utils.py"},"region":{"startLine":2282}}}],"partialFingerprints":{"codehealthFindingId/v1":"6850e7d618c1bd379eb76acf02964cf536c2033801281e7880f0a00885caadbd"}},{"ruleId":"D1","level":"warning","message":{"text":"all_gather_mgpu.all_gather (cyclomatic 16): all_gather_mgpu.all_gather has cyclomatic complexity 16 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/pallas/ops/gpu/all_gather_mgpu.py"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"254c598c957ec5fd7fe967e57f43ee5ba85261d59a2d8f7ec53e50f9f7a2bc4e"}},{"ruleId":"D1","level":"warning","message":{"text":"attention_mgpu._attention_forward (cyclomatic 16): attention_mgpu._attention_forward has cyclomatic complexity 16 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/pallas/ops/gpu/attention_mgpu.py"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"ddc3b4c2782ef9c70c7e353fbbda44d9c43c2c1972a65ded0096a2e530cb5404"}},{"ruleId":"D1","level":"warning","message":{"text":"bcoo.bcoo_update_layout (cyclomatic 16): bcoo.bcoo_update_layout has cyclomatic complexity 16 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/sparse/bcoo.py"},"region":{"startLine":1572}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3bfb5b71ccf56e8a27ac1b6a38e64a3a4d42f0f3407ffe0ad8da8cd79639e1d"}},{"ruleId":"D2","level":"warning","message":{"text":"LaunchContext.async_copy (cognitive 225): LaunchContext.async_copy has cognitive complexity 225 (threshold 15). Drivers by points: if/else 90 (176 pts), loops 8 (18 pts), ternaries 6 (17 pts), boolean chains 14 (nesting depth added 107). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/mosaic/gpu/launch_context.py"},"region":{"startLine":1473}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c6627a9e708c7cf0b120c66a9be2bead64d6f47be61476953fd80e022138728"}},{"ruleId":"D2","level":"warning","message":{"text":"tcgen05.mma (cognitive 194): tcgen05.mma has cognitive complexity 194 (threshold 15). Drivers by points: if/else 86 (143 pts), boolean chains 29, ternaries 12 (21 pts), loops 1 (nesting depth added 66). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/mosaic/gpu/tcgen05.py"},"region":{"startLine":216}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc259a5e2cd7d39eb4533497d6fd3fdce2c92ee1c14edccfe56105ef7e73413a"}},{"ruleId":"D2","level":"warning","message":{"text":"mlir.lower_jaxpr_to_fun (cognitive 184): mlir.lower_jaxpr_to_fun has cognitive complexity 184 (threshold 15). Drivers by points: if/else 55 (95 pts), loops 19 (49 pts), boolean chains 20, ternaries 11 (20 pts) (nesting depth added 79). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/interpreters/mlir.py"},"region":{"startLine":1779}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d3e663512fbdccbc1f6ae9dd28d80c72e5462b9afb70ac5df9e692691dd0030"}},{"ruleId":"D2","level":"warning","message":{"text":"FragmentedArray.astype (cognitive 153): FragmentedArray.astype has cognitive complexity 153 (threshold 15). Drivers by points: if/else 49 (74 pts), boolean chains 38, loops 9 (22 pts), ternaries 8 (15 pts), match/switch 2 (4 pts) (nesting depth added 47). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/mosaic/gpu/fragmented_array.py"},"region":{"startLine":2507}}}],"partialFingerprints":{"codehealthFindingId/v1":"13833d214fb92eb534edf08b7f00b1eaf0a55bcebe4b011fb0b5101256944e32"}},{"ruleId":"D2","level":"warning","message":{"text":"FragmentedArray.transfer_tiled (cognitive 149): FragmentedArray.transfer_tiled has cognitive complexity 149 (threshold 15). Drivers by points: if/else 55 (100 pts), loops 11 (23 pts), boolean chains 18, ternaries 5 (8 pts) (nesting depth added 60). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/mosaic/gpu/fragmented_array.py"},"region":{"startLine":4749}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ce693abc3eb32f9f71c0a13ad7be9ba9fbaa78b56c55f0c22faebcd42dd73e4"}},{"ruleId":"D2","level":"warning","message":{"text":"FragmentedArray.reduce (cognitive 115): FragmentedArray.reduce has cognitive complexity 115 (threshold 15). Drivers by points: if/else 43 (79 pts), ternaries 6 (17 pts), loops 5 (9 pts), boolean chains 7, match/switch 2 (3 pts) (nesting depth added 52). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/mosaic/gpu/fragmented_array.py"},"region":{"startLine":3299}}}],"partialFingerprints":{"codehealthFindingId/v1":"545831acb0d80451fa2c1db57278985eee53c08de6652c0c4326f69410caf695"}},{"ruleId":"D2","level":"warning","message":{"text":"lowering.lower_jaxpr_into_pipelined_module (cognitive 108): lowering.lower_jaxpr_into_pipelined_module has cognitive complexity 108 (threshold 15). Drivers by points: if/else 26 (72 pts), loops 8 (21 pts), ternaries 3 (10 pts), boolean chains 5 (nesting depth added 66). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/mosaic/lowering.py"},"region":{"startLine":1104}}}],"partialFingerprints":{"codehealthFindingId/v1":"2fc202583986fc0995650783731e418a19fab7599a84dd655174f580d821275e"}},{"ruleId":"D2","level":"warning","message":{"text":"reductions._quantile (cognitive 103): reductions._quantile has cognitive complexity 103 (threshold 15). Drivers by points: if/else 52 (86 pts), ternaries 4 (8 pts), boolean chains 5, loops 2 (4 pts) (nesting depth added 40). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/numpy/reductions.py"},"region":{"startLine":2720}}}],"partialFingerprints":{"codehealthFindingId/v1":"89c94ee5a8b5d169eff8e56ef19fa9104f5aa909fb1265996b54233b322c2f88"}},{"ruleId":"D2","level":"warning","message":{"text":"primitives._copy_gmem_to_smem_lowering (cognitive 91): primitives._copy_gmem_to_smem_lowering has cognitive complexity 91 (threshold 15). Drivers by points: if/else 44 (76 pts), boolean chains 7, match/switch 3 (4 pts), ternaries 2 (4 pts) (nesting depth added 35). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/mosaic_gpu/primitives.py"},"region":{"startLine":975}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc68e756f54f4a19150dc8cebc0697fe636872d48a32643be1f6d0b578169e1e"}},{"ruleId":"D2","level":"warning","message":{"text":"splash_attention_mask_info._process_mask (cognitive 90): splash_attention_mask_info._process_mask has cognitive complexity 90 (threshold 15). Drivers by points: if/else 28 (47 pts), loops 10 (20 pts), ternaries 9 (17 pts), boolean chains 6 (nesting depth added 37). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/pallas/ops/tpu/splash_attention/splash_attention_mask_info.py"},"region":{"startLine":518}}}],"partialFingerprints":{"codehealthFindingId/v1":"892333dcec2a25789ad124ff3e25f9bc891351e99e40bf4c6cebdd67d3a3c10c"}},{"ruleId":"D2","level":"warning","message":{"text":"CustomCallBackendConfig.to_json (cognitive 81): CustomCallBackendConfig.to_json has cognitive complexity 81 (threshold 15). Drivers by points: if/else 38 (62 pts), ternaries 3 (9 pts), loops 4 (8 pts), boolean chains 2 (nesting depth added 34). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/tpu_custom_call.py"},"region":{"startLine":251}}}],"partialFingerprints":{"codehealthFindingId/v1":"ddc3c42b05891d4156c6ea39e868d0924b834c98d86f46ca48cad7d0970f0f78"}},{"ruleId":"D2","level":"warning","message":{"text":"lowering.jaxpr_subcomp (cognitive 80): lowering.jaxpr_subcomp has cognitive complexity 80 (threshold 15). Drivers by points: if/else 14 (42 pts), error handling 3 (13 pts), ternaries 4 (13 pts), loops 5 (9 pts), boolean chains 3 (nesting depth added 51). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/mosaic/lowering.py"},"region":{"startLine":1790}}}],"partialFingerprints":{"codehealthFindingId/v1":"4292b5f48260bf90ffcc407e782f91ce39a615885e4d601eb83dce9f8764d207"}},{"ruleId":"D2","level":"warning","message":{"text":"hlo._parse_hlo_new_format (cognitive 76): hlo._parse_hlo_new_format has cognitive complexity 76 (threshold 15). Drivers by points: if/else 18 (66 pts), loops 4 (10 pts) (nesting depth added 54). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/source_mapper/hlo.py"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ee00737564ffa7966abd2472a83745250105bc159913026ecc6cf9f73893b60"}},{"ruleId":"D2","level":"warning","message":{"text":"FragmentedArray.to_layout (cognitive 73): FragmentedArray.to_layout has cognitive complexity 73 (threshold 15). Drivers by points: loops 11 (29 pts), if/else 17 (25 pts), ternaries 3 (11 pts), boolean chains 8 (nesting depth added 34). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/mosaic/gpu/fragmented_array.py"},"region":{"startLine":1352}}}],"partialFingerprints":{"codehealthFindingId/v1":"2555cb4f9db26b22b2abb0c6da38d4707c37cf9067e48f96f757e7e40d7c613c"}},{"ruleId":"D2","level":"warning","message":{"text":"einsum._einsum (cognitive 68): einsum._einsum has cognitive complexity 68 (threshold 15). Drivers by points: if/else 17 (39 pts), ternaries 4 (16 pts), boolean chains 12, loops 1 (nesting depth added 34). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/numpy/einsum.py"},"region":{"startLine":441}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1bb4c2a67756739e189c4e5d6c80863ae700f4aeccc2cbafc9d99d5c9c2b776"}},{"ruleId":"D2","level":"warning","message":{"text":"dispatch._device_put_sharding_impl (cognitive 64): dispatch._device_put_sharding_impl has cognitive complexity 64 (threshold 15). Drivers by points: if/else 22 (47 pts), boolean chains 13, ternaries 2 (4 pts) (nesting depth added 27). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/dispatch.py"},"region":{"startLine":471}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b6049b5de3eaeebd6af930e93ded1cebf4348d5a632681326dc5e26a6e3979b"}},{"ruleId":"D2","level":"warning","message":{"text":"FragmentedArray._store_register_atomic (cognitive 63): FragmentedArray._store_register_atomic has cognitive complexity 63 (threshold 15). Drivers by points: if/else 22 (39 pts), ternaries 6 (14 pts), boolean chains 7, loops 2 (3 pts) (nesting depth added 26). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/mosaic/gpu/fragmented_array.py"},"region":{"startLine":4375}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ff325bf533a8d030be6099a23e0277394e5e67c52c5dad6621c88b6c6ce7adf"}},{"ruleId":"D2","level":"warning","message":{"text":"interpret_pallas_call._interpret_jaxpr (cognitive 62): interpret_pallas_call._interpret_jaxpr has cognitive complexity 62 (threshold 15). Drivers by points: if/else 17 (47 pts), loops 3 (7 pts), boolean chains 5, ternaries 2 (3 pts) (nesting depth added 35). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/mosaic/interpret/interpret_pallas_call.py"},"region":{"startLine":1349}}}],"partialFingerprints":{"codehealthFindingId/v1":"9365061ec736cbd152ec0cb80e8ed451997a1d53e5434ef5b3308a3f4617869e"}},{"ruleId":"D2","level":"warning","message":{"text":"signal._spectral_helper (cognitive 60): signal._spectral_helper has cognitive complexity 60 (threshold 15). Drivers by points: if/else 40 (49 pts), boolean chains 6, ternaries 2 (3 pts), error handling 1 (2 pts) (nesting depth added 11). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/scipy/signal.py"},"region":{"startLine":615}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0faa7304eb482b4706959335bd9a003ecbf9cc193b196691007d232bd413f74"}},{"ruleId":"D2","level":"warning","message":{"text":"array_constructors.array (cognitive 59): array_constructors.array has cognitive complexity 59 (threshold 15). Drivers by points: if/else 24 (34 pts), boolean chains 10, ternaries 5 (10 pts), loops 1 (3 pts), error handling 1 (2 pts) (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/numpy/array_constructors.py"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"83598f9c30832470d72e395cd8e5e79d8dd7579df31e7149819e8077c60ee3cd"}},{"ruleId":"D2","level":"warning","message":{"text":"thunky._transforms_to_slice_params (cognitive 54): thunky._transforms_to_slice_params has cognitive complexity 54 (threshold 15). Drivers by points: if/else 14 (47 pts), loops 2 (4 pts), boolean chains 3 (nesting depth added 35). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/thunky/thunky.py"},"region":{"startLine":191}}}],"partialFingerprints":{"codehealthFindingId/v1":"5bc541a03c015b9cc7a136f4f253b6cc274d97fa22ae86292ea592fb7fee4756"}},{"ruleId":"D2","level":"warning","message":{"text":"lowering._compute_offsets_from_indices (cognitive 52): lowering._compute_offsets_from_indices has cognitive complexity 52 (threshold 15). Drivers by points: if/else 15 (32 pts), loops 4 (11 pts), ternaries 2 (4 pts), boolean chains 3, match/switch 1 (2 pts) (nesting depth added 27). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/triton/lowering.py"},"region":{"startLine":1924}}}],"partialFingerprints":{"codehealthFindingId/v1":"38f2088cb12029a91d3f1a05b17b51e08c99ecb00d5846accc976d8198089a47"}},{"ruleId":"D2","level":"warning","message":{"text":"core._launch (cognitive 51): core._launch has cognitive complexity 51 (threshold 15). Drivers by points: if/else 30 (42 pts), loops 3 (6 pts), boolean chains 3 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/mosaic/gpu/core.py"},"region":{"startLine":751}}}],"partialFingerprints":{"codehealthFindingId/v1":"68de8cce2e6d2b531d979b4bb11e8df064222cd8b9ac5dc6b75027d80c5b49a1"}},{"ruleId":"D2","level":"warning","message":{"text":"custom_partitioning_sharding_rule._parse_values (cognitive 50): custom_partitioning_sharding_rule._parse_values has cognitive complexity 50 (threshold 15). Drivers by points: if/else 17 (41 pts), loops 2 (5 pts), boolean chains 4 (nesting depth added 27). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/custom_partitioning_sharding_rule.py"},"region":{"startLine":212}}}],"partialFingerprints":{"codehealthFindingId/v1":"03168c945aeafa2a776d88861cd76a63f73add5539232004c2a8d314f5a0b1f1"}},{"ruleId":"D2","level":"warning","message":{"text":"slicing._dynamic_slice_indices (cognitive 50): slicing._dynamic_slice_indices has cognitive complexity 50 (threshold 15). Drivers by points: if/else 17 (32 pts), ternaries 3 (11 pts), boolean chains 4, loops 2 (3 pts) (nesting depth added 24). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/lax/slicing.py"},"region":{"startLine":3922}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e39972b436d8ecd2a5cc70481b58a6ba0ee458dd4e42fd6706e7b477b284af4"}},{"ruleId":"D2","level":"warning","message":{"text":"evaluate_sampler_bias.evaluate_bias (cognitive 50): evaluate_sampler_bias.evaluate_bias has cognitive complexity 50 (threshold 15). Drivers by points: if/else 14 (22 pts), ternaries 5 (13 pts), error handling 4 (9 pts), loops 4 (6 pts) (nesting depth added 23). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/tools/evaluate_sampler_bias.py"},"region":{"startLine":187}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea608e1ae23daa9815c4d443f1680689e11a20c5e8813ab243889d20aeee562f"}},{"ruleId":"D2","level":"warning","message":{"text":"LaunchContext.async_copy_im2col (cognitive 49): LaunchContext.async_copy_im2col has cognitive complexity 49 (threshold 15). Drivers by points: if/else 29 (42 pts), loops 4, boolean chains 3 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/mosaic/gpu/launch_context.py"},"region":{"startLine":2266}}}],"partialFingerprints":{"codehealthFindingId/v1":"996bfeac1f3f520799a5969a498675171316be2b0580c2a10c99103ec7654e80"}},{"ruleId":"D2","level":"warning","message":{"text":"mlir._set_up_aliases (cognitive 48): mlir._set_up_aliases has cognitive complexity 48 (threshold 15). Drivers by points: if/else 15 (33 pts), boolean chains 11, loops 4 (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/interpreters/mlir.py"},"region":{"startLine":1604}}}],"partialFingerprints":{"codehealthFindingId/v1":"055d95e8b0a5c333f21a0b407cb607c1079f75e661573f6b78aaa1873772b9e2"}},{"ruleId":"D2","level":"warning","message":{"text":"lax._convert_element_type (cognitive 48): lax._convert_element_type has cognitive complexity 48 (threshold 15). Drivers by points: if/else 17 (29 pts), boolean chains 15, error handling 1 (4 pts) (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/lax/lax.py"},"region":{"startLine":1841}}}],"partialFingerprints":{"codehealthFindingId/v1":"c084629369fa31e0c621679044979767775256eabf50b8e7e52b8a48133f07b9"}},{"ruleId":"D2","level":"warning","message":{"text":"pallas_call_registration.mpmd_map_tpu_lowering_rule (cognitive 48): pallas_call_registration.mpmd_map_tpu_lowering_rule has cognitive complexity 48 (threshold 15). Drivers by points: if/else 17 (32 pts), ternaries 3 (6 pts), loops 3 (4 pts), boolean chains 3, match/switch 2 (3 pts) (nesting depth added 20). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/mosaic/pallas_call_registration.py"},"region":{"startLine":612}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf60a1b2ef197105f86a82861e454da8d5f43a4c83ba275b2f87db855a876be5"}},{"ruleId":"D2","level":"warning","message":{"text":"core._mosaic_gpu_lowering_rule (cognitive 48): core._mosaic_gpu_lowering_rule has cognitive complexity 48 (threshold 15). Drivers by points: if/else 25 (45 pts), boolean chains 2, ternaries 1 (nesting depth added 20). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/mosaic/gpu/core.py"},"region":{"startLine":211}}}],"partialFingerprints":{"codehealthFindingId/v1":"a772510bf6b151e302a05dd750d0cf51387ad69fb25c0477a2bc50c86e40894c"}},{"ruleId":"D2","level":"warning","message":{"text":"compiler.get_compile_options (cognitive 47): compiler.get_compile_options has cognitive complexity 47 (threshold 15). Drivers by points: if/else 23 (38 pts), boolean chains 5, loops 2 (4 pts) (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/compiler.py"},"region":{"startLine":187}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ea01599a3bd2f37f9782bfdf28920319d4ad0a8106e463584409e2b5e10058e"}},{"ruleId":"D2","level":"warning","message":{"text":"custom_partitioning_sharding_rule.sdy_sharding_rule_to_mlir (cognitive 47): custom_partitioning_sharding_rule.sdy_sharding_rule_to_mlir has cognitive complexity 47 (threshold 15). Drivers by points: if/else 17 (30 pts), loops 7 (14 pts), boolean chains 3 (nesting depth added 20). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/custom_partitioning_sharding_rule.py"},"region":{"startLine":363}}}],"partialFingerprints":{"codehealthFindingId/v1":"85d843c98cdafee468513e4c4a199c0683cd2b18f60b94b1086d873644290959"}},{"ruleId":"D2","level":"warning","message":{"text":"_export._export_lowered (cognitive 47): _export._export_lowered has cognitive complexity 47 (threshold 15). Drivers by points: if/else 19 (31 pts), ternaries 3 (6 pts), boolean chains 5, loops 3 (5 pts) (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/export/_export.py"},"region":{"startLine":698}}}],"partialFingerprints":{"codehealthFindingId/v1":"506b5186840661da73429042a2fb69882882edb5fa85b4052818e176d30b6a76"}},{"ruleId":"D2","level":"warning","message":{"text":"ProfilerSpec.dump (cognitive 47): ProfilerSpec.dump has cognitive complexity 47 (threshold 15). Drivers by points: if/else 10 (28 pts), loops 4 (11 pts), ternaries 2 (8 pts) (nesting depth added 31). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/mosaic/gpu/profiler.py"},"region":{"startLine":255}}}],"partialFingerprints":{"codehealthFindingId/v1":"74aaf9037bc2c07a1eafc9f32f9d476fda8b6de5397b877ed071aad3b03e3446"}},{"ruleId":"D2","level":"warning","message":{"text":"mlir.lower_jaxpr_to_module (cognitive 46): mlir.lower_jaxpr_to_module has cognitive complexity 46 (threshold 15). Drivers by points: if/else 16 (26 pts), ternaries 6 (9 pts), boolean chains 5, loops 2 (5 pts), error handling 1 (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/interpreters/mlir.py"},"region":{"startLine":1436}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5d2d19c9a3a0a35512c2b8505d6a21ef42e0d9e2c69b903f740622c33956b33"}},{"ruleId":"D2","level":"warning","message":{"text":"indexing._index_to_gather (cognitive 45): indexing._index_to_gather has cognitive complexity 45 (threshold 15). Drivers by points: if/else 20 (37 pts), boolean chains 5, error handling 1 (2 pts), loops 1 (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/numpy/indexing.py"},"region":{"startLine":1405}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f4cbeb1439a53dc5e01488c96b3758fb3551f9fd1297c6601a692703b56a92f"}},{"ruleId":"D2","level":"warning","message":{"text":"shard_map_fusion._make_block_extractor (cognitive 45): shard_map_fusion._make_block_extractor has cognitive complexity 45 (threshold 15). Drivers by points: if/else 16 (27 pts), boolean chains 6, ternaries 4 (6 pts), error handling 2 (4 pts), loops 2 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/fuser/shard_map_fusion.py"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"a99c0705b1f6ae3ecd22b03db6647210a45cada61297bfb4f245e169129f6b07"}},{"ruleId":"D2","level":"warning","message":{"text":"discharge._eval_jaxpr_discharge_state (cognitive 45): discharge._eval_jaxpr_discharge_state has cognitive complexity 45 (threshold 15). Drivers by points: if/else 18 (39 pts), loops 2 (4 pts), boolean chains 2 (nesting depth added 23). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/state/discharge.py"},"region":{"startLine":233}}}],"partialFingerprints":{"codehealthFindingId/v1":"da10c8c10e641c60a5a02496594fd700b19a4618adc2b72c46f4b46e7065dfeb"}},{"ruleId":"D2","level":"warning","message":{"text":"ad.backward_pass3 (cognitive 44): ad.backward_pass3 has cognitive complexity 44 (threshold 15). Drivers by points: if/else 13 (28 pts), loops 5 (10 pts), ternaries 2 (4 pts), boolean chains 2 (nesting depth added 22). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/interpreters/ad.py"},"region":{"startLine":300}}}],"partialFingerprints":{"codehealthFindingId/v1":"41eadb551b011eef63ce2096ad96a6f2703aae4866292e01bb9b9d3237d0c305"}},{"ruleId":"D2","level":"warning","message":{"text":"pipeline._emit_pipeline_effectful_abstract_eval (cognitive 44): pipeline._emit_pipeline_effectful_abstract_eval has cognitive complexity 44 (threshold 15). Drivers by points: if/else 12 (30 pts), ternaries 3 (9 pts), loops 3, boolean chains 2 (nesting depth added 24). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/mosaic/pipeline.py"},"region":{"startLine":2475}}}],"partialFingerprints":{"codehealthFindingId/v1":"c877fbf460ea93191717cf37f7b7c0c6cf39083bee25742c05771e8b6f96fab8"}},{"ruleId":"D2","level":"warning","message":{"text":"LaunchContext._prepare_async_copy (cognitive 44): LaunchContext._prepare_async_copy has cognitive complexity 44 (threshold 15). Drivers by points: if/else 21 (38 pts), boolean chains 4, loops 1, ternaries 1 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/mosaic/gpu/launch_context.py"},"region":{"startLine":1150}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a1b9c30d05e289041d132d8181c59ce878965ff14dd59f709cd7527d5afe2fa"}},{"ruleId":"D2","level":"warning","message":{"text":"layout_inference._check_unsatisfiable_divisibility_constraints (cognitive 44): layout_inference._check_unsatisfiable_divisibility_constraints has cognitive complexity 44 (threshold 15). Drivers by points: if/else 8 (24 pts), loops 7 (15 pts), boolean chains 3, match/switch 1 (2 pts) (nesting depth added 25). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/mosaic/gpu/layout_inference.py"},"region":{"startLine":2645}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f019d88a4abdfd9816a4087699c66b8aae6dcb96d638d37f75131164d1c4e13"}},{"ruleId":"D2","level":"warning","message":{"text":"utils.multimem_load_reduce (cognitive 44): utils.multimem_load_reduce has cognitive complexity 44 (threshold 15). Drivers by points: if/else 18 (36 pts), loops 1 (4 pts), ternaries 1 (4 pts) (nesting depth added 24). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/mosaic/gpu/utils.py"},"region":{"startLine":423}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b1166a11b4b784fbffb2eaddc58f5a6d3672fc09a7efc8568885c757d5b5bc9"}},{"ruleId":"D2","level":"warning","message":{"text":"core._check_jaxpr (cognitive 43): core._check_jaxpr has cognitive complexity 43 (threshold 15). Drivers by points: if/else 13 (33 pts), loops 5 (8 pts), error handling 1 (2 pts) (nesting depth added 24). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/core.py"},"region":{"startLine":3708}}}],"partialFingerprints":{"codehealthFindingId/v1":"627ac5fc15f49396346a93859cab3dc317c905f423be66174ce56c936a3e7934"}},{"ruleId":"D2","level":"warning","message":{"text":"utils.parse_indices (cognitive 43): utils.parse_indices has cognitive complexity 43 (threshold 15). Drivers by points: if/else 13 (31 pts), boolean chains 11, loops 1 (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/mosaic/gpu/utils.py"},"region":{"startLine":1086}}}],"partialFingerprints":{"codehealthFindingId/v1":"27e1257046925b5e3637c95b4c2b4c6899a8a7ecc07e941e9a46a58030b74834"}},{"ruleId":"D2","level":"warning","message":{"text":"lowering._check_block_mappings (cognitive 42): lowering._check_block_mappings has cognitive complexity 42 (threshold 15). Drivers by points: if/else 16 (33 pts), boolean chains 8, loops 1 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/mosaic/lowering.py"},"region":{"startLine":959}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ed0fc9155482e7ad813f4b23fcb4f352fc403df3caf4127a724482640b5a4a8"}},{"ruleId":"D2","level":"warning","message":{"text":"constraints.reduce_constraint (cognitive 42): constraints.reduce_constraint has cognitive complexity 42 (threshold 15). Drivers by points: if/else 17 (34 pts), boolean chains 7, match/switch 1 (nesting depth added 17). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/mosaic/gpu/constraints.py"},"region":{"startLine":939}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b7b67322d6d8cdf414e76fcdda9a190c7a8d0d5d1eeb13cab2ad239e9939e99"}},{"ruleId":"D2","level":"warning","message":{"text":"TMEMRef.load (cognitive 42): TMEMRef.load has cognitive complexity 42 (threshold 15). Drivers by points: if/else 18 (30 pts), boolean chains 12 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/mosaic/gpu/tcgen05.py"},"region":{"startLine":1431}}}],"partialFingerprints":{"codehealthFindingId/v1":"85255bf1162c7f82c6f3389fca652f52ca2fe28e68e32f9bd07b501e25c74da8"}},{"ruleId":"D2","level":"warning","message":{"text":"tcgen05._do_mma (cognitive 42): tcgen05._do_mma has cognitive complexity 42 (threshold 15). Drivers by points: if/else 13 (18 pts), ternaries 9 (15 pts), boolean chains 8, loops 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/mosaic/gpu/tcgen05.py"},"region":{"startLine":665}}}],"partialFingerprints":{"codehealthFindingId/v1":"066d4e8b4b11f282b5d3ff7fd6b4805be0ec71aa2ceb7c2e79cdf9ab152c99d7"}},{"ruleId":"D2","level":"warning","message":{"text":"interpret_pallas_call.interpret_pallas_call (cognitive 41): interpret_pallas_call.interpret_pallas_call has cognitive complexity 41 (threshold 15). Drivers by points: if/else 22 (33 pts), loops 5, boolean chains 2, ternaries 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/mosaic/interpret/interpret_pallas_call.py"},"region":{"startLine":2003}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb5be1a38be1231de6476460fae1e23f9f384fe33e2beab6b44201fdd82cbad3"}},{"ruleId":"D2","level":"warning","message":{"text":"pallas_call_registration._resolve_memory_spaces (cognitive 41): pallas_call_registration._resolve_memory_spaces has cognitive complexity 41 (threshold 15). Drivers by points: if/else 14 (33 pts), loops 2 (5 pts), ternaries 1 (2 pts), boolean chains 1 (nesting depth added 23). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/mosaic/pallas_call_registration.py"},"region":{"startLine":152}}}],"partialFingerprints":{"codehealthFindingId/v1":"243f74d36b146edf042b50234bede8b1e19d9d1e85bb2c609f745b3eb2fef60b"}},{"ruleId":"D2","level":"warning","message":{"text":"mpmd._mpmd_map_abstract_eval (cognitive 41): mpmd._mpmd_map_abstract_eval has cognitive complexity 41 (threshold 15). Drivers by points: if/else 12 (28 pts), boolean chains 6, ternaries 3 (4 pts), loops 2 (3 pts) (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/mpmd.py"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb63419f41bb3c37fa5fc6486912a0827601da5aa63dfaa8e563846b2cb7d937"}},{"ruleId":"D2","level":"warning","message":{"text":"lax_numpy.cov (cognitive 40): lax_numpy.cov has cognitive complexity 40 (threshold 15). Drivers by points: if/else 21 (28 pts), ternaries 5 (9 pts), boolean chains 3 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/numpy/lax_numpy.py"},"region":{"startLine":9176}}}],"partialFingerprints":{"codehealthFindingId/v1":"78b879c35dc3e39eaa2bb978f5ce64c15ec69abaf4b52fa9a82f05055a3cb3a2"}},{"ruleId":"D2","level":"warning","message":{"text":"einshape._inverse_block_transform (cognitive 40): einshape._inverse_block_transform has cognitive complexity 40 (threshold 15). Drivers by points: if/else 10 (22 pts), ternaries 4 (9 pts), loops 3 (8 pts), match/switch 1 (nesting depth added 22). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/einshape.py"},"region":{"startLine":535}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5f645d473788dcfc9f89a5ef7f6383fa85743981750ecdca696a793aa56627b"}},{"ruleId":"D2","level":"warning","message":{"text":"Barrier._wait (cognitive 40): Barrier._wait has cognitive complexity 40 (threshold 15). Drivers by points: if/else 18 (32 pts), loops 2 (4 pts), boolean chains 3, ternaries 1 (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/mosaic_gpu/interpret/shared_memory.py"},"region":{"startLine":1380}}}],"partialFingerprints":{"codehealthFindingId/v1":"fbb82e7b06587f85a34b508121214fd7b14d9b467b9a86cc1e45266d86cffa4a"}},{"ruleId":"D2","level":"warning","message":{"text":"torch._find_mgpu_call (cognitive 40): torch._find_mgpu_call has cognitive complexity 40 (threshold 15). Drivers by points: if/else 15 (32 pts), boolean chains 3, error handling 1 (3 pts), loops 2 (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/mosaic_gpu/torch.py"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3d7f03402892544e271e8fc809b2b575863ca24d7bf4e5b5163c7e188e7e358"}},{"ruleId":"D2","level":"warning","message":{"text":"splash_attention_mask_info._get_mask_info_for_shard (cognitive 40): splash_attention_mask_info._get_mask_info_for_shard has cognitive complexity 40 (threshold 15). Drivers by points: if/else 15 (26 pts), error handling 2 (7 pts), ternaries 2 (3 pts), boolean chains 2, loops 2 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/pallas/ops/tpu/splash_attention/splash_attention_mask_info.py"},"region":{"startLine":172}}}],"partialFingerprints":{"codehealthFindingId/v1":"a24c9ff54e1311b0129ec206c5ff66f7696790c075a8859b67bb53ad0806105e"}},{"ruleId":"D2","level":"warning","message":{"text":"lowering._run_scoped_lowering_rule (cognitive 39): lowering._run_scoped_lowering_rule has cognitive complexity 39 (threshold 15). Drivers by points: if/else 16 (29 pts), boolean chains 6, loops 2 (4 pts) (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/mosaic_gpu/lowering.py"},"region":{"startLine":3476}}}],"partialFingerprints":{"codehealthFindingId/v1":"bef4763c178ed57a44c919a9a10a3485e4891a85600eff577becc3efb8bb8a6d"}},{"ruleId":"D2","level":"warning","message":{"text":"primitives._batch_indexer (cognitive 39): primitives._batch_indexer has cognitive complexity 39 (threshold 15). Drivers by points: if/else 15 (37 pts), boolean chains 1, loops 1 (nesting depth added 22). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/state/primitives.py"},"region":{"startLine":799}}}],"partialFingerprints":{"codehealthFindingId/v1":"f99a3c0c2def30a5eff3a9b7893127ea0d51670db09ee1a5dcfb8d0f201a5024"}},{"ruleId":"D2","level":"warning","message":{"text":"wgmma._wgmma_m64 (cognitive 39): wgmma._wgmma_m64 has cognitive complexity 39 (threshold 15). Drivers by points: if/else 24 (28 pts), boolean chains 5, ternaries 3 (4 pts), loops 2 (nesting depth added 5). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/mosaic/gpu/wgmma.py"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e933f369fa7f65431463e3b53004ef564b0bc4f82ec8aa46c1ec6e574e9ed51"}},{"ruleId":"D2","level":"warning","message":{"text":"splash_attention_kernel._splash_attention_forward (cognitive 39): splash_attention_kernel._splash_attention_forward has cognitive complexity 39 (threshold 15). Drivers by points: if/else 28 (31 pts), ternaries 5, boolean chains 3 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/pallas/ops/tpu/splash_attention/splash_attention_kernel.py"},"region":{"startLine":912}}}],"partialFingerprints":{"codehealthFindingId/v1":"41d7984e703d2882827504168c03f04ff726158a1372febc6d759d2603e545b3"}},{"ruleId":"D2","level":"warning","message":{"text":"fused_attention_stablehlo.dot_product_attention (cognitive 38): fused_attention_stablehlo.dot_product_attention has cognitive complexity 38 (threshold 15). Drivers by points: if/else 15 (28 pts), boolean chains 10 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/cudnn/fused_attention_stablehlo.py"},"region":{"startLine":2032}}}],"partialFingerprints":{"codehealthFindingId/v1":"19a4b8b80e3c9772c5605ec63a878bc31a5ce64713e011f93f7c59660ee7c111"}},{"ruleId":"D2","level":"warning","message":{"text":"debugging.visualize_sharding (cognitive 38): debugging.visualize_sharding has cognitive complexity 38 (threshold 15). Drivers by points: if/else 12 (18 pts), ternaries 5 (11 pts), loops 3 (4 pts), boolean chains 3, error handling 1 (2 pts) (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/debugging.py"},"region":{"startLine":861}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0aa526c617687caf52b4929aca2cdc1a7d32c256617890e6f5bd07958d3d584"}},{"ruleId":"D2","level":"warning","message":{"text":"pxla.lower_sharding_computation (cognitive 38): pxla.lower_sharding_computation has cognitive complexity 38 (threshold 15). Drivers by points: if/else 14 (22 pts), boolean chains 7, ternaries 5 (6 pts), loops 2 (3 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/interpreters/pxla.py"},"region":{"startLine":956}}}],"partialFingerprints":{"codehealthFindingId/v1":"960daf66ca879b851796964f5c0e126b3fc53398471127b943bd7aa3c70df716"}},{"ruleId":"D2","level":"warning","message":{"text":"linalg._eig_gpu_lowering (cognitive 38): linalg._eig_gpu_lowering has cognitive complexity 38 (threshold 15). Drivers by points: if/else 17 (28 pts), ternaries 2 (6 pts), boolean chains 4 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/lax/linalg.py"},"region":{"startLine":1104}}}],"partialFingerprints":{"codehealthFindingId/v1":"8bcf8f1d456fd3e435abc6ce3fe06a731f22087a6e8ac3daf45ad6677658c443"}},{"ruleId":"D2","level":"warning","message":{"text":"reductions._reduction (cognitive 38): reductions._reduction has cognitive complexity 38 (threshold 15). Drivers by points: if/else 18 (23 pts), boolean chains 11, ternaries 3 (4 pts) (nesting depth added 6). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/numpy/reductions.py"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"50089cb45121bf2e5c292e6ad3e87015a9b63a2203df5bb053d7ba9aaa24d16b"}},{"ruleId":"D2","level":"warning","message":{"text":"NDIndexer.__post_init__ (cognitive 38): NDIndexer.__post_init__ has cognitive complexity 38 (threshold 15). Drivers by points: if/else 11 (30 pts), error handling 2 (4 pts), ternaries 1 (2 pts), boolean chains 1, loops 1 (nesting depth added 22). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/state/indexing.py"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"b03767a4192b27a081ac4600cf83d3d121881f047a6607dd5114edc915d99179"}},{"ruleId":"D2","level":"warning","message":{"text":"FragmentedArray._pointwise (cognitive 38): FragmentedArray._pointwise has cognitive complexity 38 (threshold 15). Drivers by points: if/else 17 (32 pts), loops 3 (4 pts), boolean chains 2 (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/mosaic/gpu/fragmented_array.py"},"region":{"startLine":1629}}}],"partialFingerprints":{"codehealthFindingId/v1":"76b670890f89686205f89b84833d0954290aba2d5b8b4c4b57f0412fb3734987"}},{"ruleId":"D2","level":"warning","message":{"text":"paged_attention_kernel.paged_attention (cognitive 38): paged_attention_kernel.paged_attention has cognitive complexity 38 (threshold 15). Drivers by points: if/else 25 (29 pts), ternaries 4 (8 pts), boolean chains 1 (nesting depth added 8). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/pallas/ops/tpu/paged_attention/paged_attention_kernel.py"},"region":{"startLine":391}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1dd86f81fcf1ba464d9939798d0a1eda3a03b00de2f9fb414322a362a4f57ee"}},{"ruleId":"D2","level":"warning","message":{"text":"lax.broadcasting_sharding_rule (cognitive 37): lax.broadcasting_sharding_rule has cognitive complexity 37 (threshold 15). Drivers by points: if/else 13 (25 pts), loops 3 (6 pts), boolean chains 5, ternaries 1 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/lax/lax.py"},"region":{"startLine":4705}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a643cfdf63f2e3730d67ba1ed5d206859392884fa694dfe51bfaa3fd44e803a"}},{"ruleId":"D2","level":"warning","message":{"text":"lowering._dot_general_lowering_rule (cognitive 37): lowering._dot_general_lowering_rule has cognitive complexity 37 (threshold 15). Drivers by points: if/else 17 (30 pts), boolean chains 4, ternaries 1 (2 pts), loops 1 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/mosaic/lowering.py"},"region":{"startLine":3013}}}],"partialFingerprints":{"codehealthFindingId/v1":"b15c8cc3132134cf7810145c54dcd567d37d23127a6b75dd66eb3f0cfec47948"}},{"ruleId":"D2","level":"warning","message":{"text":"lowering._lower_jaxpr_to_for_loop (cognitive 37): lowering._lower_jaxpr_to_for_loop has cognitive complexity 37 (threshold 15). Drivers by points: if/else 16 (23 pts), boolean chains 6, loops 3 (6 pts), ternaries 1 (2 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/mosaic/lowering.py"},"region":{"startLine":4610}}}],"partialFingerprints":{"codehealthFindingId/v1":"58eb6f0b8b97da6b500ef43e4e896661a1699eafd0d118f4e39f2740d79a5a4e"}},{"ruleId":"D2","level":"warning","message":{"text":"sc_lowering._store_lowering_rule (cognitive 37): sc_lowering._store_lowering_rule has cognitive complexity 37 (threshold 15). Drivers by points: if/else 23 (31 pts), boolean chains 4, loops 1, ternaries 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/mosaic/sc_lowering.py"},"region":{"startLine":258}}}],"partialFingerprints":{"codehealthFindingId/v1":"af3aae73fff9b239cf03dd3d2e5825f544dce7e9ff51983cb9eac671fabbd2e6"}},{"ruleId":"D2","level":"warning","message":{"text":"lowering._handle_transforms (cognitive 37): lowering._handle_transforms has cognitive complexity 37 (threshold 15). Drivers by points: if/else 17 (32 pts), match/switch 1 (2 pts), boolean chains 1, loops 1, ternaries 1 (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/mosaic_gpu/lowering.py"},"region":{"startLine":1664}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f28cb683d445709004d49011defe400f12400ef3714065180831a7046963c4f"}},{"ruleId":"D2","level":"warning","message":{"text":"lowering._swap_lowering_rule (cognitive 37): lowering._swap_lowering_rule has cognitive complexity 37 (threshold 15). Drivers by points: if/else 17 (27 pts), loops 3 (6 pts), match/switch 2 (3 pts), boolean chains 1 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/mosaic_gpu/lowering.py"},"region":{"startLine":2004}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6e6ddc8898d69050c25d0e9c2044646e67bd6eb56ee054505b02fdb566d4654"}},{"ruleId":"D2","level":"warning","message":{"text":"FragmentedArray.load_tiled (cognitive 37): FragmentedArray.load_tiled has cognitive complexity 37 (threshold 15). Drivers by points: if/else 15 (24 pts), loops 3 (6 pts), boolean chains 4, error handling 1 (2 pts), ternaries 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/mosaic/gpu/fragmented_array.py"},"region":{"startLine":4595}}}],"partialFingerprints":{"codehealthFindingId/v1":"9baa3939b568b276d1269456920da2250e85fa89e0a1449e57a596404a808b2b"}},{"ruleId":"D2","level":"warning","message":{"text":"wgmma.wgmma (cognitive 37): wgmma.wgmma has cognitive complexity 37 (threshold 15). Drivers by points: if/else 20 (26 pts), boolean chains 8, ternaries 2, loops 1 (nesting depth added 6). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/mosaic/gpu/wgmma.py"},"region":{"startLine":292}}}],"partialFingerprints":{"codehealthFindingId/v1":"5871353c16eb5b6dbeb5e6047715250098ab228b570def150aaf4ef297537495"}},{"ruleId":"D2","level":"warning","message":{"text":"BufferedRef.create (cognitive 36): BufferedRef.create has cognitive complexity 36 (threshold 15). Drivers by points: if/else 13 (23 pts), ternaries 4 (7 pts), boolean chains 6 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/mosaic/pipeline.py"},"region":{"startLine":648}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1ef8f36fd3534b654e157695b686e09090cf6875609dc858dcc215ced1e57dc"}},{"ruleId":"D2","level":"warning","message":{"text":"lowering._convert_element_type_lowering_rule_wg (cognitive 36): lowering._convert_element_type_lowering_rule_wg has cognitive complexity 36 (threshold 15). Drivers by points: if/else 19 (31 pts), boolean chains 4, ternaries 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/mosaic_gpu/lowering.py"},"region":{"startLine":2416}}}],"partialFingerprints":{"codehealthFindingId/v1":"711aa6e467197818d991684cf6f418aa10c7f2ae148154946b5892864ae8462c"}},{"ruleId":"D2","level":"warning","message":{"text":"utils.pattern_match_while_to_fori_loop (cognitive 36): utils.pattern_match_while_to_fori_loop has cognitive complexity 36 (threshold 15). Drivers by points: if/else 18 (33 pts), boolean chains 2, loops 1 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/utils.py"},"region":{"startLine":171}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0a68fde04262466083c1ac03d99642afca4762af6d0150adad5397c2755612a"}},{"ruleId":"D2","level":"warning","message":{"text":"signal.istft (cognitive 36): signal.istft has cognitive complexity 36 (threshold 15). Drivers by points: if/else 18 (25 pts), boolean chains 5, ternaries 3 (4 pts), error handling 1 (2 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/scipy/signal.py"},"region":{"startLine":1051}}}],"partialFingerprints":{"codehealthFindingId/v1":"1fff73fb1c99cac56a4c5f532c8c7b822e61d8a1cac7515e282a73f07036819c"}},{"ruleId":"D2","level":"warning","message":{"text":"LaunchContext._prepare_tma (cognitive 36): LaunchContext._prepare_tma has cognitive complexity 36 (threshold 15). Drivers by points: if/else 12 (25 pts), loops 3 (5 pts), boolean chains 4, ternaries 1 (2 pts) (nesting depth added 16). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/mosaic/gpu/launch_context.py"},"region":{"startLine":1302}}}],"partialFingerprints":{"codehealthFindingId/v1":"d899dc6397a9d14310b38431328738657fd9edabb2ffd4655ef2a0f6d702bd40"}},{"ruleId":"D2","level":"warning","message":{"text":"pxla._get_and_check_device_assignment (cognitive 35): pxla._get_and_check_device_assignment has cognitive complexity 35 (threshold 15). Drivers by points: if/else 12 (25 pts), boolean chains 7, ternaries 2, loops 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/interpreters/pxla.py"},"region":{"startLine":521}}}],"partialFingerprints":{"codehealthFindingId/v1":"b888bcf80080b4b59f3d7169d9f6bf3087748c02aeff5039f5a707813aaadb74"}},{"ruleId":"D2","level":"warning","message":{"text":"NDIndexer.to_dynamic_slice (cognitive 35): NDIndexer.to_dynamic_slice has cognitive complexity 35 (threshold 15). Drivers by points: if/else 15 (30 pts), boolean chains 3, loops 2 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/numpy/indexing.py"},"region":{"startLine":489}}}],"partialFingerprints":{"codehealthFindingId/v1":"7de9c71c07a2fc7d12a02b4d193c2db451cac58a7eff53f025992bf03a10f932"}},{"ruleId":"D2","level":"warning","message":{"text":"mlir.lower_per_platform (cognitive 34): mlir.lower_per_platform has cognitive complexity 34 (threshold 15). Drivers by points: if/else 13 (22 pts), loops 6 (9 pts), error handling 1 (2 pts), boolean chains 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/interpreters/mlir.py"},"region":{"startLine":2689}}}],"partialFingerprints":{"codehealthFindingId/v1":"813839bb46294d55530f0dfb3a1d052818de2cd80d622cdc255512f90aaf688c"}},{"ruleId":"D2","level":"warning","message":{"text":"mesh_utils._create_device_mesh_for_nd_torus (cognitive 34): mesh_utils._create_device_mesh_for_nd_torus has cognitive complexity 34 (threshold 15). Drivers by points: if/else 7 (19 pts), loops 5 (9 pts), ternaries 1 (5 pts), boolean chains 1 (nesting depth added 20). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/mesh_utils.py"},"region":{"startLine":252}}}],"partialFingerprints":{"codehealthFindingId/v1":"2044a19a4787aaa7a5ef1f19d6e80ddc599de3e83822fe240d89f57bf2799cf9"}},{"ruleId":"D2","level":"warning","message":{"text":"linalg.norm (cognitive 34): linalg.norm has cognitive complexity 34 (threshold 15). Drivers by points: if/else 12 (26 pts), boolean chains 5, ternaries 1 (2 pts), match/switch 1 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/numpy/linalg.py"},"region":{"startLine":1203}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1ace0c63d8e6cd0fe9f513cedcbddb3fd37ea7b9ae944f2e93de03b0b27e051"}},{"ruleId":"D2","level":"warning","message":{"text":"lowering._dot_general_lowering (cognitive 34): lowering._dot_general_lowering has cognitive complexity 34 (threshold 15). Drivers by points: if/else 19 (28 pts), boolean chains 3, match/switch 1 (2 pts), loops 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/triton/lowering.py"},"region":{"startLine":2454}}}],"partialFingerprints":{"codehealthFindingId/v1":"d42cfc3d3d4624243ecd50bf0040814d5bf782230155d7ebc24fbd376e92c249"}},{"ruleId":"D2","level":"warning","message":{"text":"utils.pattern_match_scan_to_fori_loop (cognitive 34): utils.pattern_match_scan_to_fori_loop has cognitive complexity 34 (threshold 15). Drivers by points: if/else 10 (31 pts), loops 1 (2 pts), boolean chains 1 (nesting depth added 22). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/utils.py"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"875d9c1dc601de6fedca09aeb70f0560bc44f97a593a38e4a49916ac39bcd333"}},{"ruleId":"D2","level":"warning","message":{"text":"shard_map._unshard_shaped_array (cognitive 34): shard_map._unshard_shaped_array has cognitive complexity 34 (threshold 15). Drivers by points: if/else 11 (13 pts), ternaries 4 (10 pts), boolean chains 9, loops 1 (2 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/shard_map.py"},"region":{"startLine":980}}}],"partialFingerprints":{"codehealthFindingId/v1":"660e8557717006e86df09f93ba3587eecbc6ee8ccbf44f85144654f8fcf539e2"}},{"ruleId":"D2","level":"warning","message":{"text":"discharge.transform_swap_array (cognitive 34): discharge.transform_swap_array has cognitive complexity 34 (threshold 15). Drivers by points: if/else 12 (30 pts), loops 2, match/switch 1 (2 pts) (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/state/discharge.py"},"region":{"startLine":553}}}],"partialFingerprints":{"codehealthFindingId/v1":"0cc25f34452280b2a851bb5ff44a023275f3356f27c90777cd8c7aaf464c46c7"}},{"ruleId":"D2","level":"warning","message":{"text":"mma_utils.create_descriptor (cognitive 34): mma_utils.create_descriptor has cognitive complexity 34 (threshold 15). Drivers by points: if/else 16 (25 pts), boolean chains 9 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/mosaic/gpu/mma_utils.py"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc29a3152abf92e8f01f5bff5111509dca2522b8df38b33dddb77a534d7cf8e9"}},{"ruleId":"D2","level":"warning","message":{"text":"convolution._conv_general_dilated_batch_rule (cognitive 33): convolution._conv_general_dilated_batch_rule has cognitive complexity 33 (threshold 15). Drivers by points: if/else 13 (21 pts), boolean chains 7, ternaries 2 (5 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/lax/convolution.py"},"region":{"startLine":601}}}],"partialFingerprints":{"codehealthFindingId/v1":"48b0ab7565021436f460b50ef37fc62c87db4fe7fa5fe90fca428778683fae8c"}},{"ruleId":"D2","level":"warning","message":{"text":"BlockSpec.to_block_mapping (cognitive 33): BlockSpec.to_block_mapping has cognitive complexity 33 (threshold 15). Drivers by points: if/else 17 (25 pts), boolean chains 4, loops 2, match/switch 1 (2 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/core.py"},"region":{"startLine":688}}}],"partialFingerprints":{"codehealthFindingId/v1":"d578da1121012875e0900887c1d5ad2500fedf77ac0cb9d79f445f5a7359b0c8"}},{"ruleId":"D2","level":"warning","message":{"text":"lowering._masked_swap_lowering_rule (cognitive 33): lowering._masked_swap_lowering_rule has cognitive complexity 33 (threshold 15). Drivers by points: if/else 20 (29 pts), boolean chains 2, loops 1, ternaries 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/mosaic/lowering.py"},"region":{"startLine":2658}}}],"partialFingerprints":{"codehealthFindingId/v1":"4df977e1ba176d58aaf6c34a4c488e618cb6b9e3a92980ce494e01abb1e9a54b"}},{"ruleId":"D2","level":"warning","message":{"text":"lowering._extract_aliased_ref (cognitive 33): lowering._extract_aliased_ref has cognitive complexity 33 (threshold 15). Drivers by points: if/else 12 (30 pts), boolean chains 2, match/switch 1 (nesting depth added 18). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/mosaic_gpu/lowering.py"},"region":{"startLine":1323}}}],"partialFingerprints":{"codehealthFindingId/v1":"abc4dff3fe752a5fd77fd8649f0164d84d10bd90f0538bf7e3a3110e3b7b4534"}},{"ruleId":"D2","level":"warning","message":{"text":"primitives._tcgen05_mma_lowering (cognitive 33): primitives._tcgen05_mma_lowering has cognitive complexity 33 (threshold 15). Drivers by points: if/else 25 (30 pts), match/switch 2, boolean chains 1 (nesting depth added 5). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/mosaic_gpu/primitives.py"},"region":{"startLine":2814}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e0fa8156e86047138c65807536c27b28918b3e06ff68bd61107ca4434a58f50"}},{"ruleId":"D2","level":"warning","message":{"text":"fragmented_array.concatenate (cognitive 33): fragmented_array.concatenate has cognitive complexity 33 (threshold 15). Drivers by points: if/else 12 (24 pts), loops 4 (7 pts), boolean chains 1, match/switch 1 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/mosaic/gpu/fragmented_array.py"},"region":{"startLine":6048}}}],"partialFingerprints":{"codehealthFindingId/v1":"0882760b6c7bbecd576bf8938ac6f7865b3b3315464682146478cca69da1bc5b"}},{"ruleId":"D2","level":"warning","message":{"text":"splash_attention_kernel._splash_attention_bwd_dkv (cognitive 33): splash_attention_kernel._splash_attention_bwd_dkv has cognitive complexity 33 (threshold 15). Drivers by points: if/else 24 (25 pts), ternaries 7, boolean chains 1 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/pallas/ops/tpu/splash_attention/splash_attention_kernel.py"},"region":{"startLine":1871}}}],"partialFingerprints":{"codehealthFindingId/v1":"91c23879a8a19cc4b06016373dd9fc08ab81e5cfaa0353869eddb6db993f1f30"}},{"ruleId":"D2","level":"warning","message":{"text":"pallas_call._pallas_call_batching_rule (cognitive 32): pallas_call._pallas_call_batching_rule has cognitive complexity 32 (threshold 15). Drivers by points: if/else 17 (22 pts), ternaries 4 (6 pts), boolean chains 3, loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/pallas_call.py"},"region":{"startLine":520}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff3c223ac0474b654d9bc7d4680aa3bc83d1aa7aa0ddecbaf716cf770dca4078"}},{"ruleId":"D2","level":"warning","message":{"text":"lowering._ir_cast (cognitive 32): lowering._ir_cast has cognitive complexity 32 (threshold 15). Drivers by points: if/else 15 (22 pts), boolean chains 9, loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/triton/lowering.py"},"region":{"startLine":1684}}}],"partialFingerprints":{"codehealthFindingId/v1":"6fcc4c812e832eef8e07d80664985e870aa352763d3a454c238943c3c8165f91"}},{"ruleId":"D2","level":"warning","message":{"text":"lowering._maybe_pattern_match_fori_loop (cognitive 32): lowering._maybe_pattern_match_fori_loop has cognitive complexity 32 (threshold 15). Drivers by points: if/else 14 (29 pts), boolean chains 2, loops 1 (nesting depth added 15). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/triton/lowering.py"},"region":{"startLine":2840}}}],"partialFingerprints":{"codehealthFindingId/v1":"89aacd9f56aa344328547c94cf0d5e3bee29125f0c4e71c942c2ab0f09c4fe30"}},{"ruleId":"D2","level":"warning","message":{"text":"pjit._resolve_in_layouts (cognitive 32): pjit._resolve_in_layouts has cognitive complexity 32 (threshold 15). Drivers by points: if/else 11 (23 pts), ternaries 2 (6 pts), boolean chains 2, loops 1 (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pjit.py"},"region":{"startLine":958}}}],"partialFingerprints":{"codehealthFindingId/v1":"0017d20cf8d9f968811b58f39961e6ad74a41c51561f51729cea3c293320705e"}},{"ruleId":"D2","level":"warning","message":{"text":"bessel._yn_series (cognitive 32): bessel._yn_series has cognitive complexity 32 (threshold 15). Drivers by points: if/else 10 (15 pts), ternaries 10 (15 pts), boolean chains 2 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/scipy/bessel.py"},"region":{"startLine":930}}}],"partialFingerprints":{"codehealthFindingId/v1":"bbc5fd7f9119dba6145177a681ec5d470635c18ab269f24cbc65dd2edebd9145"}},{"ruleId":"D2","level":"warning","message":{"text":"dialect_lowering._memref_subview_op_lowering_rule (cognitive 32): dialect_lowering._memref_subview_op_lowering_rule has cognitive complexity 32 (threshold 15). Drivers by points: if/else 13 (27 pts), loops 2 (4 pts), match/switch 1 (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/mosaic/gpu/dialect_lowering.py"},"region":{"startLine":1936}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a29a8acd477f5ce42f01a7f3454cb0e28bb117905caffe6a56ef7e9354ee376"}},{"ruleId":"D2","level":"warning","message":{"text":"_DecisionByElimination._bounds_for_sorted_terms (cognitive 31): _DecisionByElimination._bounds_for_sorted_terms has cognitive complexity 31 (threshold 15). Drivers by points: if/else 14 (26 pts), ternaries 1 (3 pts), boolean chains 1, loops 1 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/export/shape_poly_decision.py"},"region":{"startLine":284}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e8c0b61897a52098cffd57ed5dbb4a313b0c25984c36e5fca0b71f418282d88"}},{"ruleId":"D2","level":"warning","message":{"text":"primitives._device_id_dict_to_mesh (cognitive 31): primitives._device_id_dict_to_mesh has cognitive complexity 31 (threshold 15). Drivers by points: if/else 13 (24 pts), loops 3 (5 pts), boolean chains 2 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/primitives.py"},"region":{"startLine":1205}}}],"partialFingerprints":{"codehealthFindingId/v1":"272e1774bb595435834e8d83b7a601fe9283285a3c9ad5dc84f9e29223107cb2"}},{"ruleId":"D2","level":"warning","message":{"text":"constraints.reduce_collapse_shape_expression (cognitive 31): constraints.reduce_collapse_shape_expression has cognitive complexity 31 (threshold 15). Drivers by points: if/else 8 (23 pts), loops 3 (7 pts), match/switch 1 (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/mosaic/gpu/constraints.py"},"region":{"startLine":328}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ba1e933a0823ee0cec9c8edbe2472239f7e1f598bb6c70f8b51624c3084e1e5"}},{"ruleId":"D2","level":"warning","message":{"text":"FragmentedArray.store_tiled (cognitive 31): FragmentedArray.store_tiled has cognitive complexity 31 (threshold 15). Drivers by points: if/else 10 (16 pts), loops 4 (8 pts), boolean chains 3, error handling 1 (2 pts), ternaries 1 (2 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/mosaic/gpu/fragmented_array.py"},"region":{"startLine":4513}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a5763305a94bdde8cf4e97fed00e3e209b2513258775105ea76bdde046bff16"}},{"ruleId":"D2","level":"warning","message":{"text":"FragmentedArray.transfer_strided (cognitive 31): FragmentedArray.transfer_strided has cognitive complexity 31 (threshold 15). Drivers by points: if/else 6 (23 pts), loops 3 (7 pts), error handling 1 (nesting depth added 21). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/mosaic/gpu/fragmented_array.py"},"region":{"startLine":4696}}}],"partialFingerprints":{"codehealthFindingId/v1":"c122689a3a63a7e1e33ddbf2274514e8838fe3e09f8e0bc4f759a06964efc3d9"}},{"ruleId":"D2","level":"warning","message":{"text":"fused_attention_stablehlo.check_is_flash_attention (cognitive 30): fused_attention_stablehlo.check_is_flash_attention has cognitive complexity 30 (threshold 15). Drivers by points: if/else 11 (17 pts), boolean chains 11, ternaries 1 (2 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/cudnn/fused_attention_stablehlo.py"},"region":{"startLine":352}}}],"partialFingerprints":{"codehealthFindingId/v1":"7eb11e563ce92b839acb2607ac888dc493b02e8e4129f86b5220c6f489375c1a"}},{"ruleId":"D2","level":"warning","message":{"text":"dlpack.from_dlpack (cognitive 30): dlpack.from_dlpack has cognitive complexity 30 (threshold 15). Drivers by points: if/else 12 (17 pts), boolean chains 5, error handling 4 (5 pts), ternaries 3 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/dlpack.py"},"region":{"startLine":234}}}],"partialFingerprints":{"codehealthFindingId/v1":"aabd8425b1abaaba420a3e9df1a08bfaef3107780eca66e4afd342c1fbcbbf11"}},{"ruleId":"D2","level":"warning","message":{"text":"_DimFactor.evaluate (cognitive 30): _DimFactor.evaluate has cognitive complexity 30 (threshold 15). Drivers by points: if/else 10 (23 pts), boolean chains 5, error handling 1 (2 pts) (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/export/shape_poly.py"},"region":{"startLine":228}}}],"partialFingerprints":{"codehealthFindingId/v1":"d663361dcd1d3084f237e0e375167a552d0733d1189f59332420142a9ec44b1a"}},{"ruleId":"D2","level":"warning","message":{"text":"conditionals.cond (cognitive 30): conditionals.cond has cognitive complexity 30 (threshold 15). Drivers by points: if/else 17 (21 pts), boolean chains 4, ternaries 3 (4 pts), error handling 1 (nesting depth added 5). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/lax/control_flow/conditionals.py"},"region":{"startLine":195}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5acdeac226cf2e613da82b271484f6d0bb10faf2219585f3704b74c8f679802"}},{"ruleId":"D2","level":"warning","message":{"text":"conditionals._check_branch_outputs (cognitive 30): conditionals._check_branch_outputs has cognitive complexity 30 (threshold 15). Drivers by points: if/else 12 (22 pts), loops 2 (5 pts), boolean chains 2, error handling 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/lax/control_flow/conditionals.py"},"region":{"startLine":337}}}],"partialFingerprints":{"codehealthFindingId/v1":"198a9bac2fdf7cb5050bd8e898431fd0f210f0b1a7b7bee90c14286abeb40246"}},{"ruleId":"D2","level":"warning","message":{"text":"loops._check_carry_type (cognitive 30): loops._check_carry_type has cognitive complexity 30 (threshold 15). Drivers by points: if/else 16 (25 pts), error handling 2 (3 pts), boolean chains 2 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/lax/control_flow/loops.py"},"region":{"startLine":531}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5098ad0e18b87246c491676817ba156edda87fb857685f1add854239af939ba"}},{"ruleId":"D2","level":"warning","message":{"text":"lax._get_monoid_reducer (cognitive 30): lax._get_monoid_reducer has cognitive complexity 30 (threshold 15). Drivers by points: ternaries 7 (21 pts), boolean chains 5, if/else 3 (4 pts) (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/lax/lax.py"},"region":{"startLine":3502}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f9c58707194983b57dcd58ac33929e02d571973b09c289078b420b847bf86e3"}},{"ruleId":"D2","level":"warning","message":{"text":"slicing._scatter_unreduced_rule (cognitive 30): slicing._scatter_unreduced_rule has cognitive complexity 30 (threshold 15). Drivers by points: if/else 13 (25 pts), boolean chains 4, ternaries 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/lax/slicing.py"},"region":{"startLine":3060}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca8f681ddacbceb32db220e4fbe19fb132f7b2991732d3e7713e217c56018ffd"}},{"ruleId":"D2","level":"warning","message":{"text":"functions.dot_product_attention (cognitive 30): functions.dot_product_attention has cognitive complexity 30 (threshold 15). Drivers by points: if/else 13 (23 pts), boolean chains 3, ternaries 3, match/switch 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/nn/functions.py"},"region":{"startLine":1053}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe5d417df84aeb158e485f91a990de2a5758c90560dd9c39c4f4ca0a99522ecb"}},{"ruleId":"D2","level":"warning","message":{"text":"polynomial.polyfit (cognitive 30): polynomial.polyfit has cognitive complexity 30 (threshold 15). Drivers by points: if/else 22 (29 pts), boolean chains 1 (nesting depth added 7). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/numpy/polynomial.py"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c9f7d1e27256722778af67fbe52e0639acd3df5b76472dbee426a09e9da4fe1"}},{"ruleId":"D2","level":"warning","message":{"text":"_core.jaxpr_type_signature (cognitive 30): _core.jaxpr_type_signature has cognitive complexity 30 (threshold 15). Drivers by points: if/else 8 (17 pts), loops 5 (9 pts), boolean chains 4 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/key_reuse/_core.py"},"region":{"startLine":329}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca17e0465f96fa7d65cd7accdf3b2b170bd80285f866b97278ca200821f2bd12"}},{"ruleId":"D2","level":"warning","message":{"text":"attention_mgpu.main (cognitive 30): attention_mgpu.main has cognitive complexity 30 (threshold 15). Drivers by points: if/else 9 (21 pts), boolean chains 3, error handling 1 (3 pts), loops 2 (3 pts) (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/pallas/ops/gpu/attention_mgpu.py"},"region":{"startLine":849}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0940676c588c1ca3bfe5b057735f2b69ecda89b2ed869e65ccf8b7753d04b7c"}},{"ruleId":"D2","level":"warning","message":{"text":"custom_vjp.__call__ (cognitive 29): custom_vjp.__call__ has cognitive complexity 29 (threshold 15). Drivers by points: if/else 13 (16 pts), ternaries 2 (6 pts), boolean chains 4, loops 1 (2 pts), error handling 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/custom_derivatives.py"},"region":{"startLine":806}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1e20e82b2952a146b28a9ee0d1eec7e40d015239e7c517f6b3703b6c738f43e"}},{"ruleId":"D2","level":"warning","message":{"text":"_Parser.shape (cognitive 29): _Parser.shape has cognitive complexity 29 (threshold 15). Drivers by points: if/else 11 (22 pts), loops 2 (4 pts), boolean chains 3 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/export/shape_poly.py"},"region":{"startLine":1640}}}],"partialFingerprints":{"codehealthFindingId/v1":"f43a607de6060e56ec63241f7984c93d64b0d9cace30dca6bc77d71aa2fae48a"}},{"ruleId":"D2","level":"warning","message":{"text":"utils._device_id_dict_to_mesh (cognitive 29): utils._device_id_dict_to_mesh has cognitive complexity 29 (threshold 15). Drivers by points: if/else 11 (22 pts), loops 3 (5 pts), boolean chains 2 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/mosaic/interpret/utils.py"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b3caa4fc3fd69207d0c5ca4ed0c57f96894a9c7743bd9351136af0420e25c00"}},{"ruleId":"D2","level":"warning","message":{"text":"mpmd._mpmd_map_batching_rule (cognitive 29): mpmd._mpmd_map_batching_rule has cognitive complexity 29 (threshold 15). Drivers by points: if/else 9 (17 pts), loops 5 (8 pts), ternaries 2 (3 pts), boolean chains 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/mpmd.py"},"region":{"startLine":519}}}],"partialFingerprints":{"codehealthFindingId/v1":"e27efdd2d9cfada888c796070db87470b4cfc3a98747a510b0265ef6aa856153"}},{"ruleId":"D2","level":"warning","message":{"text":"pmap.global_array_to_host_local_array (cognitive 29): pmap.global_array_to_host_local_array has cognitive complexity 29 (threshold 15). Drivers by points: if/else 11 (23 pts), error handling 1 (3 pts), boolean chains 2, loops 1 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pmap.py"},"region":{"startLine":867}}}],"partialFingerprints":{"codehealthFindingId/v1":"9300598a43fefbe441c25996666f96788b97dd5521a73c2cbe18c179fbe6818c"}},{"ruleId":"D2","level":"warning","message":{"text":"core._sample_sharding (cognitive 29): core._sample_sharding has cognitive complexity 29 (threshold 15). Drivers by points: if/else 10 (17 pts), ternaries 2 (5 pts), boolean chains 3, loops 2 (3 pts), error handling 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/random/core.py"},"region":{"startLine":517}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0848a81bf760b45448dc9c3c04362d39c212f1e9363d2a68c73dfa4322ee044"}},{"ruleId":"D2","level":"warning","message":{"text":"tcgen05._load_32xcols_native (cognitive 29): tcgen05._load_32xcols_native has cognitive complexity 29 (threshold 15). Drivers by points: if/else 11 (16 pts), match/switch 2 (8 pts), loops 2 (3 pts), boolean chains 2 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/mosaic/gpu/tcgen05.py"},"region":{"startLine":1844}}}],"partialFingerprints":{"codehealthFindingId/v1":"23e7d516a329198742fe2a9b557dde769a06ca1c424332358e875f819219df59"}},{"ruleId":"D2","level":"warning","message":{"text":"api.device_put (cognitive 28): api.device_put has cognitive complexity 28 (threshold 15). Drivers by points: if/else 15 (19 pts), boolean chains 7, loops 2 (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/api.py"},"region":{"startLine":2388}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f76d30c1c7968c357467c44f121a7fd96688525fb7b965cdddba35fcec8c966"}},{"ruleId":"D2","level":"warning","message":{"text":"_DecisionByElimination.add_implicit_constraints_term (cognitive 28): _DecisionByElimination.add_implicit_constraints_term has cognitive complexity 28 (threshold 15). Drivers by points: if/else 13 (22 pts), loops 2 (3 pts), ternaries 1 (2 pts), boolean chains 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/export/shape_poly_decision.py"},"region":{"startLine":362}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f36a14eb008a9ec16c3ae8ff8be03eef752c86ff822c0b78ca660627513fc9f"}},{"ruleId":"D2","level":"warning","message":{"text":"loops.fori_loop (cognitive 28): loops.fori_loop has cognitive complexity 28 (threshold 15). Drivers by points: if/else 14 (20 pts), boolean chains 6, error handling 1 (2 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/lax/control_flow/loops.py"},"region":{"startLine":2699}}}],"partialFingerprints":{"codehealthFindingId/v1":"39da11c650a545c142d7741bbaf7d6323a6da03046aa62e77b058f676c09cb1d"}},{"ruleId":"D2","level":"warning","message":{"text":"lax_numpy._repeat (cognitive 28): lax_numpy._repeat has cognitive complexity 28 (threshold 15). Drivers by points: if/else 13 (20 pts), ternaries 3 (7 pts), boolean chains 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/numpy/lax_numpy.py"},"region":{"startLine":6484}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5360c41ec9036c1b58be2c433819eae97a5f02c52be0990c9127f611324e230"}},{"ruleId":"D2","level":"warning","message":{"text":"setops._unique (cognitive 28): setops._unique has cognitive complexity 28 (threshold 15). Drivers by points: if/else 18 (24 pts), boolean chains 2, ternaries 2 (nesting depth added 6). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/numpy/setops.py"},"region":{"startLine":616}}}],"partialFingerprints":{"codehealthFindingId/v1":"de14e133ece342991419a0ce620f929a4d58f7703a1230e34c9b55e61b1e6e6a"}},{"ruleId":"D2","level":"warning","message":{"text":"einshape._get_einshape_dims (cognitive 28): einshape._get_einshape_dims has cognitive complexity 28 (threshold 15). Drivers by points: if/else 9 (23 pts), loops 2 (4 pts), boolean chains 1 (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/einshape.py"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef7a66ffd3a89de7287f07cfb8bcb34b6b77da4218227626e2767840926c4288"}},{"ruleId":"D2","level":"warning","message":{"text":"hlo_interpreter.pallas_call_hlo_interpret (cognitive 28): hlo_interpreter.pallas_call_hlo_interpret has cognitive complexity 28 (threshold 15). Drivers by points: if/else 9 (16 pts), ternaries 5 (7 pts), boolean chains 3, loops 2 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/hlo_interpreter.py"},"region":{"startLine":316}}}],"partialFingerprints":{"codehealthFindingId/v1":"43bff221d80360a0543f5d702eb9aa9f87ae9e05a68bf6c0dce79311babacaba"}},{"ruleId":"D2","level":"warning","message":{"text":"lowering._broadcast_in_dim_lowering_rule (cognitive 28): lowering._broadcast_in_dim_lowering_rule has cognitive complexity 28 (threshold 15). Drivers by points: if/else 13 (23 pts), boolean chains 3, loops 1 (2 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/mosaic_gpu/lowering.py"},"region":{"startLine":2306}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce777b50b415468a8f280f20c2eea4e8b4e254a8b74397849a19928df2889a59"}},{"ruleId":"D2","level":"warning","message":{"text":"primitives._inline_mgpu_flat_transformed_args (cognitive 28): primitives._inline_mgpu_flat_transformed_args has cognitive complexity 28 (threshold 15). Drivers by points: if/else 10 (20 pts), ternaries 2 (4 pts), boolean chains 2, loops 2 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/mosaic_gpu/primitives.py"},"region":{"startLine":3718}}}],"partialFingerprints":{"codehealthFindingId/v1":"da53d77c7f54dc46363b1b69afd175b90ca567784767c907a0485590beec085b"}},{"ruleId":"D2","level":"warning","message":{"text":"pmap.host_local_array_to_global_array (cognitive 28): pmap.host_local_array_to_global_array has cognitive complexity 28 (threshold 15). Drivers by points: if/else 11 (23 pts), boolean chains 4, loops 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pmap.py"},"region":{"startLine":777}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f050660d45b9b86be1efe6bb4cebfbc805dbff4fc1d9ab030be2ee585f78ec8"}},{"ruleId":"D2","level":"warning","message":{"text":"tpu_custom_call._lowered_to_custom_call_config (cognitive 28): tpu_custom_call._lowered_to_custom_call_config has cognitive complexity 28 (threshold 15). Drivers by points: if/else 12 (17 pts), boolean chains 10, ternaries 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/tpu_custom_call.py"},"region":{"startLine":739}}}],"partialFingerprints":{"codehealthFindingId/v1":"085123a5d7f1f0c6447901d004a741e55618f75e31624b59920db930b54d3ffc"}},{"ruleId":"D2","level":"warning","message":{"text":"layout_inference.derive_relayout_constraints (cognitive 28): layout_inference.derive_relayout_constraints has cognitive complexity 28 (threshold 15). Drivers by points: if/else 5 (18 pts), loops 5 (10 pts) (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/mosaic/gpu/layout_inference.py"},"region":{"startLine":2548}}}],"partialFingerprints":{"codehealthFindingId/v1":"3965a948a49fcbd50057e2cd296010eaa8ef4268691f418ebcfb31be44fca9ba"}},{"ruleId":"D2","level":"warning","message":{"text":"custom_derivatives._flatten_bwd (cognitive 27): custom_derivatives._flatten_bwd has cognitive complexity 27 (threshold 15). Drivers by points: if/else 11 (18 pts), boolean chains 5, ternaries 1 (2 pts), error handling 1, loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/custom_derivatives.py"},"region":{"startLine":1074}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8906fe2a4f4d82cf06e30b5c13bb860ece39ad2fb0fe4a3dc9222dc58111410"}},{"ruleId":"D2","level":"warning","message":{"text":"_export._call_exported_lowering (cognitive 27): _export._call_exported_lowering has cognitive complexity 27 (threshold 15). Drivers by points: if/else 15 (19 pts), loops 3 (4 pts), ternaries 3, boolean chains 1 (nesting depth added 5). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/export/_export.py"},"region":{"startLine":1521}}}],"partialFingerprints":{"codehealthFindingId/v1":"0686afae569e2c8697a8249305993e510f78ef209b0508e244ca9cea4182e8ce"}},{"ruleId":"D2","level":"warning","message":{"text":"_DecisionByElimination.combine_constraint_with_existing (cognitive 27): _DecisionByElimination.combine_constraint_with_existing has cognitive complexity 27 (threshold 15). Drivers by points: if/else 5 (15 pts), boolean chains 5, ternaries 1 (4 pts), loops 2 (3 pts) (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/export/shape_poly_decision.py"},"region":{"startLine":228}}}],"partialFingerprints":{"codehealthFindingId/v1":"32bbf63c5890825f63fe9d4cbc7955b65dc6f7c1e3a8dfd5cbb352c5c9110606"}},{"ruleId":"D2","level":"warning","message":{"text":"ffi.ffi_batching_rule (cognitive 27): ffi.ffi_batching_rule has cognitive complexity 27 (threshold 15). Drivers by points: ternaries 7 (16 pts), if/else 6 (8 pts), boolean chains 3 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/ffi.py"},"region":{"startLine":679}}}],"partialFingerprints":{"codehealthFindingId/v1":"49c0ce50c23be9e3d63f8984977e212cce343c1676b91339c039822fe8634e59"}},{"ruleId":"D2","level":"warning","message":{"text":"pxla._maybe_get_and_check_out_shardings (cognitive 27): pxla._maybe_get_and_check_out_shardings has cognitive complexity 27 (threshold 15). Drivers by points: if/else 8 (17 pts), boolean chains 5, error handling 1 (4 pts), loops 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/interpreters/pxla.py"},"region":{"startLine":1575}}}],"partialFingerprints":{"codehealthFindingId/v1":"b263096f03f318cc83ba9caf3d09c57fa61a3cc8e9f1d650d0c89ebf2f9837fe"}},{"ruleId":"D2","level":"warning","message":{"text":"slicing._gather_shape_rule (cognitive 27): slicing._gather_shape_rule has cognitive complexity 27 (threshold 15). Drivers by points: if/else 12 (17 pts), boolean chains 5, loops 5 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/lax/slicing.py"},"region":{"startLine":1941}}}],"partialFingerprints":{"codehealthFindingId/v1":"dbde22d53122da0574fe5feb5deddcd899e0d97509fe22c69964932c8c1847ae"}},{"ruleId":"D2","level":"warning","message":{"text":"NDIndexer.to_static_slice (cognitive 27): NDIndexer.to_static_slice has cognitive complexity 27 (threshold 15). Drivers by points: if/else 14 (22 pts), boolean chains 2, loops 2, ternaries 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/numpy/indexing.py"},"region":{"startLine":388}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb8f566211e2cbad88053cb2f3f9de5c5a18eca9f77a646fea6aebf2d85316de"}},{"ruleId":"D2","level":"warning","message":{"text":"interpret_pallas_call.get (cognitive 27): interpret_pallas_call.get has cognitive complexity 27 (threshold 15). Drivers by points: if/else 14 (23 pts), boolean chains 1, error handling 1, loops 1, ternaries 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/mosaic/interpret/interpret_pallas_call.py"},"region":{"startLine":631}}}],"partialFingerprints":{"codehealthFindingId/v1":"c025cbdf9da4ac1dc09f49b512814c099abc02d480e90146095dfb3af13839e9"}},{"ruleId":"D2","level":"warning","message":{"text":"utils.is_range_out_of_bounds_for_shape (cognitive 27): utils.is_range_out_of_bounds_for_shape has cognitive complexity 27 (threshold 15). Drivers by points: if/else 8 (23 pts), boolean chains 3, loops 1 (nesting depth added 15). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/mosaic/interpret/utils.py"},"region":{"startLine":445}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3141604991e507d23232bf8ae7edb3bbeaf269a4f5f1362ea10beb4cf74729d"}},{"ruleId":"D2","level":"warning","message":{"text":"primitives._get_barrier_base_index (cognitive 27): primitives._get_barrier_base_index has cognitive complexity 27 (threshold 15). Drivers by points: if/else 8 (21 pts), loops 2 (4 pts), match/switch 1 (2 pts) (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/mosaic_gpu/primitives.py"},"region":{"startLine":1662}}}],"partialFingerprints":{"codehealthFindingId/v1":"516fb253f8254c823aef32c432be84473109a9ff09ce26666517b9277b51d346"}},{"ruleId":"D2","level":"warning","message":{"text":"primitives._populate_custom_primitive_op_block (cognitive 27): primitives._populate_custom_primitive_op_block has cognitive complexity 27 (threshold 15). Drivers by points: if/else 11 (24 pts), loops 2, boolean chains 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/mosaic_gpu/primitives.py"},"region":{"startLine":3917}}}],"partialFingerprints":{"codehealthFindingId/v1":"df06faac63d8635a724be72913770004f8f76545de31561fc9655886a8b7493b"}},{"ruleId":"D2","level":"warning","message":{"text":"pjit._run_python_pjit (cognitive 27): pjit._run_python_pjit has cognitive complexity 27 (threshold 15). Drivers by points: if/else 7 (13 pts), error handling 4 (7 pts), loops 2 (4 pts), ternaries 1 (2 pts), boolean chains 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pjit.py"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d12ed749522b72d34eb7ad3c43445f451e642c57d918032e23cb9dfca8861fb"}},{"ruleId":"D2","level":"warning","message":{"text":"pjit._resolve_in_shardings (cognitive 27): pjit._resolve_in_shardings has cognitive complexity 27 (threshold 15). Drivers by points: if/else 8 (20 pts), boolean chains 4, ternaries 1 (2 pts), loops 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pjit.py"},"region":{"startLine":1041}}}],"partialFingerprints":{"codehealthFindingId/v1":"a393acb144406c75ff08f9fba915c4cf01a6ddd0d5a0104657b8eabf89b2b5de"}},{"ruleId":"D2","level":"warning","message":{"text":"bessel._jn_impl (cognitive 27): bessel._jn_impl has cognitive complexity 27 (threshold 15). Drivers by points: if/else 10 (16 pts), ternaries 4 (10 pts), boolean chains 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/scipy/bessel.py"},"region":{"startLine":804}}}],"partialFingerprints":{"codehealthFindingId/v1":"139ed71581150fdd87be15d8ed780f91a57c102910ece98b2ff6136230367ac8"}},{"ruleId":"D2","level":"warning","message":{"text":"NDIndexer.from_indices_shape (cognitive 27): NDIndexer.from_indices_shape has cognitive complexity 27 (threshold 15). Drivers by points: if/else 13 (18 pts), error handling 2 (4 pts), ternaries 2 (3 pts), boolean chains 2 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/state/indexing.py"},"region":{"startLine":184}}}],"partialFingerprints":{"codehealthFindingId/v1":"cfa08fb7aefa1eec12d00d9d89a381e7e40f37147ab81cf5483a3cb708a4428a"}},{"ruleId":"D2","level":"warning","message":{"text":"tensorstore_impl.verify_tensorstore_spec (cognitive 27): tensorstore_impl.verify_tensorstore_spec has cognitive complexity 27 (threshold 15). Drivers by points: if/else 15 (27 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/array_serialization/tensorstore_impl.py"},"region":{"startLine":187}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e2a5050ad5b7cf39a5ce0ba1919589ddf9e88f3a6988ffc9633cbf2cf64c294"}},{"ruleId":"D2","level":"warning","message":{"text":"FragmentedArray.broadcast_in_dim (cognitive 27): FragmentedArray.broadcast_in_dim has cognitive complexity 27 (threshold 15). Drivers by points: if/else 14 (18 pts), loops 4 (6 pts), boolean chains 3 (nesting depth added 6). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/mosaic/gpu/fragmented_array.py"},"region":{"startLine":3958}}}],"partialFingerprints":{"codehealthFindingId/v1":"d89d083404489a0c627300b639a5d6d6e8324e47114ee9d9a5094bd310744f7e"}},{"ruleId":"D2","level":"warning","message":{"text":"SdyShardingRule.__init__ (cognitive 26): SdyShardingRule.__init__ has cognitive complexity 26 (threshold 15). Drivers by points: if/else 6 (15 pts), loops 5 (9 pts), boolean chains 2 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/custom_partitioning_sharding_rule.py"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1e29a7f017800bde50975dc988ac517cde457cd20b4d442f60c537e9148024b"}},{"ruleId":"D2","level":"warning","message":{"text":"State.initialize (cognitive 26): State.initialize has cognitive complexity 26 (threshold 15). Drivers by points: if/else 19 (22 pts), boolean chains 4 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/distributed.py"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"8449a1e9ed5f361087be2072c352d4314e5f55bcde172e6d65d2626e97dc05dd"}},{"ruleId":"D2","level":"warning","message":{"text":"lowering._run_scoped_resource_estimator (cognitive 26): lowering._run_scoped_resource_estimator has cognitive complexity 26 (threshold 15). Drivers by points: if/else 11 (23 pts), boolean chains 2, loops 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/mosaic_gpu/lowering.py"},"region":{"startLine":347}}}],"partialFingerprints":{"codehealthFindingId/v1":"a71a0922b2473bddb80aca0a662fda9d9ea0f81a9cc71eeebd9eb0cc3d0bf981"}},{"ruleId":"D2","level":"warning","message":{"text":"lowering._get_lowering_rule (cognitive 26): lowering._get_lowering_rule has cognitive complexity 26 (threshold 15). Drivers by points: if/else 10 (14 pts), loops 3 (6 pts), boolean chains 3, match/switch 2 (3 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/mosaic_gpu/lowering.py"},"region":{"startLine":1862}}}],"partialFingerprints":{"codehealthFindingId/v1":"377c4207b27960cfbde48f05948031775009c18e12cdcdec3fee75e19b22bc68"}},{"ruleId":"D2","level":"warning","message":{"text":"primitives._wgmma_lowering (cognitive 26): primitives._wgmma_lowering has cognitive complexity 26 (threshold 15). Drivers by points: if/else 17 (23 pts), match/switch 2 (3 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/mosaic_gpu/primitives.py"},"region":{"startLine":2220}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3565e5d65b11a7a3ecad4095dc58d5aef28b854129e3e2769f05c58cbad15ce"}},{"ruleId":"D2","level":"warning","message":{"text":"primitives._wgmma_warpgroup_lowering (cognitive 26): primitives._wgmma_warpgroup_lowering has cognitive complexity 26 (threshold 15). Drivers by points: if/else 14 (21 pts), boolean chains 4, loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/mosaic_gpu/primitives.py"},"region":{"startLine":2339}}}],"partialFingerprints":{"codehealthFindingId/v1":"4488015b2dd56042ac19f8a9827719d0dd1544c2bccac50bbdb5cf2696f28f00"}},{"ruleId":"D2","level":"warning","message":{"text":"lowering._load (cognitive 26): lowering._load has cognitive complexity 26 (threshold 15). Drivers by points: if/else 15 (18 pts), boolean chains 5, error handling 1 (2 pts), ternaries 1 (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/triton/lowering.py"},"region":{"startLine":2089}}}],"partialFingerprints":{"codehealthFindingId/v1":"949abc41ce25a9734fb672574226f4dbd26cd9d1b3925405d82aba4d91a68511"}},{"ruleId":"D2","level":"warning","message":{"text":"core.choice (cognitive 26): core.choice has cognitive complexity 26 (threshold 15). Drivers by points: if/else 13 (16 pts), ternaries 4 (9 pts), boolean chains 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/random/core.py"},"region":{"startLine":1108}}}],"partialFingerprints":{"codehealthFindingId/v1":"79384a227b8641d59adc1040c047654951552254f27e246879a3757e79cc6972"}},{"ruleId":"D2","level":"warning","message":{"text":"eigh.eigh (cognitive 26): eigh.eigh has cognitive complexity 26 (threshold 15). Drivers by points: if/else 12 (19 pts), boolean chains 4, ternaries 2 (3 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/tpu/linalg/eigh.py"},"region":{"startLine":511}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d651236b1e596e4040221682b912e343c58e40417827eb399b6b727c4259034"}},{"ruleId":"D2","level":"warning","message":{"text":"tree_util._register_dataclass (cognitive 26): tree_util._register_dataclass has cognitive complexity 26 (threshold 15). Drivers by points: if/else 11 (21 pts), boolean chains 3, loops 1, ternaries 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/tree_util.py"},"region":{"startLine":1151}}}],"partialFingerprints":{"codehealthFindingId/v1":"a367d2bafadae4b1a778f0b38e2e087e368c379a9ec07500f2f012fec065b1c9"}},{"ruleId":"D2","level":"warning","message":{"text":"FragmentedArray.store_untiled (cognitive 26): FragmentedArray.store_untiled has cognitive complexity 26 (threshold 15). Drivers by points: if/else 11 (23 pts), loops 1 (2 pts), match/switch 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/mosaic/gpu/fragmented_array.py"},"region":{"startLine":4135}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce90804413bd754b38fe7c69de173d88ea430b80af910f01127afc94db4de74e"}},{"ruleId":"D2","level":"warning","message":{"text":"fragmented_array.plan_gmem_transfer (cognitive 26): fragmented_array.plan_gmem_transfer has cognitive complexity 26 (threshold 15). Drivers by points: if/else 11 (14 pts), boolean chains 4, loops 3 (4 pts), ternaries 4 (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/mosaic/gpu/fragmented_array.py"},"region":{"startLine":5426}}}],"partialFingerprints":{"codehealthFindingId/v1":"4426df2d61021e78dcb9fb095e51f78c0e3147ff75c5026f1863d51c0a6b38ca"}},{"ruleId":"D2","level":"warning","message":{"text":"fragmented_array.optimization_barrier (cognitive 26): fragmented_array.optimization_barrier has cognitive complexity 26 (threshold 15). Drivers by points: if/else 9 (17 pts), loops 3 (4 pts), ternaries 2 (4 pts), boolean chains 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/mosaic/gpu/fragmented_array.py"},"region":{"startLine":5782}}}],"partialFingerprints":{"codehealthFindingId/v1":"92e70a78523bdbcd820625c418c1071beb49c557fc6f0c9d4ce9bd3ae05d330c"}},{"ruleId":"D2","level":"warning","message":{"text":"ad_checkpoint._saved_residuals (cognitive 25): ad_checkpoint._saved_residuals has cognitive complexity 25 (threshold 15). Drivers by points: if/else 10 (19 pts), loops 5 (6 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/ad_checkpoint.py"},"region":{"startLine":482}}}],"partialFingerprints":{"codehealthFindingId/v1":"3308b41c9175ab60d8ab2eb3c6aed0b8fb14f257f01e0002e8416cea8f72eef8"}},{"ruleId":"D2","level":"warning","message":{"text":"ad_checkpoint._insert_reduce_precision (cognitive 25): ad_checkpoint._insert_reduce_precision has cognitive complexity 25 (threshold 15). Drivers by points: if/else 7 (14 pts), ternaries 2 (6 pts), boolean chains 4, loops 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/ad_checkpoint.py"},"region":{"startLine":664}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c9a23fa9032073e487256170a2ef05da59ae40594f7016d2c4f611240bb1dcf"}},{"ruleId":"D2","level":"warning","message":{"text":"partial_eval.lower_jaxpr (cognitive 25): partial_eval.lower_jaxpr has cognitive complexity 25 (threshold 15). Drivers by points: ternaries 4 (11 pts), if/else 6 (9 pts), loops 3, boolean chains 2 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/interpreters/partial_eval.py"},"region":{"startLine":2373}}}],"partialFingerprints":{"codehealthFindingId/v1":"28af6df88e6bd2fb5dc7b2eedcd7f50a05cbdbc811487820b104f7166b7d0f32"}},{"ruleId":"D2","level":"warning","message":{"text":"slicing._scatter_shape_rule (cognitive 25): slicing._scatter_shape_rule has cognitive complexity 25 (threshold 15). Drivers by points: if/else 15 (19 pts), boolean chains 3, loops 3 (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/lax/slicing.py"},"region":{"startLine":2688}}}],"partialFingerprints":{"codehealthFindingId/v1":"601be2ffa636aacc974f70de4b1273dc2214bdcb67acfaa920014a5dfc070f2e"}},{"ruleId":"D2","level":"warning","message":{"text":"lax_numpy._interp (cognitive 25): lax_numpy._interp has cognitive complexity 25 (threshold 15). Drivers by points: if/else 15 (20 pts), ternaries 2 (4 pts), boolean chains 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/numpy/lax_numpy.py"},"region":{"startLine":2640}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e7364c2a340cf605ef93a3bf8e18fc4b0237742916780415f62f42e4992a813"}},{"ruleId":"D2","level":"warning","message":{"text":"lax_numpy._arange (cognitive 25): lax_numpy._arange has cognitive complexity 25 (threshold 15). Drivers by points: if/else 13 (18 pts), boolean chains 5, loops 1, ternaries 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/numpy/lax_numpy.py"},"region":{"startLine":6005}}}],"partialFingerprints":{"codehealthFindingId/v1":"99fac2ad0638b77f11a7fe5b33acc4e28311e3865561b062b6632e1d72d2357b"}},{"ruleId":"D2","level":"warning","message":{"text":"jaxpr_fusion._construct_output_fusions (cognitive 25): jaxpr_fusion._construct_output_fusions has cognitive complexity 25 (threshold 15). Drivers by points: if/else 8 (17 pts), loops 4 (5 pts), ternaries 1 (2 pts), boolean chains 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/fuser/jaxpr_fusion.py"},"region":{"startLine":212}}}],"partialFingerprints":{"codehealthFindingId/v1":"5100de4f0b3423e0a81719fd1aaaa07ad8be0b5e1fba52bb0387ca32e9844b95"}},{"ruleId":"D2","level":"warning","message":{"text":"lowering.lower_jaxpr_to_mosaic_gpu (cognitive 25): lowering.lower_jaxpr_to_mosaic_gpu has cognitive complexity 25 (threshold 15). Drivers by points: if/else 6 (13 pts), loops 4 (6 pts), error handling 2 (4 pts), boolean chains 2 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/mosaic_gpu/lowering.py"},"region":{"startLine":1049}}}],"partialFingerprints":{"codehealthFindingId/v1":"da2c98c6bd115e3eebc6d8a9c9fc1b205bda1992c03c1041485214ed6a718220"}},{"ruleId":"D2","level":"warning","message":{"text":"pjit._sharding_constraint_hlo_lowering (cognitive 25): pjit._sharding_constraint_hlo_lowering has cognitive complexity 25 (threshold 15). Drivers by points: if/else 9 (17 pts), ternaries 1 (4 pts), boolean chains 2, loops 1 (2 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pjit.py"},"region":{"startLine":2228}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a8c08e9c1801fb9cebab4c305f897b00b10edee68f4c0ba7f04f9f64b85ad8f"}},{"ruleId":"D2","level":"warning","message":{"text":"shard_map._check_specs (cognitive 25): shard_map._check_specs has cognitive complexity 25 (threshold 15). Drivers by points: if/else 5 (9 pts), loops 3 (9 pts), ternaries 2 (5 pts), boolean chains 2 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/shard_map.py"},"region":{"startLine":494}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8ae78a7bc6d04d2d2ce7fc11c01f8fde66cf07da6a7b6ec52b6989a0e424c13"}},{"ruleId":"D2","level":"warning","message":{"text":"shard_map._spec_divisibility_error (cognitive 25): shard_map._spec_divisibility_error has cognitive complexity 25 (threshold 15). Drivers by points: if/else 6 (13 pts), ternaries 2 (8 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/shard_map.py"},"region":{"startLine":620}}}],"partialFingerprints":{"codehealthFindingId/v1":"e595ce9e1ab404fb74ce36e2169d692a6dcbba5caebf7366bc2d6e8691334b9f"}},{"ruleId":"D2","level":"warning","message":{"text":"xla_bridge.backends (cognitive 25): xla_bridge.backends has cognitive complexity 25 (threshold 15). Drivers by points: if/else 11 (18 pts), loops 2 (3 pts), boolean chains 2, error handling 1 (2 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/xla_bridge.py"},"region":{"startLine":811}}}],"partialFingerprints":{"codehealthFindingId/v1":"74a4db1425ff37f480de767005b066d502c15beb206b3439d3f2436de781f9ad"}},{"ruleId":"D2","level":"warning","message":{"text":"layout_inference.assign_layouts (cognitive 25): layout_inference.assign_layouts has cognitive complexity 25 (threshold 15). Drivers by points: if/else 12 (24 pts), loops 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/mosaic/gpu/layout_inference.py"},"region":{"startLine":2396}}}],"partialFingerprints":{"codehealthFindingId/v1":"42e6763e108b1905fb8ee54f0f4a8ec97e2d53a1035945a67578a50f99476b28"}},{"ruleId":"D2","level":"warning","message":{"text":"array._array_shard_arg (cognitive 24): array._array_shard_arg has cognitive complexity 24 (threshold 15). Drivers by points: if/else 8 (16 pts), boolean chains 2, error handling 1 (2 pts), loops 2, ternaries 1 (2 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/array.py"},"region":{"startLine":1363}}}],"partialFingerprints":{"codehealthFindingId/v1":"47532da4d9fb5a87dbf883f09eb2a2fefbfdeb673f266dfb068e2e6305f60b41"}},{"ruleId":"D2","level":"warning","message":{"text":"core._why_alive_container_info (cognitive 24): core._why_alive_container_info has cognitive complexity 24 (threshold 15). Drivers by points: if/else 16 (24 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/core.py"},"region":{"startLine":1657}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5de1a866e5d1f91b3b07db75e92a5aa977d6bdf6471b29542c2ac342f4e9cd4"}},{"ruleId":"D2","level":"warning","message":{"text":"partial_eval._partial_eval_jaxpr_custom_cached (cognitive 24): partial_eval._partial_eval_jaxpr_custom_cached has cognitive complexity 24 (threshold 15). Drivers by points: if/else 7 (14 pts), boolean chains 5, loops 3 (5 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/interpreters/partial_eval.py"},"region":{"startLine":865}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9ea6e2d2c5971af55e77cd2ba722810cf772caf82f06311de7c1d8705a2a26b"}},{"ruleId":"D2","level":"warning","message":{"text":"jaxpr_util.jaxpr_to_html (cognitive 24): jaxpr_util.jaxpr_to_html has cognitive complexity 24 (threshold 15). Drivers by points: loops 6 (10 pts), if/else 4 (9 pts), ternaries 2 (4 pts), boolean chains 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/jaxpr_util.py"},"region":{"startLine":357}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2d109da4521b54dee356ab91bd97170da547875447a4efb94d29083a1849503"}},{"ruleId":"D2","level":"warning","message":{"text":"lax._dot_general_layout_rule (cognitive 24): lax._dot_general_layout_rule has cognitive complexity 24 (threshold 15). Drivers by points: if/else 14 (16 pts), boolean chains 6, ternaries 2 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/lax/lax.py"},"region":{"startLine":7166}}}],"partialFingerprints":{"codehealthFindingId/v1":"3596cc471e602dd7d215224f93b3ed644d7982cf14d5272e2f2f1389fd775cd1"}},{"ruleId":"D2","level":"warning","message":{"text":"linalg._svd_gpu_sub_lowering (cognitive 24): linalg._svd_gpu_sub_lowering has cognitive complexity 24 (threshold 15). Drivers by points: if/else 12 (15 pts), ternaries 2 (4 pts), boolean chains 3, error handling 1 (2 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/lax/linalg.py"},"region":{"startLine":2586}}}],"partialFingerprints":{"codehealthFindingId/v1":"be3ae75a4837bf0ba683b3efc291316821b06c33c32083ecfd4c2157adf6f242"}},{"ruleId":"D2","level":"warning","message":{"text":"slicing._scatter_spec_computation (cognitive 24): slicing._scatter_spec_computation has cognitive complexity 24 (threshold 15). Drivers by points: if/else 8 (12 pts), boolean chains 8, loops 2 (4 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/lax/slicing.py"},"region":{"startLine":2863}}}],"partialFingerprints":{"codehealthFindingId/v1":"20bc34d967e095080c96c11c4fcaa33a822711d39f93764b5dcc391c023c13ce"}},{"ruleId":"D2","level":"warning","message":{"text":"slicing._scatter_addsub_transpose_rule (cognitive 24): slicing._scatter_addsub_transpose_rule has cognitive complexity 24 (threshold 15). Drivers by points: if/else 9 (16 pts), ternaries 2 (4 pts), loops 1 (3 pts), boolean chains 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/lax/slicing.py"},"region":{"startLine":3180}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c96c7b8d7a5086e63d706f56f181d747c39f6ca85b9ff70a3699b4f8fc47e90"}},{"ruleId":"D2","level":"warning","message":{"text":"slicing._scatter_mul_transpose_rule (cognitive 24): slicing._scatter_mul_transpose_rule has cognitive complexity 24 (threshold 15). Drivers by points: if/else 9 (16 pts), ternaries 2 (4 pts), loops 1 (3 pts), boolean chains 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/lax/slicing.py"},"region":{"startLine":3222}}}],"partialFingerprints":{"codehealthFindingId/v1":"69fd66ac3323242e5d2b765e9c7a41e3d46e3739a00ff5c07186e54e42f30a96"}},{"ruleId":"D2","level":"warning","message":{"text":"lowering._load_lowering_rule (cognitive 24): lowering._load_lowering_rule has cognitive complexity 24 (threshold 15). Drivers by points: if/else 16 (21 pts), boolean chains 3 (nesting depth added 5). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/mosaic/lowering.py"},"region":{"startLine":2459}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6764d7b617b47d7c3b1a58d2fbd9a29c04605ab92f0271748f32dc317f14325"}},{"ruleId":"D2","level":"warning","message":{"text":"pipeline._spec_has_trivial_windowing (cognitive 24): pipeline._spec_has_trivial_windowing has cognitive complexity 24 (threshold 15). Drivers by points: if/else 11 (17 pts), loops 4 (5 pts), boolean chains 1, ternaries 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/mosaic/pipeline.py"},"region":{"startLine":229}}}],"partialFingerprints":{"codehealthFindingId/v1":"93c9c1f2119b2bb47eff59b914dd04afc1408319f910532bbe5b8f6549da132a"}},{"ruleId":"D2","level":"warning","message":{"text":"MemorySpace.__call__ (cognitive 24): MemorySpace.__call__ has cognitive complexity 24 (threshold 15). Drivers by points: if/else 11 (23 pts), boolean chains 1 (nesting depth added 12). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/mosaic_gpu/core.py"},"region":{"startLine":199}}}],"partialFingerprints":{"codehealthFindingId/v1":"258b670583e115b75eec858e865a81f4ad4a32764020ca044b5be3b85f61011b"}},{"ruleId":"D2","level":"warning","message":{"text":"lowering.lower_jaxpr_to_module (cognitive 24): lowering.lower_jaxpr_to_module has cognitive complexity 24 (threshold 15). Drivers by points: if/else 18 (22 pts), boolean chains 1, loops 1 (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/mosaic_gpu/lowering.py"},"region":{"startLine":737}}}],"partialFingerprints":{"codehealthFindingId/v1":"eaf001cdbc2ed5b46776a2229e16fdb2c1323a73a9627242f65351ac559ef4e5"}},{"ruleId":"D2","level":"warning","message":{"text":"pipeline.emit_pipeline_warp_specialized (cognitive 24): pipeline.emit_pipeline_warp_specialized has cognitive complexity 24 (threshold 15). Drivers by points: if/else 13 (17 pts), boolean chains 4, loops 3 (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/mosaic_gpu/pipeline.py"},"region":{"startLine":660}}}],"partialFingerprints":{"codehealthFindingId/v1":"32813c62c416ef4ed6503cd0cf92040cf85085803630abbdd1becd7131bbbd63"}},{"ruleId":"D2","level":"warning","message":{"text":"primitives._atomic_lowering_rule (cognitive 24): primitives._atomic_lowering_rule has cognitive complexity 24 (threshold 15). Drivers by points: if/else 12 (15 pts), ternaries 3 (8 pts), boolean chains 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/triton/primitives.py"},"region":{"startLine":445}}}],"partialFingerprints":{"codehealthFindingId/v1":"dfaf425abd4665c44c867fe362ee06899600cdcc65cca75960c68376e92fd6ae"}},{"ruleId":"D2","level":"warning","message":{"text":"program_order.eval_jaxpr_program_order (cognitive 24): program_order.eval_jaxpr_program_order has cognitive complexity 24 (threshold 15). Drivers by points: if/else 10 (22 pts), boolean chains 1, loops 1 (nesting depth added 12). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/program_order.py"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"4dddc93fbedf8d6778b21d4c1327a5da40a3627a7b915cfb3f7e171a6e9ca7f1"}},{"ruleId":"D2","level":"warning","message":{"text":"fragmented_array.plan_tiled_transfer (cognitive 24): fragmented_array.plan_tiled_transfer has cognitive complexity 24 (threshold 15). Drivers by points: if/else 7 (10 pts), loops 4 (7 pts), ternaries 5, boolean chains 2 (nesting depth added 6). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/mosaic/gpu/fragmented_array.py"},"region":{"startLine":5582}}}],"partialFingerprints":{"codehealthFindingId/v1":"502fe2534dd29dbcaed7db5688b93b3ef846c2721b3781dd4863e22c3993092b"}},{"ruleId":"D2","level":"warning","message":{"text":"layout_inference._extract_layout_candidates_from_tmem_registers_transfer (cognitive 24): layout_inference._extract_layout_candidates_from_tmem_registers_transfer has cognitive complexity 24 (threshold 15). Drivers by points: if/else 9 (16 pts), loops 3 (5 pts), boolean chains 2, match/switch 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/mosaic/gpu/layout_inference.py"},"region":{"startLine":297}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab2172058b12e075ebf573ca4309f2c471404578066354f1b2f6164faabb77ac"}},{"ruleId":"D2","level":"warning","message":{"text":"splash_attention_kernel._splash_attention_bwd_dq (cognitive 24): splash_attention_kernel._splash_attention_bwd_dq has cognitive complexity 24 (threshold 15). Drivers by points: if/else 17, ternaries 5, boolean chains 2. To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/pallas/ops/tpu/splash_attention/splash_attention_kernel.py"},"region":{"startLine":1417}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0e3d8d7db1967b14d72693c438fb57f4446711741a064e9380b802ceb567ce5"}},{"ruleId":"D2","level":"warning","message":{"text":"api_util.resolve_argnums (cognitive 23): api_util.resolve_argnums has cognitive complexity 23 (threshold 15). Drivers by points: ternaries 5 (14 pts), if/else 5 (9 pts) (nesting depth added 13). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/api_util.py"},"region":{"startLine":553}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb7e285d99061a9987a5ec11249b7b86f3a68115666004ce7841b427818c19ed"}},{"ruleId":"D2","level":"warning","message":{"text":"dispatch._device_put_impl (cognitive 23): dispatch._device_put_impl has cognitive complexity 23 (threshold 15). Drivers by points: if/else 8 (13 pts), boolean chains 4, ternaries 2 (4 pts), error handling 1 (2 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/dispatch.py"},"region":{"startLine":606}}}],"partialFingerprints":{"codehealthFindingId/v1":"7860e855484296057004fbe4f2bcee0ffb7d84ccaf9edfed0e75c931a4a0f897"}},{"ruleId":"D2","level":"warning","message":{"text":"_export._wrap_main_func (cognitive 23): _export._wrap_main_func has cognitive complexity 23 (threshold 15). Drivers by points: if/else 11 (15 pts), loops 4 (5 pts), error handling 2, ternaries 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/export/_export.py"},"region":{"startLine":905}}}],"partialFingerprints":{"codehealthFindingId/v1":"4dc7a743a95b6191bb3bdf44af928e705f7915e977af3e7bfbdfe43331371e7b"}},{"ruleId":"D2","level":"warning","message":{"text":"loops.scan (cognitive 23): loops.scan has cognitive complexity 23 (threshold 15). Drivers by points: if/else 14 (15 pts), ternaries 3 (5 pts), loops 1 (2 pts), boolean chains 1 (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/lax/control_flow/loops.py"},"region":{"startLine":242}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a416af4f2480243ce668c2678a83b0083f7871e2bb46725f5ac6ea3fb24f216"}},{"ruleId":"D2","level":"warning","message":{"text":"lax._dot_general_sharding_rule (cognitive 23): lax._dot_general_sharding_rule has cognitive complexity 23 (threshold 15). Drivers by points: if/else 8 (14 pts), loops 3 (5 pts), boolean chains 4 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/lax/lax.py"},"region":{"startLine":6825}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c2086da9f3f2b7344e8e2e79892133e8bb26b922c69ec3ba9e03de6e56117d7"}},{"ruleId":"D2","level":"warning","message":{"text":"lax._merge_an_axis_sharding_rule (cognitive 23): lax._merge_an_axis_sharding_rule has cognitive complexity 23 (threshold 15). Drivers by points: if/else 11 (20 pts), loops 2, boolean chains 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/lax/lax.py"},"region":{"startLine":9503}}}],"partialFingerprints":{"codehealthFindingId/v1":"e78c8d45aa8b34d91a11c3d470ff95ba28047ec93b6625565219806b3ccf1138"}},{"ruleId":"D2","level":"warning","message":{"text":"slicing._gather_collective_rule (cognitive 23): slicing._gather_collective_rule has cognitive complexity 23 (threshold 15). Drivers by points: if/else 10 (14 pts), boolean chains 5, loops 2, ternaries 2 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/lax/slicing.py"},"region":{"startLine":2590}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f068a76ed62db6bfc6003d1ea65cfae52ce136323d417f486a721017c60d62c"}},{"ruleId":"D2","level":"warning","message":{"text":"indexing.take_along_axis (cognitive 23): indexing.take_along_axis has cognitive complexity 23 (threshold 15). Drivers by points: if/else 14 (20 pts), boolean chains 1, loops 1, ternaries 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/numpy/indexing.py"},"region":{"startLine":832}}}],"partialFingerprints":{"codehealthFindingId/v1":"47b59c8cdfc0d640e8bb118c5056febc125dd476befd2408183a93e8a9002ec9"}},{"ruleId":"D2","level":"warning","message":{"text":"ufunc._reduce_via_scan (cognitive 23): ufunc._reduce_via_scan has cognitive complexity 23 (threshold 15). Drivers by points: if/else 17 (22 pts), boolean chains 1 (nesting depth added 5). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/numpy/ufunc_api.py"},"region":{"startLine":262}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8af4e58ae285ed2ce6872326631cfcb6f1acac3ce35425a8bae1c59527940fd"}},{"ruleId":"D2","level":"warning","message":{"text":"GenericSharedMemory.swap_buffer_content (cognitive 23): GenericSharedMemory.swap_buffer_content has cognitive complexity 23 (threshold 15). Drivers by points: if/else 10 (15 pts), loops 1 (3 pts), boolean chains 2, ternaries 1 (2 pts), error handling 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/mosaic/interpret/shared_memory.py"},"region":{"startLine":688}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b76644dc3e8f9a53e63f3f3c2474895e1cc952f2d6a9f32eb5625728117f543"}},{"ruleId":"D2","level":"warning","message":{"text":"lowering._transform_ref (cognitive 23): lowering._transform_ref has cognitive complexity 23 (threshold 15). Drivers by points: if/else 8 (15 pts), ternaries 1 (3 pts), boolean chains 2, match/switch 1 (2 pts), loops 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/mosaic/lowering.py"},"region":{"startLine":2317}}}],"partialFingerprints":{"codehealthFindingId/v1":"afdcc854972701117bd211d662082f79846bbb43c52acdfc11112583f7464142"}},{"ruleId":"D2","level":"warning","message":{"text":"pipeline._partition_grid (cognitive 23): pipeline._partition_grid has cognitive complexity 23 (threshold 15). Drivers by points: if/else 16 (18 pts), boolean chains 5 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/mosaic/pipeline.py"},"region":{"startLine":1707}}}],"partialFingerprints":{"codehealthFindingId/v1":"03b45b4eb622c6f8cf95b5bdfa74b928064165c6c3a5940a0a3e18e162c207e0"}},{"ruleId":"D2","level":"warning","message":{"text":"sc_lowering._load_lowering_rule (cognitive 23): sc_lowering._load_lowering_rule has cognitive complexity 23 (threshold 15). Drivers by points: if/else 14 (17 pts), boolean chains 4, loops 1, ternaries 1 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/mosaic/sc_lowering.py"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"479eb0084809d2228763ec432856510fd205c47df38f10247b57f4d993191eea"}},{"ruleId":"D2","level":"warning","message":{"text":"shard_map._manual_spec (cognitive 23): shard_map._manual_spec has cognitive complexity 23 (threshold 15). Drivers by points: ternaries 4 (10 pts), if/else 5 (8 pts), loops 2 (4 pts), boolean chains 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/shard_map.py"},"region":{"startLine":435}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d108befb04452a35ec16b296eec69222c21f992668321149cb6e5e08b8cbafa"}},{"ruleId":"D2","level":"warning","message":{"text":"stages._traced_out_info (cognitive 23): stages._traced_out_info has cognitive complexity 23 (threshold 15). Drivers by points: ternaries 6 (15 pts), if/else 4 (7 pts), loops 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/stages.py"},"region":{"startLine":398}}}],"partialFingerprints":{"codehealthFindingId/v1":"72ee1060fa99205cc5521f735093982026e74f2555f6910aacb4b153b59c8baf"}},{"ruleId":"D2","level":"warning","message":{"text":"jax2tf._tfval_to_tensor_jax_dtype (cognitive 23): jax2tf._tfval_to_tensor_jax_dtype has cognitive complexity 23 (threshold 15). Drivers by points: if/else 10 (19 pts), boolean chains 4 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/jax2tf/jax2tf.py"},"region":{"startLine":725}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8280cd02826302d053f49efb7f4bbf5b0b6284ee6e70e91744339d9d99522d4"}},{"ruleId":"D2","level":"warning","message":{"text":"mma.mma (cognitive 23): mma.mma has cognitive complexity 23 (threshold 15). Drivers by points: if/else 13 (16 pts), loops 3 (6 pts), boolean chains 1 (nesting depth added 6). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/mosaic/gpu/mma.py"},"region":{"startLine":191}}}],"partialFingerprints":{"codehealthFindingId/v1":"ffe459eb874634f3da72a0ca3a281c4b39cfd22e613c906748603cca6ed81064"}},{"ruleId":"D2","level":"warning","message":{"text":"splash_attention_kernel._apply_mask_and_soft_cap (cognitive 23): splash_attention_kernel._apply_mask_and_soft_cap has cognitive complexity 23 (threshold 15). Drivers by points: if/else 14 (22 pts), boolean chains 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/pallas/ops/tpu/splash_attention/splash_attention_kernel.py"},"region":{"startLine":608}}}],"partialFingerprints":{"codehealthFindingId/v1":"c90f49f0497512131f48ed2865280ca2bfe931ae6d2054e4b212cd727aff0273"}},{"ruleId":"D2","level":"warning","message":{"text":"bcoo.bcoo_concatenate (cognitive 23): bcoo.bcoo_concatenate has cognitive complexity 23 (threshold 15). Drivers by points: if/else 12 (16 pts), ternaries 2 (6 pts), boolean chains 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/sparse/bcoo.py"},"region":{"startLine":1767}}}],"partialFingerprints":{"codehealthFindingId/v1":"c87b7a812620c188766b4e1fa0e684405e57db9ae370806489c717e926a42617"}},{"ruleId":"D2","level":"warning","message":{"text":"ConfigOptionDirective.run (cognitive 22): ConfigOptionDirective.run has cognitive complexity 22 (threshold 15). Drivers by points: if/else 6 (15 pts), loops 3 (7 pts) (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/sphinxext/jax_list_config_options.py"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"43579184520e5394478f096e8c74092260e86b137b53d8692634413dcae69969"}},{"ruleId":"D2","level":"warning","message":{"text":"Primitive.bind (cognitive 22): Primitive.bind has cognitive complexity 22 (threshold 15). Drivers by points: if/else 5 (16 pts), boolean chains 3, error handling 1 (2 pts), loops 1 (nesting depth added 12). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/core.py"},"region":{"startLine":631}}}],"partialFingerprints":{"codehealthFindingId/v1":"c206ef6771bc11ece13ce802643edba6d2a735b3e2084b97fd1bf37d400e3e24"}},{"ruleId":"D2","level":"warning","message":{"text":"core.auto_insert_reshard (cognitive 22): core.auto_insert_reshard has cognitive complexity 22 (threshold 15). Drivers by points: if/else 8 (17 pts), boolean chains 2, ternaries 2, loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/core.py"},"region":{"startLine":2784}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ad1a3df49fc00a9ecc6e06932a42ff49c92fddebae3247fe772e224a2e4810a"}},{"ruleId":"D2","level":"warning","message":{"text":"dtypes._issubdtype_cached (cognitive 22): dtypes._issubdtype_cached has cognitive complexity 22 (threshold 15). Drivers by points: if/else 9 (11 pts), boolean chains 9, ternaries 2 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/dtypes.py"},"region":{"startLine":554}}}],"partialFingerprints":{"codehealthFindingId/v1":"50eddf867acb79b40fb9fc571ef08920d3feb6c9457650134878c9b8e158ca66"}},{"ruleId":"D2","level":"warning","message":{"text":"pxla.maybe_recover_user_shardings (cognitive 22): pxla.maybe_recover_user_shardings has cognitive complexity 22 (threshold 15). Drivers by points: if/else 6 (10 pts), boolean chains 5, loops 3 (4 pts), ternaries 2 (3 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/interpreters/pxla.py"},"region":{"startLine":1405}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e28a2ed885cf13cf95219140a489f6c2c7a52665d0045a00eb2972c25e2402f"}},{"ruleId":"D2","level":"warning","message":{"text":"loops._scan_impl (cognitive 22): loops._scan_impl has cognitive complexity 22 (threshold 15). Drivers by points: if/else 14 (18 pts), boolean chains 2, ternaries 1 (2 pts) (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/lax/control_flow/loops.py"},"region":{"startLine":618}}}],"partialFingerprints":{"codehealthFindingId/v1":"d890509fb95baf2c9a86b0e165aee2ba81cc01fc708473816c59b08c6661da67"}},{"ruleId":"D2","level":"warning","message":{"text":"lax._split_an_axis_sharding_rule (cognitive 22): lax._split_an_axis_sharding_rule has cognitive complexity 22 (threshold 15). Drivers by points: if/else 9 (15 pts), ternaries 1 (4 pts), loops 2, boolean chains 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/lax/lax.py"},"region":{"startLine":9466}}}],"partialFingerprints":{"codehealthFindingId/v1":"16c3c369c7b6fb3f6ca570f0242a0f99f40863be3f6f99e64eb0205615e5d08b"}},{"ruleId":"D2","level":"warning","message":{"text":"slicing._scatter_transpose_rule (cognitive 22): slicing._scatter_transpose_rule has cognitive complexity 22 (threshold 15). Drivers by points: if/else 9 (14 pts), ternaries 2 (4 pts), loops 1 (3 pts), boolean chains 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/lax/slicing.py"},"region":{"startLine":3642}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea3d265e6b894ef31d4b09492aa69aa3b77be14251230d53b587d9e1ea0af090"}},{"ruleId":"D2","level":"warning","message":{"text":"utils.int_dtype_for_shape (cognitive 22): utils.int_dtype_for_shape has cognitive complexity 22 (threshold 15). Drivers by points: if/else 8 (18 pts), loops 2 (4 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/lax/utils.py"},"region":{"startLine":468}}}],"partialFingerprints":{"codehealthFindingId/v1":"2045f56bb1b245eb2fbf38d65f73bb865c67e3f37c7b016549ffaaf6a880d207"}},{"ruleId":"D2","level":"warning","message":{"text":"reductions._reduce_minmax (cognitive 22): reductions._reduce_minmax has cognitive complexity 22 (threshold 15). Drivers by points: if/else 15 (18 pts), boolean chains 4 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/numpy/reductions.py"},"region":{"startLine":620}}}],"partialFingerprints":{"codehealthFindingId/v1":"b851eb5831f64c19b0724f3e2d46d41fcef4e6f53dfd00c7d754aa60cac171e6"}},{"ruleId":"D2","level":"warning","message":{"text":"primitives._copy_smem_to_gmem_lowering (cognitive 22): primitives._copy_smem_to_gmem_lowering has cognitive complexity 22 (threshold 15). Drivers by points: if/else 15 (19 pts), ternaries 1 (2 pts), boolean chains 1 (nesting depth added 5). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/mosaic_gpu/primitives.py"},"region":{"startLine":294}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae14048723d1fd229ab2547376e38c5977e672f3deea80758ec5a53533cc2872"}},{"ruleId":"D2","level":"warning","message":{"text":"primitives._swap_discharge_rule (cognitive 22): primitives._swap_discharge_rule has cognitive complexity 22 (threshold 15). Drivers by points: if/else 7 (12 pts), boolean chains 4, ternaries 2 (4 pts), loops 1 (2 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/primitives.py"},"region":{"startLine":387}}}],"partialFingerprints":{"codehealthFindingId/v1":"68194b30ce3963f7c8a0f479b8ebc24dc88db6c384c4f48c8fb38ffcb3f870b5"}},{"ruleId":"D2","level":"warning","message":{"text":"primitives._semaphore_signal_abstract_eval (cognitive 22): primitives._semaphore_signal_abstract_eval has cognitive complexity 22 (threshold 15). Drivers by points: if/else 6 (12 pts), loops 3 (9 pts), boolean chains 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/primitives.py"},"region":{"startLine":1020}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb565f847089900a92929f1f06c73a28b03c0aaef1d588560b6e7a51a40f3754"}},{"ruleId":"D2","level":"warning","message":{"text":"lowering.lower_jaxpr_to_triton_ir (cognitive 22): lowering.lower_jaxpr_to_triton_ir has cognitive complexity 22 (threshold 15). Drivers by points: if/else 7 (15 pts), error handling 2 (4 pts), loops 2 (3 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/triton/lowering.py"},"region":{"startLine":392}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ce40fb15a1ce72aa32d65c29a7872848d17a8649305c28c04208e24db70d8c1"}},{"ruleId":"D2","level":"warning","message":{"text":"pjit._get_new_mesh (cognitive 22): pjit._get_new_mesh has cognitive complexity 22 (threshold 15). Drivers by points: if/else 9 (14 pts), boolean chains 6, loops 2 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pjit.py"},"region":{"startLine":2912}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a428bc0133cc0c03483c699092256c795d540327f3b93712b953e44ea98578e"}},{"ruleId":"D2","level":"warning","message":{"text":"core._multivariate_normal (cognitive 22): core._multivariate_normal has cognitive complexity 22 (threshold 15). Drivers by points: if/else 13 (14 pts), ternaries 3 (5 pts), boolean chains 3 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/random/core.py"},"region":{"startLine":1544}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6e3256c6b811b921afec4f429d0242996b6bff7531e8838be80a1fd7a2ce02a"}},{"ruleId":"D2","level":"warning","message":{"text":"fft.dctn (cognitive 22): fft.dctn has cognitive complexity 22 (threshold 15). Drivers by points: if/else 12 (14 pts), ternaries 2 (4 pts), error handling 1 (2 pts), boolean chains 1, loops 1 (nesting depth added 5). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/scipy/fft.py"},"region":{"startLine":159}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0924526f63efa77a54fed99795c06ead57c22b7ef21c6f7cf7767cf580f0122"}},{"ruleId":"D2","level":"warning","message":{"text":"sharding_impls.parse_flatten_op_sharding (cognitive 22): sharding_impls.parse_flatten_op_sharding has cognitive complexity 22 (threshold 15). Drivers by points: if/else 6 (11 pts), loops 4 (9 pts), boolean chains 2 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/sharding_impls.py"},"region":{"startLine":487}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa2b3c8f0ae37d74813599adc1ee423f1e7ded69513278a2402e498e5cfa0bc1"}},{"ruleId":"D2","level":"warning","message":{"text":"primitives._swap_vmap (cognitive 22): primitives._swap_vmap has cognitive complexity 22 (threshold 15). Drivers by points: if/else 14 (17 pts), boolean chains 5 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/state/primitives.py"},"region":{"startLine":981}}}],"partialFingerprints":{"codehealthFindingId/v1":"3cea5efa5f7c6ecaecffd0c76b341a7e1e2375f8dcad181df392273989c19233"}},{"ruleId":"D2","level":"warning","message":{"text":"svd.svd (cognitive 22): svd.svd has cognitive complexity 22 (threshold 15). Drivers by points: if/else 13 (18 pts), boolean chains 2, ternaries 1 (2 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/tpu/linalg/svd.py"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"35d53996bc1d03b2c860061a2827290541546cd094367c381cd24fbb2b2337e9"}},{"ruleId":"D2","level":"warning","message":{"text":"layout_inference._async_load_store_constraint_system (cognitive 22): layout_inference._async_load_store_constraint_system has cognitive complexity 22 (threshold 15). Drivers by points: if/else 9 (19 pts), boolean chains 1, loops 1, ternaries 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/mosaic/gpu/layout_inference.py"},"region":{"startLine":2230}}}],"partialFingerprints":{"codehealthFindingId/v1":"985b602cb5fa98d57c0a2880210d000cbafdab8e311ea3312597010e762c42d6"}},{"ruleId":"D2","level":"warning","message":{"text":"Partition.__init__ (cognitive 22): Partition.__init__ has cognitive complexity 22 (threshold 15). Drivers by points: if/else 10 (17 pts), loops 3 (4 pts), boolean chains 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/mosaic/gpu/utils.py"},"region":{"startLine":1870}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0010bf287db487b74ea33b853d73e12ea9c694caec644168a9c58013d61e5ac"}},{"ruleId":"D2","level":"warning","message":{"text":"reduce_scatter_mgpu.reduce_scatter (cognitive 22): reduce_scatter_mgpu.reduce_scatter has cognitive complexity 22 (threshold 15). Drivers by points: if/else 14 (19 pts), loops 1 (2 pts), boolean chains 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/pallas/ops/gpu/reduce_scatter_mgpu.py"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f485d4b82abefc5130df8d8a22d9b69b67eeb3ac9e453f99f5cd5c0a285bc11"}},{"ruleId":"D2","level":"warning","message":{"text":"mlir.parse_mlir_locations (cognitive 22): mlir.parse_mlir_locations has cognitive complexity 22 (threshold 15). Drivers by points: if/else 7 (20 pts), loops 2 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/source_mapper/mlir.py"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"683a29e6ff5a570ad775dd25e27a974f8f5d056cb348a67edb5b6144d5adc223"}},{"ruleId":"D2","level":"warning","message":{"text":"ArrayImpl.__dlpack_device__ (cognitive 21): ArrayImpl.__dlpack_device__ has cognitive complexity 21 (threshold 15). Drivers by points: if/else 13 (21 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/array.py"},"region":{"startLine":453}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c9343bf5fcbfc39514638afe399df958a10dd1b97a23b508f9ccda6341c4c0d"}},{"ruleId":"D2","level":"warning","message":{"text":"compiler._resolve_compilation_strategy (cognitive 21): compiler._resolve_compilation_strategy has cognitive complexity 21 (threshold 15). Drivers by points: if/else 9 (15 pts), boolean chains 6 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/compiler.py"},"region":{"startLine":549}}}],"partialFingerprints":{"codehealthFindingId/v1":"469c2ff31c56aaae3cf613d30625cf2adce725da2d7e428aebbf03d4de769325"}},{"ruleId":"D2","level":"warning","message":{"text":"custom_partitioning._custom_partitioning_lowering_rule (cognitive 21): custom_partitioning._custom_partitioning_lowering_rule has cognitive complexity 21 (threshold 15). Drivers by points: if/else 11 (18 pts), boolean chains 3 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/custom_partitioning.py"},"region":{"startLine":527}}}],"partialFingerprints":{"codehealthFindingId/v1":"65e83639c709fd61f8b6f25a0ada51d52d198d0dccacc2a822bb170c8c4ec44e"}},{"ruleId":"D2","level":"warning","message":{"text":"hardware_utils.num_available_amd_gpus (cognitive 21): hardware_utils.num_available_amd_gpus has cognitive complexity 21 (threshold 15). Drivers by points: if/else 7 (15 pts), error handling 2 (3 pts), boolean chains 2, loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/hardware_utils.py"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"b049ddd67e85e452aa3712144548af0b3fc467db69689e8527347fe0246d8ab9"}},{"ruleId":"D2","level":"warning","message":{"text":"ExecuteReplicated.__call__ (cognitive 21): ExecuteReplicated.__call__ has cognitive complexity 21 (threshold 15). Drivers by points: if/else 11 (13 pts), error handling 1 (4 pts), boolean chains 2, loops 1 (2 pts) (nesting depth added 6). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/interpreters/pxla.py"},"region":{"startLine":400}}}],"partialFingerprints":{"codehealthFindingId/v1":"7aa62ded766a1429028f10cee4f474238707585c0e7f51f68e9cbe8fc90473fa"}},{"ruleId":"D2","level":"warning","message":{"text":"conditionals._cond_lowering (cognitive 21): conditionals._cond_lowering has cognitive complexity 21 (threshold 15). Drivers by points: if/else 4 (12 pts), loops 4 (8 pts), boolean chains 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/lax/control_flow/conditionals.py"},"region":{"startLine":1142}}}],"partialFingerprints":{"codehealthFindingId/v1":"4993d4587102f883f5feb5315c4d272568f1214197a9885ac3857f46f6c04d24"}},{"ruleId":"D2","level":"warning","message":{"text":"scaled_dot._scaled_dot_validate_inputs (cognitive 21): scaled_dot._scaled_dot_validate_inputs has cognitive complexity 21 (threshold 15). Drivers by points: if/else 11 (15 pts), ternaries 2 (4 pts), loops 2 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/lax/scaled_dot.py"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e49fdf7dd1b876de41dacb32219633314c7ecc691f94102c7c8ca42e4e739e8"}},{"ruleId":"D2","level":"warning","message":{"text":"slicing._gather_spec_computation (cognitive 21): slicing._gather_spec_computation has cognitive complexity 21 (threshold 15). Drivers by points: if/else 6 (9 pts), boolean chains 8, loops 2 (4 pts) (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/lax/slicing.py"},"region":{"startLine":2131}}}],"partialFingerprints":{"codehealthFindingId/v1":"b336bfcf768f05c6f01a12eb8a0ad6cdd888ad7926ef97410d8de9c9129ad296"}},{"ruleId":"D2","level":"warning","message":{"text":"fft._fft_core (cognitive 21): fft._fft_core has cognitive complexity 21 (threshold 15). Drivers by points: if/else 14 (18 pts), loops 1 (2 pts), boolean chains 1 (nesting depth added 5). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/numpy/fft.py"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"8fc01011cbb353cb53806fdfc35e63ed9b8459ee07593c6207d2acef29bf99f3"}},{"ruleId":"D2","level":"warning","message":{"text":"_AxisConcat.__getitem__ (cognitive 21): _AxisConcat.__getitem__ has cognitive complexity 21 (threshold 15). Drivers by points: if/else 9 (14 pts), error handling 1 (3 pts), boolean chains 2, loops 1, ternaries 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/numpy/index_tricks.py"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c1fff8873622291cbcacecaedb8c47e267245742d9b7a046238b90a6351f4ea"}},{"ruleId":"D2","level":"warning","message":{"text":"indexing.rewriting_take (cognitive 21): indexing.rewriting_take has cognitive complexity 21 (threshold 15). Drivers by points: ternaries 4 (8 pts), if/else 7, error handling 2 (4 pts), boolean chains 2 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/numpy/indexing.py"},"region":{"startLine":1165}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d317a5a9698d803933cfcca8455324d9e3185b407814ff4ac480231183557c6"}},{"ruleId":"D2","level":"warning","message":{"text":"scatter._scatter_impl (cognitive 21): scatter._scatter_impl has cognitive complexity 21 (threshold 15). Drivers by points: if/else 9 (13 pts), boolean chains 3, loops 1 (3 pts), ternaries 1 (2 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/ops/scatter.py"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ada06dfb82190f234b95a5565a32681ce41166219d0f272132b8d128da1182a"}},{"ruleId":"D2","level":"warning","message":{"text":"core.get_grid_mapping (cognitive 21): core.get_grid_mapping has cognitive complexity 21 (threshold 15). Drivers by points: if/else 14 (17 pts), boolean chains 3, ternaries 1 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/core.py"},"region":{"startLine":1410}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd8de0864baee17f2b72761be63d395f2dd8d3a5da1bbaa9bb46aac5d67c3608"}},{"ruleId":"D2","level":"warning","message":{"text":"einshape._apply_split (cognitive 21): einshape._apply_split has cognitive complexity 21 (threshold 15). Drivers by points: if/else 6 (14 pts), loops 3 (6 pts), boolean chains 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/einshape.py"},"region":{"startLine":784}}}],"partialFingerprints":{"codehealthFindingId/v1":"1171e81754416159e396b534d88ebd07692b87d7aec263624c223c3ee2cdf3fe"}},{"ruleId":"D2","level":"warning","message":{"text":"lowering.aval_to_ir_type (cognitive 21): lowering.aval_to_ir_type has cognitive complexity 21 (threshold 15). Drivers by points: if/else 13 (20 pts), boolean chains 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/mosaic/lowering.py"},"region":{"startLine":599}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c09b424b7067f05be468f2af387c3fe85cbd56f47ffdb43fc28abb3a19e3a18"}},{"ruleId":"D2","level":"warning","message":{"text":"lowering._convert_helper (cognitive 21): lowering._convert_helper has cognitive complexity 21 (threshold 15). Drivers by points: if/else 11 (20 pts), boolean chains 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/mosaic/lowering.py"},"region":{"startLine":3298}}}],"partialFingerprints":{"codehealthFindingId/v1":"5855380f63ac1f471bbd9eabcd715f70de09407d92593187682cf458b645a78e"}},{"ruleId":"D2","level":"warning","message":{"text":"primitives._get_dma_effects (cognitive 21): primitives._get_dma_effects has cognitive complexity 21 (threshold 15). Drivers by points: if/else 7 (11 pts), loops 2 (7 pts), boolean chains 2, ternaries 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/mosaic/primitives.py"},"region":{"startLine":358}}}],"partialFingerprints":{"codehealthFindingId/v1":"c84f408a2542be0f5ef1cc67791c949f86abecdc18724e8c51fc09ba6b873c20"}},{"ruleId":"D2","level":"warning","message":{"text":"pjit._trace_for_jit (cognitive 21): pjit._trace_for_jit has cognitive complexity 21 (threshold 15). Drivers by points: if/else 12, boolean chains 6, ternaries 2 (3 pts) (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pjit.py"},"region":{"startLine":497}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ad69ddd24b589571e4e61bc5b3ac19b2bb5e8ad5c95927bfe10e97973781ef9"}},{"ruleId":"D2","level":"warning","message":{"text":"pjit._sharding_constraint_impl (cognitive 21): pjit._sharding_constraint_impl has cognitive complexity 21 (threshold 15). Drivers by points: if/else 10 (18 pts), boolean chains 3 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pjit.py"},"region":{"startLine":2175}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff276109d82db69f91b5458635252169d3e9c5e833291158ed41e7cdafd566d0"}},{"ruleId":"D2","level":"warning","message":{"text":"fft.idctn (cognitive 21): fft.idctn has cognitive complexity 21 (threshold 15). Drivers by points: if/else 11 (13 pts), ternaries 2 (4 pts), error handling 1 (2 pts), boolean chains 1, loops 1 (nesting depth added 5). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/scipy/fft.py"},"region":{"startLine":380}}}],"partialFingerprints":{"codehealthFindingId/v1":"48ac2ff7f3fe7c62b51bd0550085fe443090d1b47b57224a0f2960678400c436"}},{"ruleId":"D2","level":"warning","message":{"text":"shard_map._shmap_checks (cognitive 21): shard_map._shmap_checks has cognitive complexity 21 (threshold 15). Drivers by points: if/else 15 (18 pts), boolean chains 3 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/shard_map.py"},"region":{"startLine":371}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3ad5ad2f7325db1dc66820fc7ceef051e642edec2672ee9438fa0654fd3cb74"}},{"ruleId":"D2","level":"warning","message":{"text":"sharding_impls.canonicalize_sharding (cognitive 21): sharding_impls.canonicalize_sharding has cognitive complexity 21 (threshold 15). Drivers by points: if/else 11 (17 pts), boolean chains 3, loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/sharding_impls.py"},"region":{"startLine":852}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7b8955ea2e961f9c72dee70b2da5d561a58a3a003563015fa50d6b9b9837f32"}},{"ruleId":"D2","level":"warning","message":{"text":"serialization.is_remote_storage (cognitive 21): serialization.is_remote_storage has cognitive complexity 21 (threshold 15). Drivers by points: if/else 8 (18 pts), loops 2 (3 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/array_serialization/serialization.py"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"88bb841c5b97ae9db30ccf8e5ddec8bc85a0d67a7b656741aad33f817465aa3a"}},{"ruleId":"D2","level":"warning","message":{"text":"call_tf._call_tf_lowering (cognitive 21): call_tf._call_tf_lowering has cognitive complexity 21 (threshold 15). Drivers by points: if/else 10 (17 pts), loops 2 (3 pts), error handling 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/jax2tf/call_tf.py"},"region":{"startLine":514}}}],"partialFingerprints":{"codehealthFindingId/v1":"d78e4c22457f3ef703415a45457ebe9949261b6a83ed98d909896481c4317349"}},{"ruleId":"D2","level":"warning","message":{"text":"core._construct_smem_reftree (cognitive 21): core._construct_smem_reftree has cognitive complexity 21 (threshold 15). Drivers by points: if/else 4 (12 pts), ternaries 2 (6 pts), match/switch 1 (2 pts), loops 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/mosaic/gpu/core.py"},"region":{"startLine":532}}}],"partialFingerprints":{"codehealthFindingId/v1":"1986d9e8201be111b23a38132d5d54dd2a61e9ba5ee44f7d4ea97e2785aa7661"}},{"ruleId":"D2","level":"warning","message":{"text":"layout_inference._conjure_transforms_for_smem_ref (cognitive 21): layout_inference._conjure_transforms_for_smem_ref has cognitive complexity 21 (threshold 15). Drivers by points: if/else 7 (13 pts), ternaries 2 (7 pts), loops 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/mosaic/gpu/layout_inference.py"},"region":{"startLine":255}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2d6c1484b521f674a4cd7302ae14a8dff53e7db6015f0977ddab6e5343d6e79"}},{"ruleId":"D2","level":"warning","message":{"text":"blackwell_matmul_mgpu.main (cognitive 21): blackwell_matmul_mgpu.main has cognitive complexity 21 (threshold 15). Drivers by points: if/else 4 (13 pts), error handling 1 (3 pts), loops 2 (3 pts), boolean chains 2 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/pallas/ops/gpu/blackwell_matmul_mgpu.py"},"region":{"startLine":271}}}],"partialFingerprints":{"codehealthFindingId/v1":"d094d528b5319c25c59780890b272314a68398284aa6c4172128b9b8f7a2cefb"}},{"ruleId":"D2","level":"warning","message":{"text":"ragged_dot_mgpu.main (cognitive 21): ragged_dot_mgpu.main has cognitive complexity 21 (threshold 15). Drivers by points: if/else 6 (15 pts), error handling 1 (3 pts), loops 2 (3 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/pallas/ops/gpu/ragged_dot_mgpu.py"},"region":{"startLine":245}}}],"partialFingerprints":{"codehealthFindingId/v1":"016ded46b867c54ee3022fb3e0699d4f614c4089ec9d4f5524f03f6d8634f3fb"}},{"ruleId":"D2","level":"warning","message":{"text":"transform.eval_sparse (cognitive 21): transform.eval_sparse has cognitive complexity 21 (threshold 15). Drivers by points: if/else 6 (14 pts), loops 2 (4 pts), ternaries 1 (3 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/sparse/transform.py"},"region":{"startLine":396}}}],"partialFingerprints":{"codehealthFindingId/v1":"7119bdb0446b513a0ad73a0c79954d2ae0d0d5f1f0b68d5578f2e1ab46910473"}},{"ruleId":"D2","level":"warning","message":{"text":"cuda._check_cuda_versions (cognitive 21): cuda._check_cuda_versions has cognitive complexity 21 (threshold 15). Drivers by points: if/else 13 (16 pts), boolean chains 4, loops 1 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax_plugins/cuda/__init__.py"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"91337cb1de57ff3945bf1a5a83001aeac3eb1fba6ffad2bdf3ebb333da102f7f"}},{"ruleId":"D2","level":"warning","message":{"text":"callback.emit_python_callback (cognitive 20): callback.emit_python_callback has cognitive complexity 20 (threshold 15). Drivers by points: if/else 11 (15 pts), ternaries 3 (4 pts), boolean chains 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/callback.py"},"region":{"startLine":764}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e9e056ab437d4cea0beb2bdfa5076be71c08e8d36e84d4a90f9f871e2015b72"}},{"ruleId":"D2","level":"warning","message":{"text":"ClusterEnv.auto_detect_unset_distributed_params (cognitive 20): ClusterEnv.auto_detect_unset_distributed_params has cognitive complexity 20 (threshold 15). Drivers by points: if/else 11 (18 pts), boolean chains 2 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/clusters/cluster.py"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ad70a42eff8d2e7c8501da8b30bbe99b88d977e01cf1e455349cc9457cb72a2"}},{"ruleId":"D2","level":"warning","message":{"text":"core.pp_toplevel_jaxpr (cognitive 20): core.pp_toplevel_jaxpr has cognitive complexity 20 (threshold 15). Drivers by points: if/else 5 (11 pts), loops 5 (8 pts), boolean chains 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/core.py"},"region":{"startLine":4127}}}],"partialFingerprints":{"codehealthFindingId/v1":"2566cecf4009f60c4042f0ecbf8e43e8d90397a01624a4c3d496ccf4bee9f403"}},{"ruleId":"D2","level":"warning","message":{"text":"conditionals._join_cond_fwd_res (cognitive 20): conditionals._join_cond_fwd_res has cognitive complexity 20 (threshold 15). Drivers by points: ternaries 2 (9 pts), if/else 3 (8 pts), loops 2 (3 pts) (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/lax/control_flow/conditionals.py"},"region":{"startLine":813}}}],"partialFingerprints":{"codehealthFindingId/v1":"42a7322db17305ce2080809015eca2c8ccb91f09cfbdd027ac72b9eef28e12ef"}},{"ruleId":"D2","level":"warning","message":{"text":"linalg._svd_cpu_gpu_lowering (cognitive 20): linalg._svd_cpu_gpu_lowering has cognitive complexity 20 (threshold 15). Drivers by points: if/else 9 (11 pts), ternaries 2 (6 pts), boolean chains 3 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/lax/linalg.py"},"region":{"startLine":2514}}}],"partialFingerprints":{"codehealthFindingId/v1":"9fcd3ad02b5158a448f36e1f4d6df62e47ab0345596f6aa2a6b637be5d7e687e"}},{"ruleId":"D2","level":"warning","message":{"text":"utils._check_no_collectives (cognitive 20): utils._check_no_collectives has cognitive complexity 20 (threshold 15). Drivers by points: if/else 6 (12 pts), boolean chains 5, loops 2 (3 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/lax/utils.py"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"5bec1365fd82d1e357cdcd13550ded3ac9eded7eac01df96b4165555d527f0b0"}},{"ruleId":"D2","level":"warning","message":{"text":"lax_reference._float64_fma_scalar (cognitive 20): lax_reference._float64_fma_scalar has cognitive complexity 20 (threshold 15). Drivers by points: if/else 11 (13 pts), boolean chains 6, ternaries 1 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/lax_reference.py"},"region":{"startLine":252}}}],"partialFingerprints":{"codehealthFindingId/v1":"75c6de7fad7cf295510fa8aebd59ea43e900e03424673f1e3510ba6e3bda2193"}},{"ruleId":"D2","level":"warning","message":{"text":"named_sharding.named_sharding_to_xla_hlo_sharding (cognitive 20): named_sharding.named_sharding_to_xla_hlo_sharding has cognitive complexity 20 (threshold 15). Drivers by points: loops 6 (10 pts), if/else 8 (9 pts), boolean chains 1 (nesting depth added 5). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/named_sharding.py"},"region":{"startLine":429}}}],"partialFingerprints":{"codehealthFindingId/v1":"31b514a7b7ea14a4103473d2ad0cb4cd342d423359e58cd3b92bf9a9a7775642"}},{"ruleId":"D2","level":"warning","message":{"text":"tensor_contractions.matmul (cognitive 20): tensor_contractions.matmul has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8 (10 pts), boolean chains 4, ternaries 4, loops 2 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/numpy/tensor_contractions.py"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"69b9444f4150a6f9359ed3f8ea4c7b269cae111f072c2ba13f78a457258dca32"}},{"ruleId":"D2","level":"warning","message":{"text":"lowering._convert_element_type_lowering_rule (cognitive 20): lowering._convert_element_type_lowering_rule has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (13 pts), boolean chains 7 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/mosaic/lowering.py"},"region":{"startLine":3334}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d7b7fc2e0b6e77975726eb17097aba784b3fa25f53e40fb8f34313bc13c77cb"}},{"ruleId":"D2","level":"warning","message":{"text":"primitives.dma_start_discharge_rule (cognitive 20): primitives.dma_start_discharge_rule has cognitive complexity 20 (threshold 15). Drivers by points: if/else 10 (13 pts), ternaries 3 (5 pts), boolean chains 2 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/mosaic/primitives.py"},"region":{"startLine":508}}}],"partialFingerprints":{"codehealthFindingId/v1":"f59efa543286bca845a905f5b556f133931d5634974fed472920ae7645114a02"}},{"ruleId":"D2","level":"warning","message":{"text":"primitives._print_layout_lowering (cognitive 20): primitives._print_layout_lowering has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8 (12 pts), match/switch 1 (4 pts), loops 1 (3 pts), boolean chains 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/mosaic_gpu/primitives.py"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"b46ee1a983d89fe3c1c9a006d0b2af4137a48b785109984311404242929e4df6"}},{"ruleId":"D2","level":"warning","message":{"text":"mpmd._mpmd_map_discharge_rule (cognitive 20): mpmd._mpmd_map_discharge_rule has cognitive complexity 20 (threshold 15). Drivers by points: if/else 3 (9 pts), loops 6 (7 pts), ternaries 3, boolean chains 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/mpmd.py"},"region":{"startLine":215}}}],"partialFingerprints":{"codehealthFindingId/v1":"f12272a5067584372c1b9fc895841c214e85730ec21c736b19f61a1f005b991d"}},{"ruleId":"D2","level":"warning","message":{"text":"primitives._load_discharge_rule (cognitive 20): primitives._load_discharge_rule has cognitive complexity 20 (threshold 15). Drivers by points: if/else 5 (7 pts), ternaries 3 (6 pts), boolean chains 5, loops 1 (2 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/primitives.py"},"region":{"startLine":264}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc5983bdf3d22392434f99bab68e7a9aa2f0fc5f7e80e577c714120492cbcff0"}},{"ruleId":"D2","level":"warning","message":{"text":"lowering._store (cognitive 20): lowering._store has cognitive complexity 20 (threshold 15). Drivers by points: if/else 13 (16 pts), boolean chains 2, error handling 1 (2 pts) (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/triton/lowering.py"},"region":{"startLine":2313}}}],"partialFingerprints":{"codehealthFindingId/v1":"710d38c25347d273865edb3e09841609e55f5a8cd77432eed6ca760aee4835cf"}},{"ruleId":"D2","level":"warning","message":{"text":"core._truncated_normal (cognitive 20): core._truncated_normal has cognitive complexity 20 (threshold 15). Drivers by points: if/else 9 (15 pts), ternaries 2 (4 pts), boolean chains 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/random/core.py"},"region":{"startLine":1711}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d2c2ec96eb04e86e050dfec3b65c93882a66c67a2b89d652ca799bb57c5aa7d"}},{"ruleId":"D2","level":"warning","message":{"text":"sharding_impls.prepare_axis_resources (cognitive 20): sharding_impls.prepare_axis_resources has cognitive complexity 20 (threshold 15). Drivers by points: if/else 6 (15 pts), boolean chains 4, loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/sharding_impls.py"},"region":{"startLine":324}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4c63817a91d6074e91467162c2616b439b15ae227b9e8c5f7496fb38f873eaf"}},{"ruleId":"D2","level":"warning","message":{"text":"call_tf._mlir_type_to_numpy_dtype (cognitive 20): call_tf._mlir_type_to_numpy_dtype has cognitive complexity 20 (threshold 15). Drivers by points: ternaries 4 (12 pts), if/else 6 (8 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/jax2tf/call_tf.py"},"region":{"startLine":473}}}],"partialFingerprints":{"codehealthFindingId/v1":"63dffb4b9af082e755f0abfe0bb85eb39402517486e6437181c1294e2c9e6f2d"}},{"ruleId":"D2","level":"warning","message":{"text":"bcoo._bcoo_spdot_general_abstract_eval (cognitive 20): bcoo._bcoo_spdot_general_abstract_eval has cognitive complexity 20 (threshold 15). Drivers by points: boolean chains 9, if/else 9, ternaries 2. To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/sparse/bcoo.py"},"region":{"startLine":1195}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa9b2686005ef08b883d39c9da4dea34f0d9350493fe91320f6c3c558b5fe07e"}},{"ruleId":"D2","level":"warning","message":{"text":"callback._callback_op_sharding (cognitive 19): callback._callback_op_sharding has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (15 pts), error handling 1 (3 pts), boolean chains 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/callback.py"},"region":{"startLine":157}}}],"partialFingerprints":{"codehealthFindingId/v1":"0adbe68ae160545010b8dc51f338cfddc89726c867b6441699099dadf008bf5a"}},{"ruleId":"D2","level":"warning","message":{"text":"dispatch._device_put_transpose (cognitive 19): dispatch._device_put_transpose has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (11 pts), loops 3 (5 pts), ternaries 1 (2 pts), boolean chains 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/dispatch.py"},"region":{"startLine":754}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf3db26a3c68e274c36345858c0bfd675f03433cb2bebaa2492e0e5bdcc1cd24"}},{"ruleId":"D2","level":"warning","message":{"text":"_DimFactor._syntactic_cmp (cognitive 19): _DimFactor._syntactic_cmp has cognitive complexity 19 (threshold 15). Drivers by points: ternaries 6 (10 pts), if/else 5 (6 pts), boolean chains 2, loops 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/export/shape_poly.py"},"region":{"startLine":186}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7cabd051862328ae34774018107ed07fc86b0d25fdc5590587a8d2aa5eded1b"}},{"ruleId":"D2","level":"warning","message":{"text":"mlir.merge_mlir_modules (cognitive 19): mlir.merge_mlir_modules has cognitive complexity 19 (threshold 15). Drivers by points: loops 6 (9 pts), if/else 2 (4 pts), boolean chains 3, ternaries 1 (3 pts) (nesting depth added 7). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/interpreters/mlir.py"},"region":{"startLine":3388}}}],"partialFingerprints":{"codehealthFindingId/v1":"19f8d45cb0983193fc368bba0aec014b6aa22855cde809402370d05d7a62df6e"}},{"ruleId":"D2","level":"warning","message":{"text":"DynamicJaxprTrace.default_process_primitive (cognitive 19): DynamicJaxprTrace.default_process_primitive has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (10 pts), boolean chains 3, error handling 1 (2 pts), loops 1 (2 pts), ternaries 2 (nesting depth added 4). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/interpreters/partial_eval.py"},"region":{"startLine":1829}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d5082ac70da9d2ae714adaf8fa774b4491fcd9835a85303dca8bcb438156967"}},{"ruleId":"D2","level":"warning","message":{"text":"partial_eval.diff_types (cognitive 19): partial_eval.diff_types has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (16 pts), boolean chains 1, loops 1, ternaries 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/interpreters/partial_eval.py"},"region":{"startLine":2111}}}],"partialFingerprints":{"codehealthFindingId/v1":"5665527e02393b89db9fec56f0e6c9b100bb35ee415aef413af1263563130839"}},{"ruleId":"D2","level":"warning","message":{"text":"loops._infer_scan_length (cognitive 19): loops._infer_scan_length has cognitive complexity 19 (threshold 15). Drivers by points: if/else 11 (15 pts), error handling 2 (3 pts), boolean chains 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/lax/control_flow/loops.py"},"region":{"startLine":473}}}],"partialFingerprints":{"codehealthFindingId/v1":"df646a18c1efd0d0de7e61ba7d2f3a2843535f1e207aab59cf77c721a436910d"}},{"ruleId":"D2","level":"warning","message":{"text":"loops._scan_batching_rule (cognitive 19): loops._scan_batching_rule has cognitive complexity 19 (threshold 15). Drivers by points: ternaries 9 (11 pts), if/else 3 (4 pts), boolean chains 3, loops 1 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/lax/control_flow/loops.py"},"region":{"startLine":1225}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c1e43b8a14db3c1aa264b14ced3ea703a4713cf439fd1df02377e88a1dd950d"}},{"ruleId":"D2","level":"warning","message":{"text":"linalg._eigh_cpu_gpu_lowering (cognitive 19): linalg._eigh_cpu_gpu_lowering has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (9 pts), ternaries 3 (7 pts), boolean chains 3 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/lax/linalg.py"},"region":{"startLine":1302}}}],"partialFingerprints":{"codehealthFindingId/v1":"68eb4882cb0f6958dffdb72b544002e2539197f068854f5be6ed2ecc9600a9b3"}},{"ruleId":"D2","level":"warning","message":{"text":"linalg._resolve_gpu_svd_implementation (cognitive 19): linalg._resolve_gpu_svd_implementation has cognitive complexity 19 (threshold 15). Drivers by points: if/else 12 (16 pts), error handling 1 (2 pts), boolean chains 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/lax/linalg.py"},"region":{"startLine":2465}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d783db78ff4151d553b66e251727f5552659a7bc45ac7b1d5c1d106077a132c"}},{"ruleId":"D2","level":"warning","message":{"text":"Einsum.transpose (cognitive 19): Einsum.transpose has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (15 pts), loops 2 (4 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/numpy/hijax.py"},"region":{"startLine":548}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc3fc7abcad24396402bf95b17bbab98d9f74c3bd874729f2fdb54ad532d7d21"}},{"ruleId":"D2","level":"warning","message":{"text":"indexing._take (cognitive 19): indexing._take has cognitive complexity 19 (threshold 15). Drivers by points: if/else 11 (15 pts), boolean chains 4 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/numpy/indexing.py"},"region":{"startLine":731}}}],"partialFingerprints":{"codehealthFindingId/v1":"44adb2aa54c59954e94486b12bf050ccc06ce9b96615dd644950369c650f34c7"}},{"ruleId":"D2","level":"warning","message":{"text":"indexing._gather (cognitive 19): indexing._gather has cognitive complexity 19 (threshold 15). Drivers by points: if/else 10 (14 pts), boolean chains 5 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/numpy/indexing.py"},"region":{"startLine":1290}}}],"partialFingerprints":{"codehealthFindingId/v1":"67db3958249ce76b2382355e31ef386491733230f4823c18fc6d814eea726a05"}},{"ruleId":"D2","level":"warning","message":{"text":"reductions._average (cognitive 19): reductions._average has cognitive complexity 19 (threshold 15). Drivers by points: if/else 9 (16 pts), ternaries 1 (3 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/numpy/reductions.py"},"region":{"startLine":1163}}}],"partialFingerprints":{"codehealthFindingId/v1":"07a56c2b76197a1885b74ce79953882fe26b62d02132c7dfb5c3b7a014f1f372"}},{"ruleId":"D2","level":"warning","message":{"text":"Einshape.block_eval_rule (cognitive 19): Einshape.block_eval_rule has cognitive complexity 19 (threshold 15). Drivers by points: if/else 4 (7 pts), loops 2 (4 pts), ternaries 1 (4 pts), boolean chains 2, match/switch 1 (2 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/einshape.py"},"region":{"startLine":443}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b8ec4c68c73a6f77ad653aeb35d75e5271ca84800600ec399f1c14921689d1b"}},{"ruleId":"D2","level":"warning","message":{"text":"lowering._debug_print_rule (cognitive 19): lowering._debug_print_rule has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (11 pts), boolean chains 5, ternaries 1 (3 pts) (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/mosaic/lowering.py"},"region":{"startLine":5968}}}],"partialFingerprints":{"codehealthFindingId/v1":"39b3b5413160e91ae762fec02770bdda257c61464282f55b0fa5afad396105cb"}},{"ruleId":"D2","level":"warning","message":{"text":"bessel._yn_first_quadrant (cognitive 19): bessel._yn_first_quadrant has cognitive complexity 19 (threshold 15). Drivers by points: if/else 9 (12 pts), ternaries 3 (5 pts), boolean chains 2 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/scipy/bessel.py"},"region":{"startLine":1389}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb0bed1dc8dc218a1cfc014a1af0eb7e03df28b3ec925380e91fc42e2cf021cc"}},{"ruleId":"D2","level":"warning","message":{"text":"linalg.eigh_tridiagonal (cognitive 19): linalg.eigh_tridiagonal has cognitive complexity 19 (threshold 15). Drivers by points: if/else 14 (17 pts), boolean chains 2 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/scipy/linalg.py"},"region":{"startLine":1736}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8746d273b4188e685d425e3ebb0389a01fe7f195fcaf0deab1938751c1b5ad8"}},{"ruleId":"D2","level":"warning","message":{"text":"primitives._addupdate_vmap (cognitive 19): primitives._addupdate_vmap has cognitive complexity 19 (threshold 15). Drivers by points: if/else 12 (15 pts), boolean chains 4 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/state/primitives.py"},"region":{"startLine":1075}}}],"partialFingerprints":{"codehealthFindingId/v1":"5cd89a742dfbc15bda985f09a9631116f34483fbc6bc457b4a8501f52464b619"}},{"ruleId":"D2","level":"warning","message":{"text":"xla_bridge._options_from_jax_configs (cognitive 19): xla_bridge._options_from_jax_configs has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (14 pts), loops 1 (2 pts), ternaries 1 (2 pts), boolean chains 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/xla_bridge.py"},"region":{"startLine":526}}}],"partialFingerprints":{"codehealthFindingId/v1":"e66d3efaf823aabb291390177b50dd4f330735c61ae00bd5d31a3d86f0831d10"}},{"ruleId":"D2","level":"warning","message":{"text":"pytree_serialization._set_up_destination (cognitive 19): pytree_serialization._set_up_destination has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (15 pts), boolean chains 4 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/array_serialization/pytree_serialization.py"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"8255c16dbae7b719f98ddd9fc720396ebdc574dda82530d013bb6f88dfe4f567"}},{"ruleId":"D2","level":"warning","message":{"text":"Tiling.tile_nested_shape_strides (cognitive 19): Tiling.tile_nested_shape_strides has cognitive complexity 19 (threshold 15). Drivers by points: if/else 4 (11 pts), loops 3 (6 pts), ternaries 2 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/mosaic/gpu/fragmented_array.py"},"region":{"startLine":193}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a57c1f3e3112fea77bc8ad528f05722cebb845f83dfe16dd2676d7a7c1b892f"}},{"ruleId":"D2","level":"warning","message":{"text":"hopper_matmul_mgpu.main (cognitive 19): hopper_matmul_mgpu.main has cognitive complexity 19 (threshold 15). Drivers by points: if/else 2 (7 pts), ternaries 2 (6 pts), error handling 1 (3 pts), loops 2 (3 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/pallas/ops/gpu/hopper_matmul_mgpu.py"},"region":{"startLine":275}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c3f21f28c72224deb2b626f87b2f86c035fbef3d31fcf31aa682f0ed89f9b78"}},{"ruleId":"D2","level":"warning","message":{"text":"hopper_mixed_type_matmul_mgpu.main (cognitive 19): hopper_mixed_type_matmul_mgpu.main has cognitive complexity 19 (threshold 15). Drivers by points: if/else 2 (7 pts), ternaries 2 (6 pts), error handling 1 (3 pts), loops 2 (3 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/pallas/ops/gpu/hopper_mixed_type_matmul_mgpu.py"},"region":{"startLine":278}}}],"partialFingerprints":{"codehealthFindingId/v1":"037faf1465d2ae33306e675e402e9d48cda1dfa5493396108b7dcfb9db4885d1"}},{"ruleId":"D2","level":"warning","message":{"text":"kernel.static_validate_inputs (cognitive 19): kernel.static_validate_inputs has cognitive complexity 19 (threshold 15). Drivers by points: if/else 11, boolean chains 8. To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/pallas/ops/tpu/ragged_paged_attention/kernel.py"},"region":{"startLine":216}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c1ed1cea050ac7fa11187af64e4fb106eb62dc17ee7b2282ceb721bb7d569bb"}},{"ruleId":"D2","level":"warning","message":{"text":"api.clear_backends (cognitive 18): api.clear_backends has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (12 pts), loops 2 (4 pts), error handling 1 (2 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/api.py"},"region":{"startLine":2911}}}],"partialFingerprints":{"codehealthFindingId/v1":"0007c8f8c8a215690dcaa29633607ff6353f0419392ec11cd506eaaae363ae2c"}},{"ruleId":"D2","level":"warning","message":{"text":"fused_attention_stablehlo.check_layout (cognitive 18): fused_attention_stablehlo.check_layout has cognitive complexity 18 (threshold 15). Drivers by points: if/else 12 (15 pts), boolean chains 2, ternaries 1 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/cudnn/fused_attention_stablehlo.py"},"region":{"startLine":275}}}],"partialFingerprints":{"codehealthFindingId/v1":"55695d368e13690078603cb29dd82cd928bdb30032033f65b16d514fe7e7fa4b"}},{"ruleId":"D2","level":"warning","message":{"text":"_export.to_named_sharding_with_abstract_mesh (cognitive 18): _export.to_named_sharding_with_abstract_mesh has cognitive complexity 18 (threshold 15). Drivers by points: if/else 10 (17 pts), boolean chains 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/export/_export.py"},"region":{"startLine":646}}}],"partialFingerprints":{"codehealthFindingId/v1":"b09e2c90ee6db952a832e9d4ab6fa66aefb9c1b19c27aa5396f12ebc61276892"}},{"ruleId":"D2","level":"warning","message":{"text":"mlir.jaxpr_subcomp (cognitive 18): mlir.jaxpr_subcomp has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (12 pts), boolean chains 3, loops 2 (3 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/interpreters/mlir.py"},"region":{"startLine":2242}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4af80c56ef55bb85134f3a2dcd012c707c587686a1ea6e5ee96b0a3eb71f10c"}},{"ruleId":"D2","level":"warning","message":{"text":"partial_eval.tracers_to_jaxpr (cognitive 18): partial_eval.tracers_to_jaxpr has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (12 pts), ternaries 1 (4 pts), boolean chains 1, loops 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/interpreters/partial_eval.py"},"region":{"startLine":581}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa45b762b5b8af230d3a811c351c7eca3b5197b6bb0b90f50007863eb7e02b29"}},{"ruleId":"D2","level":"warning","message":{"text":"pxla._concretize_abstract_out_shardings (cognitive 18): pxla._concretize_abstract_out_shardings has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (8 pts), ternaries 2 (8 pts), boolean chains 1, loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/interpreters/pxla.py"},"region":{"startLine":916}}}],"partialFingerprints":{"codehealthFindingId/v1":"46c98d6cc805004f227fcd1b7dfcbfaa7f34378d2ee86d43da3e30bcfb68b7cf"}},{"ruleId":"D2","level":"warning","message":{"text":"pxla._get_out_sharding_from_orig_sharding (cognitive 18): pxla._get_out_sharding_from_orig_sharding has cognitive complexity 18 (threshold 15). Drivers by points: error handling 2 (8 pts), if/else 4 (7 pts), boolean chains 2, loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/interpreters/pxla.py"},"region":{"startLine":1378}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8586fcc61d0a831e100dbdf7de78fa1cb39f1ea3580a4d628179efcbfb84327"}},{"ruleId":"D2","level":"warning","message":{"text":"loops.while_loop (cognitive 18): loops.while_loop has cognitive complexity 18 (threshold 15). Drivers by points: if/else 10, boolean chains 4, error handling 1 (2 pts), loops 1 (2 pts) (nesting depth added 2). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/lax/control_flow/loops.py"},"region":{"startLine":1677}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa75f39c1c3a3fddee9cd43ce32239994efd9a5a90251939a1b95b5c5a269706"}},{"ruleId":"D2","level":"warning","message":{"text":"solves._linear_solve_batching_rule (cognitive 18): solves._linear_solve_batching_rule has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (9 pts), boolean chains 4, ternaries 4, loops 1 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/lax/control_flow/solves.py"},"region":{"startLine":499}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ecf1d2c33744c64b7ce5a79787b29d455cc3c9303eb8806de56df9554ebd76f"}},{"ruleId":"D2","level":"warning","message":{"text":"lax._convert_element_type_unreduced_rule (cognitive 18): lax._convert_element_type_unreduced_rule has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (16 pts), boolean chains 2 (nesting depth added 10). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/lax/lax.py"},"region":{"startLine":6309}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a0c0b54cfe3d15b28f2cbef0ec4c68452bbbaf18fe6f479618ddb2057539dc9"}},{"ruleId":"D2","level":"warning","message":{"text":"lax._ragged_dot_general_shape_rule (cognitive 18): lax._ragged_dot_general_shape_rule has cognitive complexity 18 (threshold 15). Drivers by points: if/else 10 (15 pts), boolean chains 2, match/switch 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/lax/lax.py"},"region":{"startLine":7732}}}],"partialFingerprints":{"codehealthFindingId/v1":"30b08dd1bb0856a7e2424150dda907c32401a0094c1679578e0fcb146e8000aa"}},{"ruleId":"D2","level":"warning","message":{"text":"lax._split_on_one_axis (cognitive 18): lax._split_on_one_axis has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (13 pts), loops 2 (4 pts), boolean chains 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/lax/lax.py"},"region":{"startLine":9356}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff7fee737ceb04f649fd065c6d57598f0621f579a7ffd553ada731637b0b6c44"}},{"ruleId":"D2","level":"warning","message":{"text":"lax._select_transpose_rule (cognitive 18): lax._select_transpose_rule has cognitive complexity 18 (threshold 15). Drivers by points: ternaries 5 (13 pts), if/else 4 (5 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/lax/lax.py"},"region":{"startLine":9973}}}],"partialFingerprints":{"codehealthFindingId/v1":"34b8cc3253f7f35a6e5b8500a1dc18a71f4faa226b8ae2f2bcb817a3ed0b6f24"}},{"ruleId":"D2","level":"warning","message":{"text":"setops._in1d (cognitive 18): setops._in1d has cognitive complexity 18 (threshold 15). Drivers by points: if/else 11 (15 pts), ternaries 1 (2 pts), boolean chains 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/numpy/setops.py"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"f342dfe344cb96724da7489cb6775d3ef103b49b33c859a668be8ec9724a4893"}},{"ruleId":"D2","level":"warning","message":{"text":"einshape.get_einshape_transforms (cognitive 18): einshape.get_einshape_transforms has cognitive complexity 18 (threshold 15). Drivers by points: if/else 10 (15 pts), loops 3 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/einshape.py"},"region":{"startLine":217}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b7892cc1710228a14d63f5e95759ad0be11ae27764a5ab36da9e0b509d9f29f"}},{"ruleId":"D2","level":"warning","message":{"text":"shard_map_fusion.fuse_shard_map_jaxpr (cognitive 18): shard_map_fusion.fuse_shard_map_jaxpr has cognitive complexity 18 (threshold 15). Drivers by points: if/else 11 (14 pts), boolean chains 2, loops 2 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/fuser/shard_map_fusion.py"},"region":{"startLine":219}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b8d96d2f71ffe828fbc492cc59d3b2aab497466eb8eca21de5a28b9750491bc"}},{"ruleId":"D2","level":"warning","message":{"text":"RaceDetectionState.check_write (cognitive 18): RaceDetectionState.check_write has cognitive complexity 18 (threshold 15). Drivers by points: if/else 10 (16 pts), loops 2 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/mosaic/interpret/race_detection_state.py"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc2c853e83704ed29ea0dae5ffbe6d9e211cbc4057ce4632fcb34c89eb2c48a4"}},{"ruleId":"D2","level":"warning","message":{"text":"pipeline._normalize_buffer_count (cognitive 18): pipeline._normalize_buffer_count has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (7 pts), ternaries 2 (6 pts), boolean chains 5 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/mosaic/pipeline.py"},"region":{"startLine":304}}}],"partialFingerprints":{"codehealthFindingId/v1":"891679450fbdf6d8dc0c35cd769a4c9cbfd2cee026a5b06159e09343e4b95ad3"}},{"ruleId":"D2","level":"warning","message":{"text":"sc_lowering._dma_start_lowering_rule (cognitive 18): sc_lowering._dma_start_lowering_rule has cognitive complexity 18 (threshold 15). Drivers by points: if/else 10 (13 pts), boolean chains 5 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/mosaic/sc_lowering.py"},"region":{"startLine":637}}}],"partialFingerprints":{"codehealthFindingId/v1":"df540418530cdb8b0784b14379a41b3dbaa715432366649326432453cac1d6c8"}},{"ruleId":"D2","level":"warning","message":{"text":"sc_lowering._extract_indirect_offsets_from_indices (cognitive 18): sc_lowering._extract_indirect_offsets_from_indices has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (14 pts), boolean chains 3, match/switch 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/mosaic/sc_lowering.py"},"region":{"startLine":860}}}],"partialFingerprints":{"codehealthFindingId/v1":"70b4439cedcc4d6a7123cd82a267f8ec6974699c7e8a9d2882a3837d1cebe5cd"}},{"ruleId":"D2","level":"warning","message":{"text":"GPURaceDetectionState._check_ref_union (cognitive 18): GPURaceDetectionState._check_ref_union has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9 (14 pts), boolean chains 3, loops 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/mosaic_gpu/interpret/race_detection_state.py"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ebb45283b24ecc886b5f716d4c23cf6cad2ba6f4c47f1947645209a1ec37a22"}},{"ruleId":"D2","level":"warning","message":{"text":"Barrier.arrive (cognitive 18): Barrier.arrive has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9 (14 pts), boolean chains 2, loops 1 (2 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/mosaic_gpu/interpret/shared_memory.py"},"region":{"startLine":1310}}}],"partialFingerprints":{"codehealthFindingId/v1":"41eb4da7c08ae779149a5423d04cad3ac11b0fc384e60530bb57581f07e14d3b"}},{"ruleId":"D2","level":"warning","message":{"text":"lowering.merge_indexers (cognitive 18): lowering.merge_indexers has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (15 pts), loops 2 (3 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/mosaic_gpu/lowering.py"},"region":{"startLine":4414}}}],"partialFingerprints":{"codehealthFindingId/v1":"76bc21ef910ceff3c6d1561b66c9c73b46de66c6910240842d2adcce6ed36429"}},{"ruleId":"D2","level":"warning","message":{"text":"primitives._tcgen05_mma_abstract_eval (cognitive 18): primitives._tcgen05_mma_abstract_eval has cognitive complexity 18 (threshold 15). Drivers by points: if/else 11 (16 pts), boolean chains 2 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/mosaic_gpu/primitives.py"},"region":{"startLine":2763}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a4e0feea183f952d2ed8ec5615dad75c2e95687138b3133722a0140581c1cc9"}},{"ruleId":"D2","level":"warning","message":{"text":"pjit.pjit_check_aval_sharding (cognitive 18): pjit.pjit_check_aval_sharding has cognitive complexity 18 (threshold 15). Drivers by points: if/else 4 (8 pts), error handling 2 (5 pts), boolean chains 2, ternaries 1 (2 pts), loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pjit.py"},"region":{"startLine":839}}}],"partialFingerprints":{"codehealthFindingId/v1":"3bbc5b3d8be4ab31a7f3fb716f136999edaafe0bc186d802ef5f0dcfc25d2e31"}},{"ruleId":"D2","level":"warning","message":{"text":"pjit._lower_shaped_reshard (cognitive 18): pjit._lower_shaped_reshard has cognitive complexity 18 (threshold 15). Drivers by points: if/else 11 (14 pts), boolean chains 3, ternaries 1 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pjit.py"},"region":{"startLine":2368}}}],"partialFingerprints":{"codehealthFindingId/v1":"840ddbfe29aa35767570bac5061acb46e280b04d65d8cc45cedfc321dbe770b0"}},{"ruleId":"D2","level":"warning","message":{"text":"pmap._get_in_axes_flat (cognitive 18): pmap._get_in_axes_flat has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (11 pts), boolean chains 5, error handling 1 (2 pts) (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pmap.py"},"region":{"startLine":561}}}],"partialFingerprints":{"codehealthFindingId/v1":"069207029dba1c64ab8e12a1bc4d2b8ca8c604c48b17677a417f6edbceb9f10f"}},{"ruleId":"D2","level":"warning","message":{"text":"Executable.as_text (cognitive 18): Executable.as_text has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (12 pts), error handling 2 (4 pts), boolean chains 2 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/stages.py"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"b88e7c36097272f5f45c1b9347a50728a018b3ccb9cd0ac42405159e837a9cd2"}},{"ruleId":"D2","level":"warning","message":{"text":"discharge._addupdate_discharge (cognitive 18): discharge._addupdate_discharge has cognitive complexity 18 (threshold 15). Drivers by points: if/else 12 (16 pts), loops 1, ternaries 1 (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/state/discharge.py"},"region":{"startLine":692}}}],"partialFingerprints":{"codehealthFindingId/v1":"41220905b79e6c7faafa7a72e6a23a97fc01680cea0a89a969296477d9a2d751"}},{"ruleId":"D2","level":"warning","message":{"text":"primitives._get_vmap (cognitive 18): primitives._get_vmap has cognitive complexity 18 (threshold 15). Drivers by points: if/else 10 (14 pts), boolean chains 4 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/state/primitives.py"},"region":{"startLine":908}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd550c38c6ff2f2ae6b74d56e5b6348fe772cbcc65b5398ce76e3107ada8b580"}},{"ruleId":"D2","level":"warning","message":{"text":"thunky._lower_call_jax (cognitive 18): thunky._lower_call_jax has cognitive complexity 18 (threshold 15). Drivers by points: if/else 4 (8 pts), ternaries 2 (6 pts), loops 2, boolean chains 1, error handling 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/thunky/thunky.py"},"region":{"startLine":1468}}}],"partialFingerprints":{"codehealthFindingId/v1":"c84054a8514bde9a9427ef225885a55aa8bcc1fe0073ad1a1159da28201fc682"}},{"ruleId":"D2","level":"warning","message":{"text":"thunky._call_thunky_discharge_rule (cognitive 18): thunky._call_thunky_discharge_rule has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (9 pts), ternaries 2 (4 pts), loops 3, boolean chains 2 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/thunky/thunky.py"},"region":{"startLine":2060}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6aa7dc4d9b88bc685075c630c5d848948c98c3be176b1421ecc3bd15f254cb5"}},{"ruleId":"D2","level":"warning","message":{"text":"constraints._reduce_system_once (cognitive 18): constraints._reduce_system_once has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (12 pts), match/switch 2 (5 pts), loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/mosaic/gpu/constraints.py"},"region":{"startLine":1470}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e1120235fdde4a7d241ad72d672d801dfcd3b1733e19d287dff5628bace50e8"}},{"ruleId":"D2","level":"warning","message":{"text":"tcgen05._store_32xcols_native (cognitive 18): tcgen05._store_32xcols_native has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (13 pts), loops 2 (4 pts), boolean chains 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/mosaic/gpu/tcgen05.py"},"region":{"startLine":1742}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b85af0eef6d5f1512d21be5b5268d7644787c11f6c31b61614fb6c5f1259682"}},{"ruleId":"D2","level":"warning","message":{"text":"splash_attention_mask_info._process_dynamic_mask (cognitive 18): splash_attention_mask_info._process_dynamic_mask has cognitive complexity 18 (threshold 15). Drivers by points: if/else 11 (13 pts), loops 2 (3 pts), ternaries 1 (2 pts) (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/pallas/ops/tpu/splash_attention/splash_attention_mask_info.py"},"region":{"startLine":316}}}],"partialFingerprints":{"codehealthFindingId/v1":"38fbe3623eb7b371d7b1547703af2ffef4a2c71515d7639eeee427dc6d0827bb"}},{"ruleId":"D2","level":"warning","message":{"text":"build_utils.create_wheel_sources_map (cognitive 18): build_utils.create_wheel_sources_map has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (15 pts), loops 2 (3 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jaxlib/tools/build_utils.py"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"1df6446f01e19ee160decf6bca53309e54549c4a15735a32207b3f7acd01c420"}},{"ruleId":"D2","level":"warning","message":{"text":"api._mapped_axis_size (cognitive 17): api._mapped_axis_size has cognitive complexity 17 (threshold 15). Drivers by points: if/else 12 (14 pts), error handling 1, loops 1, ternaries 1 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/api.py"},"region":{"startLine":1313}}}],"partialFingerprints":{"codehealthFindingId/v1":"37afde55557328de51ed59790c0b5bc04b6894127d5213186d16609f6adb5111"}},{"ruleId":"D2","level":"warning","message":{"text":"api._lift_linearized (cognitive 17): api._lift_linearized has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (14 pts), boolean chains 1, loops 1, ternaries 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/api.py"},"region":{"startLine":1594}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc3aa429224de93d7e5fdaecc3e9ae365885b6abe89f4667decb63c5d0d590c5"}},{"ruleId":"D2","level":"warning","message":{"text":"compiler.backend_compile_and_load (cognitive 17): compiler.backend_compile_and_load has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (12 pts), boolean chains 2, loops 1 (2 pts), error handling 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/compiler.py"},"region":{"startLine":342}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb2beae1d840fc20c257ef7210c73534089e8331ce1e9767a00969ee44b477db"}},{"ruleId":"D2","level":"warning","message":{"text":"fused_attention_stablehlo._dot_product_attention_bwd_batcher (cognitive 17): fused_attention_stablehlo._dot_product_attention_bwd_batcher has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9 (11 pts), boolean chains 3, ternaries 2 (3 pts) (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/cudnn/fused_attention_stablehlo.py"},"region":{"startLine":943}}}],"partialFingerprints":{"codehealthFindingId/v1":"63280e550c3ab936793b8bd417262592c6aac40c6190424df4cdfb964d925df2"}},{"ruleId":"D2","level":"warning","message":{"text":"custom_derivatives._flatten_jvp (cognitive 17): custom_derivatives._flatten_jvp has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9 (14 pts), boolean chains 1, error handling 1, ternaries 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/custom_derivatives.py"},"region":{"startLine":303}}}],"partialFingerprints":{"codehealthFindingId/v1":"462393cdf4656bc99e8b66175b2d14970ae15042541451dc04ef33eb15e9ef8f"}},{"ruleId":"D2","level":"warning","message":{"text":"dtypes.dtype (cognitive 17): dtypes.dtype has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9 (12 pts), boolean chains 3, error handling 1 (2 pts) (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/dtypes.py"},"region":{"startLine":1035}}}],"partialFingerprints":{"codehealthFindingId/v1":"b000a4a45c31b70897261c1d8551862784ed260d6ce1e8ecb3c21f4880702767"}},{"ruleId":"D2","level":"warning","message":{"text":"_export._call_exported_abstract_eval (cognitive 17): _export._call_exported_abstract_eval has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (13 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/export/_export.py"},"region":{"startLine":1401}}}],"partialFingerprints":{"codehealthFindingId/v1":"5fe665b764dd03ccbe2d71794f135826862e67163bed0d652d92a809864bdbce"}},{"ruleId":"D2","level":"warning","message":{"text":"pxla.check_array_xla_sharding_layout_match (cognitive 17): pxla.check_array_xla_sharding_layout_match has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (12 pts), boolean chains 2, ternaries 1 (2 pts), loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/interpreters/pxla.py"},"region":{"startLine":2062}}}],"partialFingerprints":{"codehealthFindingId/v1":"98e2b9ece4e6a312e9833dff4fcd6b1b09156ac7c206fe31bc77add9418161af"}},{"ruleId":"D2","level":"warning","message":{"text":"_reduction_order._check_ring_args (cognitive 17): _reduction_order._check_ring_args has cognitive complexity 17 (threshold 15). Drivers by points: boolean chains 7, if/else 7, ternaries 3. To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/lax/_reduction_order.py"},"region":{"startLine":300}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ab471d378566333e822344d4619fa479404306e7f58f736c57cb5bc26e2cd32"}},{"ruleId":"D2","level":"warning","message":{"text":"fft.fft_abstract_eval (cognitive 17): fft.fft_abstract_eval has cognitive complexity 17 (threshold 15). Drivers by points: if/else 10 (16 pts), boolean chains 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/lax/fft.py"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e49a1ebc4653cfc264f4ef290754c93af2313f6559d406e4bd49ebc77f77766"}},{"ruleId":"D2","level":"warning","message":{"text":"einsum.einsum (cognitive 17): einsum.einsum has cognitive complexity 17 (threshold 15). Drivers by points: if/else 10 (11 pts), boolean chains 3, ternaries 3 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/numpy/einsum.py"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e39c8ee3946f0387baad086198690e536ea5cbf275221cf85ec0582a839e078"}},{"ruleId":"D2","level":"warning","message":{"text":"Semaphore.wait (cognitive 17): Semaphore.wait has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (15 pts), boolean chains 1, loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/mosaic/interpret/shared_memory.py"},"region":{"startLine":148}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ead3f7e17cb7a2ca4c2ce760875640ec67e5571da669c460d7aa16d430b75e2"}},{"ruleId":"D2","level":"warning","message":{"text":"sc_primitives._masked_cumop_lowering_rule (cognitive 17): sc_primitives._masked_cumop_lowering_rule has cognitive complexity 17 (threshold 15). Drivers by points: ternaries 5 (10 pts), if/else 4 (5 pts), boolean chains 1, match/switch 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/mosaic/sc_primitives.py"},"region":{"startLine":596}}}],"partialFingerprints":{"codehealthFindingId/v1":"6db2dcb4130182db514d09c350997187712e7c31e8ea806397727be58745e28e"}},{"ruleId":"D2","level":"warning","message":{"text":"UntilingTransform.commute_ndindexer (cognitive 17): UntilingTransform.commute_ndindexer has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (10 pts), boolean chains 4, match/switch 1 (2 pts), loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/mosaic_gpu/core.py"},"region":{"startLine":875}}}],"partialFingerprints":{"codehealthFindingId/v1":"a313366302935d29592811ac87922e14e2126db887df872132d9027e6bdd0e3b"}},{"ruleId":"D2","level":"warning","message":{"text":"lowering._ndindexer_indices (cognitive 17): lowering._ndindexer_indices has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (9 pts), boolean chains 4, ternaries 1 (3 pts), loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/mosaic_gpu/lowering.py"},"region":{"startLine":1831}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5a83b959b48947f6d4ab3ff2f9e82ba4fb6d1a5f786762613834f3a75b42cfc"}},{"ruleId":"D2","level":"warning","message":{"text":"primitives._copy_gmem_to_smem_abstract_eval (cognitive 17): primitives._copy_gmem_to_smem_abstract_eval has cognitive complexity 17 (threshold 15). Drivers by points: if/else 10 (14 pts), boolean chains 1, match/switch 1, ternaries 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/mosaic_gpu/primitives.py"},"region":{"startLine":836}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ee65c0c9e8b29c2ed51a1723190644595d126c6398385a9fc03b9937414a04d"}},{"ruleId":"D2","level":"warning","message":{"text":"primitives._async_prefetch_lowering (cognitive 17): primitives._async_prefetch_lowering has cognitive complexity 17 (threshold 15). Drivers by points: if/else 10 (16 pts), boolean chains 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/mosaic_gpu/primitives.py"},"region":{"startLine":1544}}}],"partialFingerprints":{"codehealthFindingId/v1":"603ea94c71b16c8e8ed1eb9c3222eaa2f35e1711691cfca2c2b891e8f67aaf07"}},{"ruleId":"D2","level":"warning","message":{"text":"pjit._pjit_batcher_for_sharding (cognitive 17): pjit._pjit_batcher_for_sharding has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9 (14 pts), boolean chains 3 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pjit.py"},"region":{"startLine":1530}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8f5083c0b65ed1584efb67ff8d405c659aeedee2f009b88a37929efc63b116f"}},{"ruleId":"D2","level":"warning","message":{"text":"bessel._jn_recur_from_asym (cognitive 17): bessel._jn_recur_from_asym has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (9 pts), ternaries 4, loops 1 (3 pts), boolean chains 1 (nesting depth added 3). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/scipy/bessel.py"},"region":{"startLine":615}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3d8b0c6d3542fd0256518306b542224e82159e043c87486fdbca116241f7094"}},{"ruleId":"D2","level":"warning","message":{"text":"serialization._get_cpu_device_map (cognitive 17): serialization._get_cpu_device_map has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (13 pts), loops 3 (4 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/colocated_python/serialization.py"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"89a94059cf2b88ed709ae400dfd3a06ee5a8c849c618c400d530bd7d9f7306cf"}},{"ruleId":"D2","level":"warning","message":{"text":"constraints.reduce_reshape_expression (cognitive 17): constraints.reduce_reshape_expression has cognitive complexity 17 (threshold 15). Drivers by points: if/else 3 (10 pts), loops 1 (3 pts), match/switch 2 (3 pts), boolean chains 1 (nesting depth added 10). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/mosaic/gpu/constraints.py"},"region":{"startLine":211}}}],"partialFingerprints":{"codehealthFindingId/v1":"b874c9c597a752c5cde8de45e33d34e9fe4244f69539c8a5acd5d13cf23c42e6"}},{"ruleId":"D2","level":"warning","message":{"text":"TiledLayout.__post_init__ (cognitive 17): TiledLayout.__post_init__ has cognitive complexity 17 (threshold 15). Drivers by points: if/else 10 (14 pts), ternaries 2, loops 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/mosaic/gpu/fragmented_array.py"},"region":{"startLine":372}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e3c3ba11195ff004dc550759620de9699f365d7918eab6e86a69aa289f85f8c"}},{"ruleId":"D2","level":"warning","message":{"text":"layout_inference.conjure_assignment (cognitive 17): layout_inference.conjure_assignment has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (10 pts), match/switch 2 (4 pts), loops 3 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/mosaic/gpu/layout_inference.py"},"region":{"startLine":483}}}],"partialFingerprints":{"codehealthFindingId/v1":"db4b37995c50a0f178984ee13225c0ce0fde54ef86da7ae5c0335761606ea4d9"}},{"ruleId":"D2","level":"warning","message":{"text":"layout_inference._tcgen05_mma_constraint_system (cognitive 17): layout_inference._tcgen05_mma_constraint_system has cognitive complexity 17 (threshold 15). Drivers by points: if/else 12 (16 pts), boolean chains 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/mosaic/gpu/layout_inference.py"},"region":{"startLine":1614}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4b200255606c84f71cc32183474d540e8ee4cc19b98f6c7dc22b014d131a0c9"}},{"ruleId":"D2","level":"warning","message":{"text":"tcgen05.commit_arrive (cognitive 17): tcgen05.commit_arrive has cognitive complexity 17 (threshold 15). Drivers by points: if/else 11 (15 pts), boolean chains 1, ternaries 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/mosaic/gpu/tcgen05.py"},"region":{"startLine":859}}}],"partialFingerprints":{"codehealthFindingId/v1":"fbc9bc23d818e8fa2e24e664500808ac2446ea610cafeaa74c06dcbeb588a87f"}},{"ruleId":"D2","level":"warning","message":{"text":"roofline._roofline_interpreter (cognitive 17): roofline._roofline_interpreter has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (10 pts), loops 2 (4 pts), ternaries 1 (2 pts), boolean chains 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/roofline/roofline.py"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"b02af8a39e8c4357ff1fdbc15d7a53d0a030bd5b49c6b99958c87bb43cf99dfe"}},{"ruleId":"D2","level":"warning","message":{"text":"rooflines._get_spatial_valid_position_count_for_one_dim (cognitive 17): rooflines._get_spatial_valid_position_count_for_one_dim has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (10 pts), boolean chains 4, loops 2 (3 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/roofline/rooflines.py"},"region":{"startLine":258}}}],"partialFingerprints":{"codehealthFindingId/v1":"f655bee80f1bd9326dc49fbe32cbd747762fd790e65d304a960eb815a5873100"}},{"ruleId":"D2","level":"warning","message":{"text":"rooflines._ppermute_roofline (cognitive 17): rooflines._ppermute_roofline has cognitive complexity 17 (threshold 15). Drivers by points: loops 3 (7 pts), if/else 3 (6 pts), ternaries 1 (4 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/roofline/rooflines.py"},"region":{"startLine":711}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe8f5b7b475e2fecc0986a067dcb07adc8cc94ccf2d5ae5e99458565a4bc073c"}},{"ruleId":"D2","level":"warning","message":{"text":"transform._add_sparse (cognitive 17): transform._add_sparse has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (14 pts), boolean chains 3 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/sparse/transform.py"},"region":{"startLine":645}}}],"partialFingerprints":{"codehealthFindingId/v1":"209a761da039db330ffa88cb4b7ff5e9bf2e26f263704ca36989194770a88a62"}},{"ruleId":"D2","level":"warning","message":{"text":"transform._mul_sparse (cognitive 17): transform._mul_sparse has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (15 pts), boolean chains 2 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/sparse/transform.py"},"region":{"startLine":692}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee98b319dcf2915da57d23120f283fff4ab5eb0f1e65a33028155e0580ddaede"}},{"ruleId":"D2","level":"warning","message":{"text":"api_util._non_static_arg_names (cognitive 16): api_util._non_static_arg_names has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (9 pts), ternaries 3 (4 pts), error handling 1 (2 pts), boolean chains 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/api_util.py"},"region":{"startLine":723}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb70f0dc2f4666cbc20ab9de26688ccae59ddd2f4b5e8c9378f786250fa5b472"}},{"ruleId":"D2","level":"warning","message":{"text":"K8sCluster.get_coordinator_address (cognitive 16): K8sCluster.get_coordinator_address has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (15 pts), boolean chains 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/clusters/k8s_cluster.py"},"region":{"startLine":179}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7b8e86f532121a713f92ee0333b07a65f531761c5f647870820ec4c7f2e82bb"}},{"ruleId":"D2","level":"warning","message":{"text":"core.get_mat (cognitive 16): core.get_mat has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (12 pts), ternaries 1 (2 pts), boolean chains 1, loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/core.py"},"region":{"startLine":2260}}}],"partialFingerprints":{"codehealthFindingId/v1":"844a0f145293153b4e91b60d80eb031b5730f9b64e2689db43935c423612e21f"}},{"ruleId":"D2","level":"warning","message":{"text":"SymbolicScope._process_explicit_constraint (cognitive 16): SymbolicScope._process_explicit_constraint has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (12 pts), boolean chains 4 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/export/shape_poly.py"},"region":{"startLine":1103}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3a5b16adf0a54d492753a7b232f81ebca5918a49bec107e70ac07b1c08c167d"}},{"ruleId":"D2","level":"warning","message":{"text":"mlir._find_manual_pallas_collective_ids (cognitive 16): mlir._find_manual_pallas_collective_ids has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (11 pts), loops 2 (4 pts), boolean chains 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/interpreters/mlir.py"},"region":{"startLine":809}}}],"partialFingerprints":{"codehealthFindingId/v1":"918c68da021052c0c926a4e92dc6b1e81ed7868c5d3fb0f556da1fe3f3b3e4a6"}},{"ruleId":"D2","level":"warning","message":{"text":"mlir.custom_call (cognitive 16): mlir.custom_call has cognitive complexity 16 (threshold 15). Drivers by points: if/else 10 (11 pts), ternaries 2 (4 pts), boolean chains 1 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/interpreters/mlir.py"},"region":{"startLine":3487}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d8520f85723eefa2230f50d79c90ff2af89360b812538370f88aea843d7f361"}},{"ruleId":"D2","level":"warning","message":{"text":"partial_eval.make_jaxpr_effects (cognitive 16): partial_eval.make_jaxpr_effects has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (13 pts), loops 2 (3 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/interpreters/partial_eval.py"},"region":{"startLine":1524}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed7b0a20b0e8f578fd53fa784ee4e05a1c1500cbb716b25d7ef299fd07aba721"}},{"ruleId":"D2","level":"warning","message":{"text":"jaxpr_util.jaxpr_and_binder_in_params (cognitive 16): jaxpr_util.jaxpr_and_binder_in_params has cognitive complexity 16 (threshold 15). Drivers by points: if/else 3 (11 pts), loops 2 (3 pts), ternaries 1 (2 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/jaxpr_util.py"},"region":{"startLine":284}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca0c5f6025ffdaefdc4f96f95f57ed2117ebc43fb4e45acbd06e38fb00d71d72"}},{"ruleId":"D2","level":"warning","message":{"text":"conditionals._cond_typecheck (cognitive 16): conditionals._cond_typecheck has cognitive complexity 16 (threshold 15). Drivers by points: if/else 10 (14 pts), boolean chains 1, loops 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/lax/control_flow/conditionals.py"},"region":{"startLine":999}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7629b615e3421e54266e2e1bd93e6fe5199aefb0a61119be9fff6357e7bc58f"}},{"ruleId":"D2","level":"warning","message":{"text":"loops._while_loop_batching_rule (cognitive 16): loops._while_loop_batching_rule has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (10 pts), boolean chains 2, loops 2, ternaries 1 (2 pts) (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/lax/control_flow/loops.py"},"region":{"startLine":1921}}}],"partialFingerprints":{"codehealthFindingId/v1":"27a6856b9ec682b1bc3aaf06ed3bbf4f9462ae47aefb59ecbcc55c4030df1df7"}},{"ruleId":"D2","level":"warning","message":{"text":"lax.empty_like (cognitive 16): lax.empty_like has cognitive complexity 16 (threshold 15). Drivers by points: boolean chains 7, if/else 6 (7 pts), ternaries 2 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/lax/lax.py"},"region":{"startLine":4173}}}],"partialFingerprints":{"codehealthFindingId/v1":"88d3e348a40bcb25cbefdd0b6b571a377e9b2a6c9cae43029ffe91a3d888930b"}},{"ruleId":"D2","level":"warning","message":{"text":"lax._handle_dot_precision (cognitive 16): lax._handle_dot_precision has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (14 pts), boolean chains 2 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/lax/lax.py"},"region":{"startLine":7426}}}],"partialFingerprints":{"codehealthFindingId/v1":"d15e41145ddc5824f00ee4c01408a7d907a73a2b82e0802ad8f4d59f75060b7b"}},{"ruleId":"D2","level":"warning","message":{"text":"array_creation.full_like (cognitive 16): array_creation.full_like has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9 (11 pts), ternaries 2 (4 pts), boolean chains 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/numpy/array_creation.py"},"region":{"startLine":426}}}],"partialFingerprints":{"codehealthFindingId/v1":"80a83b2759407f8f8bbbb2b0f9fe712043a6ae0be97cecd6e5c41a27e9fba0e3"}},{"ruleId":"D2","level":"warning","message":{"text":"Nonzero.batch (cognitive 16): Nonzero.batch has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (12 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/numpy/hijax.py"},"region":{"startLine":356}}}],"partialFingerprints":{"codehealthFindingId/v1":"86b6405f7fdc2bef2aaed8c0e9a7efb1c1b8dd361b16b3eee3e4bd3537ef43c0"}},{"ruleId":"D2","level":"warning","message":{"text":"indexing._normalize_index (cognitive 16): indexing._normalize_index has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9 (12 pts), boolean chains 2, ternaries 1 (2 pts) (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/numpy/indexing.py"},"region":{"startLine":801}}}],"partialFingerprints":{"codehealthFindingId/v1":"82cc75119da4e86c7a7fbd15b14fde9cfd6e77035374dc51c76a3e6e84a5ef32"}},{"ruleId":"D2","level":"warning","message":{"text":"lax_numpy.histogramdd (cognitive 16): lax_numpy.histogramdd has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (7 pts), boolean chains 3, loops 2 (3 pts), ternaries 1 (2 pts), error handling 1 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/numpy/lax_numpy.py"},"region":{"startLine":1019}}}],"partialFingerprints":{"codehealthFindingId/v1":"55d6a4172cc13e8666651956cab6ca5fa1451c18a632df98e790b6a888709f29"}},{"ruleId":"D2","level":"warning","message":{"text":"lax_numpy.ravel_multi_index (cognitive 16): lax_numpy.ravel_multi_index has cognitive complexity 16 (threshold 15). Drivers by points: if/else 11 (14 pts), loops 2 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/numpy/lax_numpy.py"},"region":{"startLine":2085}}}],"partialFingerprints":{"codehealthFindingId/v1":"37c1bfed2a0d3ec544cee9cf13e1e4b7a8774033b0f33f94770bf40cc559ed4b"}},{"ruleId":"D2","level":"warning","message":{"text":"sc_lowering._prepare_dma_refs (cognitive 16): sc_lowering._prepare_dma_refs has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (12 pts), boolean chains 3, match/switch 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/mosaic/sc_lowering.py"},"region":{"startLine":507}}}],"partialFingerprints":{"codehealthFindingId/v1":"692f8f9a4f0649f61f04669e37c06024a4ccae710898864140dffe7a8d8f35bd"}},{"ruleId":"D2","level":"warning","message":{"text":"sc_lowering._sort_lowering_rule (cognitive 16): sc_lowering._sort_lowering_rule has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9 (14 pts), loops 2 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/mosaic/sc_lowering.py"},"region":{"startLine":1003}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1d32fdb2110bf988ce8ecf5359458c60aa8a48ce8aa6f1e32ed69bad6a74dab"}},{"ruleId":"D2","level":"warning","message":{"text":"jaxpr_interpret._get_barrier_allocation_key_from_inval (cognitive 16): jaxpr_interpret._get_barrier_allocation_key_from_inval has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (13 pts), loops 2 (3 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/mosaic_gpu/interpret/jaxpr_interpret.py"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb01c0eb0d3cea463e70530e68646128d884bc1f4e5fedcb09b18fd67f2a406e"}},{"ruleId":"D2","level":"warning","message":{"text":"primitives._extract_gmem_copy_params (cognitive 16): primitives._extract_gmem_copy_params has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (15 pts), loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/mosaic_gpu/primitives.py"},"region":{"startLine":486}}}],"partialFingerprints":{"codehealthFindingId/v1":"0411253830ae867c705f192f2d46ccd6a1b45d9ead477a8636be07b55d15daea"}},{"ruleId":"D2","level":"warning","message":{"text":"pallas_call_registration.pallas_call_lowering (cognitive 16): pallas_call_registration.pallas_call_lowering has cognitive complexity 16 (threshold 15). Drivers by points: if/else 10, ternaries 2 (3 pts), boolean chains 2, error handling 1 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/triton/pallas_call_registration.py"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"9350122227f1c97f6a2ae671b7f2410f3c56df582ebe38cc4f7451652a0de538"}},{"ruleId":"D2","level":"warning","message":{"text":"linalg.qr_multiply (cognitive 16): linalg.qr_multiply has cognitive complexity 16 (threshold 15). Drivers by points: if/else 12 (13 pts), ternaries 1 (2 pts), boolean chains 1 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level. This shape REPEATS in the file: one other method here (linalg.qr_multiply) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/scipy/linalg.py"},"region":{"startLine":1115}}}],"partialFingerprints":{"codehealthFindingId/v1":"129a71ca7f16013c6eecbd0e5de208a7ea2eac3a3fd92fde6c8aec66a57e4bd0"}},{"ruleId":"D2","level":"warning","message":{"text":"linalg.qr_multiply (cognitive 16): linalg.qr_multiply has cognitive complexity 16 (threshold 15). Drivers by points: if/else 12 (13 pts), ternaries 1 (2 pts), boolean chains 1 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level. This shape REPEATS in the file: one other method here (linalg.qr_multiply) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/scipy/linalg.py"},"region":{"startLine":1121}}}],"partialFingerprints":{"codehealthFindingId/v1":"feabbb33bd67119fd1584f8602889a120ab481cd72303562ca29842e49183d3a"}},{"ruleId":"D2","level":"warning","message":{"text":"shard_map._spec_rank_error (cognitive 16): shard_map._spec_rank_error has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (13 pts), boolean chains 2, loops 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/shard_map.py"},"region":{"startLine":572}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ddea9260a6f7e3196282787ae6c00959dd17c1730d545d75c9528778ace5746"}},{"ruleId":"D2","level":"warning","message":{"text":"indexing._pp_slice (cognitive 16): indexing._pp_slice has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (11 pts), ternaries 2 (5 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/state/indexing.py"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"42b58a187fe546ab866d7b209b53ea7e77791fd425b81bcfb513f79ad05774ab"}},{"ruleId":"D2","level":"warning","message":{"text":"thunky.all_to_all (cognitive 16): thunky.all_to_all has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (12 pts), boolean chains 3, ternaries 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/thunky/thunky.py"},"region":{"startLine":1108}}}],"partialFingerprints":{"codehealthFindingId/v1":"b37243d3fcb1d0d3b5b6e78aeb437a95f7e40b6b43c0ef49fe88854e7fa4e8ba"}},{"ruleId":"D2","level":"warning","message":{"text":"KeyReuseSignature.update_consumption (cognitive 16): KeyReuseSignature.update_consumption has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (11 pts), loops 4, boolean chains 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/key_reuse/_core.py"},"region":{"startLine":184}}}],"partialFingerprints":{"codehealthFindingId/v1":"9fb4d9f82c5ae00655c246af08c7e860f598d3ee52123116522f9f35864b043b"}},{"ruleId":"D2","level":"warning","message":{"text":"dialect_lowering._vector_load_op_lowering_rule (cognitive 16): dialect_lowering._vector_load_op_lowering_rule has cognitive complexity 16 (threshold 15). Drivers by points: if/else 10 (13 pts), boolean chains 2, ternaries 1 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/mosaic/gpu/dialect_lowering.py"},"region":{"startLine":395}}}],"partialFingerprints":{"codehealthFindingId/v1":"9af8154d548bea26f6648d9efd6629d5c81196a2da59de351092f395bbcfed06"}},{"ruleId":"D2","level":"warning","message":{"text":"FragmentedArray.load_strided (cognitive 16): FragmentedArray.load_strided has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (12 pts), loops 2 (4 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/mosaic/gpu/fragmented_array.py"},"region":{"startLine":1207}}}],"partialFingerprints":{"codehealthFindingId/v1":"be8a8c5c59882e9e5aa05ab54d9acee8954b9d8660f7e1f71ceb7ab698acc972"}},{"ruleId":"D2","level":"warning","message":{"text":"FragmentedArray.foreach (cognitive 16): FragmentedArray.foreach has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (12 pts), loops 2 (4 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/mosaic/gpu/fragmented_array.py"},"region":{"startLine":4068}}}],"partialFingerprints":{"codehealthFindingId/v1":"67383455c79c8709d4c0f9c2afa39903a488ca9dce0ae945a911b2b070003411"}},{"ruleId":"D2","level":"warning","message":{"text":"fragmented_array.tiled_copy_smem_gmem_layout (cognitive 16): fragmented_array.tiled_copy_smem_gmem_layout has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (10 pts), loops 2 (4 pts), boolean chains 2 (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/mosaic/gpu/fragmented_array.py"},"region":{"startLine":5899}}}],"partialFingerprints":{"codehealthFindingId/v1":"e49c89aa6664b52a0c58d94ed83ecb07f3e5bd6e180bacab69f8e274a0e129c3"}},{"ruleId":"D2","level":"warning","message":{"text":"fragmented_array.copy_tiled (cognitive 16): fragmented_array.copy_tiled has cognitive complexity 16 (threshold 15). Drivers by points: if/else 10 (15 pts), ternaries 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/mosaic/gpu/fragmented_array.py"},"region":{"startLine":5962}}}],"partialFingerprints":{"codehealthFindingId/v1":"41f61b1fc31b1db5385c81f3e39ff67cfe9a9b495d9c1509f6da15e06e463166"}},{"ruleId":"D2","level":"warning","message":{"text":"tcgen05.async_copy_scales_smem_to_tmem (cognitive 16): tcgen05.async_copy_scales_smem_to_tmem has cognitive complexity 16 (threshold 15). Drivers by points: if/else 11 (12 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 2). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/mosaic/gpu/tcgen05.py"},"region":{"startLine":1945}}}],"partialFingerprints":{"codehealthFindingId/v1":"d15c5dcfc255702690d561c039f44d28e5111336e2d83e505a0c587e34a9206b"}},{"ruleId":"D2","level":"warning","message":{"text":"utils.memref_reshape (cognitive 16): utils.memref_reshape has cognitive complexity 16 (threshold 15). Drivers by points: if/else 11 (14 pts), boolean chains 1, error handling 1 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/mosaic/gpu/utils.py"},"region":{"startLine":877}}}],"partialFingerprints":{"codehealthFindingId/v1":"d017ccbbba278ef676e725de485349bb97ec65ae3d9551a7266f238fd0bef3d2"}},{"ruleId":"D2","level":"warning","message":{"text":"utils.bitcast (cognitive 16): utils.bitcast has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9 (10 pts), boolean chains 6 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/mosaic/gpu/utils.py"},"region":{"startLine":2282}}}],"partialFingerprints":{"codehealthFindingId/v1":"e884342877d1980432eef2c1ae05a5af84e6eb3bd87aefef0085cae34d297cb7"}},{"ruleId":"D2","level":"warning","message":{"text":"multihost_utils._handle_array_process_allgather (cognitive 16): multihost_utils._handle_array_process_allgather has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (11 pts), ternaries 1 (3 pts), boolean chains 2 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/multihost_utils.py"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb3a63bb79e65e94ae1bc7398d9831c02048b988945e55cfc1393121e4c6eead"}},{"ruleId":"D2","level":"warning","message":{"text":"all_gather_mgpu.all_gather (cognitive 16): all_gather_mgpu.all_gather has cognitive complexity 16 (threshold 15). Drivers by points: if/else 11 (13 pts), loops 1 (2 pts), boolean chains 1 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/pallas/ops/gpu/all_gather_mgpu.py"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a0f61295b022f51df425ece9f5baa8324fe7022dcde0f947da91f2c6cd8e4b5"}},{"ruleId":"D2","level":"warning","message":{"text":"flash_attention.flash_attention (cognitive 16): flash_attention.flash_attention has cognitive complexity 16 (threshold 15). Drivers by points: if/else 11 (14 pts), boolean chains 2 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/pallas/ops/tpu/flash_attention.py"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a578940fe82d2ac84e8509db15afafaf0b34c945bddc70886e275f3dcd28c24"}},{"ruleId":"D2","level":"warning","message":{"text":"gmm.gmm (cognitive 16): gmm.gmm has cognitive complexity 16 (threshold 15). Drivers by points: if/else 13 (15 pts), boolean chains 1 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/pallas/ops/tpu/megablox/gmm.py"},"region":{"startLine":314}}}],"partialFingerprints":{"codehealthFindingId/v1":"af9fbb98c6b714fa7e3670d4ec90c3708507d55b58e5a0cfdab030025c25992e"}},{"ruleId":"D2","level":"warning","message":{"text":"bcoo.bcoo_slice (cognitive 16): bcoo.bcoo_slice has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9 (10 pts), ternaries 2 (4 pts), loops 2 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/sparse/bcoo.py"},"region":{"startLine":1960}}}],"partialFingerprints":{"codehealthFindingId/v1":"126067dede956bf381b64584182f9381b9b2f9d87d05def991f55065e4409533"}},{"ruleId":"D2","level":"warning","message":{"text":"bcoo.bcoo_dynamic_slice (cognitive 16): bcoo.bcoo_dynamic_slice has cognitive complexity 16 (threshold 15). Drivers by points: ternaries 5 (9 pts), if/else 5 (6 pts), loops 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/sparse/bcoo.py"},"region":{"startLine":2037}}}],"partialFingerprints":{"codehealthFindingId/v1":"540f2f32570f1637813a33326fa4abeaa01283623e9bcae71775447bdf737aa9"}},{"ruleId":"D2","level":"warning","message":{"text":"bcoo._bcoo_reduce_sum (cognitive 16): bcoo._bcoo_reduce_sum has cognitive complexity 16 (threshold 15). Drivers by points: if/else 11 (15 pts), loops 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/sparse/bcoo.py"},"region":{"startLine":2138}}}],"partialFingerprints":{"codehealthFindingId/v1":"2720e3570a1e582448085d59fa7a5819a2cbcf825518d7eec203e220a7010141"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: lax/lax.py: FileTooLong \u2014 7611 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 7111 over it, 15.22\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/lax/lax.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f49947b1825cd8f6252b352140d6d5c1378bac581a685b40a2fbe7a634fd646f"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: mosaic/lowering.py: FileTooLong \u2014 4939 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 4439 over it, 9.88\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/mosaic/lowering.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d4c64e5d9f80bebd21755bbb79975b506e82318bbc78b7e74afc687681d98ae"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: numpy/lax_numpy.py: FileTooLong \u2014 4431 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 3931 over it, 8.86\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/numpy/lax_numpy.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a91435d051d7f981e4b2e6df8d6f07df0547c01e3c6dc4ba1546200db623b171"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: mosaic_gpu/primitives.py: FileTooLong \u2014 4198 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 3698 over it, 8.40\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/mosaic_gpu/primitives.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9ecbd96be14167eba25c7b37c278741e1a5ae726f0d4d188571180809caad57"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: mosaic_gpu/lowering.py: FileTooLong \u2014 3630 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 3130 over it, 7.26\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/mosaic_gpu/lowering.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1ce89c5c8dfec579c39dd46c11b2b956d6fa2469f2cd21095cdd655db07ed3d"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: gpu/fragmented_array.py: FileTooLong \u2014 3495 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 2995 over it, 6.99\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/mosaic/gpu/fragmented_array.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"11e5cce09a6f043b051914e9caf994e50e84209efdf6ab6a9ebbd67fbe470b88"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: _src/core.py: FileTooLong \u2014 3047 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 2547 over it, 6.09\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/core.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b99ea78229b73e960c9e67cb8cddcc4261cffc5b6cbc1e1c4fc9cb5c579aa879"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: interpreters/mlir.py: FileTooLong \u2014 2659 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 2159 over it, 5.32\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/interpreters/mlir.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a4b6177031d131c0923692e840c040d8305719d37e1234330ee3378de9afde6"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: _src/pjit.py: FileTooLong \u2014 2569 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 2069 over it, 5.14\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pjit.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"842cb9d1e73cc6823a3a0ad4f2a109a941d67632de50c40df652d2eb8332caeb"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: lax/slicing.py: FileTooLong \u2014 2407 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 1907 over it, 4.81\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/lax/slicing.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9cd25a76f76dbc2350232624b7966d793674bc5c5d7dcadecd2e302aaa831a0b"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: triton/lowering.py: FileTooLong \u2014 2407 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 1907 over it, 4.81\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/triton/lowering.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0d5626e892b5fe8278cd13a283f50742fe3999ce9d00d3841f0b78bcc0dea9e"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: control_flow/loops.py: FileTooLong \u2014 2309 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 1809 over it, 4.62\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/lax/control_flow/loops.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b74e1c0831b36ae524da19c5454eee31a1d8b670aeb9092b81a07a4d712b7eda"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: lax/parallel.py: FileTooLong \u2014 2309 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 1809 over it, 4.62\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/lax/parallel.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c50af3f4c96c3a5140543794332d8d8a7c767dbe2ed145d518481fed1c4c498"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: gpu/dialect_lowering.py: FileTooLong \u2014 2256 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 1756 over it, 4.51\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/mosaic/gpu/dialect_lowering.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"bae58160deeedf8397f7f913198a7188931bf52d164d75bb8da1282fb6ab1586"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: mosaic/pipeline.py: FileTooLong \u2014 2159 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 1659 over it, 4.32\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/mosaic/pipeline.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe70d0ff1f7fb038716954c9a96b4bdd288c6f55c26253c2ddf9a0c0d13b1232"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: lax/linalg.py: FileTooLong \u2014 2156 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 1656 over it, 4.31\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/lax/linalg.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"75810719109d8400f197aa917e1854e77fc3b0c556139f66d3f55971ccc45924"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: gpu/layout_inference.py: FileTooLong \u2014 2123 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 1623 over it, 4.25\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/mosaic/gpu/layout_inference.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"88af4232cb37b283f21cc1d9accafbfe315c90f7850fa37eba2107c03e28c706"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: splash_attention/splash_attention_kernel.py: FileTooLong \u2014 2060 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 1560 over it, 4.12\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/pallas/ops/tpu/splash_attention/splash_attention_kernel.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"86a1d2f3bdd57f305c4d073e224fdf8964072f341f01743dc45ade723520c4ce"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: interpreters/partial_eval.py: FileTooLong \u2014 2001 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 1501 over it, 4.00\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/interpreters/partial_eval.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c860c37102d98225df5dc7df3985fb6245995e16746b2574324ae502410d9d0"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: _src/shard_map.py: FileTooLong \u2014 1970 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 1470 over it, 3.94\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/shard_map.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"02815586365a26ebb7bc676e8640dcb4c6b3ac98d574c1f59a2737a37ac0a267"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: random/core.py: FileTooLong \u2014 1925 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 1425 over it, 3.85\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/random/core.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc6ae22258a180c1bb2a898558a60377bcd00aa92a37d3ed42b01ab9012f8595"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: gpu/utils.py: FileTooLong \u2014 1880 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 1380 over it, 3.76\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/mosaic/gpu/utils.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"08015b5cb923c3fca4c1ff94d5252cbb2899cce834067ee6229b1d1f60b1d37d"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: interpret/interpret_pallas_call.py: FileTooLong \u2014 1829 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 1329 over it, 3.66\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/mosaic/interpret/interpret_pallas_call.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2233daaeefd02af47e1377168c79844967b64bf1ab6db211485c441ce1260479"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: numpy/ufuncs.py: FileTooLong \u2014 1819 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 1319 over it, 3.64\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/numpy/ufuncs.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa3e1f843deb8411d424bbeebc41a566d768a57500d7f5b8733d075b3d9bf7bf"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: _src/config.py: FileTooLong \u2014 1783 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 1283 over it, 3.57\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/config.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e56d25cb7af1b9c0e6316f3b1f9385ce00841fa3710cf222f0430f28b97ef893"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: scipy/bessel.py: FileTooLong \u2014 1754 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 1254 over it, 3.51\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/scipy/bessel.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"af9eccf259fb2b81ccc0bdac70f9bfcaf3b75bbb0c6888ae4bea726f40ee7deb"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: gpu/launch_context.py: FileTooLong \u2014 1734 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 1234 over it, 3.47\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/mosaic/gpu/launch_context.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7acfff1cb5f5f84028a8d93bb013b1d898206502c0ef34cdad72bbbb5ba13fa"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: thunky/thunky.py: FileTooLong \u2014 1715 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 1215 over it, 3.43\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/thunky/thunky.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d117f8237a6ed6597d55050be81c01d984b5935ae04299bc5233d133002c3048"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: numpy/reductions.py: FileTooLong \u2014 1712 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 1212 over it, 3.42\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/numpy/reductions.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"fcd19893edc9e351f0ee720db11aa9952969b72f6d81c5ce84a438c424d1b36e"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: interpreters/pxla.py: FileTooLong \u2014 1698 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 1198 over it, 3.40\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/interpreters/pxla.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1dc33b5b54e4dac63c7ad742e811c40e9c3e2ad7ebe39b593da4ca0b2a01faf2"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: interpret/gpu_callbacks.py: FileTooLong \u2014 1677 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 1177 over it, 3.35\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/mosaic_gpu/interpret/gpu_callbacks.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d816dd3df378bcfcf9ad403a39fd985991a2c70be4df0c3c1d837aec5ba5622"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: docs/autodidax.py: FileTooLong \u2014 1668 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 1168 over it, 3.34\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/autodidax.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b7bbf5832482c806a7b7a80d9094878f1cfa2a87e089ca0f769d753eda10077"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: gpu/tcgen05.py: FileTooLong \u2014 1645 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 1145 over it, 3.29\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/mosaic/gpu/tcgen05.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f805b23850d4513c05a1698e177b85a921c7c5031eb8d7a9fa557a60ba3cc701"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: cudnn/fused_attention_stablehlo.py: FileTooLong \u2014 1641 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 1141 over it, 3.28\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/cudnn/fused_attention_stablehlo.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5dde07641c86eb764f7bf5f98f90fd5e7b27cb2b592f1045d4258ab293d13dd7"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: scipy/linalg.py: FileTooLong \u2014 1515 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 1015 over it, 3.03\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/scipy/linalg.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a114be111c249c23979e86ee35a235e4874ac81b578adbb68630ca8b5b30552a"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: _src/custom_derivatives.py: FileTooLong \u2014 1407 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 907 over it, 2.81\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/custom_derivatives.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"08bcc19972f4b6af08ce09ab36894af8a4a4a0afc0be61809fe47850c130a6b9"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: export/shape_poly.py: FileTooLong \u2014 1405 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 905 over it, 2.81\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/export/shape_poly.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0654b814fd7b3417257a2336dc707321daef04fcaa675d4af623c9551b5f9196"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: _src/api.py: FileTooLong \u2014 1362 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 862 over it, 2.72\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/api.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6074e2b880749a16c5ed9eced4c5e865c512e79778ea7c1cab534574befd057c"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: tpu/flash_attention.py: FileTooLong \u2014 1322 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 822 over it, 2.64\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/pallas/ops/tpu/flash_attention.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"79650b956c6aa8d208e68c70b3c9262119e8e2b0083deec5c30adfa0079f25dd"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: _src/hijax.py: FileTooLong \u2014 1274 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 774 over it, 2.55\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/hijax.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"affd96c91db7b9a695bb1e5d660fb6077e282194e544a2814d850fa86a8cfcdc"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: scipy/special.py: FileTooLong \u2014 1221 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 721 over it, 2.44\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/scipy/special.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c52c60ae889b880cdb0c483976b8200ca164090a88f6f4c9c4b1bd653deb8cca"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: pallas/core.py: FileTooLong \u2014 1215 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 715 over it, 2.43\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/core.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c163959f7a2014077a88aae8325bc5a9883e6b2a25e8cb8c0905cd85ea10e4f0"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: lax/erf.py: FileTooLong \u2014 1170 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 670 over it, 2.34\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/lax/erf.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"504efc00636e8704463d2211bcc734106c693900dc9f2d779e5b9589d21f15fc"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: interpret/jaxpr_interpret.py: FileTooLong \u2014 1165 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 665 over it, 2.33\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/mosaic_gpu/interpret/jaxpr_interpret.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"573c0b7f9f4170aca56d598110b46997f4fdb03d102ac105043b12e11d307653"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: numpy/indexing.py: FileTooLong \u2014 1138 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 638 over it, 2.28\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/numpy/indexing.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7eb51427beeeadd4f4728656dd7fd94afe2c3d445ec09c3110dfb2b9b952811"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: mosaic_gpu/core.py: FileTooLong \u2014 1135 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 635 over it, 2.27\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/mosaic_gpu/core.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c8a16c572041c039c42b57d277533d1785aa7b5ffd801bd3ddec854ebfb9dfd"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: gpu/core.py: FileTooLong \u2014 1133 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 633 over it, 2.27\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/mosaic/gpu/core.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"78c483a985566a2581d4a370660d3677d0811b5fd3df72aaef59ff9c4581b5d5"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: numpy/linalg.py: FileTooLong \u2014 1108 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 608 over it, 2.22\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/numpy/linalg.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8c278b841cdc361b68eb7ead03c8774b5771d2c1f7d8f467194245eced5c1c6"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: mosaic/primitives.py: FileTooLong \u2014 1090 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 590 over it, 2.18\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/mosaic/primitives.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"92083efb290dd0cd9a6bc0aed93a7743204f4d1eca3b5dd5351c6821e4e45f9c"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: gpu/constraints.py: FileTooLong \u2014 1078 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 578 over it, 2.16\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/mosaic/gpu/constraints.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a718cb8d953b0d1ec36aa25b0fb7bc268a7514bce6f7fa8eb5dc4cc60f8a5c4"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: interpret/shared_memory.py: FileTooLong \u2014 1046 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 546 over it, 2.09\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/mosaic_gpu/interpret/shared_memory.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"280c6f5b80b247ea36d8242c9ab39baaa94c2c1357f42cfd813b1f7cac41a585"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: export/_export.py: FileTooLong \u2014 1044 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 544 over it, 2.09\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/export/_export.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"69a60eda3fd6ff8689c017dc76b5426c411aeaeb57357671441f019599547ba3"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: interpreters/ad.py: FileTooLong \u2014 1034 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 534 over it, 2.07\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/interpreters/ad.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"50b3b99d3381d45b5c73645dca3877be95ed5715547bead77a7f579766ae3276"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: pallas/pallas_call.py: FileTooLong \u2014 1005 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 505 over it, 2.01\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/pallas_call.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"58da79c1094454da8212e34421e8739e5e83fc08a32faae188a2f506f9db0e76"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: _src/checkify.py: FileTooLong \u2014 996 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 496 over it, 1.99\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/checkify.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"eeef108cf3cc42cc3a9b049115aa34043045378a3da7f3e1a6a72e617ae8642f"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: control_flow/conditionals.py: FileTooLong \u2014 991 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 491 over it, 1.98\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/lax/control_flow/conditionals.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a594a3d99bf81d05cc1837156b396c490bd204924d07f7b455dd503fb7cdc754"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: _DimExpr: TooManyMethods \u2014 58 methods. The bar is 30 methods; this is 28 over it, 1.93\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/export/shape_poly.py"},"region":{"startLine":421}}}],"partialFingerprints":{"codehealthFindingId/v1":"748868faf21ff0ea9da4b9b06ce45599260f7fb936dd9f215db65486b7792fc0"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: numpy/array_methods.py: FileTooLong \u2014 928 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 428 over it, 1.86\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/numpy/array_methods.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f117d62c82e6ec85c0d47f4ff13bbfb83d811596526f87e67aaf931086a0f97c"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: sparse/bcoo.py: FileTooLong \u2014 928 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 428 over it, 1.86\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/sparse/bcoo.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"214c3a4323f07799324b13f7e225fd18e596590af15c6d2c0e6340a588dd0a42"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: _src/ad_checkpoint.py: FileTooLong \u2014 925 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 425 over it, 1.85\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/ad_checkpoint.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3ac3dae6f21ab727b17790b4664cfaf3e9c5fe8c43f221c432dc8400496280b"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: _src/tpu_custom_call.py: FileTooLong \u2014 915 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 415 over it, 1.83\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/tpu_custom_call.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"59b3dbdd17e6ffe405037b09f80b42ee168f80022c48b68be81a298ab5df78c0"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: pallas/mpmd.py: FileTooLong \u2014 914 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 414 over it, 1.83\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/mpmd.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b9cc18982ba003f176a3fd0b203dff6cd0cb26a893d79076ca3c41c5a885c1b"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: state/primitives.py: FileTooLong \u2014 891 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 391 over it, 1.78\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/state/primitives.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"46523030569e9828f2e2f154d438ef1e1341ddfee9cefd4c16ce63aa17a45f34"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: random/prng.py: FileTooLong \u2014 889 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 389 over it, 1.78\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/random/prng.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"cacb6b7b00d4b5309f4cd5bef8f0a282d1ecc192225a06fc17a38a6cb300ba0b"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: numpy/fft.py: FileTooLong \u2014 888 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 388 over it, 1.78\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/numpy/fft.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2aeed1ab5ec852cbc465a663c801e6a4d6f0bbcadca69cde8e7d776462f32fa9"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: mosaic/sc_primitives.py: FileTooLong \u2014 882 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 382 over it, 1.76\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/mosaic/sc_primitives.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b437e6bf4b685d4958f63109972a8c396ecc41f7a7caa26cc88960ca08bcc000"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: _src/array.py: FileTooLong \u2014 861 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 361 over it, 1.72\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/array.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a201e3dcaacc21113aec6f00efbd392093494c6be5be1283aa42cb2bac60b5e7"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: pallas/primitives.py: FileTooLong \u2014 855 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 355 over it, 1.71\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/primitives.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e455235e1bd6db33138ef46db47bada872da512b4149d9f6e385132538b39780"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: lax/windowed_reductions.py: FileTooLong \u2014 827 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 327 over it, 1.65\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/lax/windowed_reductions.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b906049d415e62130b4f5df827c70f85cbc6702fb89e4a1be71d81176e8cdb20"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: mosaic/sc_lowering.py: FileTooLong \u2014 825 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 325 over it, 1.65\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/mosaic/sc_lowering.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ec37486906c73bfdd134bdaebc98d872f44b5bf5cf2aa8ff98a4b53769d2df0"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: state/discharge.py: FileTooLong \u2014 794 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 294 over it, 1.59\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/state/discharge.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e0c64928a8e25d4cfd13e941cfa9afc6402ccf0adaa633bee4c6c2231aeac62"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: lax/lgamma.py: FileTooLong \u2014 789 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 289 over it, 1.58\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/lax/lgamma.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e820635cb88c5f598d26f3a9bc7d256c5fb7ff0be16d66b3e7d3c643794a4330"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: sparse/transform.py: FileTooLong \u2014 764 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 264 over it, 1.53\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/sparse/transform.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"21535b632aa7722edce2ad5bcbf5ea55cf80cf143172b34eacb42991f5eb8eea"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: _src/dtypes.py: FileTooLong \u2014 757 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 257 over it, 1.51\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/dtypes.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d987ddcd511891ff636907caa2db9ecf418b34aae8f98847eef588182c4636fa"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: _src/xla_bridge.py: FileTooLong \u2014 748 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 248 over it, 1.50\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/xla_bridge.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c20e8bbcd702e88dbe594666584cb39fc431a7e2c097647641c8b38d27d27d2"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: gpu/attention_mgpu.py: FileTooLong \u2014 733 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 233 over it, 1.47\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/pallas/ops/gpu/attention_mgpu.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2b2474d9299f7aab55361d51cc0e48cb60dbdccd1f8ffab2d7cf662878b137c"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: _src/debugging.py: FileTooLong \u2014 723 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 223 over it, 1.45\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/debugging.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b93864788a0b97c9d23c067011b4f5e86d8f27299cf40db92c9fa76b71552441"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: _src/stages.py: FileTooLong \u2014 722 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 222 over it, 1.44\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/stages.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4802c1a39af9f04a2180529529a3edcfe377481dccc5b3cb053b1fc819af2f85"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: lax/convolution.py: FileTooLong \u2014 707 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 207 over it, 1.41\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/lax/convolution.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"16fe8c980cf9000b08ba23709c1f9dbf27b96fde743d0a3b31e44de26f396481"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: _src/jaxpr_util.py: FileTooLong \u2014 700 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 200 over it, 1.40\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/jaxpr_util.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0971a951845459aad33918f3b0f870b06c5b28d3ea93b03c879f3943154e2f6"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: numpy/hijax.py: FileTooLong \u2014 700 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 200 over it, 1.40\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/numpy/hijax.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f89d8d5b281c47b89726b40928221c86942233a0d265beb4f6b1338be19d47d0"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: export/serialization.py: FileTooLong \u2014 695 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 195 over it, 1.39\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/export/serialization.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"188cea4960b6b610975c2288b627443597e5507a3a92fc1770188a12a652c3a8"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: ragged_paged_attention/kernel.py: FileTooLong \u2014 690 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 190 over it, 1.38\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/pallas/ops/tpu/ragged_paged_attention/kernel.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"40fabf1d67b789e5163259a6e1595186df3fb8519c8291220a848302e76cec76"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: interpreters/batching.py: FileTooLong \u2014 681 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 181 over it, 1.36\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/interpreters/batching.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"49343c5fd33f39da3328de4bdb49e41dc3309272a42e105e7080b9349966336b"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: splash_attention/splash_attention_mask_info.py: FileTooLong \u2014 657 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 157 over it, 1.31\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/pallas/ops/tpu/splash_attention/splash_attention_mask_info.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5de45dc58d126f8c6caef4d64ab822af6562aa8f51867903d2e12aa3a1b9a5cd"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: mosaic/pallas_call_registration.py: FileTooLong \u2014 643 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 143 over it, 1.29\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/mosaic/pallas_call_registration.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2b582a0471660d262ae466076340e80330581f3fa94caeb34f239e9a068f719"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: pallas/einshape.py: FileTooLong \u2014 620 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 120 over it, 1.24\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/einshape.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e24a2589c707f7b658a0a78f67c7c79916bfdddd1146f2325339cc4f3930569"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: _src/lax_reference.py: FileTooLong \u2014 618 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 118 over it, 1.24\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/lax_reference.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"035315384625129b5a7ae65a6694bddc1fde59450f45708dce99791c823f3bad"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: _src/tree_util.py: FileTooLong \u2014 617 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 117 over it, 1.23\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/tree_util.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"596cb56074c8f5bc8d54dc83e8b28e5da9e446cb707b844449e7130d788837c4"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: _src/dispatch.py: FileTooLong \u2014 602 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 102 over it, 1.20\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/dispatch.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"11a0a3d02120472f2152bc7f7fc41ea2c5a33d440ef7638179a9a760872ded57"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: mosaic_gpu/pipeline.py: FileTooLong \u2014 601 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 101 over it, 1.20\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/mosaic_gpu/pipeline.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"944362cd81edeab87d60258e06dd519034e9694e7e88405306c847b6669311e8"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: _src/sharding_impls.py: FileTooLong \u2014 600 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 100 over it, 1.20\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/sharding_impls.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b2a61966a2233a5db071d01dcf62572dbaf4e47ca22f4a14aa163cb71ce8395"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: _src/api_util.py: FileTooLong \u2014 598 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 98 over it, 1.20\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/api_util.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ddc1e3aae4b9ad83b13102816eda1cfae1ba2a2c7732b9dcc3c76b0fe924242"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: cudnn/scaled_matmul_stablehlo.py: FileTooLong \u2014 596 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 96 over it, 1.19\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/cudnn/scaled_matmul_stablehlo.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"27ead0576ef01645f3a215dfc6269abd0857d89790d4bc33846d55e3c893ac1f"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: interpret/shared_memory.py: FileTooLong \u2014 592 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 92 over it, 1.18\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/mosaic/interpret/shared_memory.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"860c71eb166dd72eaf16c327d40d61a254be33de455d9c5cb0174ef218044c9f"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Tracer: TooManyMethods \u2014 35 methods. The bar is 30 methods; this is 5 over it, 1.17\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/core.py"},"region":{"startLine":922}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d0539f560b549a7a5f2614f632752be6753888e13b7cb31bc667e00d5e44780"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: GPUSharedMemory: TooManyMethods \u2014 35 methods. The bar is 30 methods; this is 5 over it, 1.17\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/mosaic_gpu/interpret/shared_memory.py"},"region":{"startLine":440}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ec6af006814a301bf140e6043d484e18f5f5440451978f1a1c3cef382d75be9"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: _src/compiler.py: FileTooLong \u2014 581 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 81 over it, 1.16\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/compiler.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6b1b564c7a572d2577daef0a6f7922e21a96917633ad1b4e3206a4088a2666f"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: _src/callback.py: FileTooLong \u2014 573 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 73 over it, 1.15\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/callback.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b3e8268de0f45ce8cbd04a73301c5fd3d8f62699aa56d60d5cc78a50d5b1977"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: ArrayImpl: TooManyMethods \u2014 34 methods. The bar is 30 methods; this is 4 over it, 1.13\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/array.py"},"region":{"startLine":213}}}],"partialFingerprints":{"codehealthFindingId/v1":"2fa27fd24c3417416ddd929a12d90b90beb6bf72d5036f54d42a42a525efe85d"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: roofline/rooflines.py: FileTooLong \u2014 562 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 62 over it, 1.12\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/roofline/rooflines.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ef8d0adf1a7c8e4d104266f95b63300ce06f8ddf9546c3db6fc29e26d7ac78d"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: notebooks/shard_map.py: FileTooLong \u2014 557 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 57 over it, 1.11\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/notebooks/shard_map.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"623c453d0ece771056c4a6d3cf4d13dfe845d64ddd0cb47f933fe6cb35ebc312"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: scipy/betaln.py: FileTooLong \u2014 549 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 49 over it, 1.10\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/scipy/betaln.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f926537a71fe5a5d792bcb01521874ba945566a7314af47cbdb188fbea7ffa8"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: colocated_python/func.py: FileTooLong \u2014 544 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 44 over it, 1.09\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/colocated_python/func.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"226936c7f09fcee40c772498ba9d741c33d4bf1ad6f5da20ebe4c7fb3b44e02e"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: state/types.py: FileTooLong \u2014 542 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 42 over it, 1.08\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/state/types.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"45bd94a7503346c39adb3db4d00d9193513c799b4034e7e12bc76f6f70f565c8"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: paged_attention/paged_attention_kernel.py: FileTooLong \u2014 527 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 27 over it, 1.05\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/pallas/ops/tpu/paged_attention/paged_attention_kernel.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4cfe6ce9889571e2ad62448c856d4b503088c5f1b9df0691cfe528ffd8461b6"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: _src/util.py: FileTooLong \u2014 521 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 21 over it, 1.04\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/util.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"41787588bb850a9d1b4c19dbdd47eef6610b1aeac186e95e940916e00f6b0ab1"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: nn/functions.py: FileTooLong \u2014 518 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 18 over it, 1.04\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/nn/functions.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c18e66de2476bf63a3bdd1000600b31d6938aaac58cb17a16e1cf6612c2604c"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: scipy/signal.py: FileTooLong \u2014 516 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 16 over it, 1.03\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/scipy/signal.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0251cbf4c7d36f589e27e96a2dec2c62f2f7139ed47aaa9b0ec0801bff78aa0d"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: _src/tpu_info.py: FileTooLong \u2014 509 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 9 over it, 1.02\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/tpu_info.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6cb1d64338a1f824d7f84ae567cda0672229c9e9f387ff8de2dbeaf9755e06b5"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (83 shared lines): jax/experimental/pallas/ops/tpu/flash_attention.py:961-1143 | jax/experimental/pallas/ops/tpu/flash_attention.py:1306-1478 \u2014 These two members are variants of one another: 83 of their lines are already reported as duplicated blocks below, spread through both bodies rather than gathered into one. Read them as a single construct written twice. The repair is at the members\u0027 grain \u2014 factor the shared pipeline into one implementation the two call with their differences as parameters or as an injected step, or, where the difference is systematic (sync against async, one transport against another), generate one from the other. Extracting the individual blocks below is not the same fix: it leaves the two bodies in place and the next edit still has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/pallas/ops/tpu/flash_attention.py"},"region":{"startLine":961}}}],"partialFingerprints":{"codehealthFindingId/v1":"ccee99aef03ddbaedf15c69f87f8b942b1c5e1494d5d8aadf0a61baf8298bd76"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (80 shared lines): jax/experimental/pallas/ops/tpu/splash_attention/splash_attention_kernel.py:1439-1682 | jax/experimental/pallas/ops/tpu/splash_attention/splash_attention_kernel.py:1895-2253 \u2014 These two members are variants of one another: 80 of their lines are already reported as duplicated blocks below, spread through both bodies rather than gathered into one. Read them as a single construct written twice. The repair is at the members\u0027 grain \u2014 factor the shared pipeline into one implementation the two call with their differences as parameters or as an injected step, or, where the difference is systematic (sync against async, one transport against another), generate one from the other. Extracting the individual blocks below is not the same fix: it leaves the two bodies in place and the next edit still has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/pallas/ops/tpu/splash_attention/splash_attention_kernel.py"},"region":{"startLine":1439}}}],"partialFingerprints":{"codehealthFindingId/v1":"ceb9b71468913e60b951e4701e85bc3d2d3453ed2730def76ebc5065afd0bf57"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (79 shared lines): jax/experimental/pallas/ops/gpu/all_gather_mgpu.py:41-158 | jax/experimental/pallas/ops/gpu/reduce_scatter_mgpu.py:42-177 \u2014 These two members are variants of one another: 79 of their lines are already reported as duplicated blocks below, spread through both bodies rather than gathered into one. Read them as a single construct written twice. The repair is at the members\u0027 grain \u2014 factor the shared pipeline into one implementation the two call with their differences as parameters or as an injected step, or, where the difference is systematic (sync against async, one transport against another), generate one from the other. Extracting the individual blocks below is not the same fix: it leaves the two bodies in place and the next edit still has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/pallas/ops/gpu/all_gather_mgpu.py"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"5adf75aa95634509068a4958d0490990b6f93e1dd8660aac111ec1c7e809b1ca"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (70 shared lines): jax/_src/state/primitives.py:982-1072 | jax/_src/state/primitives.py:1076-1154 \u2014 These two members are variants of one another: 70 of their lines are already reported as duplicated blocks below, spread through both bodies rather than gathered into one. Read them as a single construct written twice. The repair is at the members\u0027 grain \u2014 factor the shared pipeline into one implementation the two call with their differences as parameters or as an injected step, or, where the difference is systematic (sync against async, one transport against another), generate one from the other. Extracting the individual blocks below is not the same fix: it leaves the two bodies in place and the next edit still has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/state/primitives.py"},"region":{"startLine":982}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e8ca4e77a27fa6817bfd501c09433c57de820ad3a07682e60c94d5e68fdff9c"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (70 shared lines): jax/experimental/pallas/ops/gpu/hopper_matmul_mgpu.py:65-229 | jax/experimental/pallas/ops/gpu/hopper_mixed_type_matmul_mgpu.py:60-266 \u2014 These two members are variants of one another: 70 of their lines are already reported as duplicated blocks below, spread through both bodies rather than gathered into one. Read them as a single construct written twice. The repair is at the members\u0027 grain \u2014 factor the shared pipeline into one implementation the two call with their differences as parameters or as an injected step, or, where the difference is systematic (sync against async, one transport against another), generate one from the other. Extracting the individual blocks below is not the same fix: it leaves the two bodies in place and the next edit still has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/pallas/ops/gpu/hopper_matmul_mgpu.py"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f3000021ec89889e7689f31b056480e6aa422569003445bb733fab9ec2e5e96"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (41 shared lines): jax/experimental/pallas/ops/gpu/all_gather_mgpu.py:162-221 | jax/experimental/pallas/ops/gpu/reduce_scatter_mgpu.py:181-243 \u2014 These two members are variants of one another: 41 of their lines are already reported as duplicated blocks below, spread through both bodies rather than gathered into one. Read them as a single construct written twice. The repair is at the members\u0027 grain \u2014 factor the shared pipeline into one implementation the two call with their differences as parameters or as an injected step, or, where the difference is systematic (sync against async, one transport against another), generate one from the other. Extracting the individual blocks below is not the same fix: it leaves the two bodies in place and the next edit still has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/pallas/ops/gpu/all_gather_mgpu.py"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"27afeeb327dc8f33948f9a149e84e9c0617f330c076dc5b37154a1da20b1a677"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): jax/_src/scipy/linalg.py:1581-1589 | jax/_src/scipy/linalg.py:1592-1602 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/scipy/linalg.py"},"region":{"startLine":1581}}}],"partialFingerprints":{"codehealthFindingId/v1":"232c6904d6fd2dfffa7a811190075b921c5c2a1be8bd85f5c013ae5ff32ad6ad"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (5 members, 50\u002B identical tokens): docs/_static/fault_tolerance/cancel_collectives.py:36-56 | docs/_static/fault_tolerance/collectives.py:30-46 | docs/_static/fault_tolerance/dont_fail.py:29-41 | docs/_static/fault_tolerance/live_devices.py:37-60 | docs/_static/fault_tolerance/while_loop.py:26-37 \u2014 These 5 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 5 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 5 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/_static/fault_tolerance/cancel_collectives.py"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc4c22dd099da1f73fcec7656f78b132390d8057d20540461cba5b2fdb067fcd"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (5 members, 50\u002B identical tokens): jax/_src/random/core.py:1992-2027 | jax/_src/random/core.py:2124-2159 | jax/_src/random/core.py:3482-3515 | jax/_src/random/core.py:3531-3564 | jax/_src/random/core.py:3891-3928 \u2014 These 5 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 5 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 5 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/random/core.py"},"region":{"startLine":1992}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f05271d74c9549b068b663629f1f52c68905034bccbd1b2c780cee17ecf4de4"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): jax/_src/compute_on.py:210-258 | jax/_src/lax/eval_jaxpr.py:56-80 | jax/_src/program_order.py:253-282 | jax/_src/xla_metadata.py:394-440 \u2014 These 4 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 4 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/compute_on.py"},"region":{"startLine":210}}}],"partialFingerprints":{"codehealthFindingId/v1":"172b82ace0f73c0d257c7d2255c79d063b058bbb38044949907e5b47a4b1c814"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): jax/_src/cudnn/fused_attention_stablehlo.py:883-941 | jax/_src/cudnn/fused_attention_stablehlo.py:946-1028 | jax/_src/cudnn/fused_attention_stablehlo.py:1722-1763 | jax/_src/cudnn/fused_attention_stablehlo.py:1767-1809 \u2014 These 4 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 4 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/cudnn/fused_attention_stablehlo.py"},"region":{"startLine":883}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2277dca70d0b6fa1c945c7f4dbb0b95b9f457bd34aba2ca6e71add8ff079e7b"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): jax/_src/lax/slicing.py:3183-3220 | jax/_src/lax/slicing.py:3226-3267 | jax/_src/lax/slicing.py:3394-3517 | jax/_src/lax/slicing.py:3646-3693 \u2014 These 4 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 4 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/lax/slicing.py"},"region":{"startLine":3183}}}],"partialFingerprints":{"codehealthFindingId/v1":"451cd38b0e051e6cd37b8b6fc625b9c8f608cc7b00abf45a63d45674665ec67b"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): jax/_src/pallas/mosaic/lowering.py:3695-3710 | jax/_src/pallas/mosaic/lowering.py:3717-3732 | jax/_src/pallas/mosaic/lowering.py:4053-4068 | jax/_src/pallas/mosaic/lowering.py:4075-4090 \u2014 These 4 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 4 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/mosaic/lowering.py"},"region":{"startLine":3695}}}],"partialFingerprints":{"codehealthFindingId/v1":"23406fa5740174460e66203d2ad5112bb797b7d5e82a9f880e2486d6c3f59686"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): jax/_src/pallas/mosaic_gpu/primitives.py:4311-4330 | jax/_src/pallas/mosaic_gpu/primitives.py:4343-4381 | jax/_src/pallas/mosaic_gpu/primitives.py:4446-4476 | jax/_src/pallas/mosaic_gpu/primitives.py:4489-4531 \u2014 These 4 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 4 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/mosaic_gpu/primitives.py"},"region":{"startLine":4311}}}],"partialFingerprints":{"codehealthFindingId/v1":"3be4f0f526a557369b0f38150610acd19a5d146a7b8e65e096802edac33090fa"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): jax/_src/scipy/fft.py:53-140 | jax/_src/scipy/fft.py:163-270 | jax/_src/scipy/fft.py:275-377 | jax/_src/scipy/fft.py:384-495 \u2014 These 4 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 4 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/scipy/fft.py"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"46362e05fbcb23be9ff5618d0889b70816be1b593b0f0bf5445508a507933ee9"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): jax/experimental/sparse/_lowerings.py:64-79 | jax/experimental/sparse/_lowerings.py:117-132 | jax/experimental/sparse/_lowerings.py:190-205 | jax/experimental/sparse/_lowerings.py:242-257 \u2014 These 4 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 4 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/sparse/_lowerings.py"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e806fd0d9615564833c1844400482895214dccfa6dd39f06352071b454fd706"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): jax/experimental/sparse/ad.py:82-105 | jax/experimental/sparse/ad.py:110-135 | jax/experimental/sparse/ad.py:140-158 | jax/experimental/sparse/ad.py:163-181 \u2014 These 4 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 4 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/sparse/ad.py"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3ad510c6395661fae855eb546fa2ffd70491713b6b7273a6683813eabe79d88"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (118 corresponding lines): jax/experimental/pallas/ops/tpu/flash_attention.py:819-938 | jax/experimental/pallas/ops/tpu/flash_attention.py:1167-1284 \u2014 These two members are one piece of code written twice and then edited apart: 118 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/pallas/ops/tpu/flash_attention.py"},"region":{"startLine":819}}}],"partialFingerprints":{"codehealthFindingId/v1":"e86a0a67966bc3266ee5c2b3e102f7adea874a5f2939a3192f3e13ebaaa6f786"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (75 corresponding lines): jax/experimental/pallas/ops/gpu/ragged_dot_mgpu.py:246-326 | jax/experimental/pallas/ops/gpu/transposed_ragged_dot_mgpu.py:226-300 \u2014 These two members are one piece of code written twice and then edited apart: 75 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/pallas/ops/gpu/ragged_dot_mgpu.py"},"region":{"startLine":246}}}],"partialFingerprints":{"codehealthFindingId/v1":"b54726718a8d110b5094b3d858db1f7ae2061c9302a2b1e45ab6a91b4d419b37"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (55 corresponding lines): jax/_src/scipy/bessel.py:1502-1565 | jax/_src/scipy/bessel.py:2464-2518 \u2014 These two members are one piece of code written twice and then edited apart: 55 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/scipy/bessel.py"},"region":{"startLine":1502}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c039d5e63892d69b0492654d6c78a520e7213aed974923782d67294bf1d14b1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (79 corresponding lines): jax/_src/cudnn/fused_attention_stablehlo.py:677-755 | jax/_src/cudnn/fused_attention_stablehlo.py:762-849 \u2014 These two members are one piece of code written twice and then edited apart: 79 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/cudnn/fused_attention_stablehlo.py"},"region":{"startLine":677}}}],"partialFingerprints":{"codehealthFindingId/v1":"653557002cb8e33a9be182becd576bd724479d8ec36b2c76701942319fb6fa63"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 57\u002B corresponding lines): jax/experimental/pallas/ops/gpu/blackwell_ragged_dot_mgpu.py:378-435 | jax/experimental/pallas/ops/gpu/hopper_matmul_mgpu.py:276-332 | jax/experimental/pallas/ops/gpu/hopper_mixed_type_matmul_mgpu.py:279-340 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 57 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/pallas/ops/gpu/blackwell_ragged_dot_mgpu.py"},"region":{"startLine":378}}}],"partialFingerprints":{"codehealthFindingId/v1":"af4593fd03b96b61ba56b2e8daf60441233d3681da1b60036dd5b2c2ef6c2834"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (44 corresponding lines): jax/_src/interpreters/partial_eval.py:216-259 | jax/_src/interpreters/partial_eval.py:262-306 \u2014 These two members are one piece of code written twice and then edited apart: 44 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/interpreters/partial_eval.py"},"region":{"startLine":216}}}],"partialFingerprints":{"codehealthFindingId/v1":"02ff04ad6ad80ae14b8abcc6df371451c45903895cdb9202e3cdb7d0bc9ebf1c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (58 corresponding lines): jax/_src/pallas/triton/lowering.py:2098-2167 | jax/_src/pallas/triton/lowering.py:2321-2378 \u2014 These two members are one piece of code written twice and then edited apart: 58 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/triton/lowering.py"},"region":{"startLine":2098}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8fbbe2c333c1dbedf1311788e39cae2f2f72e905779e394f256537fc25d0b4c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (26 corresponding lines): jax/_src/interpreters/ad.py:87-119 | jax/_src/interpreters/remat.py:140-165 \u2014 These two members are one piece of code written twice and then edited apart: 26 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/interpreters/ad.py"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"61d2197605ada1c08fef72e31e586025c9eee9dc70d1d3173fff77d60befb414"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (27 corresponding lines): jax/_src/interpreters/ad.py:591-617 | jax/_src/interpreters/ad.py:781-808 \u2014 These two members are one piece of code written twice and then edited apart: 27 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/interpreters/ad.py"},"region":{"startLine":591}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3c154f7c7b05c05e0ce907cb22788f6b7b9fd3b098a4ff5c13b1e3b9fa8365e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (37 corresponding lines): jax/_src/pallas/primitives.py:265-301 | jax/_src/pallas/primitives.py:388-432 \u2014 These two members are one piece of code written twice and then edited apart: 37 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/primitives.py"},"region":{"startLine":265}}}],"partialFingerprints":{"codehealthFindingId/v1":"bfb198ff91220ece79c443828385222d08673d3a442e53c7bd6391803fe177cf"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (36 corresponding lines): jax/_src/pallas/mosaic_gpu/primitives.py:5309-5351 | jax/_src/pallas/triton/primitives.py:315-350 \u2014 These two members are one piece of code written twice and then edited apart: 36 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/mosaic_gpu/primitives.py"},"region":{"startLine":5309}}}],"partialFingerprints":{"codehealthFindingId/v1":"43a3ed2fee45e36c2bd5b99a2ce043e8639815b8b775a81ba1c3345fad1c1a2b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (91 corresponding lines): jax/_src/pallas/mosaic/sc_lowering.py:646-753 | jax/_src/pallas/mosaic/sc_lowering.py:767-857 \u2014 These two members are one piece of code written twice and then edited apart: 91 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/mosaic/sc_lowering.py"},"region":{"startLine":646}}}],"partialFingerprints":{"codehealthFindingId/v1":"7324487c23e02b2e09bb3d1c5a3b533fa429146182cece60f4a59fe7b0152214"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (69 corresponding lines): jax/_src/pmap.py:780-864 | jax/_src/pmap.py:868-936 \u2014 These two members are one piece of code written twice and then edited apart: 69 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pmap.py"},"region":{"startLine":780}}}],"partialFingerprints":{"codehealthFindingId/v1":"eff640ef5611b7b72610eb12957aff247b75c7df9075975feecea4a6e6e585da"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (56 corresponding lines): jax/experimental/pallas/ops/tpu/splash_attention/splash_attention_mask_info.py:972-1028 | jax/experimental/pallas/ops/tpu/splash_attention/splash_attention_mask_info.py:1038-1093 \u2014 These two members are one piece of code written twice and then edited apart: 56 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/pallas/ops/tpu/splash_attention/splash_attention_mask_info.py"},"region":{"startLine":972}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8c68f5b333d8ea32f97c7e7cec531d4ed1c56b4ecfce9e5434a32aa63779b5f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (38 corresponding lines): jax/_src/interpreters/partial_eval.py:1876-1913 | jax/_src/interpreters/partial_eval.py:1920-1966 \u2014 These two members are one piece of code written twice and then edited apart: 38 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/interpreters/partial_eval.py"},"region":{"startLine":1876}}}],"partialFingerprints":{"codehealthFindingId/v1":"477564a994de5283026f1673b4d54531d9a21c7144758a8df8683b42b51efb93"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (23 corresponding lines): jax/_src/interpreters/partial_eval.py:2491-2513 | jax/_src/program_order.py:311-343 \u2014 These two members are one piece of code written twice and then edited apart: 23 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/interpreters/partial_eval.py"},"region":{"startLine":2491}}}],"partialFingerprints":{"codehealthFindingId/v1":"29adc2ceb551ab6b2c8cd7f9b8e966eca0e320dfd4e8703e2d898ad77c7133b8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (62 corresponding lines): jax/_src/pallas/mosaic/interpret/interpret_pallas_call.py:779-851 | jax/_src/pallas/mosaic/interpret/interpret_pallas_call.py:867-928 \u2014 These two members are one piece of code written twice and then edited apart: 62 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/mosaic/interpret/interpret_pallas_call.py"},"region":{"startLine":779}}}],"partialFingerprints":{"codehealthFindingId/v1":"3676593da99d6f64313535a9cd65a05c807152ef15923c3420868d583374c34a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (40 corresponding lines): jax/_src/pallas/mosaic/interpret/utils.py:157-196 | jax/_src/pallas/primitives.py:1206-1254 \u2014 These two members are one piece of code written twice and then edited apart: 40 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/mosaic/interpret/utils.py"},"region":{"startLine":157}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e6a54935baca87715a5626470943156747c1e8563521de5d14ebb6e4755932d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (30 corresponding lines): jax/_src/lax/lax.py:9467-9496 | jax/_src/lax/lax.py:9505-9541 \u2014 These two members are one piece of code written twice and then edited apart: 30 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/lax/lax.py"},"region":{"startLine":9467}}}],"partialFingerprints":{"codehealthFindingId/v1":"42a8f0bc79c49fc549d6bcf04bbb916173f098e5c66e8e242fa90d1d9125b7a9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 20\u002B corresponding lines): jax/_src/lax/special.py:435-474 | jax/_src/lax/special.py:621-640 | jax/_src/lax/special.py:643-663 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 20 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/lax/special.py"},"region":{"startLine":435}}}],"partialFingerprints":{"codehealthFindingId/v1":"0692db2ba400d4c3a6174574fc66b050bbe0dfcde50c91d514dfae49256f8bc6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): jax/_src/lax/convolution.py:756-774 | jax/_src/lax/lax.py:7303-7323 \u2014 These two members are one piece of code written twice and then edited apart: 19 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/lax/convolution.py"},"region":{"startLine":756}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e1c34f5047a05f1e0ca4b95f3b93f370a71e97be9e00274a95e0808d02d217d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (21 corresponding lines): jax/_src/ad_checkpoint.py:1089-1113 | jax/_src/ad_checkpoint.py:1144-1164 \u2014 These two members are one piece of code written twice and then edited apart: 21 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/ad_checkpoint.py"},"region":{"startLine":1089}}}],"partialFingerprints":{"codehealthFindingId/v1":"7463278aa693bf38ae1b3b6c63b185a20ee5527695e133e6f892f468ac9b3caf"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): jax/_src/lax/other.py:257-273 | jax/_src/lax/other.py:290-307 \u2014 These two members are one piece of code written twice and then edited apart: 17 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/lax/other.py"},"region":{"startLine":257}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b4193792632b8f4ca8e54872a447f969131f73ea965aa1aebf837cf56625f27"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (28 corresponding lines): jax/_src/pallas/triton/lowering.py:528-556 | jax/_src/pallas/triton/lowering.py:2603-2630 \u2014 These two members are one piece of code written twice and then edited apart: 28 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/triton/lowering.py"},"region":{"startLine":528}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f72ed6e8b21852de086b3f1cf07470196cdfe9d4c2709a85332c809cad07c7a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (20 corresponding lines): jax/_src/interpreters/partial_eval.py:439-458 | jax/_src/interpreters/partial_eval.py:464-483 \u2014 These two members are one piece of code written twice and then edited apart: 20 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/interpreters/partial_eval.py"},"region":{"startLine":439}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd97b04aced2b9a12acfbc9a1728e74e8f241e0238840ad396f00a025e58b508"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (44 corresponding lines): jax/_src/lax/lax.py:4098-4146 | jax/_src/lax/lax.py:4177-4220 \u2014 These two members are one piece of code written twice and then edited apart: 44 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/lax/lax.py"},"region":{"startLine":4098}}}],"partialFingerprints":{"codehealthFindingId/v1":"b80982d83908e18f3a1b290b1679d2ae6ac72c39ecc940745cba322b8aa92742"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (22 corresponding lines): jax/_src/cudnn/fused_attention_stablehlo.py:552-573 | jax/_src/cudnn/fused_attention_stablehlo.py:580-608 \u2014 These two members are one piece of code written twice and then edited apart: 22 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/cudnn/fused_attention_stablehlo.py"},"region":{"startLine":552}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6a36862f34074348511019560f563fdba28c6715e5ecbff596f3b9183bec476"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): jax/_src/checkify.py:1138-1155 | jax/_src/custom_derivatives.py:410-425 \u2014 These two members are one piece of code written twice and then edited apart: 16 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/checkify.py"},"region":{"startLine":1138}}}],"partialFingerprints":{"codehealthFindingId/v1":"70213e5711071de703e4a1139c2f725e524d249bad00d15bba153383c177f5bc"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (31 corresponding lines): jax/_src/lax/parallel.py:2244-2274 | jax/_src/lax/parallel.py:2493-2523 \u2014 These two members are one piece of code written twice and then edited apart: 31 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/lax/parallel.py"},"region":{"startLine":2244}}}],"partialFingerprints":{"codehealthFindingId/v1":"a91bcede425caa1d9bae6aae353ae62a1945db078e6ac43dd8b18bbf0e1c8613"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (29 corresponding lines): jax/experimental/mosaic/gpu/launch_context.py:182-210 | jax/experimental/mosaic/gpu/launch_context.py:213-243 \u2014 These two members are one piece of code written twice and then edited apart: 29 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/mosaic/gpu/launch_context.py"},"region":{"startLine":182}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a0a0b9587593494963916473237b546aa3cd30642207a7f2595104676ffef8f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (25 corresponding lines): jax/_src/config.py:388-469 | jax/_src/config.py:484-508 \u2014 These two members are one piece of code written twice and then edited apart: 25 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/config.py"},"region":{"startLine":388}}}],"partialFingerprints":{"codehealthFindingId/v1":"027bdca144e476ed45bdded377983d344fa1f610d3cc3b0f69b35416535b8c0e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): docs/autodidax.py:2358-2372 | docs/autodidax.py:2927-2948 \u2014 These two members are one piece of code written twice and then edited apart: 15 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/autodidax.py"},"region":{"startLine":2358}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f2c10aedcc01eb15f99a0a4d4faf40407a1e5c077219d3156a2f5a263d1aeb3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (5 members, 39\u002B corresponding lines): jax/_src/config.py:524-579 | jax/_src/config.py:594-639 | jax/_src/config.py:655-722 | jax/_src/config.py:737-779 | jax/_src/config.py:790-828 \u2014 These 5 members are one piece of code written 5 times and then edited apart: every two of them correspond over at least 39 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 5 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/config.py"},"region":{"startLine":524}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e5aa3f2cae26a8e056da164740fe13bd18dc9f85d124f514aa1acb3fb5d6638"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (31 corresponding lines): jax/_src/scipy/special.py:4180-4210 | jax/_src/scipy/special.py:4531-4562 \u2014 These two members are one piece of code written twice and then edited apart: 31 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/scipy/special.py"},"region":{"startLine":4180}}}],"partialFingerprints":{"codehealthFindingId/v1":"d75583c16376b9a3909bf6b28d8821fd56d1e791d12e5178633bc75a1a5a935b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): jax/experimental/pallas/ops/tpu/random/philox.py:159-182 | jax/experimental/pallas/ops/tpu/random/threefry.py:91-109 \u2014 These two members are one piece of code written twice and then edited apart: 19 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/pallas/ops/tpu/random/philox.py"},"region":{"startLine":159}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2629edbb8b52eb3d55333d55acad79bd21e2626e3097dd19e66a215072b5687"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 17\u002B corresponding lines): jax/_src/ad_checkpoint.py:793-813 | jax/_src/compute_on.py:407-430 | jax/_src/xla_metadata.py:520-536 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 17 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/ad_checkpoint.py"},"region":{"startLine":793}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3ee4525834bb12232f4b8a7b6487720b512a66d8b2df7ccb4ba957e0dfe1e95"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): jax/experimental/sparse/bcoo.py:63-77 | jax/experimental/sparse/bcsr.py:74-88 \u2014 These two members are one piece of code written twice and then edited apart: 15 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/sparse/bcoo.py"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"ecae49f9bb78b464bdb63ab4a9bcc7f90571740e921f00bd6e4b00d557eac5e3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (23 corresponding lines): jax/experimental/sparse/coo.py:459-481 | jax/experimental/sparse/coo.py:580-602 \u2014 These two members are one piece of code written twice and then edited apart: 23 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/sparse/coo.py"},"region":{"startLine":459}}}],"partialFingerprints":{"codehealthFindingId/v1":"17f5c558bc357df9b392427d6a18228f5ed3b97c041ecb57cc762f2a0d7c3efb"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (23 corresponding lines): jax/_src/lax/ann.py:423-454 | jax/_src/lax/lax.py:11133-11155 \u2014 These two members are one piece of code written twice and then edited apart: 23 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/lax/ann.py"},"region":{"startLine":423}}}],"partialFingerprints":{"codehealthFindingId/v1":"b452b01a17d30426e4adee2817c0306540a0d4aba287c1cb457cb808cb2e76c0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): jax/_src/ad_checkpoint.py:1224-1242 | jax/_src/ad_checkpoint.py:1277-1292 \u2014 These two members are one piece of code written twice and then edited apart: 16 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/ad_checkpoint.py"},"region":{"startLine":1224}}}],"partialFingerprints":{"codehealthFindingId/v1":"237b23913b240ab917e6bf774856ebff37c1be9f352f10e96bc962133434d309"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (22 corresponding lines): jax/_src/random/philox4x32.py:153-174 | jax/_src/random/threefry4x32.py:206-228 \u2014 These two members are one piece of code written twice and then edited apart: 22 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/random/philox4x32.py"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"bdcb1d36d532e6bd5fe50db2bbdbd1a2c7b548ecd885fdcd04b739601e2984db"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): docs/401/cute_dsl_jax/cute_dsl_jax_kernels.py:60-71 | docs/401/cute_dsl_jax/cute_dsl_jax_kernels.py:91-102 \u2014 These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/401/cute_dsl_jax/cute_dsl_jax_kernels.py"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d899ace27c6c841ba60486cddddae28b5ee60a5d6b2cb940b4b940de0492008"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (33 corresponding lines): jax/_src/pallas/mosaic/lowering.py:4809-4841 | jax/_src/pallas/mosaic_gpu/lowering.py:3831-3869 \u2014 These two members are one piece of code written twice and then edited apart: 33 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/mosaic/lowering.py"},"region":{"startLine":4809}}}],"partialFingerprints":{"codehealthFindingId/v1":"7887e46ded309355be155e74935df8b124ed504cfd93a5fa27c820f0a0e342cb"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): jax/experimental/sparse/coo.py:128-143 | jax/experimental/sparse/csr.py:96-115 \u2014 These two members are one piece of code written twice and then edited apart: 16 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/sparse/coo.py"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"940d5bdbe6b352eef2db22f6ef757e9b7c6aacc3c9ec1997812ef3cc3260b189"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (48 corresponding lines): jax/_src/pallas/mosaic/interpret/shared_memory.py:578-625 | jax/_src/pallas/mosaic/interpret/shared_memory.py:636-686 \u2014 These two members are one piece of code written twice and then edited apart: 48 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/mosaic/interpret/shared_memory.py"},"region":{"startLine":578}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2c80edb292816af90bd48a4a357896849bbe2c0fc770792659d9c0793f3bef8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): jax/_src/scipy/special.py:1203-1219 | jax/_src/scipy/special.py:2327-2344 \u2014 These two members are one piece of code written twice and then edited apart: 17 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/scipy/special.py"},"region":{"startLine":1203}}}],"partialFingerprints":{"codehealthFindingId/v1":"0cc561fa515804d73f0b7d39b7429de44e64de4035217af3f2d76304dd48c569"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (24 corresponding lines): jax/experimental/array_serialization/pytree_serialization.py:203-227 | jax/experimental/array_serialization/pytree_serialization.py:360-383 \u2014 These two members are one piece of code written twice and then edited apart: 24 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/array_serialization/pytree_serialization.py"},"region":{"startLine":203}}}],"partialFingerprints":{"codehealthFindingId/v1":"b221d4d38ce2a6d8745194320d7c93ddf4101a9037e8fbc9fa48a232020a5fdb"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (26 corresponding lines): jax/experimental/mosaic/gpu/layout_inference.py:795-821 | jax/experimental/mosaic/gpu/layout_inference.py:843-868 \u2014 These two members are one piece of code written twice and then edited apart: 26 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/mosaic/gpu/layout_inference.py"},"region":{"startLine":795}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1b8a1cee0c6ecb84986838a097ea84cb329a2c5d909762352e78eb6e4b259c0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (40 corresponding lines): jax/_src/pallas/mosaic_gpu/interpret/gpu_callbacks.py:813-852 | jax/_src/pallas/mosaic_gpu/interpret/gpu_callbacks.py:1130-1173 \u2014 These two members are one piece of code written twice and then edited apart: 40 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/mosaic_gpu/interpret/gpu_callbacks.py"},"region":{"startLine":813}}}],"partialFingerprints":{"codehealthFindingId/v1":"999f4e708999906c1333f9dbd4d93beb4dc01c75c64144440fa5566c86b8af0a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): jax/experimental/jet.py:552-562 | jax/experimental/jet.py:648-657 \u2014 These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/jet.py"},"region":{"startLine":552}}}],"partialFingerprints":{"codehealthFindingId/v1":"0368746afa7f0c201d4ef1f112e4fe0b773bb0b0f8b939f50a66d69150d255d2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): jax/_src/lax/parallel.py:1308-1326 | jax/_src/lax/parallel.py:1444-1461 \u2014 These two members are one piece of code written twice and then edited apart: 18 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/lax/parallel.py"},"region":{"startLine":1308}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5cd4ee79832d4ab1dba0490ac178d887bc4156921faaa331c85565a910ebb14"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (43 corresponding lines): jax/_src/pallas/mosaic/interpret/interpret_pallas_call.py:984-1026 | jax/_src/pallas/mosaic/interpret/interpret_pallas_call.py:1029-1073 \u2014 These two members are one piece of code written twice and then edited apart: 43 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/mosaic/interpret/interpret_pallas_call.py"},"region":{"startLine":984}}}],"partialFingerprints":{"codehealthFindingId/v1":"7bf3ad8cc0d4aaa194e24411dcf51ad1e6e5c3ccbc7242c5ab7bd1718b6b01a1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (20 corresponding lines): jax/_src/pallas/mosaic/sc_primitives.py:122-141 | jax/_src/pallas/mosaic/sc_primitives.py:357-379 \u2014 These two members are one piece of code written twice and then edited apart: 20 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/mosaic/sc_primitives.py"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"06fd88d62707635d78d47a58b1eef1742d16523fb1058dd1c137fcd52800b158"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (37 corresponding lines): jax/_src/lax/parallel.py:241-277 | jax/_src/lax/parallel.py:281-317 \u2014 These two members are one piece of code written twice and then edited apart: 37 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/lax/parallel.py"},"region":{"startLine":241}}}],"partialFingerprints":{"codehealthFindingId/v1":"1604590d9b30059fa5b299d32936a51548a17b105ba5ce386638c0024043d99d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 12\u002B corresponding lines): jax/_src/compute_on.py:190-204 | jax/_src/xla_metadata.py:377-388 | jax/experimental/fused.py:87-98 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 12 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/compute_on.py"},"region":{"startLine":190}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c5ee67b3eb70c319087a905e83530b7c525d0a3cd86deb9c45e2d6c64f20ee3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): jax/_src/lax/fft.py:247-264 | jax/_src/lax/fft.py:271-288 \u2014 These two members are one piece of code written twice and then edited apart: 18 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/lax/fft.py"},"region":{"startLine":247}}}],"partialFingerprints":{"codehealthFindingId/v1":"753c7550c797329e3c2418bbb6c7bc610cecb430e7a0ba147bc811ccc9e7f71c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (24 corresponding lines): jax/_src/callback.py:606-629 | jax/_src/callback.py:641-670 \u2014 These two members are one piece of code written twice and then edited apart: 24 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/callback.py"},"region":{"startLine":606}}}],"partialFingerprints":{"codehealthFindingId/v1":"f48c1da5da1719791f1c0337184d991037dedeeddb3432a10571c5b8d91de601"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 22\u002B corresponding lines): jax/experimental/mosaic/gpu/fragmented_array.py:1764-1785 | jax/experimental/mosaic/gpu/fragmented_array.py:1803-1824 | jax/experimental/mosaic/gpu/fragmented_array.py:1827-1850 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 22 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/mosaic/gpu/fragmented_array.py"},"region":{"startLine":1764}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d55d15549e045a4f81faaf6d5c7e4d65f9fd1872abc2520370ea908f3733763"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): jax/_src/pallas/mosaic_gpu/lowering.py:2593-2611 | jax/_src/pallas/mosaic_gpu/lowering.py:2679-2694 \u2014 These two members are one piece of code written twice and then edited apart: 16 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/mosaic_gpu/lowering.py"},"region":{"startLine":2593}}}],"partialFingerprints":{"codehealthFindingId/v1":"63172e52ecde53b689702f4c1df3758edc93fc0feafb23240b2067bbf6e814ee"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): jax/_src/lax/slicing.py:2515-2531 | jax/_src/lax/slicing.py:3716-3733 \u2014 These two members are one piece of code written twice and then edited apart: 17 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/lax/slicing.py"},"region":{"startLine":2515}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ada923e9b9f603eb02aba14d9a3cded18e3233e3fa8c204ac11c7d94bed3f05"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (62 corresponding lines): jax/_src/numpy/sorting.py:213-274 | jax/_src/numpy/sorting.py:280-347 \u2014 These two members are one piece of code written twice and then edited apart: 62 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/numpy/sorting.py"},"region":{"startLine":213}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6367af6f9e3380291d96421c30e41a95edca7721303ab218c343e5323ac9f50"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (23 corresponding lines): jax/_src/pallas/mosaic/primitives.py:418-440 | jax/_src/pallas/mosaic/primitives.py:660-684 \u2014 These two members are one piece of code written twice and then edited apart: 23 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/mosaic/primitives.py"},"region":{"startLine":418}}}],"partialFingerprints":{"codehealthFindingId/v1":"173a4457ca55a55e9ac30442bfa075811e599479f479150d50762d40d93d6abb"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): jax/_src/lax/lax.py:5218-5226 | jax/_src/lax/lax.py:5249-5256 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/lax/lax.py"},"region":{"startLine":5218}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed46f585e0e57f25bfb6e8e79482ea5f7f21395df68ddc8b0e059089f506b611"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (55 corresponding lines): jax/_src/numpy/reductions.py:2454-2508 | jax/_src/numpy/reductions.py:2516-2570 \u2014 These two members are one piece of code written twice and then edited apart: 55 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/numpy/reductions.py"},"region":{"startLine":2454}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc692fb50b07386f3ed3ed0b1cfcb86412f9eb483f4f8a70a340383ac48378e4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (30 corresponding lines): jax/_src/pallas/mosaic_gpu/interpret/gpu_callbacks.py:2122-2151 | jax/_src/pallas/mosaic_gpu/interpret/gpu_callbacks.py:2164-2194 \u2014 These two members are one piece of code written twice and then edited apart: 30 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/mosaic_gpu/interpret/gpu_callbacks.py"},"region":{"startLine":2122}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8a64e4170777316c74a855494e0efc9c8384d2ddfd41b30c614ff463e119355"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): jax/experimental/sparse/bcoo.py:2532-2548 | jax/experimental/sparse/bcsr.py:885-901 \u2014 These two members are one piece of code written twice and then edited apart: 17 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/sparse/bcoo.py"},"region":{"startLine":2532}}}],"partialFingerprints":{"codehealthFindingId/v1":"afc2a5b6c24a98fad44b2e6dc43ba0e26d4e5fb409a9e06d66e98de8899177b6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): jax/_src/ad_checkpoint.py:569-584 | jax/_src/program_order.py:236-247 \u2014 These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/ad_checkpoint.py"},"region":{"startLine":569}}}],"partialFingerprints":{"codehealthFindingId/v1":"af6ff5491fc55e722d1d9c65a444515821e99cd7b77b8438f9649e1c63aacc7d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (28 corresponding lines): jax/_src/pallas/mosaic_gpu/interpret/jaxpr_interpret.py:1039-1066 | jax/_src/pallas/mosaic_gpu/interpret/jaxpr_interpret.py:1195-1225 \u2014 These two members are one piece of code written twice and then edited apart: 28 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/mosaic_gpu/interpret/jaxpr_interpret.py"},"region":{"startLine":1039}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9003226390534c6c72e559f340ba7d6068865d86af300f7bec6e9d1b05d7bf9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): jax/_src/state/discharge.py:944-962 | jax/_src/state/discharge.py:965-985 \u2014 These two members are one piece of code written twice and then edited apart: 19 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/state/discharge.py"},"region":{"startLine":944}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1e4761a032a87abd9ea07da9dc87968958eb0923d111ac294cb613f761512e6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): jax/experimental/mosaic/gpu/dialect_lowering.py:726-743 | jax/experimental/mosaic/gpu/dialect_lowering.py:775-789 \u2014 These two members are one piece of code written twice and then edited apart: 15 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/mosaic/gpu/dialect_lowering.py"},"region":{"startLine":726}}}],"partialFingerprints":{"codehealthFindingId/v1":"76d8a8aa8d8a6e0ed10306aba21316e79600beaa790cf563e9a94b0124acc40f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (26 corresponding lines): jax/experimental/roofline/rooflines.py:487-516 | jax/experimental/roofline/rooflines.py:682-707 \u2014 These two members are one piece of code written twice and then edited apart: 26 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/roofline/rooflines.py"},"region":{"startLine":487}}}],"partialFingerprints":{"codehealthFindingId/v1":"038c10f1c771f6590dabe2602794cf96760869e4fdd5aacdd0e857b19ef55407"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (47 corresponding lines): jax/_src/numpy/lax_numpy.py:8910-8956 | jax/_src/numpy/lax_numpy.py:8962-9009 \u2014 These two members are one piece of code written twice and then edited apart: 47 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/numpy/lax_numpy.py"},"region":{"startLine":8910}}}],"partialFingerprints":{"codehealthFindingId/v1":"30a1a8bd8b413d6ba417a7449148b1012c23e84c3449b3c2d913987c7bb5fedc"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): jax/_src/scipy/spatial/transform.py:74-89 | jax/_src/scipy/spatial/transform.py:146-160 \u2014 These two members are one piece of code written twice and then edited apart: 15 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/scipy/spatial/transform.py"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2f3dba7d8b907c7fa1774ac29c24a0d790607e7fb3649bbaa238a750f12a832"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (5 members, 8\u002B corresponding lines): jax/_src/compute_on.py:389-401 | jax/_src/custom_partitioning.py:211-222 | jax/_src/pjit.py:906-915 | jax/_src/xla_metadata.py:484-493 | jax/experimental/fused.py:157-164 \u2014 These 5 members are one piece of code written 5 times and then edited apart: every two of them correspond over at least 8 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 5 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/compute_on.py"},"region":{"startLine":389}}}],"partialFingerprints":{"codehealthFindingId/v1":"74ea61bb1582532b8d594cc1a700827520c50fb6fb0fbcad5a49889442aa2bba"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (36 corresponding lines): jax_plugins/cuda/__init__.py:54-89 | jax_plugins/oneapi/__init__.py:38-77 \u2014 These two members are one piece of code written twice and then edited apart: 36 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax_plugins/cuda/__init__.py"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"eba6c41dfa239f109b344105c60d8b3cc4ea8e19bd493d9f124e33adee5a9bae"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): jax/_src/core.py:2179-2195 | jax/_src/named_sharding.py:404-416 \u2014 These two members are one piece of code written twice and then edited apart: 13 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/core.py"},"region":{"startLine":2179}}}],"partialFingerprints":{"codehealthFindingId/v1":"11f09e19410aed002d5d8ad3b118fb16bb0d00f39dbee18c56e4b3130d8d347e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 9\u002B corresponding lines): jax/_src/lax/eval_jaxpr.py:119-127 | jax/_src/pjit.py:1707-1717 | jax/_src/program_order.py:380-391 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 9 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/lax/eval_jaxpr.py"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"950eced3f257f8717eca70adbbd819a011ae9870c0efe3a740610115b362f1cd"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (24 corresponding lines): jax/_src/pjit.py:773-797 | jax/_src/pjit.py:805-828 \u2014 These two members are one piece of code written twice and then edited apart: 24 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pjit.py"},"region":{"startLine":773}}}],"partialFingerprints":{"codehealthFindingId/v1":"bec94e8daca8fa3ac69e94f144cc37e7742e63c9f25bcf994ca8d293d7068964"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (30 corresponding lines): jax/_src/pallas/mosaic_gpu/interpret/gpu_callbacks.py:1598-1629 | jax/_src/pallas/mosaic_gpu/interpret/gpu_callbacks.py:1661-1690 \u2014 These two members are one piece of code written twice and then edited apart: 30 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/mosaic_gpu/interpret/gpu_callbacks.py"},"region":{"startLine":1598}}}],"partialFingerprints":{"codehealthFindingId/v1":"9fd4017ff1a10bd7dbd4ec2013b55bab63e78086feecfb9173a8ba03e650c48b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): docs/autodidax.py:2001-2011 | docs/autodidax.py:2520-2532 \u2014 These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/autodidax.py"},"region":{"startLine":2001}}}],"partialFingerprints":{"codehealthFindingId/v1":"5788c1f47731f4eae61c72ed4e6d4d07b526753fcbddd423753c1610b1b93ed1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): jax/_src/lax/erf.py:761-788 | jax/_src/lax/erf.py:792-809 \u2014 These two members are one piece of code written twice and then edited apart: 18 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/lax/erf.py"},"region":{"startLine":761}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2da8d574cc55b84b8dc134611404a799508eb2909c360b762da67a3f282c651"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (23 corresponding lines): jax/_src/pallas/mosaic/lowering.py:6179-6202 | jax/_src/pallas/mosaic_gpu/lowering.py:4545-4567 \u2014 These two members are one piece of code written twice and then edited apart: 23 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/mosaic/lowering.py"},"region":{"startLine":6179}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc830f3ed854d397a91de03dbce8e509afaee5e414c89deabb9fc8a7348ad9a8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): jax/_src/pallas/mosaic_gpu/lowering.py:3218-3233 | jax/_src/pallas/mosaic_gpu/lowering.py:3245-3260 \u2014 These two members are one piece of code written twice and then edited apart: 16 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/mosaic_gpu/lowering.py"},"region":{"startLine":3218}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9f0b9a7902adb220ae8aa3ca796086a259beaab9450c08b944cda8777845b46"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): jax/_src/random/core.py:2337-2349 | jax/_src/random/core.py:2895-2907 \u2014 These two members are one piece of code written twice and then edited apart: 13 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/random/core.py"},"region":{"startLine":2337}}}],"partialFingerprints":{"codehealthFindingId/v1":"57bf8e0839e17320eeb97bd7108ef24fa3e74368ffc572800e61c2813c4e13b7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (7 members, 11\u002B corresponding lines): jax/experimental/sparse/_lowerings.py:83-95 | jax/experimental/sparse/_lowerings.py:209-221 | jax/experimental/sparse/_lowerings.py:261-274 | jax/experimental/sparse/_lowerings.py:307-318 | jax/experimental/sparse/_lowerings.py:321-331 | jax/experimental/sparse/_lowerings.py:334-345 | jax/experimental/sparse/_lowerings.py:348-358 \u2014 These 7 members are one piece of code written 7 times and then edited apart: every two of them correspond over at least 11 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 7 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/sparse/_lowerings.py"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0fdf8af57925e695d2ae1fef37dbb90c81a6bf06ed39684034b354ffe7e22ef"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (25 corresponding lines): jax/_src/pallas/mosaic_gpu/interpret/shared_memory.py:694-718 | jax/_src/pallas/mosaic_gpu/interpret/shared_memory.py:832-856 \u2014 These two members are one piece of code written twice and then edited apart: 25 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/mosaic_gpu/interpret/shared_memory.py"},"region":{"startLine":694}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc34269ab96aa7fa37c348cc42436519a06c8f54c4b4314090b45f0fae7ab607"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): jax/_src/random/prng.py:692-705 | jax/_src/random/prng.py:965-977 \u2014 These two members are one piece of code written twice and then edited apart: 13 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/random/prng.py"},"region":{"startLine":692}}}],"partialFingerprints":{"codehealthFindingId/v1":"485889f44f852af002aafa1515d61e09c764d9c931fd239bc900ad871752707a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (24 corresponding lines): jax/_src/scipy/special.py:4123-4146 | jax/_src/scipy/special.py:4150-4174 \u2014 These two members are one piece of code written twice and then edited apart: 24 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/scipy/special.py"},"region":{"startLine":4123}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef2db571b2a357b9daed957c99c2316ebcf54f243f8ab35e9d2e5c9167348623"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): jax/experimental/sparse/bcoo.py:2585-2594 | jax/experimental/sparse/bcsr.py:921-934 \u2014 These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/sparse/bcoo.py"},"region":{"startLine":2585}}}],"partialFingerprints":{"codehealthFindingId/v1":"70afff9c7fbe2079dabc4c5f475d22211ff3c2db4137f387cb210bd39c9fabf4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): jax/_src/checkify.py:627-639 | jax/_src/checkify.py:645-657 \u2014 These two members are one piece of code written twice and then edited apart: 13 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/checkify.py"},"region":{"startLine":627}}}],"partialFingerprints":{"codehealthFindingId/v1":"823cdd824a3adccf76b1cc5b0944df4b9b7e28b826b8858a53a34d449ab253d0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): jax/experimental/mosaic/gpu/layout_inference.py:1426-1443 | jax/experimental/mosaic/gpu/layout_inference.py:1482-1502 \u2014 These two members are one piece of code written twice and then edited apart: 18 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/mosaic/gpu/layout_inference.py"},"region":{"startLine":1426}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac679322d61502e6fe34dc976641a34a5fe3550b90d071f3d6b62b8ccb60c0ed"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): jax/_src/pallas/triton/lowering.py:1441-1453 | jax/_src/pallas/triton/lowering.py:1459-1471 \u2014 These two members are one piece of code written twice and then edited apart: 13 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/triton/lowering.py"},"region":{"startLine":1441}}}],"partialFingerprints":{"codehealthFindingId/v1":"71ddfc3d7de5343ce28ebc60eb94db25cc84567d8c1f4c610eca07b7b8a6133f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): jax/_src/export/shape_poly.py:343-359 | jax/_src/export/shape_poly.py:656-672 \u2014 These two members are one piece of code written twice and then edited apart: 17 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/export/shape_poly.py"},"region":{"startLine":343}}}],"partialFingerprints":{"codehealthFindingId/v1":"e696f97ad8bdeb78ad599312941c45036e43f810895b619949af6b650e8b5e0c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): jax/_src/lax/windowed_reductions.py:219-231 | jax/_src/lax/windowed_reductions.py:269-281 \u2014 These two members are one piece of code written twice and then edited apart: 13 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/lax/windowed_reductions.py"},"region":{"startLine":219}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa3e71b1767cfb937e27c5eff58847f5917407915a801a69da8e59b1e20821c4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): jax/_src/pallas/mosaic/lowering.py:1994-2004 | jax/_src/pallas/mosaic/lowering.py:2015-2030 \u2014 These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/mosaic/lowering.py"},"region":{"startLine":1994}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e678cb5db52bdc65632b6a9340cb5979e312ee99aedcca95e21f21684d76704"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): jax/_src/cudnn/fused_attention_stablehlo.py:436-449 | jax/_src/cudnn/fused_attention_stablehlo.py:457-471 \u2014 These two members are one piece of code written twice and then edited apart: 14 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/cudnn/fused_attention_stablehlo.py"},"region":{"startLine":436}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a2e94cf06aa873287c9f514936ec5c81d5d6f46571152c526a0ca06f429cb0b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): jax/_src/pallas/triton/lowering.py:1146-1160 | jax/_src/pallas/triton/lowering.py:1164-1174 \u2014 These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/triton/lowering.py"},"region":{"startLine":1146}}}],"partialFingerprints":{"codehealthFindingId/v1":"601758bf59dfb07876f4c8f3737cb2f08238a7b8258cfb0414d07771f128bf9e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): jax/_src/random/philox2x32.py:142-156 | jax/_src/random/threefry2x32.py:63-74 \u2014 These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/random/philox2x32.py"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f0402db06cdb281a34f77e067b7e7369de20f30bc13894891b1b5e637b09d6d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): jax/experimental/sparse/csr.py:473-481 | jax/experimental/sparse/csr.py:585-594 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/sparse/csr.py"},"region":{"startLine":473}}}],"partialFingerprints":{"codehealthFindingId/v1":"22fdfc280eaf37579c742f6c6be234418890ae554a134b1f46aae96e00ff2b32"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): jax/experimental/sparse/bcoo.py:134-141 | jax/experimental/sparse/bcsr.py:124-135 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/sparse/bcoo.py"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"a815c268e96ee98c6134e011ef5f4d20073ead4f18794e44a13aab376c5efbd3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): jax/_src/hijax.py:730-739 | jax/_src/hijax.py:747-756 \u2014 These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/hijax.py"},"region":{"startLine":730}}}],"partialFingerprints":{"codehealthFindingId/v1":"0338a5f5da5a8f1abf8a53e2b388218767c45913db8cdd1934a18b98563bb39c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): jax/_src/lax_reference.py:108-115 | jax/_src/lax_reference.py:119-126 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/lax_reference.py"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"12b1a7ebb605032052441175e0ab7f8209933d41d6d1fd98a45b63012181c82b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (38 corresponding lines): jax/_src/scipy/stats/pareto.py:28-68 | jax/_src/scipy/stats/pareto.py:156-193 \u2014 These two members are one piece of code written twice and then edited apart: 38 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/scipy/stats/pareto.py"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3cbd89e7847876d838a6f9a2ad04ef2594859a480ea5b79fee85b2b29d150b4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): jax/_src/hijax.py:1418-1433 | jax/_src/hijax.py:1436-1453 \u2014 These two members are one piece of code written twice and then edited apart: 16 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/hijax.py"},"region":{"startLine":1418}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd3bf97168a3a593746d311f4d2dd90ed4b9c4090654c118e2241c286c712874"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): jax/_src/lax/eval_jaxpr.py:83-92 | jax/_src/xla_metadata.py:463-477 \u2014 These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/lax/eval_jaxpr.py"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff07eab7cbb407e588b3f5b4b055925f630ea3255eb5991a32cc51467cf07038"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): jax/_src/lax/windowed_reductions.py:833-845 | jax/_src/lax/windowed_reductions.py:981-995 \u2014 These two members are one piece of code written twice and then edited apart: 13 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/lax/windowed_reductions.py"},"region":{"startLine":833}}}],"partialFingerprints":{"codehealthFindingId/v1":"2abfaf92a8943c88bf9dbdacc373e10ac3e92d474c2730cc7739d2db08d14273"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (27 corresponding lines): jax/_src/pallas/mosaic/interpret/interpret_pallas_call.py:191-221 | jax/_src/pallas/mosaic_gpu/interpret/gpu_callbacks.py:167-193 \u2014 These two members are one piece of code written twice and then edited apart: 27 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/mosaic/interpret/interpret_pallas_call.py"},"region":{"startLine":191}}}],"partialFingerprints":{"codehealthFindingId/v1":"060643df242b043bf0e1393e0543af69e9933b347320f448aa4d6a07556831f9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): jax/_src/pallas/mosaic_gpu/interpret/jaxpr_interpret.py:377-393 | jax/_src/pallas/mosaic_gpu/interpret/jaxpr_interpret.py:398-422 \u2014 These two members are one piece of code written twice and then edited apart: 17 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/mosaic_gpu/interpret/jaxpr_interpret.py"},"region":{"startLine":377}}}],"partialFingerprints":{"codehealthFindingId/v1":"1859acc07598f0951c3cd2090d8f33739917d7a8ccde0fa6aeba8593e829a590"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 51\u002B corresponding lines): jax/_src/random/core.py:1907-1957 | jax/_src/random/core.py:2487-2547 | jax/_src/random/core.py:2557-2615 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 51 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/random/core.py"},"region":{"startLine":1907}}}],"partialFingerprints":{"codehealthFindingId/v1":"525f3c2b7ef759d51d67fab689bfb07b37a1d1b1d9f77b2b570978832f8d7de2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): jax/_src/lax/slicing.py:1592-1605 | jax/_src/lax/slicing.py:1782-1796 \u2014 These two members are one piece of code written twice and then edited apart: 14 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/lax/slicing.py"},"region":{"startLine":1592}}}],"partialFingerprints":{"codehealthFindingId/v1":"62875aa0c149752f05d1899b2acc9a667c3e9e681d945bdc505dcf4765878509"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): jax/_src/lax/linalg.py:913-923 | jax/_src/lax/linalg.py:927-937 \u2014 These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/lax/linalg.py"},"region":{"startLine":913}}}],"partialFingerprints":{"codehealthFindingId/v1":"af951bc7218d25c4fa73b836a25febde62d80e2c468d178478c8eb979e6284b7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): docs/notebooks/shard_map.py:1134-1146 | docs/notebooks/shard_map.py:1246-1256 \u2014 These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/notebooks/shard_map.py"},"region":{"startLine":1134}}}],"partialFingerprints":{"codehealthFindingId/v1":"8dd79cbea2fdf2b8d565f508dbda5a70458b7c3b34015f4c8cb3ec5b20da5de2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): jax/_src/lax/lax.py:8978-8999 | jax/_src/lax/lax.py:9071-9082 \u2014 These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/lax/lax.py"},"region":{"startLine":8978}}}],"partialFingerprints":{"codehealthFindingId/v1":"8acdc53233839717409618d1ef507e657ebc15358ac67f21b3a379baea8776de"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (60 corresponding lines): jax/_src/numpy/lax_numpy.py:6691-6750 | jax/_src/numpy/lax_numpy.py:6756-6819 \u2014 These two members are one piece of code written twice and then edited apart: 60 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/numpy/lax_numpy.py"},"region":{"startLine":6691}}}],"partialFingerprints":{"codehealthFindingId/v1":"a26df2d42e745b2174cbf0380be081e8b228e36a14eab17564d1535c1de1650b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 12\u002B corresponding lines): jax/_src/random/philox2x32.py:90-106 | jax/_src/random/philox4x32.py:101-117 | jax/_src/random/threefry2x32.py:94-105 | jax/_src/random/threefry4x32.py:142-158 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 12 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/random/philox2x32.py"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b5aa360e504749ed1432ec9139de322ba2247701346c34a7b9fe9f307213730"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): jax/experimental/mosaic/gpu/utils.py:1249-1263 | jax/experimental/mosaic/gpu/utils.py:1719-1733 \u2014 These two members are one piece of code written twice and then edited apart: 15 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/mosaic/gpu/utils.py"},"region":{"startLine":1249}}}],"partialFingerprints":{"codehealthFindingId/v1":"316eab407083a2e3852ad04930f5d15effde006c075407122452d5a245ccbb56"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): jax/experimental/sparse/bcoo.py:342-350 | jax/experimental/sparse/bcsr.py:286-296 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/sparse/bcoo.py"},"region":{"startLine":342}}}],"partialFingerprints":{"codehealthFindingId/v1":"3256e9d8af85e28b4a487f344ed948d18cc61524c282b87229cb1ff6e5463df4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): jax/_src/pallas/mosaic_gpu/core.py:1507-1517 | jax/_src/pallas/mosaic_gpu/core.py:1538-1556 \u2014 These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/mosaic_gpu/core.py"},"region":{"startLine":1507}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf03420156cfa397e904dbc81cd422c613a25aea6224c0a618d47281713f6222"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): jax/experimental/sparse/csr.py:125-134 | jax/experimental/sparse/csr.py:198-209 \u2014 These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/sparse/csr.py"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"4863fd9cf1df8cf2821f4f303c97c879fbe207f93f1784ce7322891be1e1dead"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): docs/autodidax.py:1920-1926 | docs/autodidax.py:3036-3044 \u2014 These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/autodidax.py"},"region":{"startLine":1920}}}],"partialFingerprints":{"codehealthFindingId/v1":"84486053871b2beb26d51cb49a7c032d3e856ed95c869813bbee2fb7f2fca8c5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): docs/hijax_types.py:928-935 | docs/hijax_types.py:959-968 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/hijax_types.py"},"region":{"startLine":928}}}],"partialFingerprints":{"codehealthFindingId/v1":"2640cc05684f9b234ef91dbed73778764ac6c1a0c24da15a80aeb01d745849c0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): jax/_src/random/philox4x32.py:227-238 | jax/_src/random/threefry4x32.py:298-309 \u2014 These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/random/philox4x32.py"},"region":{"startLine":227}}}],"partialFingerprints":{"codehealthFindingId/v1":"a61d26247875d96b746d81d43b331cf13535f9bbaea0e1bae99ec6b6fa890d7a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): jax/_src/lax/lax.py:3542-3550 | jax/_src/lax/lax.py:3553-3561 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/lax/lax.py"},"region":{"startLine":3542}}}],"partialFingerprints":{"codehealthFindingId/v1":"90f47c55cee4f125e99e6902cb162c80eef55331e7e77a58f8ba771370ddd0d2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): jax/_src/lax/lax.py:8340-8356 | jax/_src/lax/lax.py:9716-9731 \u2014 These two members are one piece of code written twice and then edited apart: 16 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/lax/lax.py"},"region":{"startLine":8340}}}],"partialFingerprints":{"codehealthFindingId/v1":"eac6745634c67ce2087df01cc280fbf237d13b5330fb7dc8865e4f4118602c4a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): jax/_src/lax/lax.py:10952-10958 | jax/_src/lax/lax.py:10963-10969 \u2014 These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/lax/lax.py"},"region":{"startLine":10952}}}],"partialFingerprints":{"codehealthFindingId/v1":"e45188fd1cc95cfb9ce8c889028ba6e5edbd710bdef64e5ddf6fe5bad9593886"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): jax/experimental/jet.py:807-820 | jax/experimental/jet.py:824-836 \u2014 These two members are one piece of code written twice and then edited apart: 13 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/jet.py"},"region":{"startLine":807}}}],"partialFingerprints":{"codehealthFindingId/v1":"fda0c94615aa20c8ce52d3a6b8e776827772f22f67918d4b69ba5f265626af2c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): jax/experimental/sparse/csr.py:487-496 | jax/experimental/sparse/csr.py:600-609 \u2014 These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/sparse/csr.py"},"region":{"startLine":487}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0142dd0bf39c3142276d157278fa6fa9abcbc34a1e9aaec76a00a2c7ba1fb7f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): jax/_src/pallas/mosaic_gpu/core.py:1129-1147 | jax/_src/pallas/mosaic_gpu/core.py:1192-1208 \u2014 These two members are one piece of code written twice and then edited apart: 17 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/mosaic_gpu/core.py"},"region":{"startLine":1129}}}],"partialFingerprints":{"codehealthFindingId/v1":"796ea2f73f64ecdff6fcb59ca6926add71ea141744ac3e47fc09c13428e1a8bb"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): jax/_src/pallas/triton/lowering.py:1190-1199 | jax/_src/pallas/triton/lowering.py:1215-1224 \u2014 These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/triton/lowering.py"},"region":{"startLine":1190}}}],"partialFingerprints":{"codehealthFindingId/v1":"22ee2676c0132fd244e91fec87e6643552a34f65fd4862919558a77ff369cf97"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (31 corresponding lines): jax/_src/scipy/stats/bernoulli.py:26-62 | jax/_src/scipy/stats/geom.py:26-56 \u2014 These two members are one piece of code written twice and then edited apart: 31 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/scipy/stats/bernoulli.py"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b2481dac51c0486ce28aaa18edbb43122be027311acbc032f14ec845981983c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 33\u002B corresponding lines): jax/_src/numpy/ufuncs.py:1256-1291 | jax/_src/numpy/ufuncs.py:1306-1338 | jax/_src/numpy/ufuncs.py:1601-1634 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 33 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/numpy/ufuncs.py"},"region":{"startLine":1256}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb14bb4c882c5359d36ac25b7700af3d5ab5e4803c717792137f4c872201dd5e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): jax/_src/interpreters/batching.py:363-371 | jax/_src/interpreters/batching.py:375-384 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/interpreters/batching.py"},"region":{"startLine":363}}}],"partialFingerprints":{"codehealthFindingId/v1":"8da8fcca28314a60aee95b939c9a28465fee4a046a8966c4935185b4bce19c35"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 9\u002B corresponding lines): jax/_src/pallas/mosaic/lowering.py:3645-3653 | jax/_src/pallas/mosaic/lowering.py:3987-4000 | jax/_src/pallas/mosaic/lowering.py:4007-4024 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 9 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/mosaic/lowering.py"},"region":{"startLine":3645}}}],"partialFingerprints":{"codehealthFindingId/v1":"0706555969257737c7e4c708c5c8a8024f2f88154fa7f25f863cacaf5fc35cdf"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): jax/_src/scipy/linalg.py:2556-2563 | jax/_src/scipy/linalg.py:2620-2627 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/scipy/linalg.py"},"region":{"startLine":2556}}}],"partialFingerprints":{"codehealthFindingId/v1":"6aab1fc47dbb51b079eccd7dbf2d4fdacc1e884bf035046e2ca795b1752919b6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): jax/_src/core.py:2706-2721 | jax/_src/core.py:2729-2738 \u2014 These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/core.py"},"region":{"startLine":2706}}}],"partialFingerprints":{"codehealthFindingId/v1":"6cad1a466ff6d8eb4a50d9e857da91b05ef9c41a87215756dac5888ff88199ea"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (34 corresponding lines): jax/_src/scipy/stats/gumbel_l.py:162-195 | jax/_src/scipy/stats/gumbel_r.py:160-194 \u2014 These two members are one piece of code written twice and then edited apart: 34 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/scipy/stats/gumbel_l.py"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"57200bf0c40456983b7ee949c5d74728addf299afe8b85b731aed6c188a5d885"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): jax/experimental/jet.py:578-586 | jax/experimental/jet.py:606-616 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/jet.py"},"region":{"startLine":578}}}],"partialFingerprints":{"codehealthFindingId/v1":"90851ddb8a42b0f39e018550a3987ace973c02cd5dffeef93532b96618197f1d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): jax/experimental/mosaic/gpu/tcgen05.py:1189-1203 | jax/experimental/mosaic/gpu/tcgen05.py:1207-1221 \u2014 These two members are one piece of code written twice and then edited apart: 15 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/mosaic/gpu/tcgen05.py"},"region":{"startLine":1189}}}],"partialFingerprints":{"codehealthFindingId/v1":"14bf0358c9fd8f25a54c843655a30a97903e4b760b02632e455b019593d5d1a8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): docs/autodidax.py:1303-1313 | docs/autodidax.py:1419-1430 \u2014 These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/autodidax.py"},"region":{"startLine":1303}}}],"partialFingerprints":{"codehealthFindingId/v1":"da976528e6d902918c227215c8a605e24f614f87e8f6bf1e6f22edcef1322191"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (34 corresponding lines): jax/_src/config.py:839-872 | jax/_src/config.py:885-920 \u2014 These two members are one piece of code written twice and then edited apart: 34 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/config.py"},"region":{"startLine":839}}}],"partialFingerprints":{"codehealthFindingId/v1":"48022b9c12822d304f6aa397f3d57ac2c07516c255c05c7304f39a82691cac10"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): jax/_src/interpreters/partial_eval.py:2521-2529 | jax/_src/lax/control_flow/conditionals.py:1113-1123 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/interpreters/partial_eval.py"},"region":{"startLine":2521}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef85283ff25596a6f5785a0019c59fb6d746f25b7d500a4c1ad82a875be028e8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): jax/_src/numpy/util.py:225-237 | jax/_src/numpy/util.py:241-248 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/numpy/util.py"},"region":{"startLine":225}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f4c9bc7e8614d8898a365e9f24883dc1d80b9fb714650829afec20c0b8a38fb"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): docs/_static/fault_tolerance/data_parallelism_with_recovery.py:70-77 | docs/_static/fault_tolerance/data_parallelism_with_recovery.py:81-90 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/_static/fault_tolerance/data_parallelism_with_recovery.py"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"a95c4f2b9c784c2ebfec02f25e22e8b7b0d349a64b86fb9714a4acc7ee91c060"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): jax/_src/lax/parallel.py:138-154 | jax/_src/lax/parallel.py:2621-2639 \u2014 These two members are one piece of code written twice and then edited apart: 17 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/lax/parallel.py"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"1106ab6296cdbc83c90f64ad177adf5766be75ec4dca28eda4131b788bd4e673"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (45 corresponding lines): jax/_src/numpy/fft.py:1248-1292 | jax/_src/numpy/fft.py:1296-1341 \u2014 These two members are one piece of code written twice and then edited apart: 45 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/numpy/fft.py"},"region":{"startLine":1248}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2c1a91879a93d6c12454757d2df2490909b0bc4aadb1eadbf2ee8699922819e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): jax/_src/pallas/primitives.py:196-213 | jax/_src/pallas/primitives.py:366-380 \u2014 These two members are one piece of code written twice and then edited apart: 15 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/primitives.py"},"region":{"startLine":196}}}],"partialFingerprints":{"codehealthFindingId/v1":"03671093ac41f144f839954661c2a97ce8969925d00402cf3f89f7cd632ef5c4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (24 corresponding lines): jax/_src/state/primitives.py:725-751 | jax/_src/state/primitives.py:756-779 \u2014 These two members are one piece of code written twice and then edited apart: 24 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/state/primitives.py"},"region":{"startLine":725}}}],"partialFingerprints":{"codehealthFindingId/v1":"45c2f949d78fce6aabeb8d841eaacb825000acc9a7f9bb2f5c73adae0889b805"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (22 corresponding lines): jax/_src/pallas/mosaic/interpret/interpret_pallas_call.py:1184-1206 | jax/_src/pallas/mosaic/interpret/interpret_pallas_call.py:1259-1280 \u2014 These two members are one piece of code written twice and then edited apart: 22 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/mosaic/interpret/interpret_pallas_call.py"},"region":{"startLine":1184}}}],"partialFingerprints":{"codehealthFindingId/v1":"d719bedb38e73072eed14081bc05372f6e17f29381223c98f9b6253012226224"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 12\u002B corresponding lines): jax/_src/thunky/thunky.py:1764-1776 | jax/_src/thunky/thunky.py:1786-1797 | jax/_src/thunky/thunky.py:1807-1819 | jax/_src/thunky/thunky.py:1855-1869 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 12 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/thunky/thunky.py"},"region":{"startLine":1764}}}],"partialFingerprints":{"codehealthFindingId/v1":"4014474fa1011bd63547836f028732608cacc7af8a7626a8c6e506239fa4ef27"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): jax/_src/interpreters/mlir.py:1244-1255 | jax/_src/interpreters/mlir.py:1261-1272 \u2014 These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/interpreters/mlir.py"},"region":{"startLine":1244}}}],"partialFingerprints":{"codehealthFindingId/v1":"e913d1bf0a30ac7efeb9edd9211e02233ff1cfe2b8b738cfcaa0c8ba8bdf1133"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): jax/_src/interpreters/remat.py:119-126 | jax/_src/interpreters/remat.py:129-136 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/interpreters/remat.py"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"39ab54521cc73ebaecf2d73ee4e717f585b9b0d80711db58e75b0c72f86d0e70"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (43 corresponding lines): jax/_src/random/core.py:1203-1245 | jax/_src/random/core.py:1638-1690 \u2014 These two members are one piece of code written twice and then edited apart: 43 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/random/core.py"},"region":{"startLine":1203}}}],"partialFingerprints":{"codehealthFindingId/v1":"9def0d1552630f9351c2a04a6e5f2f4482c9a053dcb4bcf05734111e066451f5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): jax/_src/scipy/stats/poisson.py:215-231 | jax/_src/scipy/stats/poisson.py:234-247 \u2014 These two members are one piece of code written twice and then edited apart: 14 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/scipy/stats/poisson.py"},"region":{"startLine":215}}}],"partialFingerprints":{"codehealthFindingId/v1":"ccfdc1e597bba26c0b60b772d2f749d66de5b935aa1642af376abb7759064174"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): jax/_src/lax/lax.py:5881-5886 | jax/_src/lax/lax.py:5938-5943 \u2014 These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/lax/lax.py"},"region":{"startLine":5881}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d93be435826adba23ee767c8ea6f2c3fba1970f40402f3c3a2d7f19dbd8ecbb"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (20 corresponding lines): jax/_src/pallas/hlo_interpreter.py:123-142 | jax/_src/pallas/mosaic/interpret/utils.py:61-82 \u2014 These two members are one piece of code written twice and then edited apart: 20 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/hlo_interpreter.py"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"69dea1122edbe5f2b4009041d933a7e38a6e3ff7e767041e51b7464a07630464"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): jax/_src/pallas/mosaic/sc_primitives.py:535-542 | jax/_src/pallas/mosaic/sc_primitives.py:586-593 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/mosaic/sc_primitives.py"},"region":{"startLine":535}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2afb459c61c3d0f51fa013432979c061e25520532b526366e5259390b820167"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (51 corresponding lines): jax/_src/scipy/linalg.py:3027-3077 | jax/_src/scipy/linalg.py:3089-3149 \u2014 These two members are one piece of code written twice and then edited apart: 51 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/scipy/linalg.py"},"region":{"startLine":3027}}}],"partialFingerprints":{"codehealthFindingId/v1":"56f423a41a1d42bc31ab3e526e0fa1dd4a68387a3dbeb213fdf96012b7717627"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (41 corresponding lines): jax/_src/scipy/special.py:3013-3053 | jax/_src/scipy/special.py:3057-3107 \u2014 These two members are one piece of code written twice and then edited apart: 41 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/scipy/special.py"},"region":{"startLine":3013}}}],"partialFingerprints":{"codehealthFindingId/v1":"75a2cc6798504572c7ff774244344c9f7cad2df0d00ca3acd3eab7108751b5f7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): jax/experimental/pallas/ops/tpu/splash_attention/splash_attention_mask.py:272-285 | jax/experimental/pallas/ops/tpu/splash_attention/splash_attention_mask.py:544-551 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/pallas/ops/tpu/splash_attention/splash_attention_mask.py"},"region":{"startLine":272}}}],"partialFingerprints":{"codehealthFindingId/v1":"428dd5df2734a3863a19011c6567121d792657b4d58e09ce219347874882c37a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): jax/_src/nn/initializers.py:270-279 | jax/_src/nn/initializers.py:284-296 \u2014 These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/nn/initializers.py"},"region":{"startLine":270}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab83e1bfa879e38d547147a3f8d27fb5e93924e557b8052476d5a23e5e07a6c1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): jax/_src/shard_map.py:1296-1304 | jax/_src/shard_map.py:1307-1315 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/shard_map.py"},"region":{"startLine":1296}}}],"partialFingerprints":{"codehealthFindingId/v1":"572e1e7eac86c2464b4f3a01792c48b7297c1f3d3868a6f22951ce4764b5f01a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): jax/experimental/sparse/coo.py:445-452 | jax/experimental/sparse/coo.py:568-574 \u2014 These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/sparse/coo.py"},"region":{"startLine":445}}}],"partialFingerprints":{"codehealthFindingId/v1":"ede3f419c733a8d906d68c26ebc7a159ed197e57ea0f4a665779e38251f0b1bf"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 7\u002B corresponding lines): jax/experimental/sparse/coo.py:491-500 | jax/experimental/sparse/coo.py:612-618 | jax/experimental/sparse/csr.py:505-520 | jax/experimental/sparse/csr.py:618-631 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 7 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/sparse/coo.py"},"region":{"startLine":491}}}],"partialFingerprints":{"codehealthFindingId/v1":"130f517782155e0b5be1333ebcc982aa36fa363ec329876cfca20f9e5b2e6d52"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): jax/_src/interpreters/partial_eval.py:846-860 | jax/_src/interpreters/partial_eval.py:1244-1270 \u2014 These two members are one piece of code written twice and then edited apart: 15 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/interpreters/partial_eval.py"},"region":{"startLine":846}}}],"partialFingerprints":{"codehealthFindingId/v1":"baa443701a6489710a8d7795800fbe75a6075ff2b20f266ccfd335dd8399d9f5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 11\u002B corresponding lines): jax/_src/lax/lax.py:5862-5874 | jax/_src/lax/lax.py:5920-5932 | jax/_src/lax/lax.py:6146-6156 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 11 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/lax/lax.py"},"region":{"startLine":5862}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1f90ee7437218ba7747824d61f4907451185f2f5faa19b89123f24c212cfcf7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 9\u002B corresponding lines): jax/_src/state/discharge.py:501-509 | jax/_src/state/discharge.py:650-660 | jax/_src/state/discharge.py:670-680 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 9 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/state/discharge.py"},"region":{"startLine":501}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ec3a8b92a8b24efc5100cf356427cdb8012db7c81f8a2da78b1676812ad4809"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): jax/_src/tree_util.py:415-422 | jax/_src/tree_util.py:1320-1330 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/tree_util.py"},"region":{"startLine":415}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d8ab4f15de4161fa4cd0402e9d9d58ebbddba24493cf9ad20be12379f174a8b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): jax/experimental/sparse/bcoo.py:659-669 | jax/experimental/sparse/bcsr.py:507-517 \u2014 These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/sparse/bcoo.py"},"region":{"startLine":659}}}],"partialFingerprints":{"codehealthFindingId/v1":"ded916d5f84c8f8c40d865bc89cd412b32bedf05a7cae78ecb6ee28bf708ab85"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): jax/experimental/sparse/bcoo.py:912-922 | jax/experimental/sparse/bcsr.py:590-600 \u2014 These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/sparse/bcoo.py"},"region":{"startLine":912}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f19a638040a579eb79ecd8c86d22158ef2436edb59733f79118ce30c1e55ba4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 7\u002B corresponding lines): jax/_src/nn/functions.py:575-610 | jax/_src/ops/special.py:79-85 | jax/_src/ops/special.py:102-108 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 7 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/nn/functions.py"},"region":{"startLine":575}}}],"partialFingerprints":{"codehealthFindingId/v1":"626148d830430a402f47050f2c892c240b72fb22025d31a77876129fd3975e85"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): jax/_src/pallas/mosaic/pipeline.py:1524-1541 | jax/_src/pallas/mosaic/pipeline.py:1557-1573 \u2014 These two members are one piece of code written twice and then edited apart: 17 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/mosaic/pipeline.py"},"region":{"startLine":1524}}}],"partialFingerprints":{"codehealthFindingId/v1":"401c0541df0711c25a9f64e460556422419a3049e5aa813798a6b387bc09ab10"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): jax/_src/pallas/triton/lowering.py:515-525 | jax/_src/pallas/triton/primitives.py:665-681 \u2014 These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/triton/lowering.py"},"region":{"startLine":515}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0f031142d5fd59ec389055a749ac10d1781404cc6981f9026cbdbbae741561c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): jax/experimental/mosaic/gpu/constraints.py:1278-1290 | jax/experimental/mosaic/gpu/constraints.py:1296-1310 \u2014 These two members are one piece of code written twice and then edited apart: 13 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/mosaic/gpu/constraints.py"},"region":{"startLine":1278}}}],"partialFingerprints":{"codehealthFindingId/v1":"658d265ff957633d07b92b5398f0fc4572a7da85e0132ca30e2a19146cd211d7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): jax/experimental/mosaic/gpu/constraints.py:1316-1332 | jax/experimental/mosaic/gpu/constraints.py:1347-1360 \u2014 These two members are one piece of code written twice and then edited apart: 14 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/mosaic/gpu/constraints.py"},"region":{"startLine":1316}}}],"partialFingerprints":{"codehealthFindingId/v1":"bacf0904c0c16caf7127b0f4ed83ea10addbde8d0cb016ec5f85daae60164224"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): jax/experimental/mosaic/gpu/layout_inference.py:1880-1896 | jax/experimental/mosaic/gpu/layout_inference.py:1925-1935 \u2014 These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/mosaic/gpu/layout_inference.py"},"region":{"startLine":1880}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9169acb9fe202460e8eb382869c63a83fe67650dd3d960bdf458d36175a1ffd"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): jax/_src/cudnn/fused_attention_stablehlo.py:1284-1293 | jax/_src/cudnn/fused_attention_stablehlo.py:1296-1305 \u2014 These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/cudnn/fused_attention_stablehlo.py"},"region":{"startLine":1284}}}],"partialFingerprints":{"codehealthFindingId/v1":"db3a7a0f4a530f2ac914f10c2f6b05c44b3a68ab8d9cfc7d7af81cf5ae6573ad"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): jax/_src/lax/special.py:681-695 | jax/_src/lax/special.py:768-786 \u2014 These two members are one piece of code written twice and then edited apart: 15 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/lax/special.py"},"region":{"startLine":681}}}],"partialFingerprints":{"codehealthFindingId/v1":"0751431a4f745fa72687bcb7f2aa8e18c3b0c95ffac55c114a3ea70e9c72c83d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): jax/_src/pallas/triton/lowering.py:1178-1186 | jax/_src/pallas/triton/lowering.py:1236-1243 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/triton/lowering.py"},"region":{"startLine":1178}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7cbd7fff184af943503d45908a5f8e2e538b7ce4079b87c5b82c7441a451f47"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 8\u002B corresponding lines): jax/experimental/jet.py:406-416 | jax/experimental/jet.py:509-516 | jax/experimental/jet.py:520-529 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 8 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/jet.py"},"region":{"startLine":406}}}],"partialFingerprints":{"codehealthFindingId/v1":"59281ccbc4dc9b26abcbc4d8fec012cc72e26f6501dcdcfa87e072526a425dc8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): jax/_src/lax/erf.py:78-85 | jax/_src/lax/erf.py:105-114 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/lax/erf.py"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"428716ce51584e83cdf55551d918e8f1836ebce182ac232ecdf9243ba862af0f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): jax/_src/pallas/mosaic/pipeline.py:1031-1045 | jax/_src/pallas/mosaic/pipeline.py:1073-1089 \u2014 These two members are one piece of code written twice and then edited apart: 15 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/mosaic/pipeline.py"},"region":{"startLine":1031}}}],"partialFingerprints":{"codehealthFindingId/v1":"88d241d44e7a9f1721cf7e37d7b6bbcce13d5ffbd7feaba6bf8283bc9b63c003"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): jax/_src/random/core.py:4278-4287 | jax/_src/random/core.py:4406-4419 \u2014 These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/random/core.py"},"region":{"startLine":4278}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f2e37beaa3b0e741bd045be4a4b53ec75ccfd133d20c60258d0ff2c29323d38"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): jax/experimental/mosaic/gpu/utils.py:1388-1405 | jax/experimental/mosaic/gpu/utils.py:1410-1420 \u2014 These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/mosaic/gpu/utils.py"},"region":{"startLine":1388}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f3159c5f276d38782b7b8358652070822ad4bab679642bb34774a5fc03921cf"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): jax/_src/pallas/mosaic/lowering.py:4243-4259 | jax/_src/pallas/mosaic/lowering.py:4324-4337 \u2014 These two members are one piece of code written twice and then edited apart: 14 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/mosaic/lowering.py"},"region":{"startLine":4243}}}],"partialFingerprints":{"codehealthFindingId/v1":"496eb2f8a1d868d7ac6d6d648cccb2c0e9a824470da30d39880d01d2eba90625"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): jax/_src/scipy/linalg.py:1562-1568 | jax/_src/scipy/linalg.py:1571-1578 \u2014 These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/scipy/linalg.py"},"region":{"startLine":1562}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c20d4b9e27f453335b45a980be1685c95888f2ffd294a8fcfd13fc96430a74b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): jax/experimental/sparse/bcoo.py:2734-2741 | jax/experimental/sparse/bcoo.py:2744-2751 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/sparse/bcoo.py"},"region":{"startLine":2734}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e9dab18ae1aebcc1336527ba409a0918ab89a6ef4b21138db61021d91e872b4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): docs/autodidax.py:2816-2826 | docs/autodidax.py:2834-2844 \u2014 These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/autodidax.py"},"region":{"startLine":2816}}}],"partialFingerprints":{"codehealthFindingId/v1":"775d5f8e0629fbfd4789f3304aa2c10cafd01c1c3ebb8e4a7120b7e2710e5597"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): jax/_src/lax_reference.py:58-65 | jax/_src/lax_reference.py:69-76 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/lax_reference.py"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"63430945e7e49f38a782cd3084b545d96c3797be8741d472b219f24cb9e5c162"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (6 members, 11\u002B corresponding lines): jax/_src/numpy/array_methods.py:672-683 | jax/_src/numpy/array_methods.py:686-697 | jax/_src/numpy/array_methods.py:732-742 | jax/_src/numpy/array_methods.py:745-755 | jax/_src/numpy/array_methods.py:774-784 | jax/_src/numpy/array_methods.py:787-797 \u2014 These 6 members are one piece of code written 6 times and then edited apart: every two of them correspond over at least 11 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 6 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/numpy/array_methods.py"},"region":{"startLine":672}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e08ec30612eaaac845218cb88d53b93615ddcd72b05804c7c2c545c106e6639"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): jax/_src/state/types.py:124-135 | jax/_src/state/types.py:180-190 \u2014 These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/state/types.py"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"efafc6b1ce6ec5723df4560e44ced910fbf499148d12a6b5629e43ba40ad71c2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): jax/_src/ad_checkpoint.py:943-954 | jax/_src/state/discharge.py:1036-1045 \u2014 These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/ad_checkpoint.py"},"region":{"startLine":943}}}],"partialFingerprints":{"codehealthFindingId/v1":"51ace006b460c01d887f55cf887b808d2b44f101cba2563659af656f0beada18"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 12\u002B corresponding lines): jax/_src/lax/parallel.py:2110-2125 | jax/_src/lax/parallel.py:2292-2303 | jax/_src/lax/parallel.py:2874-2886 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 12 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/lax/parallel.py"},"region":{"startLine":2110}}}],"partialFingerprints":{"codehealthFindingId/v1":"6cde824738febd7c8a22517755ad10c1f3e4ceb1d11ab4040495eca792d1a7e8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): jax/_src/custom_derivatives.py:511-518 | jax/_src/custom_derivatives.py:1320-1329 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/custom_derivatives.py"},"region":{"startLine":511}}}],"partialFingerprints":{"codehealthFindingId/v1":"5cd770ac26bf93a1cbe5593c383025bac8fc5d7c3b5be73fe301219619255282"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): jax/_src/lax/linalg.py:1481-1489 | jax/_src/lax/linalg.py:1613-1621 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/lax/linalg.py"},"region":{"startLine":1481}}}],"partialFingerprints":{"codehealthFindingId/v1":"15ace72a38426ec1ba635405b3b34a45a1c0c6a8fd2a5dd28f0b1796381aecc7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): jax/_src/numpy/lax_numpy.py:8501-8506 | jax/_src/numpy/lax_numpy.py:8562-8567 \u2014 These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/numpy/lax_numpy.py"},"region":{"startLine":8501}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e21e49285d4331d822aa41a38f84c4318403ea187061a92158976b502844d96"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): jax/experimental/mosaic/gpu/fragmented_array.py:1904-1914 | jax/experimental/mosaic/gpu/fragmented_array.py:1927-1937 \u2014 These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/mosaic/gpu/fragmented_array.py"},"region":{"startLine":1904}}}],"partialFingerprints":{"codehealthFindingId/v1":"4da33a11f83e28f00cecdfa817e89a6ccc8758759e4a0177257e1baa516d44b6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): jax/_src/numpy/indexing.py:1245-1261 | jax/_src/numpy/indexing.py:1265-1284 \u2014 These two members are one piece of code written twice and then edited apart: 17 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/numpy/indexing.py"},"region":{"startLine":1245}}}],"partialFingerprints":{"codehealthFindingId/v1":"03233c759e90a4f20d8220489bb2027708396d2fef4f9645f39a2ecd5cfcb75a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): jax/_src/pallas/primitives.py:1113-1124 | jax/_src/pallas/primitives.py:1190-1199 \u2014 These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/primitives.py"},"region":{"startLine":1113}}}],"partialFingerprints":{"codehealthFindingId/v1":"33cb770cd2cb6b870de1f61e6f53a6fd147f826c8e3cce85d6f93b0a1930a721"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 14\u002B corresponding lines): jax/experimental/sparse/bcsr.py:269-282 | jax/experimental/sparse/coo.py:354-369 | jax/experimental/sparse/csr.py:388-401 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 14 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/sparse/bcsr.py"},"region":{"startLine":269}}}],"partialFingerprints":{"codehealthFindingId/v1":"c53dc08c0b06eb832567604d1ecb0e50404f3b725c1fafb28a5bae2ab1cf7a1a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): jax/_src/lax/erf.py:737-745 | jax/_src/lax/erf.py:749-757 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/lax/erf.py"},"region":{"startLine":737}}}],"partialFingerprints":{"codehealthFindingId/v1":"85f894ec9429fc4bdaf9226c2b7e050da02784bdb45e70ad81bac697706f45ee"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): jax/_src/numpy/lax_numpy.py:8367-8377 | jax/_src/numpy/lax_numpy.py:8428-8438 \u2014 These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/numpy/lax_numpy.py"},"region":{"startLine":8367}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce519a04b3108808be75e57ab49017b3263839572b2045755d8069cc0c1ee368"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (35 corresponding lines): jax/_src/api.py:2835-2869 | jax/_src/api.py:2872-2908 \u2014 These two members are one piece of code written twice and then edited apart: 35 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/api.py"},"region":{"startLine":2835}}}],"partialFingerprints":{"codehealthFindingId/v1":"fccc4872c98b6916934948ae209de59a3c5ba1bad0dc5a5f835b2654b44d4cb6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): jax/_src/lax/parallel.py:1922-1933 | jax/_src/lax/slicing.py:1808-1818 \u2014 These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/lax/parallel.py"},"region":{"startLine":1922}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f081214bca36748ad68c806ae578cbae4b0da9e192268c5b62216e5b7e6553c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (43 corresponding lines): jax/_src/numpy/array_creation.py:53-95 | jax/_src/numpy/array_creation.py:102-144 \u2014 These two members are one piece of code written twice and then edited apart: 43 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/numpy/array_creation.py"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"4bf43541a424e24163077bc654b80444c9431b3cd466ab6531ffc7d211ede0f5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): jax/_src/custom_derivatives.py:207-246 | jax/_src/hijax.py:1502-1512 \u2014 These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/custom_derivatives.py"},"region":{"startLine":207}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e0fd41336c5753f728bb4c5d1c94a47cf4aa666d1b9aa4dbff08b97c0693dc5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): jax/_src/lax/trig.py:277-288 | jax/_src/lax/trig.py:292-302 \u2014 These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/lax/trig.py"},"region":{"startLine":277}}}],"partialFingerprints":{"codehealthFindingId/v1":"5300a778da88cf2ae5359ede92c5b895a393eb61c30495253b1d7714c1c56419"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): jax/_src/random/philox4x32.py:185-194 | jax/_src/random/threefry4x32.py:247-258 \u2014 These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/random/philox4x32.py"},"region":{"startLine":185}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc1adad60bcc6df4d3a9e1a74c68e345f37463e911d59ec5f333dcc649518090"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): docs/401/cute_dsl_jax/cute_dsl_jax_kernels.py:123-131 | docs/401/cute_dsl_jax/cute_dsl_jax_kernels.py:156-165 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/401/cute_dsl_jax/cute_dsl_jax_kernels.py"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"374bbc0291b622c7cab8462cc99ec4ec3d5e3bd2f79cb84bba230cfec36e0897"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): jax/_src/core.py:3479-3487 | jax/_src/core.py:3492-3503 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/core.py"},"region":{"startLine":3479}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c29c575e2163ece9206425cebb7dd32896b8566b45fcd0bfaf0a4fd2a77bd45"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (59 corresponding lines): jax/_src/numpy/reductions.py:2971-3029 | jax/_src/numpy/reductions.py:3040-3099 \u2014 These two members are one piece of code written twice and then edited apart: 59 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/numpy/reductions.py"},"region":{"startLine":2971}}}],"partialFingerprints":{"codehealthFindingId/v1":"feb24819f3da01af81891514eeb5822697bc94c9e70da604111e97366b651fc4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 21\u002B corresponding lines): jax/_src/pallas/mosaic/sc_primitives.py:89-113 | jax/_src/pallas/mosaic/sc_primitives.py:172-203 | jax/_src/pallas/mosaic/sc_primitives.py:207-228 | jax/_src/pallas/mosaic/sc_primitives.py:232-252 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 21 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/mosaic/sc_primitives.py"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"dac4cab72fa5f1b112ce7aafd45ae3605ad52c7f45bf90da5b4a078d5531d75f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): jax/_src/pallas/mosaic_gpu/interpret/gpu_callbacks.py:866-884 | jax/_src/pallas/mosaic_gpu/interpret/gpu_callbacks.py:1188-1207 \u2014 These two members are one piece of code written twice and then edited apart: 19 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/mosaic_gpu/interpret/gpu_callbacks.py"},"region":{"startLine":866}}}],"partialFingerprints":{"codehealthFindingId/v1":"293ca4c47758846e502584f7004885990556c830fef3099e98196f426abcb2fc"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): jax/_src/state/primitives.py:429-441 | jax/_src/state/primitives.py:444-454 \u2014 These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/state/primitives.py"},"region":{"startLine":429}}}],"partialFingerprints":{"codehealthFindingId/v1":"b311d16ce0bbc07474c82bde3e3a57f9ef61f8ab955be0a06c108f051e18e98b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): jax/_src/core.py:3450-3457 | jax/_src/core.py:3465-3472 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/core.py"},"region":{"startLine":3450}}}],"partialFingerprints":{"codehealthFindingId/v1":"5199d424ce8890a2e7c04c7796cf05e3f6cbbdc6167edc85433269d81a8cc8e4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (55 corresponding lines): jax/_src/numpy/lax_numpy.py:6951-7005 | jax/_src/numpy/lax_numpy.py:7010-7064 \u2014 These two members are one piece of code written twice and then edited apart: 55 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/numpy/lax_numpy.py"},"region":{"startLine":6951}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8155d1c91f00eabd341f3032ed62b1295970f94732c6dc5d3f87b1f288a4784"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): jax/_src/pallas/mosaic/pipeline.py:1256-1262 | jax/_src/pallas/mosaic_gpu/pipeline.py:227-235 \u2014 These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/mosaic/pipeline.py"},"region":{"startLine":1256}}}],"partialFingerprints":{"codehealthFindingId/v1":"ebee86bb5884f0b2d45f502da0a7cf36ab56f97970fe374b2f183c240dcba198"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): jax/_src/pallas/mosaic/primitives.py:486-503 | jax/_src/pallas/mosaic/primitives.py:724-737 \u2014 These two members are one piece of code written twice and then edited apart: 14 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/mosaic/primitives.py"},"region":{"startLine":486}}}],"partialFingerprints":{"codehealthFindingId/v1":"22d26d9ad2d3881e8a2b3cfee211241614fd0232b72ac5d50e1c5733c8bfa341"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): jax/_src/thunky/thunky.py:944-954 | jax/_src/thunky/thunky.py:1176-1188 \u2014 These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/thunky/thunky.py"},"region":{"startLine":944}}}],"partialFingerprints":{"codehealthFindingId/v1":"0593b69e57319baca73b72210d895d51d27a1fc1478e75eff7455f6d0600669c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (20 corresponding lines): jax/experimental/sparse/bcoo.py:250-269 | jax/experimental/sparse/bcsr.py:183-202 \u2014 These two members are one piece of code written twice and then edited apart: 20 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/sparse/bcoo.py"},"region":{"startLine":250}}}],"partialFingerprints":{"codehealthFindingId/v1":"9eb67f55aa887486d8c7f0930903094078ccd7bb983cdeb4445f762a9b93d610"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): jax/_src/custom_derivatives.py:399-407 | jax/_src/custom_derivatives.py:1195-1205 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/custom_derivatives.py"},"region":{"startLine":399}}}],"partialFingerprints":{"codehealthFindingId/v1":"364ed4eb4b0b680780ff4ac55487edd5734dd8843f6adf331d1abb88b6ab9f16"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (38 corresponding lines): jax/_src/random/core.py:2045-2093 | jax/_src/random/core.py:4723-4760 \u2014 These two members are one piece of code written twice and then edited apart: 38 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/random/core.py"},"region":{"startLine":2045}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac92f4d0e5690124150108cae5f616b96cf7e44f71f8bd8e3304cb9f5f7dffd3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): jaxlib/backport_stubs.py:43-52 | jaxlib/mlir/_mlir_libs/normalize_stubs.py:83-97 \u2014 These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jaxlib/backport_stubs.py"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"491a29b7d68e28b9303ea0e859f9cf6d2d7c2402c2717b42ccc4de2503ab07b3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): jax/_src/lax/parallel.py:3285-3291 | jax/_src/lax/parallel.py:3319-3325 \u2014 These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/lax/parallel.py"},"region":{"startLine":3285}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2b0eea631bc65e775babec00b755530d20c5559a2240a12e0a46d83b958ff51"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 9\u002B corresponding lines): jax/_src/lax/windowed_reductions.py:204-212 | jax/_src/lax/windowed_reductions.py:238-246 | jax/_src/lax/windowed_reductions.py:253-261 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 9 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/lax/windowed_reductions.py"},"region":{"startLine":204}}}],"partialFingerprints":{"codehealthFindingId/v1":"977e3b19d256d390e46bec175a2443672924919cb4c476fd6fe02faf24c044a7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): jax/experimental/mosaic/gpu/dialect_lowering.py:1332-1340 | jax/experimental/mosaic/gpu/dialect_lowering.py:1349-1357 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/mosaic/gpu/dialect_lowering.py"},"region":{"startLine":1332}}}],"partialFingerprints":{"codehealthFindingId/v1":"47ebf84c98f8ae3f6105e24bf85dd8721a2de8f6fc478562ca9e90602d70c90f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 7\u002B corresponding lines): jax/experimental/mosaic/gpu/dialect_lowering.py:1501-1507 | jax/experimental/mosaic/gpu/dialect_lowering.py:1585-1593 | jax/experimental/mosaic/gpu/dialect_lowering.py:1610-1618 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 7 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/mosaic/gpu/dialect_lowering.py"},"region":{"startLine":1501}}}],"partialFingerprints":{"codehealthFindingId/v1":"3bcf765036fac211b1ccc3bba0bb84bc25cad9513c1f681e267218297f8809ad"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): jax/_src/lax/slicing.py:1608-1614 | jax/_src/lax/slicing.py:1799-1805 \u2014 These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/lax/slicing.py"},"region":{"startLine":1608}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d1157df16f143b4b4b8bd47c9fa04589a39d8801a67e3f025133a8c76baae2f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 40\u002B corresponding lines): jax/_src/scipy/bessel.py:888-927 | jax/_src/scipy/bessel.py:1598-1640 | jax/_src/scipy/bessel.py:1934-1980 | jax/_src/scipy/bessel.py:2567-2614 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 40 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/scipy/bessel.py"},"region":{"startLine":888}}}],"partialFingerprints":{"codehealthFindingId/v1":"a83288fde3e975b996f1f2f9d81be6f384418ccb395525844dc74ebe799021c2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 26\u002B corresponding lines): jax/_src/scipy/stats/gumbel_l.py:96-129 | jax/_src/scipy/stats/gumbel_r.py:97-127 | jax/_src/scipy/stats/gumbel_r.py:198-228 | jax/_src/scipy/stats/gumbel_r.py:232-257 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 26 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/scipy/stats/gumbel_l.py"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d6e64ca90d17c69b3d520303bf67e6bea49d147b541a211985953e833cd5053"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 8\u002B corresponding lines): jax/experimental/roofline/rooflines.py:81-88 | jax/experimental/roofline/rooflines.py:185-193 | jax/experimental/roofline/rooflines.py:207-221 | jax/experimental/roofline/rooflines.py:797-805 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 8 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/roofline/rooflines.py"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ecb9920f709683e5e3146289d470fb3dd38e786d8b76aed6719fa0db8faf12c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): jax/experimental/sparse/coo.py:372-378 | jax/experimental/sparse/csr.py:404-410 \u2014 These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/sparse/coo.py"},"region":{"startLine":372}}}],"partialFingerprints":{"codehealthFindingId/v1":"e762b3f918f39dbb646b4d04d43e0aabf856d1277c05091c6a6b9b3826ea1af6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): jax/_src/numpy/array_methods.py:1520-1527 | jax/_src/numpy/array_methods.py:1585-1593 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/numpy/array_methods.py"},"region":{"startLine":1520}}}],"partialFingerprints":{"codehealthFindingId/v1":"9673518090fd97faf036c82454e30766b9f92da87532c337216df03c59718d08"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 8\u002B corresponding lines): jax/_src/stages.py:861-869 | jax/_src/stages.py:892-899 | jax/_src/stages.py:913-920 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 8 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/stages.py"},"region":{"startLine":861}}}],"partialFingerprints":{"codehealthFindingId/v1":"55f6e0e8cdc6fa62cd5cb84071b21811688b78f5d2cde0132bfaab211ddf1547"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 8\u002B corresponding lines): jax/experimental/sparse/coo.py:344-351 | jax/experimental/sparse/csr.py:269-277 | jax/experimental/sparse/csr.py:377-384 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 8 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/sparse/coo.py"},"region":{"startLine":344}}}],"partialFingerprints":{"codehealthFindingId/v1":"394ce581b781f69b3ae18d2073e5a24d2ce48c8ced0513ff334500595e1656c3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (81 corresponding lines): jax/_src/numpy/reductions.py:1204-1288 | jax/_src/numpy/reductions.py:1356-1436 \u2014 These two members are one piece of code written twice and then edited apart: 81 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/numpy/reductions.py"},"region":{"startLine":1204}}}],"partialFingerprints":{"codehealthFindingId/v1":"91a4bca62ad633621a802ba9a54eb29131bb53a3ee9f9480da60101fcaf66587"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (24 corresponding lines): jax/_src/pallas/mosaic_gpu/primitives.py:5881-5904 | jax/_src/pallas/primitives.py:981-1016 \u2014 These two members are one piece of code written twice and then edited apart: 24 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/mosaic_gpu/primitives.py"},"region":{"startLine":5881}}}],"partialFingerprints":{"codehealthFindingId/v1":"36a862a5552e896f6216eabf776a81dd0843a90952f2fc7b477ddf30ad405e70"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): docs/autodidax.py:2014-2025 | docs/autodidax.py:2535-2545 \u2014 These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/autodidax.py"},"region":{"startLine":2014}}}],"partialFingerprints":{"codehealthFindingId/v1":"c26abb2fe40041a85cd0820b9e06df50d96d764f1af025cbeff03f89ce0c3be9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): jax/_src/cudnn/fused_attention_stablehlo.py:415-420 | jax/_src/cudnn/fused_attention_stablehlo.py:423-428 \u2014 These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/cudnn/fused_attention_stablehlo.py"},"region":{"startLine":415}}}],"partialFingerprints":{"codehealthFindingId/v1":"4448a3e4977d7c5020834fd5345aa1c65699412b5050d4a9a044f676c6fb71ba"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): jax/_src/interpreters/mlir.py:3118-3127 | jax/_src/interpreters/mlir.py:3224-3234 \u2014 These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/interpreters/mlir.py"},"region":{"startLine":3118}}}],"partialFingerprints":{"codehealthFindingId/v1":"06668a464b1dcbd2a3274d20127789628a7f75a01d314a20b35fed628055bb2b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 55\u002B corresponding lines): jax/_src/numpy/lax_numpy.py:4706-4760 | jax/_src/numpy/lax_numpy.py:4766-4820 | jax/_src/numpy/lax_numpy.py:4826-4881 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 55 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/numpy/lax_numpy.py"},"region":{"startLine":4706}}}],"partialFingerprints":{"codehealthFindingId/v1":"1307f2b965288c1081a50d9776ec22564c4030d869cae32a41a5f373d575e7e6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): jax/_src/numpy/reductions.py:1442-1450 | jax/_src/numpy/reductions.py:2209-2215 \u2014 These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/numpy/reductions.py"},"region":{"startLine":1442}}}],"partialFingerprints":{"codehealthFindingId/v1":"83037f04d6cbd63b4daa1e2c6618dc3ae9d374477e991e33add893403b4e0b5c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (45 corresponding lines): jax/_src/numpy/ufunc_api.py:327-380 | jax/_src/numpy/ufunc_api.py:465-509 \u2014 These two members are one piece of code written twice and then edited apart: 45 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/numpy/ufunc_api.py"},"region":{"startLine":327}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d2036136286e7a968bdc9fcae33dbfa72385e94d25a660c20be6089fa9d5c2b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 11\u002B corresponding lines): jaxlib/gpu_linalg.py:25-36 | jaxlib/gpu_prng.py:25-36 | jaxlib/gpu_sparse.py:23-33 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 11 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jaxlib/gpu_linalg.py"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"87f34a338c7c013b2d5ecbc8ce8db86da0fd091d6a47b039d42cdfbd368cb2b5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): docs/autodidax.py:569-575 | docs/autodidax.py:637-643 \u2014 These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/autodidax.py"},"region":{"startLine":569}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f00f9bc414cabf376faeb4e7916492b7d239d49076c46dad1247ee469f2c601"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (59 corresponding lines): jax/_src/numpy/reductions.py:2581-2639 | jax/_src/numpy/reductions.py:2649-2710 \u2014 These two members are one piece of code written twice and then edited apart: 59 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/numpy/reductions.py"},"region":{"startLine":2581}}}],"partialFingerprints":{"codehealthFindingId/v1":"84e7399331f426a23a37dd397d961bc04250e142ab09e3c2e53121fc03c4a42d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): jax/_src/pallas/mosaic_gpu/lowering.py:4372-4381 | jax/_src/pallas/triton/lowering.py:3051-3060 \u2014 These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/mosaic_gpu/lowering.py"},"region":{"startLine":4372}}}],"partialFingerprints":{"codehealthFindingId/v1":"c36125d68d4c000b7fc25e4efc6efcb9742a0c8ca7839fbb051ddc584158c731"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): jax/_src/random/philox4x32.py:205-211 | jax/_src/random/threefry4x32.py:276-282 \u2014 These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/random/philox4x32.py"},"region":{"startLine":205}}}],"partialFingerprints":{"codehealthFindingId/v1":"1eb06ebf08c667526a60fbb4feec2f511fdefed432e81750fa3bc86ebe880095"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): jax/_src/lax/erf.py:90-100 | jax/_src/lax/erf.py:119-126 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/lax/erf.py"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"352fca08c4807cf138dd15af65e845642d7172146951de09be99210e441092ae"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (6 members, 43\u002B corresponding lines): jax/_src/lax/slicing.py:484-562 | jax/_src/lax/slicing.py:576-626 | jax/_src/lax/slicing.py:636-678 | jax/_src/lax/slicing.py:687-729 | jax/_src/lax/slicing.py:738-780 | jax/_src/lax/slicing.py:859-935 \u2014 These 6 members are one piece of code written 6 times and then edited apart: every two of them correspond over at least 43 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 6 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/lax/slicing.py"},"region":{"startLine":484}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a97fd0ee60f31859a24b7db66d5d8a35cd2e139d2e30a01216d27150ed701dc"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): jax/_src/lax/windowed_reductions.py:805-817 | jax/_src/lax/windowed_reductions.py:939-951 \u2014 These two members are one piece of code written twice and then edited apart: 13 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/lax/windowed_reductions.py"},"region":{"startLine":805}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4b73084b13c186c9f8d4131190f79c788ec33673390b0a7972c6d4bc0d6130a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): jax/_src/numpy/index_tricks.py:85-93 | jax/_src/numpy/index_tricks.py:130-135 \u2014 These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/numpy/index_tricks.py"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d2cf5a386d70af5b2b042fbb0e4d31fa334fff643bd975d0ab499b12c3ad717"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): jax/_src/pallas/mosaic_gpu/interpret/jaxpr_interpret.py:1252-1265 | jax/_src/pallas/mosaic_gpu/interpret/jaxpr_interpret.py:1343-1357 \u2014 These two members are one piece of code written twice and then edited apart: 14 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/mosaic_gpu/interpret/jaxpr_interpret.py"},"region":{"startLine":1252}}}],"partialFingerprints":{"codehealthFindingId/v1":"64a9c34fd30c95e95da34f981d8bc2b9fe32c3932187a39d00e190ec819a713c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): docs/hijax_custom_derivatives.py:454-463 | docs/hijax_custom_derivatives.py:550-559 \u2014 These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/hijax_custom_derivatives.py"},"region":{"startLine":454}}}],"partialFingerprints":{"codehealthFindingId/v1":"11181c59c2b3604f87f87bac5b395c6807878c5121b71c2c9e489dc727c76e75"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 25\u002B corresponding lines): jax/_src/pallas/mosaic_gpu/primitives.py:792-828 | jax/_src/pallas/mosaic_gpu/primitives.py:4541-4565 | jax/_src/pallas/mosaic_gpu/primitives.py:4575-4599 | jax/_src/pallas/mosaic_gpu/primitives.py:4721-4755 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 25 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/mosaic_gpu/primitives.py"},"region":{"startLine":792}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1d1de4c2c41d5b62ef98d67be31f3f082fb2c71ec141060c95ca2f6850e9fdd"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (29 corresponding lines): jax/_src/scipy/special.py:1720-1748 | jax/_src/scipy/special.py:1752-1780 \u2014 These two members are one piece of code written twice and then edited apart: 29 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/scipy/special.py"},"region":{"startLine":1720}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ba3fc74b2e0d2c192d710743397bf96468a354470d1ec785a5498813a57bbec"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (32 corresponding lines): jax/_src/scipy/stats/cauchy.py:27-58 | jax/_src/scipy/stats/cauchy.py:93-126 \u2014 These two members are one piece of code written twice and then edited apart: 32 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/scipy/stats/cauchy.py"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b49c43fc5c071a191dd87bdcf62dd3ac0523a577388811777f377ed31a7e254"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): jax/experimental/pallas/ops/tpu/splash_attention/splash_attention_kernel.py:250-265 | jax/experimental/pallas/ops/tpu/splash_attention/splash_attention_kernel.py:1285-1314 \u2014 These two members are one piece of code written twice and then edited apart: 16 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/pallas/ops/tpu/splash_attention/splash_attention_kernel.py"},"region":{"startLine":250}}}],"partialFingerprints":{"codehealthFindingId/v1":"25adbadc5ba7b84da7c8972e7ede0b11a84eaeb988d2f391606e936cf78f8b60"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): jax/experimental/sparse/bcoo.py:944-963 | jax/experimental/sparse/bcoo.py:1100-1108 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/sparse/bcoo.py"},"region":{"startLine":944}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb2f88c0aedf0feec7bca344a3f131179ec0ca5e719f4c02332c12eb4ff4b468"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): jax/_src/core.py:4459-4464 | jax/_src/core.py:4468-4473 \u2014 These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/core.py"},"region":{"startLine":4459}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c85bdd33229a0976660d14ec1b3caa264a26853acfe9f79d56fe789f13cfd42"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): jax/_src/interpreters/ad.py:980-983 | jax/_src/interpreters/ad.py:991-995 \u2014 These two members are one piece of code written twice and then edited apart: 4 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/interpreters/ad.py"},"region":{"startLine":980}}}],"partialFingerprints":{"codehealthFindingId/v1":"17cc3797e147acf85224d5e782c3dd78296caeea31e22b085251d36c9b411198"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 9\u002B corresponding lines): jax/_src/lax/lax.py:8376-8387 | jax/_src/lax/slicing.py:1445-1453 | jax/_src/pjit.py:2570-2580 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 9 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/lax/lax.py"},"region":{"startLine":8376}}}],"partialFingerprints":{"codehealthFindingId/v1":"3fb9fdb619292f7a3a152f0a5a233009cb82e9fe01358b75ebaf5ec4b85c8472"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 6\u002B corresponding lines): jax/_src/lax_reference.py:145-150 | jax/_src/lax_reference.py:154-159 | jax/_src/lax_reference.py:163-168 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 6 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/lax_reference.py"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"30211ba44966e077f20ec3e268ad1b4c4d70d8b688a2b31b9fbb5c2c3f9bc3c2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (8 members, 15\u002B corresponding lines): jax/_src/numpy/array_methods.py:1198-1212 | jax/_src/numpy/array_methods.py:1243-1257 | jax/_src/numpy/array_methods.py:1264-1278 | jax/_src/numpy/array_methods.py:1286-1300 | jax/_src/numpy/array_methods.py:1310-1327 | jax/_src/numpy/array_methods.py:1335-1353 | jax/_src/numpy/array_methods.py:1361-1376 | jax/_src/numpy/array_methods.py:1384-1400 \u2014 These 8 members are one piece of code written 8 times and then edited apart: every two of them correspond over at least 15 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 8 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/numpy/array_methods.py"},"region":{"startLine":1198}}}],"partialFingerprints":{"codehealthFindingId/v1":"87fdce44da23a4d7763184b8165b6e25e1016c827b2d6f7cba78a635946ae1fe"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): jax/_src/numpy/util.py:112-122 | jax/_src/numpy/util.py:128-138 \u2014 These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/numpy/util.py"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"4eb2972f1bc5291da40d79792553323f51b541cc1a88dcc1a289b8e8883b26ba"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): jax/_src/pallas/triton/lowering.py:2686-2693 | jax/_src/pallas/triton/lowering.py:2702-2709 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/triton/lowering.py"},"region":{"startLine":2686}}}],"partialFingerprints":{"codehealthFindingId/v1":"a20769931b90b5d5d32fcb1bff63726bb9dd50b6629240cd7e7786ce0b1bf361"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): jax/experimental/sparse/coo.py:436-441 | jax/experimental/sparse/coo.py:559-564 \u2014 These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/sparse/coo.py"},"region":{"startLine":436}}}],"partialFingerprints":{"codehealthFindingId/v1":"6676747f7f3ae79c81047d51ac848abd98e93a1d4584171a8bec4ace8e7243ba"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): docs/notebooks/shard_map.py:1434-1439 | docs/notebooks/shard_map.py:1519-1526 \u2014 These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/notebooks/shard_map.py"},"region":{"startLine":1434}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce2bbcf329c28f192f0cb37d58f2f14cd70b887c770dbed573e9caf6f12b6b4f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (58 corresponding lines): jax/_src/numpy/lax_numpy.py:7069-7126 | jax/_src/numpy/lax_numpy.py:7131-7188 \u2014 These two members are one piece of code written twice and then edited apart: 58 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/numpy/lax_numpy.py"},"region":{"startLine":7069}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2e08b4ed2f9209380a850e0d74aca1a24e7284e3b6f6c720ed802a3f3b2c23a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): jax/_src/pallas/mosaic/sc_primitives.py:426-444 | jax/_src/pallas/mosaic/sc_primitives.py:454-471 \u2014 These two members are one piece of code written twice and then edited apart: 18 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/mosaic/sc_primitives.py"},"region":{"startLine":426}}}],"partialFingerprints":{"codehealthFindingId/v1":"d66a77a9b4a9e4c9a1831f34506664700e7e42d8a5cf5402b31322f603cba033"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): jax/_src/pallas/mosaic_gpu/interpret/gpu_callbacks.py:1449-1459 | jax/_src/pallas/mosaic_gpu/interpret/gpu_callbacks.py:1462-1472 \u2014 These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/mosaic_gpu/interpret/gpu_callbacks.py"},"region":{"startLine":1449}}}],"partialFingerprints":{"codehealthFindingId/v1":"35c7dfcbedecadb8383634cb2e3b53f9c42ee6215a75d49448696c18c1c4a71e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): jax/_src/pjit.py:2585-2595 | jax/_src/pjit.py:3215-3222 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pjit.py"},"region":{"startLine":2585}}}],"partialFingerprints":{"codehealthFindingId/v1":"78bf57bcf24bfbeccaca9c74bee66adc4a395e8041e877373f1adb97ea3d825b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): jax/experimental/mosaic/gpu/constraints.py:643-652 | jax/experimental/mosaic/gpu/constraints.py:720-728 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/mosaic/gpu/constraints.py"},"region":{"startLine":643}}}],"partialFingerprints":{"codehealthFindingId/v1":"3beb226f169f7d20003de6a8e4c1480184dcf71cf26c1bfdd623de899eb69041"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (5 corresponding lines): jax/experimental/sparse/bcoo.py:353-357 | jax/experimental/sparse/bcsr.py:261-265 \u2014 These two members are one piece of code written twice and then edited apart: 5 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/sparse/bcoo.py"},"region":{"startLine":353}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a7a3fcbe40f3cc39f34439b9914654c66be7f9c9360bf3cbf6ed1410df416be"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (22 corresponding lines): jax/_src/lax/erf.py:951-972 | jax/_src/lax/erf.py:976-999 \u2014 These two members are one piece of code written twice and then edited apart: 22 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/lax/erf.py"},"region":{"startLine":951}}}],"partialFingerprints":{"codehealthFindingId/v1":"a71b5916d441a8a437baa5a02e034d49fff98c63e7e7955b962eaa90eda33ffb"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (5 corresponding lines): jax/_src/lax/lax.py:8971-8975 | jax/_src/lax/lax.py:9056-9061 \u2014 These two members are one piece of code written twice and then edited apart: 5 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/lax/lax.py"},"region":{"startLine":8971}}}],"partialFingerprints":{"codehealthFindingId/v1":"4edd97597089c1c695419dc09407cc9bbe0ba30e24bb6f00f089e1bfa136b5e6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 27\u002B corresponding lines): jax/_src/numpy/window_functions.py:43-72 | jax/_src/numpy/window_functions.py:77-103 | jax/_src/numpy/window_functions.py:108-134 | jax/_src/numpy/window_functions.py:139-165 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 27 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/numpy/window_functions.py"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"487ccb4ea9d89ffe2e0325658b45ddd1d2a628bca8d1f7be2b8dceb9b3c7ce50"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): jax/_src/pallas/primitives.py:76-85 | jax/_src/pallas/primitives.py:100-111 \u2014 These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/primitives.py"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"6437e48e46273e540500e07d701665dfef6d37523da009a082390afb7ec21624"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): jax/_src/pallas/triton/lowering.py:2050-2062 | jax/_src/pallas/triton/lowering.py:2301-2310 \u2014 These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/triton/lowering.py"},"region":{"startLine":2050}}}],"partialFingerprints":{"codehealthFindingId/v1":"4621814fdb94309a707f7d766b10b33c0f334b707618203544c877e7b1ac8632"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (5 members, 38\u002B corresponding lines): jax/_src/scipy/stats/beta.py:109-148 | jax/_src/scipy/stats/beta.py:188-227 | jax/_src/scipy/stats/chi2.py:111-153 | jax/_src/scipy/stats/chi2.py:191-233 | jax/_src/scipy/stats/gamma.py:99-136 \u2014 These 5 members are one piece of code written 5 times and then edited apart: every two of them correspond over at least 38 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 5 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/scipy/stats/beta.py"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa2a6681c8dc42ce5462f8f93effc0fcd1ee4d63b72e62adc152a688d7ffcd9f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (26 corresponding lines): jax/_src/scipy/stats/expon.py:246-275 | jax/_src/scipy/stats/uniform.py:121-146 \u2014 These two members are one piece of code written twice and then edited apart: 26 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/scipy/stats/expon.py"},"region":{"startLine":246}}}],"partialFingerprints":{"codehealthFindingId/v1":"5680e027e39c0eeca04ad9ddfc88a645c67adcd69da9b11bd92ef61453593188"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (21 corresponding lines): jax/_src/pallas/mosaic_gpu/primitives.py:5784-5804 | jax/_src/pallas/mosaic_gpu/primitives.py:5995-6016 \u2014 These two members are one piece of code written twice and then edited apart: 21 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/mosaic_gpu/primitives.py"},"region":{"startLine":5784}}}],"partialFingerprints":{"codehealthFindingId/v1":"5066ae9876120404d446ba0914d06a70085c05c4e87cbf75557d7e6cb2901f61"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (32 corresponding lines): jax/_src/random/core.py:4124-4159 | jax/_src/random/core.py:4180-4211 \u2014 These two members are one piece of code written twice and then edited apart: 32 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/random/core.py"},"region":{"startLine":4124}}}],"partialFingerprints":{"codehealthFindingId/v1":"907e209c8b80e35795655d8d725c57208a8afff3d342c34b7ce5463e6d007671"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (35 corresponding lines): jax/_src/scipy/stats/expon.py:25-59 | jax/_src/scipy/stats/expon.py:137-172 \u2014 These two members are one piece of code written twice and then edited apart: 35 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/scipy/stats/expon.py"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"d047f9393e173e74260212cebb57be993a43f378ca998d64eabd67cbcaafe5a8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 7\u002B corresponding lines): jax/experimental/mosaic/gpu/utils.py:2465-2474 | jax/experimental/mosaic/gpu/utils.py:2478-2487 | jax/experimental/mosaic/gpu/utils.py:2491-2497 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 7 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/mosaic/gpu/utils.py"},"region":{"startLine":2465}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e52625f965ced22dff46d82f6b0a8e0c01a4ebb91fc4887c8e5e170ff74f533"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (40 corresponding lines): jax/experimental/multihost_utils.py:298-383 | jax/experimental/multihost_utils.py:462-501 \u2014 These two members are one piece of code written twice and then edited apart: 40 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/multihost_utils.py"},"region":{"startLine":298}}}],"partialFingerprints":{"codehealthFindingId/v1":"addf26173f723473750e56d14651c5be6dd0c4d399bd1de9d9be5230d80eee94"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (5 corresponding lines): jax/_src/lax/ann.py:295-299 | jax/_src/lax/lax.py:11126-11130 \u2014 These two members are one piece of code written twice and then edited apart: 5 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/lax/ann.py"},"region":{"startLine":295}}}],"partialFingerprints":{"codehealthFindingId/v1":"e22886ebba4d2906597fc8ef5c6d57b6dc6f6cb45a819394aea8af71672be9dc"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): jax/_src/numpy/ufuncs.py:1246-1251 | jax/_src/numpy/ufuncs.py:1295-1301 \u2014 These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/numpy/ufuncs.py"},"region":{"startLine":1246}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3dfb09b1fc29ba67cdccb6e1807924db9cdc5a5f2a36d1c78481dd89903e8b4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (5 corresponding lines): jax/experimental/mosaic/gpu/fragmented_array.py:159-163 | jax/experimental/mosaic/gpu/fragmented_array.py:253-260 \u2014 These two members are one piece of code written twice and then edited apart: 5 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/mosaic/gpu/fragmented_array.py"},"region":{"startLine":159}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e2479ecf89ac546783ed3d2ad2898ba70ec5f9a514161314d1d10c3735485cf"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): jax/experimental/mosaic/gpu/fragmented_array.py:2147-2158 | jax/experimental/mosaic/gpu/fragmented_array.py:2173-2179 \u2014 These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/mosaic/gpu/fragmented_array.py"},"region":{"startLine":2147}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9e213bc5be936face9338a0e7c41f2a2730c0d88eb5a131636f40a805ea8204"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 20\u002B corresponding lines): jax/_src/nn/initializers.py:99-118 | jax/_src/nn/initializers.py:123-146 | jax/_src/nn/initializers.py:166-189 | jax/_src/nn/initializers.py:196-228 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 20 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/nn/initializers.py"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"fef8015bde9111b440a4040cd7e49178281255e9488bcc57b4d6fc5b55a5b594"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): jax/experimental/mosaic/gpu/dialect_lowering.py:2360-2375 | jax/experimental/mosaic/gpu/dialect_lowering.py:2382-2398 \u2014 These two members are one piece of code written twice and then edited apart: 16 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/mosaic/gpu/dialect_lowering.py"},"region":{"startLine":2360}}}],"partialFingerprints":{"codehealthFindingId/v1":"0edd328548de2f3d3a5928a96fbb547d9a895e39108518b9f83e3a4aa4a8782d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): jax/experimental/mosaic/gpu/dialect_lowering.py:682-692 | jax/experimental/mosaic/gpu/dialect_lowering.py:699-706 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/mosaic/gpu/dialect_lowering.py"},"region":{"startLine":682}}}],"partialFingerprints":{"codehealthFindingId/v1":"fcf1b716820d93f217b62001f9908b18d71270ce8641b70bd22a7fcbc47cce2a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 7\u002B corresponding lines): jax/experimental/sparse/bcsr.py:367-373 | jax/experimental/sparse/coo.py:259-265 | jax/experimental/sparse/csr.py:286-292 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 7 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/sparse/bcsr.py"},"region":{"startLine":367}}}],"partialFingerprints":{"codehealthFindingId/v1":"01c12059ab2e478cfd1c491320575745fb18cd782dd30ebab1ccc2193ff2b1c3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (5 corresponding lines): jax/_src/random/philox2x32.py:199-205 | jax/_src/random/threefry2x32.py:363-367 \u2014 These two members are one piece of code written twice and then edited apart: 5 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/random/philox2x32.py"},"region":{"startLine":199}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f99b8607ac636fed0772c52012b0c4bdb573fc7e02cf7995bc2771c113ca1fb"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (32 corresponding lines): jax/_src/scipy/stats/expon.py:97-133 | jax/_src/scipy/stats/gamma.py:173-204 \u2014 These two members are one piece of code written twice and then edited apart: 32 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/scipy/stats/expon.py"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"3dcd0220cf5902add0db27f8ed9f536621c7440e68d72c2668d7ac9c877de7a4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): jax/experimental/sparse/coo.py:288-303 | jax/experimental/sparse/csr.py:316-330 \u2014 These two members are one piece of code written twice and then edited apart: 15 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/sparse/coo.py"},"region":{"startLine":288}}}],"partialFingerprints":{"codehealthFindingId/v1":"6317f44570b066cf0f2912110f0a593852ba0e5b3d160619ade9abe0fd23708b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): jax/experimental/mosaic/gpu/fragmented_array.py:2161-2170 | jax/experimental/mosaic/gpu/fragmented_array.py:2182-2188 \u2014 These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/mosaic/gpu/fragmented_array.py"},"region":{"startLine":2161}}}],"partialFingerprints":{"codehealthFindingId/v1":"9935e4450701d606ec39f9a1377369f44ca6103ed8e0158b2340a71fa93e96ef"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): jax/_src/blocked_sampler.py:35-42 | jax/experimental/pallas/ops/tpu/random/prng_utils.py:48-55 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/blocked_sampler.py"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ecd3e1494297ed6e57d20eb42fc3755b640da30fb73060de7c2b9e77b5dda73"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): jax/_src/hijax.py:841-849 | jax/_src/lax/control_flow/solves.py:120-126 \u2014 These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/hijax.py"},"region":{"startLine":841}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a89b0222ac06825e5d9cc0c2f2fea959b369c848bec8e9efaf78ec84429972d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): docs/autodidax.py:650-657 | docs/autodidax.py:910-917 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/autodidax.py"},"region":{"startLine":650}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e3aece50ee33ba4a8fbdcb24f25ab7d47c5634f001f6b296e444b11fe23afaf"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (5 corresponding lines): jax/experimental/sparse/bcsr.py:878-882 | jax/experimental/sparse/bcoo.py:2497-2501 \u2014 These two members are one piece of code written twice and then edited apart: 5 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/sparse/bcsr.py"},"region":{"startLine":878}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf76edd5db1eedfb486042ba59a487fa2f090f4ba24f70d5cc4f74063e60a217"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (35 corresponding lines): jax/_src/lax/parallel.py:430-464 | jax/_src/lax/parallel.py:468-505 \u2014 These two members are one piece of code written twice and then edited apart: 35 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/lax/parallel.py"},"region":{"startLine":430}}}],"partialFingerprints":{"codehealthFindingId/v1":"d045e79f183ec9be6aca065ff1a2f6c4544536cdd6321d643e1e86e4bb9a31f5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): jax/_src/random/prng.py:426-433 | jax/_src/random/prng.py:437-444 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/random/prng.py"},"region":{"startLine":426}}}],"partialFingerprints":{"codehealthFindingId/v1":"79bffc13f2bfd57ffbddf487f807861c03ed4079176bbc9be3fa76e371782ce3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 34\u002B corresponding lines): jax/_src/scipy/special.py:271-325 | jax/_src/scipy/special.py:1128-1161 | jax/_src/scipy/special.py:2358-2395 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 34 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/scipy/special.py"},"region":{"startLine":271}}}],"partialFingerprints":{"codehealthFindingId/v1":"8fb5048a74788bbe16cd20643a272ea4749b221fe47e852776ddfdf051ee769a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (3 corresponding lines): jax/experimental/sparse/bcoo.py:455-458 | jax/experimental/sparse/bcsr.py:411-413 \u2014 These two members are one piece of code written twice and then edited apart: 3 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/sparse/bcoo.py"},"region":{"startLine":455}}}],"partialFingerprints":{"codehealthFindingId/v1":"87bb1dcbd93d711cd79e95221b40cf469da7694187c3824a1b7324eec5e41dd7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 6\u002B corresponding lines): jax/experimental/sparse/bcoo.py:2724-2729 | jax/experimental/sparse/bcsr.py:911-916 | jax/experimental/sparse/csr.py:141-146 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 6 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/sparse/bcoo.py"},"region":{"startLine":2724}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae5b158a1a08108f34bbeeab64045d482013b3d35fbee8b2def0af899e8c296a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): jax/_src/pallas/triton/lowering.py:1384-1391 | jax/_src/pallas/triton/primitives.py:706-713 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/triton/lowering.py"},"region":{"startLine":1384}}}],"partialFingerprints":{"codehealthFindingId/v1":"a97d2e21b1f067221a3d39f460a4cc2c4469b4eb5de452f0d6905a86999a4d27"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): jax/_src/pallas/mosaic/lowering.py:1771-1787 | jax/_src/pallas/mosaic_gpu/lowering.py:1040-1046 \u2014 These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/mosaic/lowering.py"},"region":{"startLine":1771}}}],"partialFingerprints":{"codehealthFindingId/v1":"72dde6fac8a09b8f2d35791b132243c0b1809d4802ea7337a7ecc8752e1256fe"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (5 corresponding lines): jax/_src/earray.py:115-119 | jax/_src/random/prng.py:505-509 \u2014 These two members are one piece of code written twice and then edited apart: 5 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/earray.py"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"280b7fa2385ee16441a0101410087c6a6ec1d6b8d06e0c013453f45961eff85c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): jax/_src/interpreters/partial_eval.py:2479-2482 | jax/_src/stages.py:1017-1020 \u2014 These two members are one piece of code written twice and then edited apart: 4 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/interpreters/partial_eval.py"},"region":{"startLine":2479}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb84ceecc5901f9dd4eb22ba3f486150987d95705f48315f7e68383977c49145"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): jax/_src/pallas/primitives.py:437-463 | jax/_src/pallas/triton/primitives.py:383-389 \u2014 These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/primitives.py"},"region":{"startLine":437}}}],"partialFingerprints":{"codehealthFindingId/v1":"f69b26336ec1bd23e2bfe1a7e348f6ba57939bda8bcecc7260911277decebce0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (5 corresponding lines): jax/_src/pallas/mosaic/interpret/shared_memory.py:437-441 | jax/_src/pallas/mosaic_gpu/interpret/shared_memory.py:913-917 \u2014 These two members are one piece of code written twice and then edited apart: 5 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/mosaic/interpret/shared_memory.py"},"region":{"startLine":437}}}],"partialFingerprints":{"codehealthFindingId/v1":"f13e75cd9d8125f010b7edf517c1b251e73ed04985c67338c3ca2cec32980753"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): jax/_src/mesh_utils.py:484-495 | jax/experimental/mosaic/gpu/layout_inference.py:1006-1022 \u2014 These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/mesh_utils.py"},"region":{"startLine":484}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f576cf5f6c79a7667c2933e1d12d71b6919d2e045d1d5b4d0b617adfcfe286d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): jax/_src/lax/lax.py:4026-4035 | jax/_src/numpy/array_creation.py:653-717 \u2014 These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/lax/lax.py"},"region":{"startLine":4026}}}],"partialFingerprints":{"codehealthFindingId/v1":"81617b22b55060428f9c7fbf4bbd7b9c9df2dd5cafc3334298cd4a18e9043f56"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (23 corresponding lines): jax/_src/numpy/lax_numpy.py:6177-6211 | jax/_src/scipy/special.py:2601-2623 \u2014 These two members are one piece of code written twice and then edited apart: 23 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/numpy/lax_numpy.py"},"region":{"startLine":6177}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6195b8bb3aeb1245f7ba318bbaa781d7dd2465b17b93866f5f0b9c2f84e551c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 5\u002B corresponding lines): jax/_src/ad_checkpoint.py:967-985 | jax/_src/compute_on.py:65-69 | jax/_src/shard_map.py:115-166 | jax/_src/util.py:313-324 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 5 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/ad_checkpoint.py"},"region":{"startLine":967}}}],"partialFingerprints":{"codehealthFindingId/v1":"2aa7c3c60a4b7219d85369f31ea0cf0f5744b339a14aea7b1ca5b8afd432889a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (3 corresponding lines): jax/_src/lax/erf.py:1811-1813 | jax/_src/scipy/special.py:1227-1229 \u2014 These two members are one piece of code written twice and then edited apart: 3 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/lax/erf.py"},"region":{"startLine":1811}}}],"partialFingerprints":{"codehealthFindingId/v1":"a16d88368582399cc3987cbdb14bd955abb1a3a27dc69bf19041249bfa4e4dd6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): jax/_src/lax/lax.py:9234-9237 | jax/_src/pjit.py:3105-3108 \u2014 These two members are one piece of code written twice and then edited apart: 4 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/lax/lax.py"},"region":{"startLine":9234}}}],"partialFingerprints":{"codehealthFindingId/v1":"498bcf12f14e580b9bf9d647d4b7a193c61e92ccbc03b1183f0ded3c27ee0116"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): jax/experimental/sparse/coo.py:306-320 | jax/experimental/sparse/csr.py:333-347 \u2014 These two members are one piece of code written twice and then edited apart: 15 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/sparse/coo.py"},"region":{"startLine":306}}}],"partialFingerprints":{"codehealthFindingId/v1":"97fb99edba2cb59fd26f73b48ae743b968131980b22bfa69a12cdc74b89aebca"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (5 corresponding lines): jax/_src/api_util.py:74-78 | jax/_src/interpreters/batching.py:122-126 \u2014 These two members are one piece of code written twice and then edited apart: 5 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/api_util.py"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0074bbe74d8d9cc24ffb03beb3661d9c6eab31cfacbb84d020ade2a2f98ef1a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): jax/_src/lax/control_flow/loops.py:3234-3237 | jax/_src/lax/lax.py:10285-10288 \u2014 These two members are one piece of code written twice and then edited apart: 4 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/lax/control_flow/loops.py"},"region":{"startLine":3234}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e1144321f970843a81bc7fdff9e921caa1730683e9000c5265d8f7131e9df9c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): jax/_src/pallas/mosaic/primitives.py:1493-1514 | jax/_src/pallas/mosaic_gpu/primitives.py:1948-1961 \u2014 These two members are one piece of code written twice and then edited apart: 14 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/mosaic/primitives.py"},"region":{"startLine":1493}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac427591bd3dffa91af545e69ed6e64655516077a9af79ac699155f8ecf11f69"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): jax/_src/lax/lax.py:8429-8432 | jax/_src/lax/slicing.py:1713-1716 \u2014 These two members are one piece of code written twice and then edited apart: 4 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/lax/lax.py"},"region":{"startLine":8429}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b2763397eadcfc5dab4194a715752389fd873d65885dc788eb250d479532c19"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (3 corresponding lines): jax/_src/lax/ann.py:262-264 | jax/_src/lax/lax.py:11109-11111 \u2014 These two members are one piece of code written twice and then edited apart: 3 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/lax/ann.py"},"region":{"startLine":262}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9a426f543cc427793591923b5c7ed1cdaa4c43b762f5a840a6505f098ebc7c5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): jax/_src/callback.py:674-677 | jax/_src/interpreters/pxla.py:266-284 \u2014 These two members are one piece of code written twice and then edited apart: 4 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/callback.py"},"region":{"startLine":674}}}],"partialFingerprints":{"codehealthFindingId/v1":"9688b1de9e2d2963ed664476160da934ad87aa9c5546320428d8882775b80ccb"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): jax/_src/lax/lax.py:11616-11619 | jax/_src/lax/slicing.py:1882-1885 \u2014 These two members are one piece of code written twice and then edited apart: 4 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/lax/lax.py"},"region":{"startLine":11616}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9a5abdf1cf03e566cea244034e4083cdf8ef239fb290ae373d04f73239bb551"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (1 corresponding lines): jax/_src/lax/linalg.py:3162-3162 | jax/_src/tpu/linalg/eigh.py:591-591 \u2014 These two members are one piece of code written twice and then edited apart: 1 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/lax/linalg.py"},"region":{"startLine":3162}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c1d4c2c25c6172e2d68ed715ca96145b00135657b2bec9e914003f8cede9adb"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (3 corresponding lines): jax/_src/lax/slicing.py:3706-3708 | jax/_src/lax/windowed_reductions.py:483-485 \u2014 These two members are one piece of code written twice and then edited apart: 3 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/lax/slicing.py"},"region":{"startLine":3706}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2bd9be5b28f6002296c00b8c1fe0d9d2b9f50faf9e3b2fd7bd3ddd520c21175"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (2 corresponding lines): jaxlib/mosaic/python/mosaic_gpu.py:86-87 | jaxlib/mosaic/python/tpu.py:39-40 \u2014 These two members are one piece of code written twice and then edited apart: 2 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jaxlib/mosaic/python/mosaic_gpu.py"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"3acdd483208e68d3d013d81aa89b0554c12f4acbe171937ba8a7647fd62b83ea"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (1 corresponding lines): docs/ffi.py:469-469 | docs/hijax_custom_derivatives.py:342-342 \u2014 These two members are one piece of code written twice and then edited apart: 1 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/ffi.py"},"region":{"startLine":469}}}],"partialFingerprints":{"codehealthFindingId/v1":"c891e3c623f42c17409a9786924bbe5e5093e298c9545f007dabb0c02e748c8a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): jax/_src/pallas/mpmd.py:658-661 | jax/_src/pallas/pallas_call.py:146-149 \u2014 These two members are one piece of code written twice and then edited apart: 4 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/mpmd.py"},"region":{"startLine":658}}}],"partialFingerprints":{"codehealthFindingId/v1":"92dee4335c89dbbdd867af1e464d454ab0f0c1b8e2035469323c310a6bc355d3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): jax/experimental/pallas/ops/tpu/flash_attention.py:1565-1575 | jax/experimental/pallas/ops/tpu/splash_attention/splash_attention_kernel.py:224-235 \u2014 These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/pallas/ops/tpu/flash_attention.py"},"region":{"startLine":1565}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d79345be0583533a9d9520d6d4eb7632b16d0ba9b50f99fefc96ab4635a9503"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (24 corresponding lines): jax/_src/numpy/linalg.py:1036-1083 | jax/_src/random/core.py:244-267 \u2014 These two members are one piece of code written twice and then edited apart: 24 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/numpy/linalg.py"},"region":{"startLine":1036}}}],"partialFingerprints":{"codehealthFindingId/v1":"253e609d696556b6393d476b3916e028fe07e53cb2e6b390179a6f622aed19de"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (62\u201377 lines \u00D7 4): jax/_src/scipy/fft.py:53-114 | jax/_src/scipy/fft.py:163-232 | jax/_src/scipy/fft.py:275-345 | jax/_src/scipy/fft.py:384-460 \u2014 all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060jax/_src/scipy/fft.py:53\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/scipy/fft.py"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ad493b01612064b3cd3a7646ed5624bf21f209086e128d8b71ecbf12ce9f1ed"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (57\u201358 lines \u00D7 2): jax/_src/numpy/sorting.py:213-269 | jax/_src/numpy/sorting.py:280-337 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/numpy/sorting.py"},"region":{"startLine":213}}}],"partialFingerprints":{"codehealthFindingId/v1":"11196ec705a6c22dbb733313d3774b164b04c443fef5eaefe74fd1430a0f5a0c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (54 lines \u00D7 2): jax/_src/pallas/mosaic/sc_lowering.py:155-208 | jax/_src/pallas/mosaic/sc_lowering.py:275-328 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/mosaic/sc_lowering.py"},"region":{"startLine":155}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b28be69173ca87e6ab8e408b3704e7ab22385e33aff07bc4a14ae1e185683f4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (45\u201353 lines \u00D7 4): jax/_src/random/core.py:1907-1952 | jax/_src/random/core.py:2487-2539 | jax/_src/random/core.py:2557-2604 | jax/_src/random/core.py:3707-3751 \u2014 all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060jax/_src/random/core.py:1907\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/random/core.py"},"region":{"startLine":1907}}}],"partialFingerprints":{"codehealthFindingId/v1":"448def5bdcc006eeb85fdf1ef6c79b1d98464e0ae12fac3037d8b939e817a7a5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (53 lines \u00D7 2): jax/experimental/pallas/ops/gpu/all_gather_mgpu.py:71-123 | jax/experimental/pallas/ops/gpu/reduce_scatter_mgpu.py:86-138 \u2014 before extracting anything, compare \u0060jax/experimental/pallas/ops/gpu/all_gather_mgpu.py\u0060 and \u0060jax/experimental/pallas/ops/gpu/reduce_scatter_mgpu.py\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 123 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060jax/experimental/pallas/ops/gpu/all_gather_mgpu.py:71\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/pallas/ops/gpu/all_gather_mgpu.py"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3d7245da0069fe8ced9180bd1a5b9f3ad643fb3cff592c971a56f1490d30ad3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (46\u201350 lines \u00D7 2): jax/_src/pallas/mosaic_gpu/primitives.py:2846-2891 | jax/_src/pallas/mosaic_gpu/primitives.py:3071-3120 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060jax/_src/pallas/mosaic_gpu/primitives.py:3122\u0060 calls \u0060handle_transforms_and_get_ref\u0060 and \u0060jax/_src/pallas/mosaic_gpu/primitives.py:2893\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/mosaic_gpu/primitives.py"},"region":{"startLine":2846}}}],"partialFingerprints":{"codehealthFindingId/v1":"b31e863bac2428d09723806bc99008d62dc264c746fd9105df00cbea738e8c89"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (36\u201349 lines \u00D7 2): jax/_src/scipy/special.py:3013-3048 | jax/_src/scipy/special.py:3057-3105 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/scipy/special.py"},"region":{"startLine":3013}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d8d59adbd31c81bdc1027f1a73878c1f562662ab4fef99d66128d4d289808d2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (47 lines \u00D7 2): jax/_src/numpy/reductions.py:2454-2500 | jax/_src/numpy/reductions.py:2516-2562 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/numpy/reductions.py"},"region":{"startLine":2454}}}],"partialFingerprints":{"codehealthFindingId/v1":"a65af79f8e9793dc24ea399e37c51d7c19baa84fdb0dbb421dd69001f603ebaf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (43 lines \u00D7 2): jax/_src/random/core.py:3778-3820 | jax/_src/random/core.py:4430-4473 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060jax/_src/random/core.py:4430\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/random/core.py"},"region":{"startLine":3778}}}],"partialFingerprints":{"codehealthFindingId/v1":"b24aede7de420618df639d5f138dd60c618822a2e7df2492a7e8f4f95e30e745"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (41\u201343 lines \u00D7 2): jax/experimental/pallas/ops/tpu/flash_attention.py:1057-1099 | jax/experimental/pallas/ops/tpu/flash_attention.py:1398-1438 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/pallas/ops/tpu/flash_attention.py"},"region":{"startLine":1057}}}],"partialFingerprints":{"codehealthFindingId/v1":"deb591d06ced1e2c200e72c269c3f71995e1f9fb978c541f04d897d92901a3aa"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (41\u201342 lines \u00D7 3): jax/_src/numpy/array_creation.py:275-316 | jax/_src/numpy/array_creation.py:328-369 | jax/_src/numpy/array_creation.py:380-420 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/numpy/array_creation.py"},"region":{"startLine":275}}}],"partialFingerprints":{"codehealthFindingId/v1":"325af9385a1450117b3615a72a01f5058676362a69a9b7e050cf7e69aa5998cb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (41\u201342 lines \u00D7 2): jax/_src/state/primitives.py:1005-1045 | jax/_src/state/primitives.py:1095-1136 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/state/primitives.py"},"region":{"startLine":1005}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9b5c9894b018a773ec6d853908eea1174f336c6e91a5ab24a6418d360c2d8a6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (40\u201341 lines \u00D7 2): jax/_src/random/core.py:4232-4271 | jax/_src/random/core.py:4295-4335 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/random/core.py"},"region":{"startLine":4232}}}],"partialFingerprints":{"codehealthFindingId/v1":"e43f12aef191d5b1988d6f5c47c4325f7c182a30484480c698a323673dc5eddb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (40 lines \u00D7 2): jax/_src/random/core.py:3581-3620 | jax/_src/random/core.py:3639-3678 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/random/core.py"},"region":{"startLine":3581}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a4cd128e88026de9961d939005e8d3276837335037675ea87a76004507899b3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (33\u201337 lines \u00D7 5): jax/_src/random/core.py:1992-2026 | jax/_src/random/core.py:2124-2158 | jax/_src/random/core.py:3482-3514 | jax/_src/random/core.py:3531-3563 | jax/_src/random/core.py:3891-3927 \u2014 all 5 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/random/core.py"},"region":{"startLine":1992}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a3e3ccd69c6fe7c1d0ba7784231951c7d9de05d92177b2c740be0d172a408ac"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (40 lines \u00D7 2): jax/experimental/pallas/ops/gpu/hopper_matmul_mgpu.py:153-192 | jax/experimental/pallas/ops/gpu/hopper_mixed_type_matmul_mgpu.py:173-212 \u2014 before extracting anything, compare \u0060jax/experimental/pallas/ops/gpu/hopper_matmul_mgpu.py\u0060 and \u0060jax/experimental/pallas/ops/gpu/hopper_mixed_type_matmul_mgpu.py\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 161 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060jax/experimental/pallas/ops/gpu/hopper_matmul_mgpu.py:153\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/pallas/ops/gpu/hopper_matmul_mgpu.py"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"3203f66c283885e5287debfbb42d4d453a2ea49425e8a1549077e72c0a9245a4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (33\u201336 lines \u00D7 2): jax/_src/pallas/mosaic/interpret/shared_memory.py:636-668 | jax/_src/pallas/mosaic/interpret/shared_memory.py:698-733 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/mosaic/interpret/shared_memory.py"},"region":{"startLine":636}}}],"partialFingerprints":{"codehealthFindingId/v1":"e310a0f5cd512f1f4c318af3b189ca0804062967d496c1bf52be8f64d8513f73"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (37 lines \u00D7 2): jax/_src/scipy/stats/pareto.py:112-148 | jax/_src/scipy/stats/pareto.py:199-235 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/scipy/stats/pareto.py"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"2436862fc034befda25fb0ca01ff5c2297b6d0070456348b66688760d60a0a95"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (35 lines \u00D7 2): docs/_static/fault_tolerance/data_parallelism.py:69-103 | docs/_static/fault_tolerance/data_parallelism_with_recovery.py:105-139 \u2014 before extracting anything, compare \u0060docs/_static/fault_tolerance/data_parallelism.py\u0060 and \u0060docs/_static/fault_tolerance/data_parallelism_with_recovery.py\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 81 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/_static/fault_tolerance/data_parallelism.py"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"c427c286fdc8e94f6b0a50d1a7d3575288486cccd6321b6e3e640853c048e8a2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (35 lines \u00D7 2): jax/_src/scipy/stats/pareto.py:28-62 | jax/_src/scipy/stats/pareto.py:156-190 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/scipy/stats/pareto.py"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f05775f56da66a44d479a6662a2e2026c6594ff0ee37367bc5c2bc7b719bb09"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (32 lines \u00D7 2): jax/_src/lax/parallel.py:241-272 | jax/_src/lax/parallel.py:281-312 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/lax/parallel.py"},"region":{"startLine":241}}}],"partialFingerprints":{"codehealthFindingId/v1":"76c7ac99ad636236d5daed3ca6aa3768b42a4d474a50132f2b89c40787aa0b8a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (27\u201331 lines \u00D7 3): jax/experimental/pallas/ops/tpu/flash_attention.py:730-756 | jax/experimental/pallas/ops/tpu/flash_attention.py:1062-1092 | jax/experimental/pallas/ops/tpu/flash_attention.py:1403-1433 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060jax/experimental/pallas/ops/tpu/flash_attention.py:730\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/pallas/ops/tpu/flash_attention.py"},"region":{"startLine":730}}}],"partialFingerprints":{"codehealthFindingId/v1":"09d8e603c9c1e39e5dbda2c0578b1527b35df5517fb78e2e3907f1296c16b23b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (31 lines \u00D7 2): jax/_src/scipy/stats/gumbel_l.py:28-58 | jax/_src/scipy/stats/gumbel_r.py:29-59 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/scipy/stats/gumbel_l.py"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"43517f4fcfe6af923c5bac398b309f2a744f4e377fb79916cdd81ccb3a234d5a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (25\u201331 lines \u00D7 2): jax/experimental/pallas/ops/tpu/flash_attention.py:701-725 | jax/experimental/pallas/ops/tpu/flash_attention.py:1368-1398 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060jax/experimental/pallas/ops/tpu/flash_attention.py:701\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/pallas/ops/tpu/flash_attention.py"},"region":{"startLine":701}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d4ab7db40c011fdfc1f1039e2977de6921b9eb30e7630da6c7ef664c91e8da9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (28\u201330 lines \u00D7 2): jax/_src/custom_derivatives.py:323-350 | jax/_src/custom_derivatives.py:995-1024 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060jax/_src/custom_derivatives.py:323\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/custom_derivatives.py"},"region":{"startLine":323}}}],"partialFingerprints":{"codehealthFindingId/v1":"8639a0e10e702640cf578dd7156cd2e47c852e56746b39fb4dadd098023d36e1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (3\u201329 lines \u00D7 3): jax/experimental/mosaic/gpu/fragmented_array.py:4916-4918 | jax/experimental/mosaic/gpu/fragmented_array.py:5447-5475 | jax/experimental/mosaic/gpu/fragmented_array.py:5609-5637 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/mosaic/gpu/fragmented_array.py"},"region":{"startLine":4916}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0092655deb54d066be5cdedb589da3b9f9c9f09f6a0e9c71c3f8d879c35f1cf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (28 lines \u00D7 2): jax/_src/random/core.py:3947-3974 | jax/_src/random/core.py:3999-4026 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/random/core.py"},"region":{"startLine":3947}}}],"partialFingerprints":{"codehealthFindingId/v1":"75bb4c4fbbd98941f655da085d3efcbd5e2e7628a8ee2560a532bc8073f09157"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (28 lines \u00D7 2): jax/_src/scipy/stats/gumbel_l.py:96-123 | jax/_src/scipy/stats/gumbel_l.py:227-254 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/scipy/stats/gumbel_l.py"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"348e26a532e5d2991b599ade955b6e7d071677f7dd8f52fe8edd53fb9e55d181"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21\u201328 lines \u00D7 2): jax/_src/tpu_custom_call.py:709-736 | jax/_src/tpu_custom_call.py:1058-1078 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060jax/_src/tpu_custom_call.py:709\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/tpu_custom_call.py"},"region":{"startLine":709}}}],"partialFingerprints":{"codehealthFindingId/v1":"4bf9fab88656fef02e1e363333ee56076032da94811492408d7001484930697f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (26\u201327 lines \u00D7 2): jax/experimental/pallas/ops/tpu/splash_attention/splash_attention_kernel.py:1624-1649 | jax/experimental/pallas/ops/tpu/splash_attention/splash_attention_kernel.py:2183-2209 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060jax/experimental/pallas/ops/tpu/splash_attention/splash_attention_kernel.py:1624\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/pallas/ops/tpu/splash_attention/splash_attention_kernel.py"},"region":{"startLine":1624}}}],"partialFingerprints":{"codehealthFindingId/v1":"d03864f187c42c6158465c266e445b36ae4ba1673a9185c46016545d25d6e3f9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18\u201326 lines \u00D7 4): jax/_src/lax/slicing.py:3197-3214 | jax/_src/lax/slicing.py:3245-3262 | jax/_src/lax/slicing.py:3414-3439 | jax/_src/lax/slicing.py:3671-3688 \u2014 all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060jax/_src/lax/slicing.py:3414\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/lax/slicing.py"},"region":{"startLine":3197}}}],"partialFingerprints":{"codehealthFindingId/v1":"3279267b30fe2973658aed189988f405617dc55ef60315684067940e245b4e88"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (26 lines \u00D7 3): jaxlib/tools/build_gpu_kernels_wheel.py:110-135 | jaxlib/tools/build_gpu_kernels_wheel.py:167-192 | jaxlib/tools/build_gpu_kernels_wheel.py:223-248 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jaxlib/tools/build_gpu_kernels_wheel.py"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"b805d4605d4330af518dfa4544be5ebd9efa5a1158bf998e0ccb70dfbfee7cd7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (25\u201326 lines \u00D7 2): jax/experimental/pallas/ops/gpu/hopper_matmul_mgpu.py:288-312 | jax/experimental/pallas/ops/gpu/hopper_mixed_type_matmul_mgpu.py:293-318 \u2014 before extracting anything, compare \u0060jax/experimental/pallas/ops/gpu/hopper_matmul_mgpu.py\u0060 and \u0060jax/experimental/pallas/ops/gpu/hopper_mixed_type_matmul_mgpu.py\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 161 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060jax/experimental/pallas/ops/gpu/hopper_matmul_mgpu.py:288\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/pallas/ops/gpu/hopper_matmul_mgpu.py"},"region":{"startLine":288}}}],"partialFingerprints":{"codehealthFindingId/v1":"475773fd04045b9d35c76d11744d1a156109e002f693bc0f6e4bb256192c4dfd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (25\u201326 lines \u00D7 2): jax/experimental/pallas/ops/tpu/megablox/gmm.py:529-553 | jax/experimental/pallas/ops/tpu/megablox/gmm.py:767-792 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060jax/experimental/pallas/ops/tpu/megablox/gmm.py:529\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/pallas/ops/tpu/megablox/gmm.py"},"region":{"startLine":529}}}],"partialFingerprints":{"codehealthFindingId/v1":"71c6252771606fb5ee380b906b02206f0ae2afce78496eb9b6950ee06aee6bc9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14\u201325 lines \u00D7 3): jax/_src/pallas/mosaic/sc_primitives.py:172-196 | jax/_src/pallas/mosaic/sc_primitives.py:207-222 | jax/_src/pallas/mosaic/sc_primitives.py:232-245 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/mosaic/sc_primitives.py"},"region":{"startLine":172}}}],"partialFingerprints":{"codehealthFindingId/v1":"858279d90ca57ed2c53a0536f90b815d320810a7a34c1daaafb385e4f4b8b5b0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20\u201325 lines \u00D7 2): jax/experimental/pallas/ops/tpu/splash_attention/splash_attention_kernel.py:1651-1670 | jax/experimental/pallas/ops/tpu/splash_attention/splash_attention_kernel.py:2211-2235 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060jax/experimental/pallas/ops/tpu/splash_attention/splash_attention_kernel.py:1651\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/pallas/ops/tpu/splash_attention/splash_attention_kernel.py"},"region":{"startLine":1651}}}],"partialFingerprints":{"codehealthFindingId/v1":"bbb91dca9fea3e09bd5791eab0419d0fded242d39a070eee6a5a573e0f1cf539"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (24 lines \u00D7 2): jax/_src/pallas/mosaic/sc_lowering.py:529-552 | jax/_src/pallas/mosaic/sc_lowering.py:560-583 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/mosaic/sc_lowering.py"},"region":{"startLine":529}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f239cdb52b1e68ee1234d727523cd8f5ad60156ec98399e15789e08cde8b325"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20\u201324 lines \u00D7 2): jax/_src/pallas/mosaic_gpu/interpret/gpu_callbacks.py:815-834 | jax/_src/pallas/mosaic_gpu/interpret/gpu_callbacks.py:1131-1154 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060jax/_src/pallas/mosaic_gpu/interpret/gpu_callbacks.py:815\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/mosaic_gpu/interpret/gpu_callbacks.py"},"region":{"startLine":815}}}],"partialFingerprints":{"codehealthFindingId/v1":"74a2df17dc7acdc9b5df51d6d3ca2c7105aeeff319f2ee6a46bce0571d7b5084"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21\u201323 lines \u00D7 2): jax/experimental/pallas/ops/gpu/attention_mgpu.py:468-488 | jax/experimental/pallas/ops/gpu/attention_mgpu.py:575-597 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/pallas/ops/gpu/attention_mgpu.py"},"region":{"startLine":468}}}],"partialFingerprints":{"codehealthFindingId/v1":"3fb7825518c7f76716a1e1300c0573f1b3b0a4f5e7efe07ea29024e7b1acb12a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19\u201322 lines \u00D7 2): jax/_src/pallas/mosaic_gpu/pipeline.py:464-485 | jax/_src/pallas/mosaic_gpu/pipeline.py:1044-1062 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060jax/_src/pallas/mosaic_gpu/pipeline.py:464\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/mosaic_gpu/pipeline.py"},"region":{"startLine":464}}}],"partialFingerprints":{"codehealthFindingId/v1":"df4c66c0773df8e6cd694677aa3612673e750a2af0430b80555c013153b95566"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (22 lines \u00D7 2): jax/_src/pallas/triton/lowering.py:2101-2122 | jax/_src/pallas/triton/lowering.py:2324-2345 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/triton/lowering.py"},"region":{"startLine":2101}}}],"partialFingerprints":{"codehealthFindingId/v1":"dddf003387a624426efb3bdd1344da6c0583b26f5b829e2ad5d1b026d0467212"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (22 lines \u00D7 2): jax/_src/scipy/fft.py:235-256 | jax/_src/scipy/fft.py:463-484 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060jax/_src/scipy/fft.py:235\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/scipy/fft.py"},"region":{"startLine":235}}}],"partialFingerprints":{"codehealthFindingId/v1":"dce2e1d5cddc630a1c9ffda40851966b6fc9a13ca0e6d71f79688ef8670ca37b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 2): jax/_src/callback.py:82-102 | jax/_src/callback.py:421-441 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/callback.py"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"79332ef21e35133ed9692eae7d9629ad2e96efabdbba4b507212421bc5c3336c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16\u201321 lines \u00D7 2): jax/_src/lax/lax.py:4122-4142 | jax/_src/lax/lax.py:4193-4208 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060jax/_src/lax/lax.py:4119\u0060 calls \u0060isinstance\u0060, \u0060full\u0060 and \u0060jax/_src/lax/lax.py:4191\u0060 does not \u2014 after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/lax/lax.py"},"region":{"startLine":4122}}}],"partialFingerprints":{"codehealthFindingId/v1":"282f6bc81850357adc6c7121a5e3b447189d72f7b23ff8fd5e925c06d631be98"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 2): jax/experimental/pallas/ops/tpu/flash_attention.py:1120-1140 | jax/experimental/pallas/ops/tpu/flash_attention.py:1455-1475 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/pallas/ops/tpu/flash_attention.py"},"region":{"startLine":1120}}}],"partialFingerprints":{"codehealthFindingId/v1":"c125977a279e0b540ac48a06bdba30c7cb90a6a49edfe2f1848d52e9977cc11c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 2): jax/experimental/pallas/ops/tpu/random/philox.py:83-104 | jax/experimental/pallas/ops/tpu/random/threefry.py:34-54 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/pallas/ops/tpu/random/philox.py"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d79a2aef6f368ca92d027a487016b55028ca50698bfa64c883f50751643735b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2): docs/_static/fault_tolerance/data_parallelism.py:106-125 | docs/_static/fault_tolerance/data_parallelism_with_recovery.py:159-178 \u2014 before extracting anything, compare \u0060docs/_static/fault_tolerance/data_parallelism.py\u0060 and \u0060docs/_static/fault_tolerance/data_parallelism_with_recovery.py\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 81 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/_static/fault_tolerance/data_parallelism.py"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"32832d64df064199c551bb07e091e28479c7d58896db25031f3cdab95c843c18"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2): jax/_src/pallas/core.py:1482-1501 | jax/_src/pallas/core.py:1508-1527 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060jax/_src/pallas/core.py:1482\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/core.py"},"region":{"startLine":1482}}}],"partialFingerprints":{"codehealthFindingId/v1":"0abbc2e4c0ca646b1adb60c3dfdf8b5c9a216ffee58f5a478633c95c520a28cc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2): jax/_src/tpu_info.py:483-502 | jax/_src/tpu_info.py:510-529 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060jax/_src/tpu_info.py:483\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/tpu_info.py"},"region":{"startLine":483}}}],"partialFingerprints":{"codehealthFindingId/v1":"3727e7f66cdc4a4c7b1446d5a68fdc5ce0355220686dafc242a7c4739a60625a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18\u201320 lines \u00D7 2): jax/experimental/pallas/ops/tpu/splash_attention/splash_attention_kernel.py:1553-1570 | jax/experimental/pallas/ops/tpu/splash_attention/splash_attention_kernel.py:2084-2103 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060jax/experimental/pallas/ops/tpu/splash_attention/splash_attention_kernel.py:1553\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/pallas/ops/tpu/splash_attention/splash_attention_kernel.py"},"region":{"startLine":1553}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff1274ff49b01e46f701c92fbc7e43c2f30efcd4a6d2f2ef2d0abe66a9377fed"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2): jax/experimental/pallas/ops/tpu/splash_attention/splash_attention_mask_info.py:995-1014 | jax/experimental/pallas/ops/tpu/splash_attention/splash_attention_mask_info.py:1060-1079 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060jax/experimental/pallas/ops/tpu/splash_attention/splash_attention_mask_info.py:995\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/pallas/ops/tpu/splash_attention/splash_attention_mask_info.py"},"region":{"startLine":995}}}],"partialFingerprints":{"codehealthFindingId/v1":"61c530dc547e5a011ca2b52c2f8cde0d56f9150394d251045c0ede5c81249dfb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19\u201320 lines \u00D7 2): jaxlib/tools/build_gpu_plugin_wheel.py:116-134 | jaxlib/tools/build_gpu_plugin_wheel.py:156-175 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jaxlib/tools/build_gpu_plugin_wheel.py"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa7a2b989ebc7f5c04da0be691b50e8a7d02a19683884bf578f95f3fad390c41"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17\u201319 lines \u00D7 2): jax/_src/callback.py:608-624 | jax/_src/callback.py:645-663 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060jax/_src/callback.py:608\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/callback.py"},"region":{"startLine":608}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c23364061b0bca103ae55b61c7a0c56265c62446ccf91368cca326807f069e0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2): jax/_src/pallas/mosaic/interpret/interpret_pallas_call.py:655-673 | jax/_src/pallas/mosaic/interpret/interpret_pallas_call.py:788-806 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060jax/_src/pallas/mosaic/interpret/interpret_pallas_call.py:787\u0060 calls \u0060array\u0060 and \u0060jax/_src/pallas/mosaic/interpret/interpret_pallas_call.py:654\u0060 does not \u2014 after which the two agree again for 4 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/mosaic/interpret/interpret_pallas_call.py"},"region":{"startLine":655}}}],"partialFingerprints":{"codehealthFindingId/v1":"23c08e19b22693df5c231331e582f724e83a5c28a3b5c1a12c3434fb86abe97a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18\u201319 lines \u00D7 2): jax/_src/pallas/triton/lowering.py:528-546 | jax/_src/pallas/triton/lowering.py:2603-2620 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/triton/lowering.py"},"region":{"startLine":528}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d0d4a6c51cb53d593a435a1f45acb2c3c85cbfd36ce19a1c42e6b891e8908bc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2): jax/experimental/pallas/ops/tpu/splash_attention/splash_attention_kernel.py:1959-1977 | jax/experimental/pallas/ops/tpu/splash_attention/splash_attention_kernel.py:2052-2070 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/pallas/ops/tpu/splash_attention/splash_attention_kernel.py"},"region":{"startLine":1959}}}],"partialFingerprints":{"codehealthFindingId/v1":"4abcecffdd2f026c3cf962516ea2da0f9aab20d134abd43deca7383acd21a207"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): jax/_src/mesh_utils.py:119-136 | jax/_src/mesh_utils.py:168-185 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/mesh_utils.py"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"2658d19adfd42622ca64a8beaec8d5f64d4209de4dc779e1375c5175221caab1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15\u201318 lines \u00D7 2): jax/_src/pallas/mosaic/interpret/race_detection_state.py:109-126 | jax/_src/pallas/mosaic/interpret/race_detection_state.py:160-174 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060jax/_src/pallas/mosaic/interpret/race_detection_state.py:109\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/mosaic/interpret/race_detection_state.py"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e8f19d15b5873ed7da8df375bcd1f2c8b508c3bf2f4bbb873f187f286598b7b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): jax/_src/pallas/mosaic_gpu/interpret/shared_memory.py:701-718 | jax/_src/pallas/mosaic_gpu/interpret/shared_memory.py:839-856 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060jax/_src/pallas/mosaic_gpu/interpret/shared_memory.py:701\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/mosaic_gpu/interpret/shared_memory.py"},"region":{"startLine":701}}}],"partialFingerprints":{"codehealthFindingId/v1":"a859c886f6a4b6c6265d9596c1641f3d4b2fff4a875ed62863ba091babaac188"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): jax/_src/pallas/mosaic/lowering.py:3033-3049 | jax/_src/pallas/mosaic/lowering.py:3244-3260 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/mosaic/lowering.py"},"region":{"startLine":3033}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a6988b7397992fd42eed46e3578acceed41fb506a7850fccb0c014e12a2aca1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): jax/_src/pallas/mosaic/sc_lowering.py:669-685 | jax/_src/pallas/mosaic/sc_lowering.py:785-801 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060jax/_src/pallas/mosaic/sc_lowering.py:669\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/mosaic/sc_lowering.py"},"region":{"startLine":669}}}],"partialFingerprints":{"codehealthFindingId/v1":"53b4caadc04589f84559f7b92a789af14ab2229e7866d8372ce82794be826311"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): jax/_src/pallas/mosaic/sc_primitives.py:426-442 | jax/_src/pallas/mosaic/sc_primitives.py:454-470 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/mosaic/sc_primitives.py"},"region":{"startLine":426}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1b655bab82d311cec4a1d222fda0096fd9700ba49765c7d8d2a5a33ca10c746"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): jax/_src/pallas/pallas_call.py:619-635 | jax/_src/pallas/pallas_call.py:657-673 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/pallas_call.py"},"region":{"startLine":619}}}],"partialFingerprints":{"codehealthFindingId/v1":"031456d50022470ec3ea7bb831ee4ce2f1a1b5f67123cb2211eaec782b35f419"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201317 lines \u00D7 2): jax/_src/scipy/bessel.py:506-517 | jax/_src/scipy/bessel.py:1122-1138 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/scipy/bessel.py"},"region":{"startLine":506}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f7abcb32e0b6e060a16537c775d4fea47e15303a941da830ea81b1c88a7e6be"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14\u201317 lines \u00D7 2): jax/experimental/pallas/ops/gpu/all_gather_mgpu.py:145-158 | jax/experimental/pallas/ops/gpu/reduce_scatter_mgpu.py:161-177 \u2014 before extracting anything, compare \u0060jax/experimental/pallas/ops/gpu/all_gather_mgpu.py\u0060 and \u0060jax/experimental/pallas/ops/gpu/reduce_scatter_mgpu.py\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 123 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060jax/experimental/pallas/ops/gpu/reduce_scatter_mgpu.py:161\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060jax/experimental/pallas/ops/gpu/all_gather_mgpu.py:142\u0060 calls \u0060multimem_store\u0060, \u0060semaphore_signal_multicast\u0060 and \u0060jax/experimental/pallas/ops/gpu/reduce_scatter_mgpu.py:161\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/pallas/ops/gpu/all_gather_mgpu.py"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"28a6e0508a2d3007d66304bb9e86086a0b9c6d0d6e24fd61de71722e8069b817"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): jax/experimental/pallas/ops/tpu/splash_attention/splash_attention_mask_info.py:364-380 | jax/experimental/pallas/ops/tpu/splash_attention/splash_attention_mask_info.py:563-579 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/pallas/ops/tpu/splash_attention/splash_attention_mask_info.py"},"region":{"startLine":364}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0068304b6b060773c550e472d1f6a73dd61e91f5338d980a7341921b38a092b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): jax/_src/config.py:563-578 | jax/_src/config.py:706-721 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060jax/_src/config.py:563\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/config.py"},"region":{"startLine":563}}}],"partialFingerprints":{"codehealthFindingId/v1":"325161b0f56634383014780d8ffa50a8a601b7acdb37d04b8967e8689ff8356d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): jax/_src/custom_derivatives.py:135-150 | jax/_src/custom_derivatives.py:564-579 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/custom_derivatives.py"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"bca9a6a1e60fc0573ac14e8e62a73015ad28ec7f92132c6a9b9b28b46b89b93b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): jax/_src/pallas/hlo_interpreter.py:123-138 | jax/_src/pallas/mosaic/interpret/utils.py:61-78 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060jax/_src/pallas/hlo_interpreter.py:123\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/hlo_interpreter.py"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"89102428ebfd8842157c98c30da894a615ba8852bca5cfff44349b1227f2c3f6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15\u201316 lines \u00D7 2): jax/_src/pallas/mosaic/interpret/interpret_pallas_call.py:1184-1199 | jax/_src/pallas/mosaic/interpret/interpret_pallas_call.py:1259-1273 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060jax/_src/pallas/mosaic/interpret/interpret_pallas_call.py:1184\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/mosaic/interpret/interpret_pallas_call.py"},"region":{"startLine":1184}}}],"partialFingerprints":{"codehealthFindingId/v1":"bda24b9c37d6e5a01bd830e8441bea4696e266de9b458267dea3d9d212d846fc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201316 lines \u00D7 2): jax/_src/pallas/mosaic/pallas_call_registration.py:171-186 | jax/_src/pallas/mosaic/pallas_call_registration.py:193-204 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060jax/_src/pallas/mosaic/pallas_call_registration.py:171\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/mosaic/pallas_call_registration.py"},"region":{"startLine":171}}}],"partialFingerprints":{"codehealthFindingId/v1":"2dcf7a73bf47b637ba666c7272afbf1448b143b33a96870fa0e90659bfa7f90f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201316 lines \u00D7 2): jax/_src/scipy/bessel.py:570-578 | jax/_src/scipy/bessel.py:1177-1192 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/scipy/bessel.py"},"region":{"startLine":570}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a52b24777c45a05a1932c8384a93860e39625d12fda0e085ebb3558e94a597a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): jax/_src/state/primitives.py:982-997 | jax/_src/state/primitives.py:1076-1091 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/state/primitives.py"},"region":{"startLine":982}}}],"partialFingerprints":{"codehealthFindingId/v1":"e03558e710df738d512c2fa26ae74f4207418e5bdcb73b0affb67f99fcbbd37d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): jax/experimental/pallas/ops/gpu/all_gather_mgpu.py:182-197 | jax/experimental/pallas/ops/gpu/reduce_scatter_mgpu.py:203-218 \u2014 before extracting anything, compare \u0060jax/experimental/pallas/ops/gpu/all_gather_mgpu.py\u0060 and \u0060jax/experimental/pallas/ops/gpu/reduce_scatter_mgpu.py\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 123 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/pallas/ops/gpu/all_gather_mgpu.py"},"region":{"startLine":182}}}],"partialFingerprints":{"codehealthFindingId/v1":"6fc97de244d0ed8be76cc623e907303ae7c4a385c58cad3ecbd4c480ff951dfb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): jax/experimental/pallas/ops/gpu/attention_mgpu.py:242-257 | jax/experimental/pallas/ops/gpu/attention_mgpu.py:715-730 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/pallas/ops/gpu/attention_mgpu.py"},"region":{"startLine":242}}}],"partialFingerprints":{"codehealthFindingId/v1":"51cf9f6e52f755363c36a4a94103d6797eab0464834f800fa5d16e797bdf8f0c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 3): jax/_src/tpu_info.py:323-337 | jax/_src/tpu_info.py:343-357 | jax/_src/tpu_info.py:423-437 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060jax/_src/tpu_info.py:323\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/tpu_info.py"},"region":{"startLine":323}}}],"partialFingerprints":{"codehealthFindingId/v1":"2234e8c3c010b9fadb37e3fb495206290d593e5af47728fbf67ddb0862c953d9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 3): jax/_src/tpu_info.py:363-377 | jax/_src/tpu_info.py:403-417 | jax/_src/tpu_info.py:450-464 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060jax/_src/tpu_info.py:363\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/tpu_info.py"},"region":{"startLine":363}}}],"partialFingerprints":{"codehealthFindingId/v1":"2405aa41d8807ffe78ad86170310157fac8c1843fbc783fe565f40a71e06af66"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 3): jax/_src/tpu_info.py:477-491 | jax/_src/tpu_info.py:504-518 | jax/_src/tpu_info.py:531-545 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060jax/_src/tpu_info.py:477\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/tpu_info.py"},"region":{"startLine":477}}}],"partialFingerprints":{"codehealthFindingId/v1":"a66f9f968652a031bfb7bc6f070a2c0b86911736cd6f66392257324fb480e62a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14\u201315 lines \u00D7 2): jax/_src/lax/control_flow/conditionals.py:400-413 | jax/_src/lax/control_flow/loops.py:597-611 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060jax/_src/lax/control_flow/conditionals.py:400\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/lax/control_flow/conditionals.py"},"region":{"startLine":400}}}],"partialFingerprints":{"codehealthFindingId/v1":"4860c93c11acb6e7817b450eb9b6fd326b6728d93e42dc7507aa325ecf3e36e5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): jax/_src/pallas/mosaic_gpu/interpret/interpret_pallas_call.py:310-324 | jax/_src/pallas/mosaic_gpu/interpret/interpret_pallas_call.py:336-350 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/mosaic_gpu/interpret/interpret_pallas_call.py"},"region":{"startLine":310}}}],"partialFingerprints":{"codehealthFindingId/v1":"64fb0b6039f48b553639551aa9ab4e61871ce56df128f5c86df98a02f6fc5385"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201315 lines \u00D7 2): jax/experimental/mosaic/gpu/layout_inference.py:1429-1441 | jax/experimental/mosaic/gpu/layout_inference.py:1486-1500 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060jax/experimental/mosaic/gpu/layout_inference.py:1429\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060op\u0060 to \u0060vector.ExtractStridedSliceOp\u0060 in one and \u0060vector.InsertStridedSliceOp\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060jax/experimental/mosaic/gpu/layout_inference.py:1485\u0060 calls \u0060Variable\u0060, \u0060ValueSite\u0060 and \u0060jax/experimental/mosaic/gpu/layout_inference.py:1428\u0060 does not \u2014 after which the two agree again for 4 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/mosaic/gpu/layout_inference.py"},"region":{"startLine":1429}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4edd847cd18b59c41acaf0bfc95957f6f1fe733b90995c69034b89da7529680"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201315 lines \u00D7 2): jax/experimental/mosaic/gpu/tcgen05.py:446-457 | jax/experimental/mosaic/gpu/wgmma.py:395-409 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/mosaic/gpu/tcgen05.py"},"region":{"startLine":446}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd3e695f3463424117b6089ee4d1c582267455404055931bd52c4320de19ea36"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): jax/experimental/pallas/ops/gpu/all_gather_mgpu.py:205-221 | jax/experimental/pallas/ops/gpu/reduce_scatter_mgpu.py:227-243 \u2014 before extracting anything, compare \u0060jax/experimental/pallas/ops/gpu/all_gather_mgpu.py\u0060 and \u0060jax/experimental/pallas/ops/gpu/reduce_scatter_mgpu.py\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 123 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/pallas/ops/gpu/all_gather_mgpu.py"},"region":{"startLine":205}}}],"partialFingerprints":{"codehealthFindingId/v1":"608b22ac65a5821cdd9b3077d56609b7cb19b7ee45a8388401c9446883fb8343"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): jax/experimental/pallas/ops/gpu/hopper_matmul_mgpu.py:315-329 | jax/experimental/pallas/ops/gpu/hopper_mixed_type_matmul_mgpu.py:323-337 \u2014 before extracting anything, compare \u0060jax/experimental/pallas/ops/gpu/hopper_matmul_mgpu.py\u0060 and \u0060jax/experimental/pallas/ops/gpu/hopper_mixed_type_matmul_mgpu.py\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 161 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060jax/experimental/pallas/ops/gpu/hopper_matmul_mgpu.py:315\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/pallas/ops/gpu/hopper_matmul_mgpu.py"},"region":{"startLine":315}}}],"partialFingerprints":{"codehealthFindingId/v1":"0bc2de97cf3574b22b7d86378fa749affea1f343ae2fa677041dda20fe7a5fc9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): docs/_static/fault_tolerance/data_parallelism.py:36-49 | docs/_static/fault_tolerance/data_parallelism_with_recovery.py:38-51 \u2014 before extracting anything, compare \u0060docs/_static/fault_tolerance/data_parallelism.py\u0060 and \u0060docs/_static/fault_tolerance/data_parallelism_with_recovery.py\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 81 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. The \u0060return\u0060 at the foot of the matched lines is the enclosing body\u0027s own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that \u0060return\u0060 occupied \u2014 no decision has to be handed back and re-acted on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/_static/fault_tolerance/data_parallelism.py"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"576223459b4e9de1bccbab3ea2258b0d343a5ef5f468ba9c928e78a8de6a64eb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): jax/_src/pallas/mosaic/lowering.py:6181-6194 | jax/_src/pallas/mosaic_gpu/lowering.py:4545-4558 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/mosaic/lowering.py"},"region":{"startLine":6181}}}],"partialFingerprints":{"codehealthFindingId/v1":"612e647b37bd662e05f91fdadc497b24ae8e050622d4f03d99d63dc68851950c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): jax/_src/pallas/mosaic_gpu/pipeline.py:821-834 | jax/_src/pallas/mosaic_gpu/pipeline.py:906-919 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/mosaic_gpu/pipeline.py"},"region":{"startLine":821}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0229a9c56319338e92fc10036e8d6ee161dd60af2a9bbb68570329a226f5250"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): jax/_src/pallas/mosaic_gpu/primitives.py:217-230 | jax/_src/pallas/mosaic_gpu/primitives.py:842-855 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/mosaic_gpu/primitives.py"},"region":{"startLine":217}}}],"partialFingerprints":{"codehealthFindingId/v1":"403e751595d26666d9289bacb0be68aec9ce8c53d8c31b5df6fbad01dbaef442"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): jax/_src/shard_map.py:586-599 | jax/_src/shard_map.py:629-642 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/shard_map.py"},"region":{"startLine":586}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2b5751458a689cc98cb93d96ac298fe92d79740597194e5b7b822c298c962c7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): jax/experimental/pallas/ops/tpu/flash_attention.py:405-418 | jax/experimental/pallas/ops/tpu/flash_attention.py:1193-1207 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060jax/experimental/pallas/ops/tpu/flash_attention.py:405\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/pallas/ops/tpu/flash_attention.py"},"region":{"startLine":405}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ceca6391640888c6177da2918a57da58ec58c97c6c0c19ebf4be2c3f0a2efc5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201314 lines \u00D7 2): jax/experimental/pallas/ops/tpu/flash_attention.py:886-899 | jax/experimental/pallas/ops/tpu/flash_attention.py:1221-1232 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060jax/experimental/pallas/ops/tpu/flash_attention.py:886\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/pallas/ops/tpu/flash_attention.py"},"region":{"startLine":886}}}],"partialFingerprints":{"codehealthFindingId/v1":"00128ecad94d1a2b1fd6f597294d423971710d0fe6840cfc35241469c25f2e7e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 3): jax/_src/pallas/mosaic/interpret/race_detection_state.py:119-131 | jax/_src/pallas/mosaic/interpret/race_detection_state.py:167-179 | jax/_src/pallas/mosaic/interpret/race_detection_state.py:189-201 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/mosaic/interpret/race_detection_state.py"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"827b78575433eda9cc6e319f5d446f9c9310cd29f9c25b629f90a2271984aba3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201313 lines \u00D7 3): jax/experimental/pallas/ops/tpu/splash_attention/splash_attention_kernel.py:963-975 | jax/experimental/pallas/ops/tpu/splash_attention/splash_attention_kernel.py:1455-1465 | jax/experimental/pallas/ops/tpu/splash_attention/splash_attention_kernel.py:1915-1925 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060jax/experimental/pallas/ops/tpu/splash_attention/splash_attention_kernel.py:963\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060jax/experimental/pallas/ops/tpu/splash_attention/splash_attention_kernel.py:1468\u0060 calls \u0060ValueError\u0060 and \u0060jax/experimental/pallas/ops/tpu/splash_attention/splash_attention_kernel.py:1927\u0060 does not \u2014 after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/pallas/ops/tpu/splash_attention/splash_attention_kernel.py"},"region":{"startLine":963}}}],"partialFingerprints":{"codehealthFindingId/v1":"07d9218e2e631342cddbb889220e276a3b871d7b5615eee0c92d5ee92ef625c6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 3): jax/experimental/pallas/ops/tpu/splash_attention/splash_attention_kernel.py:1179-1191 | jax/experimental/pallas/ops/tpu/splash_attention/splash_attention_kernel.py:1663-1675 | jax/experimental/pallas/ops/tpu/splash_attention/splash_attention_kernel.py:2228-2240 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060jax/experimental/pallas/ops/tpu/splash_attention/splash_attention_kernel.py:1179\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/pallas/ops/tpu/splash_attention/splash_attention_kernel.py"},"region":{"startLine":1179}}}],"partialFingerprints":{"codehealthFindingId/v1":"25c9a68aa401d29a72dc3a7f3221a4d2f58e826cc35b749e2c81449d0b7b1e5a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): jax/_src/compute_on.py:210-222 | jax/_src/xla_metadata.py:394-406 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/compute_on.py"},"region":{"startLine":210}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b932c09539f526eed0871cf266af9b846af251638b01a49215d8c23d38868e1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201313 lines \u00D7 2): jax/_src/interpreters/pxla.py:1545-1556 | jax/_src/interpreters/pxla.py:1580-1592 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060jax/_src/interpreters/pxla.py:1545\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/interpreters/pxla.py"},"region":{"startLine":1545}}}],"partialFingerprints":{"codehealthFindingId/v1":"a38d4f7ae3f2585bebe46665af06c3b1e60ae0ec21a1ad0a08ddabe26cf77687"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): jax/_src/lax/control_flow/loops.py:186-198 | jax/_src/lax/control_flow/loops.py:410-422 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/lax/control_flow/loops.py"},"region":{"startLine":186}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e898c620b27d5cafd2b4aab83ac319ec1b64f9af1d50cdb9da0b05ca7d53909"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): jax/_src/lax/control_flow/loops.py:839-851 | jax/_src/lax/control_flow/loops.py:972-984 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060jax/_src/lax/control_flow/loops.py:839\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/lax/control_flow/loops.py"},"region":{"startLine":839}}}],"partialFingerprints":{"codehealthFindingId/v1":"86269cc4049f1815ee1b00bc068af15627ee5138585eb4a68e091528bf13f8a9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): jax/_src/lax/lax.py:9484-9496 | jax/_src/lax/lax.py:9529-9541 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. The \u0060return\u0060 at the foot of the matched lines is the enclosing body\u0027s own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that \u0060return\u0060 occupied \u2014 no decision has to be handed back and re-acted on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/lax/lax.py"},"region":{"startLine":9484}}}],"partialFingerprints":{"codehealthFindingId/v1":"30cd765821070b34acac13a541967011c93a8160f55abb15c0674c4b48b640dd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201313 lines \u00D7 2): jax/_src/numpy/ufuncs.py:3047-3058 | jax/_src/numpy/ufuncs.py:3207-3219 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/numpy/ufuncs.py"},"region":{"startLine":3047}}}],"partialFingerprints":{"codehealthFindingId/v1":"0187dfab7689e1618fee1ad6b1d771c15c55c49c1a0ec112c92de3e68323ac34"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201313 lines \u00D7 2): jax/_src/pallas/mosaic/interpret/utils.py:160-170 | jax/_src/pallas/primitives.py:1215-1227 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/mosaic/interpret/utils.py"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"081f0129cf33913d1a5d56decacb91d0c2c37a30f1fb5c8d2a25a1dc228a2110"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): jax/_src/pallas/mosaic_gpu/primitives.py:1522-1534 | jax/_src/pallas/mosaic_gpu/primitives.py:1720-1732 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/mosaic_gpu/primitives.py"},"region":{"startLine":1522}}}],"partialFingerprints":{"codehealthFindingId/v1":"1fbfdad8402ba3a0872769c3b7b2f66d3631dbcc7201ac20a9159f103cc61097"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): jax/_src/pallas/mosaic_gpu/primitives.py:4346-4358 | jax/_src/pallas/mosaic_gpu/primitives.py:4494-4506 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/mosaic_gpu/primitives.py"},"region":{"startLine":4346}}}],"partialFingerprints":{"codehealthFindingId/v1":"199bc9d564a4551755e0b7a458b34a97ace4b122492df64c413fd9db53b43580"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201313 lines \u00D7 2): jax/_src/pallas/mosaic_gpu/primitives.py:5314-5326 | jax/_src/pallas/triton/primitives.py:319-329 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060jax/_src/pallas/mosaic_gpu/primitives.py:5314\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/mosaic_gpu/primitives.py"},"region":{"startLine":5314}}}],"partialFingerprints":{"codehealthFindingId/v1":"054159c1dcf3f98bf696d8fab75bfafa1e1449cfa12c70bfd98a12a63b0f48d5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15\u201316 lines \u00D7 2): jax/_src/pallas/primitives.py:265-279 | jax/_src/pallas/primitives.py:388-403 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060jax/_src/pallas/primitives.py:388\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/primitives.py"},"region":{"startLine":265}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf5d862407d8bf5294618183812aebfb3b81825f6a378a110c137ecbbabe2099"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): jax/_src/scipy/bessel.py:585-597 | jax/_src/scipy/bessel.py:1201-1213 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/scipy/bessel.py"},"region":{"startLine":585}}}],"partialFingerprints":{"codehealthFindingId/v1":"c896f23f3341c975aedc21cdbd4fc4cb29867200355085024e38d0948ba5f655"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201313 lines \u00D7 2): jax/_src/scipy/bessel.py:625-634 | jax/_src/scipy/bessel.py:1290-1302 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/scipy/bessel.py"},"region":{"startLine":625}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a8d073d031d2678cead55490d9e88fd76e5b7a955788d29c9d97341f6701711"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): jax/_src/scipy/special.py:3713-3725 | jax/_src/scipy/special.py:3780-3792 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/scipy/special.py"},"region":{"startLine":3713}}}],"partialFingerprints":{"codehealthFindingId/v1":"138a9f7606210237d49df144dfcc80146c56b7b5577d50511f5b9a671b8b6daf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): jax/_src/state/primitives.py:1049-1061 | jax/_src/state/primitives.py:1140-1152 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/state/primitives.py"},"region":{"startLine":1049}}}],"partialFingerprints":{"codehealthFindingId/v1":"49b10b2f3b2f78ca8bbebbe1af2cc6f1e3b9154091c83deef8342171ca271c25"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): jax/experimental/sparse/coo.py:128-140 | jax/experimental/sparse/csr.py:96-108 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/sparse/coo.py"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"7fe6c315ee4c3c0509563e8fe5b89fbbd9ed451411195ac1feae9ce62bc77314"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u201312 lines \u00D7 4): jax/_src/pallas/mosaic_gpu/primitives.py:4312-4319 | jax/_src/pallas/mosaic_gpu/primitives.py:4345-4356 | jax/_src/pallas/mosaic_gpu/primitives.py:4447-4454 | jax/_src/pallas/mosaic_gpu/primitives.py:4493-4504 \u2014 all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060jax/_src/pallas/mosaic_gpu/primitives.py:4312\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060jax/_src/pallas/mosaic_gpu/primitives.py:4344\u0060 calls \u0060isinstance\u0060 and \u0060jax/_src/pallas/mosaic_gpu/primitives.py:4311\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/mosaic_gpu/primitives.py"},"region":{"startLine":4312}}}],"partialFingerprints":{"codehealthFindingId/v1":"68cc300b08da146c5ba0ed2a653d0c460fbcb4c88821bc0c81948d415754433a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201312 lines \u00D7 4): jax/experimental/sparse/_lowerings.py:66-77 | jax/experimental/sparse/_lowerings.py:119-130 | jax/experimental/sparse/_lowerings.py:193-203 | jax/experimental/sparse/_lowerings.py:245-255 \u2014 all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060jax/experimental/sparse/_lowerings.py:66\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The \u0060return\u0060 at the foot of the matched lines is the enclosing body\u0027s own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that \u0060return\u0060 occupied \u2014 no decision has to be handed back and re-acted on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/sparse/_lowerings.py"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0929e7f7368d810caa13755c34798e23968c1794f14a89ec70eb376c256c689"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201312 lines \u00D7 3): jax/_src/lax/linalg.py:1805-1814 | jax/_src/lax/linalg.py:2009-2020 | jax/_src/tpu/linalg/eigh.py:674-685 \u2014 there are 3 copies across 2 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 3 sites; resolving a subset leaves the remainder to drift apart. Read the line range as the matched WINDOW rather than a finished unit: at \u0060jax/_src/lax/linalg.py:1805\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/lax/linalg.py"},"region":{"startLine":1805}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f9a1388de2af2b347f883599d45f380100ce1212bbfd4eb455aec12ea922c25"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 3): jax/_src/pallas/mosaic_gpu/primitives.py:4616-4627 | jax/_src/pallas/mosaic_gpu/primitives.py:4799-4810 | jax/_src/pallas/mosaic_gpu/primitives.py:4863-4874 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060jax/_src/pallas/mosaic_gpu/primitives.py:4798\u0060 calls \u0060isinstance\u0060 and \u0060jax/_src/pallas/mosaic_gpu/primitives.py:4862\u0060 does not \u2014 after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/mosaic_gpu/primitives.py"},"region":{"startLine":4616}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e35572b348472cdcdef8b5ffccbd32a3c32a68d7d6c1afe301e818d921422e1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201312 lines \u00D7 3): jax/experimental/mosaic/gpu/fragmented_array.py:1766-1776 | jax/experimental/mosaic/gpu/fragmented_array.py:1805-1815 | jax/experimental/mosaic/gpu/fragmented_array.py:1830-1841 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060jax/experimental/mosaic/gpu/fragmented_array.py:1766\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/mosaic/gpu/fragmented_array.py"},"region":{"startLine":1766}}}],"partialFingerprints":{"codehealthFindingId/v1":"2bdc84331cb33ef1a5fe0084b4860d4a2e2daa8a5f2e058022ac3a3dbdbb352d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): jax/_src/cudnn/fused_attention_stablehlo.py:712-723 | jax/_src/cudnn/fused_attention_stablehlo.py:799-810 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/cudnn/fused_attention_stablehlo.py"},"region":{"startLine":712}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b54c6cd36ddc84cc031b09db33f196154c5d72a8a7de6e5ac9f4902f1aaaf60"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201312 lines \u00D7 2): jax/_src/interpreters/mlir.py:2144-2154 | jax/_src/interpreters/mlir.py:2187-2198 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060jax/_src/interpreters/mlir.py:2144\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/interpreters/mlir.py"},"region":{"startLine":2144}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0fd7932fb7e3e7f4381d48ba31f425b86769a5ec6ac17f3d01538f59d054129"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201312 lines \u00D7 2): jax/_src/lax/lgamma.py:448-459 | jax/_src/lax/lgamma.py:1137-1147 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060jax/_src/lax/lgamma.py:448\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/lax/lgamma.py"},"region":{"startLine":448}}}],"partialFingerprints":{"codehealthFindingId/v1":"c16914894ef7d452e4a1292dd2fd6e6c24ae6d51625e5d37e19bd6577bafa9c5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201312 lines \u00D7 2): jax/_src/lax/parallel.py:1126-1135 | jax/_src/lax/parallel.py:2387-2398 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060jax/_src/lax/parallel.py:2385\u0060 calls \u0060list\u0060 and \u0060jax/_src/lax/parallel.py:1125\u0060 does not \u2014 after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/lax/parallel.py"},"region":{"startLine":1126}}}],"partialFingerprints":{"codehealthFindingId/v1":"81a8f4e3b534cae57a6aa1b785766a764fe743c8b36e0b76c8f5de3dd41a5bae"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): jax/_src/lax/windowed_reductions.py:762-773 | jax/_src/lax/windowed_reductions.py:775-786 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/lax/windowed_reductions.py"},"region":{"startLine":762}}}],"partialFingerprints":{"codehealthFindingId/v1":"163041e5713a8bafafd921d21b80c37ef5f629b488f61c4a171bc1f5b77e26f3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): jax/_src/pallas/mosaic/interpret/interpret_pallas_call.py:1591-1602 | jax/_src/pallas/mosaic/interpret/interpret_pallas_call.py:1614-1625 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060jax/_src/pallas/mosaic/interpret/interpret_pallas_call.py:1591\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/mosaic/interpret/interpret_pallas_call.py"},"region":{"startLine":1591}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d3d353b160926f232fba03c39f14a1cee41bbeafad28ccb23dc8e3bc40fa84a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): jax/_src/pallas/mosaic/lowering.py:4809-4820 | jax/_src/pallas/mosaic_gpu/lowering.py:3831-3844 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/mosaic/lowering.py"},"region":{"startLine":4809}}}],"partialFingerprints":{"codehealthFindingId/v1":"76a69cfe788b255f4fddad4ecfbf95171094da8913b40e7117e2ce6e88f53240"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): jax/_src/pallas/mosaic_gpu/torch.py:270-281 | jax/experimental/mosaic/gpu/core.py:1452-1463 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060jax/_src/pallas/mosaic_gpu/torch.py:270\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/mosaic_gpu/torch.py"},"region":{"startLine":270}}}],"partialFingerprints":{"codehealthFindingId/v1":"0924655f8579ceadf903cf3ec8e73ccf8da0613b50e13c4d082d2357d542e41c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): jax/_src/scipy/linalg.py:166-177 | jax/_src/scipy/linalg.py:1343-1354 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/scipy/linalg.py"},"region":{"startLine":166}}}],"partialFingerprints":{"codehealthFindingId/v1":"d45b9e7eec1081df685a2ed02ac2d88ff3e143a4ad7a5072f90b3ff4a8f89c25"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201312 lines \u00D7 2): jax/_src/thunky/thunky.py:89-100 | jax/_src/thunky/thunky.py:2086-2095 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/thunky/thunky.py"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f306065547ceb8f25b7e57bbe341ce085fd056dc7a882f20960dcd04c196da5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): jax/experimental/mosaic/gpu/dialect_lowering.py:1144-1156 | jax/experimental/mosaic/gpu/dialect_lowering.py:1275-1287 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/mosaic/gpu/dialect_lowering.py"},"region":{"startLine":1144}}}],"partialFingerprints":{"codehealthFindingId/v1":"c06435762a10582e0ab9f54833c90f72424dc9f2070d44b778b07077389617e1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): jax/experimental/mosaic/gpu/layout_inference.py:810-821 | jax/experimental/mosaic/gpu/layout_inference.py:857-868 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. The \u0060return\u0060 at the foot of the matched lines is the enclosing body\u0027s own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that \u0060return\u0060 occupied \u2014 no decision has to be handed back and re-acted on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/mosaic/gpu/layout_inference.py"},"region":{"startLine":810}}}],"partialFingerprints":{"codehealthFindingId/v1":"73f9189279bc4d34166dafa3ea1469e1edeaa3efd88854d4e7c9f3829d7fbf27"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201312 lines \u00D7 2): jax/experimental/pallas/ops/gpu/all_gather_mgpu.py:126-137 | jax/experimental/pallas/ops/gpu/reduce_scatter_mgpu.py:144-154 \u2014 before extracting anything, compare \u0060jax/experimental/pallas/ops/gpu/all_gather_mgpu.py\u0060 and \u0060jax/experimental/pallas/ops/gpu/reduce_scatter_mgpu.py\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 123 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/pallas/ops/gpu/all_gather_mgpu.py"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"af1d5b44fb676d59580c2ff9c7ef05616bbca6abaf569ca331d78e3e2f997841"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (22 lines \u00D7 2): jax/experimental/pallas/ops/gpu/attention_mgpu.py:81-102 | jax/experimental/pallas/ops/gpu/attention_mgpu.py:657-678 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/pallas/ops/gpu/attention_mgpu.py"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b0ba486b7f490a978a96c619cff94ac3db0fe1c1ed2ccc6f0bc2b1a4aba7166"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201312 lines \u00D7 2): jax/experimental/pallas/ops/gpu/ragged_dot_mgpu.py:286-295 | jax/experimental/pallas/ops/gpu/transposed_ragged_dot_mgpu.py:263-274 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060jax/experimental/pallas/ops/gpu/ragged_dot_mgpu.py:286\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/pallas/ops/gpu/ragged_dot_mgpu.py"},"region":{"startLine":286}}}],"partialFingerprints":{"codehealthFindingId/v1":"29fdbd41381d5c46d3539e9ddef30eea93ef6ebc9d1f04ed2aa98da9083b73f7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): jax/experimental/pallas/ops/tpu/splash_attention/splash_attention_mask_info.py:1017-1028 | jax/experimental/pallas/ops/tpu/splash_attention/splash_attention_mask_info.py:1082-1093 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/pallas/ops/tpu/splash_attention/splash_attention_mask_info.py"},"region":{"startLine":1017}}}],"partialFingerprints":{"codehealthFindingId/v1":"49d9dcdfc660d5c7aa4dff8871e72f7571909b74b618f5cd55f5afaadcbb5860"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 3): jax/_src/config.py:569-579 | jax/_src/config.py:629-639 | jax/_src/config.py:712-722 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060jax/_src/config.py:569\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/config.py"},"region":{"startLine":569}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f1f474cccb5cb3ee79729021db9b75351b052550229a5df639249784e41282a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 3): jax/_src/random/philox2x32.py:142-152 | jax/_src/random/philox4x32.py:153-163 | jax/_src/random/threefry4x32.py:206-216 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from all 3 call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/random/philox2x32.py"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"273c8a38b9a2d9f315a6ff84f0b7cf0ce37678f8aa849870891c5b5cc8a74db0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): docs/_static/fault_tolerance/dont_fail.py:31-41 | docs/_static/fault_tolerance/while_loop.py:27-37 \u2014 before extracting anything, compare \u0060docs/_static/fault_tolerance/dont_fail.py\u0060 and \u0060docs/_static/fault_tolerance/while_loop.py\u0060 as WHOLE FILES: 100% of the shorter file\u0027s lines also appear in the other, so this reads as one file having been copied from the other rather than as a helper waiting to be extracted. The 2 duplicated block(s) this scan matched between them are fragments of that copy, not the extent of it \u2014 treat the file pair as the unit. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060docs/_static/fault_tolerance/dont_fail.py:31\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060docs/_static/fault_tolerance/dont_fail.py:29\u0060 calls \u0060update\u0060 and \u0060docs/_static/fault_tolerance/while_loop.py:25\u0060 does not \u2014 after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/_static/fault_tolerance/dont_fail.py"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ea1acb5dadb6c8a695d208957f45dbde7a61af51aea79b48b72365711d86d6f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201311 lines \u00D7 2): jax/_src/cudnn/fused_attention_stablehlo.py:552-561 | jax/_src/cudnn/fused_attention_stablehlo.py:580-590 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/cudnn/fused_attention_stablehlo.py"},"region":{"startLine":552}}}],"partialFingerprints":{"codehealthFindingId/v1":"586e7606beff3c5f538c00b086df0379d162bc712dcc417088670cdc5c1925c5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): jax/_src/custom_derivatives.py:331-341 | jax/_src/hijax.py:1423-1433 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060jax/_src/custom_derivatives.py:331\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/custom_derivatives.py"},"region":{"startLine":331}}}],"partialFingerprints":{"codehealthFindingId/v1":"d89e0ba71a122b89e36b0d015dd5c96ad81094811045ddb333f60e305343d16f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201311 lines \u00D7 2): jax/_src/custom_derivatives.py:345-354 | jax/_src/hijax.py:1443-1453 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060jax/_src/custom_derivatives.py:345\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/custom_derivatives.py"},"region":{"startLine":345}}}],"partialFingerprints":{"codehealthFindingId/v1":"335b4c71a259701710b5d7defbef701165f8f2e22b86444080d6d4c4c59642d1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201311 lines \u00D7 2): jax/_src/custom_partitioning.py:537-546 | jax/_src/debugging.py:773-783 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060jax/_src/custom_partitioning.py:537\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/custom_partitioning.py"},"region":{"startLine":537}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f5155422ceaf51488ac95271b94b1c168b39658b7a9e3087fcd996b469ca985"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): jax/_src/interpreters/mlir.py:2004-2014 | jax/_src/interpreters/mlir.py:2076-2086 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/interpreters/mlir.py"},"region":{"startLine":2004}}}],"partialFingerprints":{"codehealthFindingId/v1":"d919f0c332117b6bccb966a310f44cb86d7a163d8f53ceebfdf162d5dcf0ec63"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201311 lines \u00D7 2): jax/_src/lax/convolution.py:692-702 | jax/_src/lax/convolution.py:728-737 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/lax/convolution.py"},"region":{"startLine":692}}}],"partialFingerprints":{"codehealthFindingId/v1":"678e73ada972320bea6bcb95912ebd92ab9299c43d6507bd36c5f6c493d1d4d7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201311 lines \u00D7 2): jax/_src/lax/parallel.py:2312-2321 | jax/_src/lax/parallel.py:2902-2912 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/lax/parallel.py"},"region":{"startLine":2312}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ba4e214234494885915fc04b53821014e36654fd2d8caebd6442b73823e9b90"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201311 lines \u00D7 2): jax/_src/lax/slicing.py:3162-3171 | jax/_src/lax/slicing.py:3400-3410 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/lax/slicing.py"},"region":{"startLine":3162}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d8a02144ea73a4fb911018ef500e725b93c922dae7372256d682684f2c33446"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): jax/_src/lax/windowed_reductions.py:221-231 | jax/_src/lax/windowed_reductions.py:271-281 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. The \u0060return\u0060 at the foot of the matched lines is the enclosing body\u0027s own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that \u0060return\u0060 occupied \u2014 no decision has to be handed back and re-acted on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/lax/windowed_reductions.py"},"region":{"startLine":221}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f99f3445ede792cf993f037436e35acad711491987d533c9f8ee160992f5b13"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): jax/_src/pallas/mosaic/primitives.py:419-429 | jax/_src/pallas/mosaic/primitives.py:664-674 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060jax/_src/pallas/mosaic/primitives.py:662\u0060 calls \u0060NotImplementedError\u0060 and \u0060jax/_src/pallas/mosaic/primitives.py:418\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/mosaic/primitives.py"},"region":{"startLine":419}}}],"partialFingerprints":{"codehealthFindingId/v1":"b770d3ce4be0be2ba187bd4d09a62199fef5cc3b1be50a1b11a1f4e5847e544c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201311 lines \u00D7 2): jax/_src/pallas/mosaic_gpu/interpret/jaxpr_interpret.py:1044-1052 | jax/_src/pallas/mosaic_gpu/interpret/jaxpr_interpret.py:1196-1206 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/mosaic_gpu/interpret/jaxpr_interpret.py"},"region":{"startLine":1044}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ca8896dd7f9e6343b1bcf85968f3ea2974d38aa3972943ef3fa2d15a330619e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): jax/_src/pallas/mosaic_gpu/lowering.py:1901-1911 | jax/_src/pallas/mosaic_gpu/lowering.py:2059-2069 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060jax/_src/pallas/mosaic_gpu/lowering.py:1901\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/mosaic_gpu/lowering.py"},"region":{"startLine":1901}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4f47b44a461c54ca45540b9bceb7f1ab28d0d84c1dd3eba717165db414ca162"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u201311 lines \u00D7 2): jax/_src/scipy/bessel.py:1549-1559 | jax/_src/scipy/bessel.py:2499-2506 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060jax/_src/scipy/bessel.py:1549\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/scipy/bessel.py"},"region":{"startLine":1549}}}],"partialFingerprints":{"codehealthFindingId/v1":"e88462fe01c06362f8988521bf3576a5d72def537129e75bb88ca940fbc59ae1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): jax/_src/scipy/optimize/line_search.py:375-385 | jax/_src/scipy/optimize/line_search.py:397-407 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060jax/_src/scipy/optimize/line_search.py:375\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/scipy/optimize/line_search.py"},"region":{"startLine":375}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8b06e848161306baf1f938e90ba1561a9b6e89dc2e2e614a99dda63d4b05258"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): jax/_src/thunky/thunky.py:2067-2077 | jax/_src/thunky/thunky.py:2174-2184 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/thunky/thunky.py"},"region":{"startLine":2067}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2d7fb1ec44f02ddd0492d173650834fc77d837e5bba188c15888663fd71553c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): jax/_src/tpu/linalg/eigh.py:68-79 | jax/_src/tpu/linalg/qdwh.py:46-57 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. The \u0060return\u0060 at the foot of the matched lines is the enclosing body\u0027s own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that \u0060return\u0060 occupied \u2014 no decision has to be handed back and re-acted on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/tpu/linalg/eigh.py"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"da1dc9b703f59d2ccd107659a809f0651e965a9abcf8d4f7e91a15b0e001e232"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): jax/experimental/jet.py:810-820 | jax/experimental/jet.py:826-836 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/jet.py"},"region":{"startLine":810}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f778c8cc9f1e3eba0cf33e7cd3fafe251b176cb6536205e9efacf07e0922e97"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): jax/experimental/pallas/ops/gpu/blackwell_matmul_mgpu.py:133-143 | jax/experimental/pallas/ops/gpu/blackwell_ragged_dot_mgpu.py:99-109 \u2014 before extracting anything, compare \u0060jax/experimental/pallas/ops/gpu/blackwell_matmul_mgpu.py\u0060 and \u0060jax/experimental/pallas/ops/gpu/blackwell_ragged_dot_mgpu.py\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 30 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/pallas/ops/gpu/blackwell_matmul_mgpu.py"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"24cfdc6750e4cac2129eb52a68ba3bd4c37c75d48613ebe4329c678a8d97ec8d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): jax/experimental/pallas/ops/gpu/hopper_matmul_mgpu.py:132-142 | jax/experimental/pallas/ops/gpu/hopper_mixed_type_matmul_mgpu.py:135-168 \u2014 before extracting anything, compare \u0060jax/experimental/pallas/ops/gpu/hopper_matmul_mgpu.py\u0060 and \u0060jax/experimental/pallas/ops/gpu/hopper_mixed_type_matmul_mgpu.py\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 161 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060jax/experimental/pallas/ops/gpu/hopper_matmul_mgpu.py:132\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/pallas/ops/gpu/hopper_matmul_mgpu.py"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b91e3f85b8f1744676e765589be69f0fd6092ac361accb632950c8ca38fd3b6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): jax/experimental/pallas/ops/gpu/ragged_dot_mgpu.py:255-265 | jax/experimental/pallas/ops/gpu/transposed_ragged_dot_mgpu.py:231-241 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/pallas/ops/gpu/ragged_dot_mgpu.py"},"region":{"startLine":255}}}],"partialFingerprints":{"codehealthFindingId/v1":"4af05a2a4d953a60dd07976feb349cdc325b23d9572e12ff44e1e0eecfb09261"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): jax/experimental/pallas/ops/tpu/flash_attention.py:1025-1037 | jax/experimental/pallas/ops/tpu/flash_attention.py:1364-1374 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060jax/experimental/pallas/ops/tpu/flash_attention.py:1025\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/pallas/ops/tpu/flash_attention.py"},"region":{"startLine":1025}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a11bbb245a9afe371c9c968fb9ff812ac5429414050d1ae033495d3db604eb4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 4): jax/_src/pallas/mosaic/lowering.py:3695-3704 | jax/_src/pallas/mosaic/lowering.py:3717-3726 | jax/_src/pallas/mosaic/lowering.py:4053-4062 | jax/_src/pallas/mosaic/lowering.py:4075-4084 \u2014 all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/mosaic/lowering.py"},"region":{"startLine":3695}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c1cfdcf28ccb3f1a1af222a9bbf47c16421df8d6d89ca22471dfc4ce07af41a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3): jax/_src/custom_derivatives.py:331-340 | jax/_src/custom_derivatives.py:1018-1027 | jax/_src/hijax.py:1423-1432 \u2014 there are 3 copies across 2 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 3 sites; resolving a subset leaves the remainder to drift apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/custom_derivatives.py"},"region":{"startLine":331}}}],"partialFingerprints":{"codehealthFindingId/v1":"77bfea07181ecb583a39669e546390e465477b12a5b58186e16e4614eef4932b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): docs/_static/fault_tolerance/data_parallelism.py:53-64 | docs/_static/fault_tolerance/data_parallelism_with_recovery.py:55-66 \u2014 before extracting anything, compare \u0060docs/_static/fault_tolerance/data_parallelism.py\u0060 and \u0060docs/_static/fault_tolerance/data_parallelism_with_recovery.py\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 81 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. The \u0060return\u0060 at the foot of the matched lines is the enclosing body\u0027s own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that \u0060return\u0060 occupied \u2014 no decision has to be handed back and re-acted on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/_static/fault_tolerance/data_parallelism.py"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1d957ee2e635d9d7f684feeaef7452ad549f4b4ff5c250b699525648ef13867"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): jax/_src/compute_on.py:226-235 | jax/_src/xla_metadata.py:411-420 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060jax/_src/compute_on.py:236\u0060 calls \u0060_filter_zeros\u0060 and \u0060jax/_src/xla_metadata.py:421\u0060 does not \u2014 after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/compute_on.py"},"region":{"startLine":226}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb241d42f0938c2c5dd711933c3f99a8466a10e622300add98c3128cf007b1ac"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): jax/_src/cudnn/fused_attention_stablehlo.py:830-839 | jax/_src/cudnn/fused_attention_stablehlo.py:1692-1701 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060jax/_src/cudnn/fused_attention_stablehlo.py:830\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/cudnn/fused_attention_stablehlo.py"},"region":{"startLine":830}}}],"partialFingerprints":{"codehealthFindingId/v1":"9354b6c2c55ca7c04d1609c3f4f98582ae0f52c439ec448b9a25366b9d3f9653"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (2\u201310 lines \u00D7 4): jax/_src/cudnn/fused_attention_stablehlo.py:910-918 | jax/_src/cudnn/fused_attention_stablehlo.py:986-987 | jax/_src/cudnn/fused_attention_stablehlo.py:1739-1748 | jax/_src/cudnn/fused_attention_stablehlo.py:1790-1791 \u2014 all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/cudnn/fused_attention_stablehlo.py"},"region":{"startLine":910}}}],"partialFingerprints":{"codehealthFindingId/v1":"63f25ecc60363e8b99d61b6edf460e36629ea8bd6a1c7dccfee952a0da1105c4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201310 lines \u00D7 2): jax/_src/ffi.py:509-517 | jax/_src/ffi.py:518-527 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/ffi.py"},"region":{"startLine":509}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f57da3c1c273bbe475d89edfd95cc26a952330770e29ba420d59759c1256375"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): jax/_src/interpreters/partial_eval.py:230-239 | jax/_src/interpreters/partial_eval.py:277-286 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/interpreters/partial_eval.py"},"region":{"startLine":230}}}],"partialFingerprints":{"codehealthFindingId/v1":"69c3f3269048f9bbe9028552cc8a394f2ec63948fe612b8f3471002d4bb9c826"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): jax/_src/interpreters/pxla.py:1460-1469 | jax/_src/interpreters/pxla.py:1471-1480 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/interpreters/pxla.py"},"region":{"startLine":1460}}}],"partialFingerprints":{"codehealthFindingId/v1":"2405f8672cf8dc665d5a9486c7d4fa15208e8baaecef430bf3094a1802635bf9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): jax/_src/interpreters/pxla.py:1969-1978 | jax/_src/pjit.py:225-234 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/interpreters/pxla.py"},"region":{"startLine":1969}}}],"partialFingerprints":{"codehealthFindingId/v1":"803f3c6060ddfa6fa7a2cba0ef421e0c73269b814143b17db96dcde103d06f61"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): jax/_src/lax/exp_log.py:436-445 | jax/_src/lax/trig.py:577-586 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/lax/exp_log.py"},"region":{"startLine":436}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f5ed2e9ceaa1901d50e76e1d459795aaa1afe793b9d1a6be201ea56bac56647"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): jax/_src/lax/parallel.py:2256-2265 | jax/_src/lax/parallel.py:2506-2515 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060jax/_src/lax/parallel.py:2256\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/lax/parallel.py"},"region":{"startLine":2256}}}],"partialFingerprints":{"codehealthFindingId/v1":"0327371860e82df0389ec4ead89b53bb65d4ece3a199f0b91554b178a82e9dc2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201310 lines \u00D7 2): jax/_src/lax/parallel.py:3137-3145 | jax/_src/lax/parallel.py:3186-3195 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060jax/_src/lax/parallel.py:3186\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/lax/parallel.py"},"region":{"startLine":3137}}}],"partialFingerprints":{"codehealthFindingId/v1":"98c510835ba874ef0bfe042415034ea424dd854e4ed40c29871f00a2a5dea7d8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): jax/_src/lax/slicing.py:3183-3192 | jax/_src/lax/slicing.py:3226-3235 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/lax/slicing.py"},"region":{"startLine":3183}}}],"partialFingerprints":{"codehealthFindingId/v1":"f879332eaa6ee253478064e3455b29ee1430b0d6f8b00ac44dcae87690209eaa"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201310 lines \u00D7 2): jax/_src/lax/windowed_reductions.py:833-842 | jax/_src/lax/windowed_reductions.py:981-989 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/lax/windowed_reductions.py"},"region":{"startLine":833}}}],"partialFingerprints":{"codehealthFindingId/v1":"9fb760175c73658d1f29fe31a19d985bcd4e99b79504023f251e6e0c82fa9c80"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): jax/_src/numpy/lax_numpy.py:4135-4144 | jax/_src/numpy/lax_numpy.py:4145-4154 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/numpy/lax_numpy.py"},"region":{"startLine":4135}}}],"partialFingerprints":{"codehealthFindingId/v1":"0725e7fb5415387c2c58dacbdf0a53765604db53ea9c32ef5230b565472181e2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201310 lines \u00D7 2): jax/_src/pallas/mosaic/lowering.py:3267-3275 | jax/_src/pallas/mosaic/primitives.py:1737-1746 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060jax/_src/pallas/mosaic/primitives.py:1737\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/mosaic/lowering.py"},"region":{"startLine":3267}}}],"partialFingerprints":{"codehealthFindingId/v1":"394863ec999318b0f62dd8f1b07e8dc4ac124117d10189f8cf4cbec4586bdb42"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): jax/_src/pallas/mosaic_gpu/primitives.py:5011-5020 | jax/_src/pallas/mosaic_gpu/primitives.py:5961-5970 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/mosaic_gpu/primitives.py"},"region":{"startLine":5011}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b1d6b78fa120407404babb6f9e10d5d4a6383355d460ebc39134b72a07c0961"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): jax/experimental/pallas/ops/gpu/blackwell_matmul_mgpu.py:162-171 | jax/experimental/pallas/ops/gpu/blackwell_ragged_dot_mgpu.py:128-137 \u2014 before extracting anything, compare \u0060jax/experimental/pallas/ops/gpu/blackwell_matmul_mgpu.py\u0060 and \u0060jax/experimental/pallas/ops/gpu/blackwell_ragged_dot_mgpu.py\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 30 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060jax/experimental/pallas/ops/gpu/blackwell_matmul_mgpu.py:162\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060jax/experimental/pallas/ops/gpu/blackwell_ragged_dot_mgpu.py:139\u0060 calls \u0060barrier_wait\u0060 and \u0060jax/experimental/pallas/ops/gpu/blackwell_matmul_mgpu.py:174\u0060 does not \u2014 after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/pallas/ops/gpu/blackwell_matmul_mgpu.py"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"f84f4497fc9b57034c757f14e4b51d06b8dbf6bd3962a48bf6fafea337c10940"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): jax/experimental/pallas/ops/tpu/flash_attention.py:1013-1022 | jax/experimental/pallas/ops/tpu/flash_attention.py:1352-1361 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/pallas/ops/tpu/flash_attention.py"},"region":{"startLine":1013}}}],"partialFingerprints":{"codehealthFindingId/v1":"400c622e1900e46e4ee6e89b6a74b348bbcf6db39602d61bbeb917b91029d114"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): jax/experimental/pallas/ops/tpu/flash_attention.py:1500-1514 | jax/experimental/pallas/ops/tpu/flash_attention.py:1640-1654 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/pallas/ops/tpu/flash_attention.py"},"region":{"startLine":1500}}}],"partialFingerprints":{"codehealthFindingId/v1":"6afac688c791b9af6df6a054ab3f41772e6b78ae25694e953d314156ee185328"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): jax/experimental/serialize_executable.py:82-91 | jax/experimental/serialize_executable.py:137-146 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/serialize_executable.py"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ed0afe89bd171e7ca2b312e379a8d11c08ed866b1036075354df30462856e1d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): jax/experimental/source_mapper/hlo.py:86-95 | jax/experimental/source_mapper/hlo.py:101-110 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060jax/experimental/source_mapper/hlo.py:86\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/source_mapper/hlo.py"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed8d5cbc71a118d27dafa5724307ed8ed7b1aa310c2c7303c2d375f6705f7c9f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): jax/experimental/sparse/coo.py:466-475 | jax/experimental/sparse/coo.py:587-596 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/sparse/coo.py"},"region":{"startLine":466}}}],"partialFingerprints":{"codehealthFindingId/v1":"61ccae28c987923f39cf287608510f4335e7205d01e8b161108169a34671ee65"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 5): docs/_static/fault_tolerance/cancel_collectives.py:37-45 | docs/_static/fault_tolerance/collectives.py:31-39 | docs/_static/fault_tolerance/dont_fail.py:30-38 | docs/_static/fault_tolerance/live_devices.py:38-46 | docs/_static/fault_tolerance/while_loop.py:26-34 \u2014 before extracting anything, compare \u0060docs/_static/fault_tolerance/cancel_collectives.py\u0060 and \u0060docs/_static/fault_tolerance/collectives.py\u0060 as WHOLE FILES: 97% of the shorter file\u0027s lines also appear in the other, so this reads as one file having been copied from the other rather than as a helper waiting to be extracted. The 2 duplicated block(s) this scan matched between them are fragments of that copy, not the extent of it \u2014 treat the file pair as the unit. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060docs/_static/fault_tolerance/cancel_collectives.py:49\u0060 calls \u0060_live_devices\u0060, \u0060devices\u0060 and \u0060docs/_static/fault_tolerance/collectives.py:41\u0060 does not \u2014 after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/_static/fault_tolerance/cancel_collectives.py"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"1cea36edd9cc41e2cafb3e7fd1ab573a0b380e09d4f168db853b96a912d2c32a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6\u20139 lines \u00D7 3): jax/experimental/mosaic/gpu/examples/matmul_blackwell.py:77-82 | jax/experimental/pallas/ops/gpu/blackwell_matmul_mgpu.py:83-88 | jax/experimental/pallas/ops/gpu/blackwell_ragged_dot_mgpu.py:246-254 \u2014 before extracting anything, compare \u0060jax/experimental/pallas/ops/gpu/blackwell_matmul_mgpu.py\u0060 and \u0060jax/experimental/pallas/ops/gpu/blackwell_ragged_dot_mgpu.py\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 30 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/mosaic/gpu/examples/matmul_blackwell.py"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"37fcb279ba246ed25edcf93d3c71cd3008606c2929ef0040f3c8a91d7f65e8c4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u20139 lines \u00D7 2): jax/_src/compute_on.py:270-277 | jax/_src/pjit.py:1746-1754 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060jax/_src/compute_on.py:270\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/compute_on.py"},"region":{"startLine":270}}}],"partialFingerprints":{"codehealthFindingId/v1":"d289cf65ffa325e0a5adeb3a9f129dc4cd7f6ad733976535d33a35ba134b8773"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): jax/_src/config.py:461-469 | jax/_src/config.py:500-508 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060jax/_src/config.py:461\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/config.py"},"region":{"startLine":461}}}],"partialFingerprints":{"codehealthFindingId/v1":"4df6d58866989cb83c1a4e0eaaaf10af0c27c18b7f5f5960c506390bdcd50204"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): jax/_src/core.py:2706-2714 | jax/_src/core.py:2729-2737 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/core.py"},"region":{"startLine":2706}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ffceabaa1c7062b5f5736bb69090455999c0767d7d59c813b2679c4afdf3275"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): jax/_src/interpreters/mlir.py:1925-1933 | jax/_src/interpreters/mlir.py:1937-1945 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060jax/_src/interpreters/mlir.py:1925\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/interpreters/mlir.py"},"region":{"startLine":1925}}}],"partialFingerprints":{"codehealthFindingId/v1":"e19f44b24180ff862eb96b692a91f454833c10ab93ac3f9068639a79bce59d09"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): jax/_src/lax/convolution.py:766-774 | jax/_src/lax/lax.py:7315-7323 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/lax/convolution.py"},"region":{"startLine":766}}}],"partialFingerprints":{"codehealthFindingId/v1":"e32154e7b50db6786c9383279b6a8ba72e15ff188c97cafeaac8f66446fa7334"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): jax/_src/pallas/mosaic/interpret/utils.py:174-182 | jax/_src/pallas/primitives.py:1230-1238 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/mosaic/interpret/utils.py"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"84c51ff7c589f53afa5a8459ea72ead397aa020d5275177ab0a6d813d4cdea08"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): jax/_src/pallas/mosaic/primitives.py:596-606 | jax/_src/pallas/mosaic/primitives.py:609-617 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060jax/_src/pallas/mosaic/primitives.py:596\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/mosaic/primitives.py"},"region":{"startLine":596}}}],"partialFingerprints":{"codehealthFindingId/v1":"97753d1aae93a7bd229b06bf20de8a1e5a00af06581112fae86a52e5a0e798ef"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): jax/_src/pallas/mosaic/sc_primitives.py:62-70 | jax/_src/pallas/mosaic/sc_primitives.py:123-131 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/mosaic/sc_primitives.py"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"1990bd8125aee67121f0bc8da03a3367057899afcba37d7b5222dc5a8d9f008c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u20139 lines \u00D7 2): jax/_src/pallas/mosaic_gpu/lowering.py:1154-1162 | jax/_src/pallas/triton/lowering.py:438-445 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060jax/_src/pallas/mosaic_gpu/lowering.py:1154\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/mosaic_gpu/lowering.py"},"region":{"startLine":1154}}}],"partialFingerprints":{"codehealthFindingId/v1":"52515bc16be965cd2583efd1433e5a06701fdae59912f69cc2f4d7dad9e87405"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): jax/_src/pallas/triton/lowering.py:2881-2889 | jax/_src/pallas/utils.py:213-221 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/triton/lowering.py"},"region":{"startLine":2881}}}],"partialFingerprints":{"codehealthFindingId/v1":"ffd72462f9d83cdbec265a8f7152ceba91c541c0e47bc98d618ec2bbf07ee27a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): jax/_src/random/core.py:2418-2426 | jax/_src/random/core.py:2937-2945 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/random/core.py"},"region":{"startLine":2418}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d67dd1bbbed8fc600ebf1ac3386e7e6ec29a61714607151e0d76f08ceffe7ad"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): jax/_src/scipy/special.py:4195-4203 | jax/_src/scipy/special.py:4547-4555 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/scipy/special.py"},"region":{"startLine":4195}}}],"partialFingerprints":{"codehealthFindingId/v1":"417113334abc7b5e09135b724e2ee0f1a40b24d45057ff2c4e46ee3dd8f922b9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): jax/_src/thunky/thunky.py:995-1003 | jax/_src/thunky/thunky.py:1043-1051 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. The \u0060return\u0060 at the foot of the matched lines is the enclosing body\u0027s own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that \u0060return\u0060 occupied \u2014 no decision has to be handed back and re-acted on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/thunky/thunky.py"},"region":{"startLine":995}}}],"partialFingerprints":{"codehealthFindingId/v1":"16ce4a6a7eac25aed4e1497b92d6aff8fd25f53c859648422b2d8d6b05c43edb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): jax/_src/tpu_info.py:430-438 | jax/_src/tpu_info.py:538-546 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060jax/_src/tpu_info.py:430\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/tpu_info.py"},"region":{"startLine":430}}}],"partialFingerprints":{"codehealthFindingId/v1":"ecb1d6e5ab59339f7074abd0336e9c7dddfbecfcae06075771716e74f2c9ac4f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): jax/experimental/mosaic/gpu/launch_context.py:2430-2438 | jax/experimental/mosaic/gpu/launch_context.py:2455-2463 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/mosaic/gpu/launch_context.py"},"region":{"startLine":2430}}}],"partialFingerprints":{"codehealthFindingId/v1":"34b5383b90aa36b122be8e3f668c23197a7be55b27f8245b4359328c83d4240a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): jax/experimental/pallas/ops/gpu/hopper_matmul_mgpu.py:81-93 | jax/experimental/pallas/ops/gpu/hopper_mixed_type_matmul_mgpu.py:118-130 \u2014 before extracting anything, compare \u0060jax/experimental/pallas/ops/gpu/hopper_matmul_mgpu.py\u0060 and \u0060jax/experimental/pallas/ops/gpu/hopper_mixed_type_matmul_mgpu.py\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 161 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/pallas/ops/gpu/hopper_matmul_mgpu.py"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"c00b0742b6e171c47d0d8d1b5df193ed3820ab6ecb821d0770068cddc6ffd7df"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): jax/experimental/pallas/ops/tpu/flash_attention.py:819-827 | jax/experimental/pallas/ops/tpu/flash_attention.py:1167-1175 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/pallas/ops/tpu/flash_attention.py"},"region":{"startLine":819}}}],"partialFingerprints":{"codehealthFindingId/v1":"151852dd13141aeb80627bc6feb91ae2d6976a0239619eaa1af88d6d50133e1f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): jax/experimental/pallas/ops/tpu/splash_attention/splash_attention_kernel.py:1398-1406 | jax/experimental/pallas/ops/tpu/splash_attention/splash_attention_kernel.py:1812-1820 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060jax/experimental/pallas/ops/tpu/splash_attention/splash_attention_kernel.py:1398\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/pallas/ops/tpu/splash_attention/splash_attention_kernel.py"},"region":{"startLine":1398}}}],"partialFingerprints":{"codehealthFindingId/v1":"dccb0bb8e0fc748056fc5834f8e648b4c2bba77ac10c15920167b7dd2066fd0e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): jax/experimental/pallas/ops/tpu/splash_attention/splash_attention_kernel.py:1497-1505 | jax/experimental/pallas/ops/tpu/splash_attention/splash_attention_kernel.py:1511-1519 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060jax/experimental/pallas/ops/tpu/splash_attention/splash_attention_kernel.py:1497\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/pallas/ops/tpu/splash_attention/splash_attention_kernel.py"},"region":{"startLine":1497}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ad52646157417a762b84bed1b36835b3e4417da6edb1f47bc22323f1a164537"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): jax/experimental/pallas/ops/tpu/splash_attention/splash_attention_kernel.py:1985-1993 | jax/experimental/pallas/ops/tpu/splash_attention/splash_attention_kernel.py:1997-2005 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060jax/experimental/pallas/ops/tpu/splash_attention/splash_attention_kernel.py:1985\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/pallas/ops/tpu/splash_attention/splash_attention_kernel.py"},"region":{"startLine":1985}}}],"partialFingerprints":{"codehealthFindingId/v1":"c808e8cb1b28e85787eaeae6e3e70b2d31502acc0e3e3a1cbbbc5a4d4b44e7ce"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u20139 lines \u00D7 2): jax/experimental/pallas/ops/tpu/splash_attention/splash_attention_mask.py:272-280 | jax/experimental/pallas/ops/tpu/splash_attention/splash_attention_mask.py:544-550 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/pallas/ops/tpu/splash_attention/splash_attention_mask.py"},"region":{"startLine":272}}}],"partialFingerprints":{"codehealthFindingId/v1":"975ad8c7aabcd73249cedf680487fd431096091c599aa7f6f07306f02aa69a04"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): jax/experimental/rnn.py:225-233 | jax/experimental/rnn.py:235-243 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/rnn.py"},"region":{"startLine":225}}}],"partialFingerprints":{"codehealthFindingId/v1":"8883327efb912b2645e126cc10991e8da07144c104e0cfe67fc9880cbd0422dd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 4): jax/_src/cudnn/fused_attention_stablehlo.py:908-915 | jax/_src/cudnn/fused_attention_stablehlo.py:974-981 | jax/_src/cudnn/fused_attention_stablehlo.py:1737-1744 | jax/_src/cudnn/fused_attention_stablehlo.py:1778-1785 \u2014 all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/cudnn/fused_attention_stablehlo.py"},"region":{"startLine":908}}}],"partialFingerprints":{"codehealthFindingId/v1":"21386e60501e6a1a41b81097614ecf35abcfbdb11e70cceda399cfdb39792abd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): jax/_src/pallas/triton/lowering.py:515-522 | jax/_src/pallas/triton/primitives.py:410-417 | jax/_src/pallas/triton/primitives.py:666-673 \u2014 there are 3 copies across 2 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 3 sites; resolving a subset leaves the remainder to drift apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/triton/lowering.py"},"region":{"startLine":515}}}],"partialFingerprints":{"codehealthFindingId/v1":"2090fd6774f622481ff5e2a175957904e7ce808a54e08d6b832e95194cf02a1a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): jax/_src/random/core.py:2085-2092 | jax/_src/random/core.py:2536-2543 | jax/_src/random/core.py:2601-2608 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/random/core.py"},"region":{"startLine":2085}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce93f95d2323d1f35c7cd967e6a49f633733fc08e5b2a8fc3c78c1301216bcbf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): jax/_src/state/primitives.py:925-932 | jax/_src/state/primitives.py:1009-1016 | jax/_src/state/primitives.py:1100-1107 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060jax/_src/state/primitives.py:925\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/state/primitives.py"},"region":{"startLine":925}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d7dfa032d33b4f19c9be360bf2f57f5d72455975ccb876c19226e5373c8ebb0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): jax/_src/compute_on.py:412-419 | jax/_src/pjit.py:2003-2010 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060eqn\u0060 to \u0060pe.JaxprEqn\u0060 in one and \u0060core.JaxprEqn\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/compute_on.py"},"region":{"startLine":412}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2811b2e5fa351a714e1a5214b598349e62d388bcd353efc5f21568ee80812ef"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u20138 lines \u00D7 2): jax/_src/cudnn/fused_attention_stablehlo.py:1006-1013 | jax/_src/cudnn/fused_attention_stablehlo.py:1801-1807 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060jax/_src/cudnn/fused_attention_stablehlo.py:1006\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/cudnn/fused_attention_stablehlo.py"},"region":{"startLine":1006}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc7b68824ed72c090b28ed84ccf3a077e9955d1e3bdd8ea978614b1e0973d33b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): jax/_src/cudnn/scaled_matmul_stablehlo.py:741-748 | jax/_src/lax/lax.py:6997-7004 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/cudnn/scaled_matmul_stablehlo.py"},"region":{"startLine":741}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe1b9a94ad22dfaba7fe1a643d2a7f5cb5d72eefd42d2eec4df175c1700d9f2c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2): jax/_src/interpreters/ad.py:594-612 | jax/_src/interpreters/ad.py:784-802 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/interpreters/ad.py"},"region":{"startLine":594}}}],"partialFingerprints":{"codehealthFindingId/v1":"21c82bc2f96fa7282354a6a844285d09d784a57f5c69b354238c53f71cd098a5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): jax/_src/interpreters/mlir.py:1248-1255 | jax/_src/interpreters/mlir.py:1265-1272 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060jax/_src/interpreters/mlir.py:1248\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/interpreters/mlir.py"},"region":{"startLine":1248}}}],"partialFingerprints":{"codehealthFindingId/v1":"5241f92399abcf93fd6727f67eb87f69eb5158eb50385b64227f07b48a9cfb50"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): jax/_src/interpreters/partial_eval.py:236-243 | jax/_src/interpreters/partial_eval.py:1892-1899 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/interpreters/partial_eval.py"},"region":{"startLine":236}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3a900cf0701233e1cbe1ca654c3f84b865ef755003a688553327414250df28d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): jax/_src/interpreters/partial_eval.py:971-979 | jax/_src/interpreters/partial_eval.py:984-991 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/interpreters/partial_eval.py"},"region":{"startLine":971}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe560a1152b72f4d9c22fd48ab8ce6904924b6005d6e3cf9936cf615ca5732a8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u20138 lines \u00D7 2): jax/_src/lax/ann.py:360-366 | jax/_src/tpu_custom_call.py:451-458 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060jax/_src/tpu_custom_call.py:451\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/lax/ann.py"},"region":{"startLine":360}}}],"partialFingerprints":{"codehealthFindingId/v1":"07f8ae064b447ecb479f6db201cc1190dcba5aa8462e7e3d69ce8a8ca303d363"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6\u20138 lines \u00D7 2): jax/_src/lax/ann.py:442-449 | jax/_src/lax/lax.py:11145-11150 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/lax/ann.py"},"region":{"startLine":442}}}],"partialFingerprints":{"codehealthFindingId/v1":"d199c9fbb2e6cee04df09235f0b71f1b763f29d313699a9b72aad3cf7d0f631d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): jax/_src/lax/convolution.py:697-704 | jax/_src/lax/convolution.py:709-716 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/lax/convolution.py"},"region":{"startLine":697}}}],"partialFingerprints":{"codehealthFindingId/v1":"125182281d1be72704b63b784f2bb6f51e9026df03012e7af394960395885635"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u20138 lines \u00D7 2): jax/_src/lax/eval_jaxpr.py:73-80 | jax/_src/program_order.py:276-282 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/lax/eval_jaxpr.py"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"82e627e12626061d5b81cb22b01a84dacd18022fdd941f494b09d1e0c856773b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): jax/_src/lax/slicing.py:3130-3137 | jax/_src/lax/slicing.py:3607-3614 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/lax/slicing.py"},"region":{"startLine":3130}}}],"partialFingerprints":{"codehealthFindingId/v1":"769e2b8107a85dadef6b4a7063ea2fe8c4b465bdef55fbd0b99f5c8e2566abde"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): jax/_src/pallas/mosaic/pipeline.py:2515-2522 | jax/_src/pallas/mosaic/pipeline.py:2581-2588 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/mosaic/pipeline.py"},"region":{"startLine":2515}}}],"partialFingerprints":{"codehealthFindingId/v1":"368c82d3155325593a23ee0786bf3eff1764db50827716ddfdf539749735a7f0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6\u20138 lines \u00D7 2): jax/_src/scipy/bessel.py:524-529 | jax/_src/scipy/bessel.py:1146-1153 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060jax/_src/scipy/bessel.py:524\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/scipy/bessel.py"},"region":{"startLine":524}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e0054caf7da34a4477b241718365d5c3cbaa65088672c243df49807cbd8745e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): jax/experimental/mosaic/gpu/fragmented_array.py:3254-3261 | jax/experimental/mosaic/gpu/fragmented_array.py:3285-3292 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/mosaic/gpu/fragmented_array.py"},"region":{"startLine":3254}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b963ad02f46a323a729aa6b8250ca76732fca7d71057851470bc158cb639dcd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): jax/experimental/pallas/ops/gpu/all_gather_mgpu.py:162-169 | jax/experimental/pallas/ops/gpu/reduce_scatter_mgpu.py:181-188 \u2014 before extracting anything, compare \u0060jax/experimental/pallas/ops/gpu/all_gather_mgpu.py\u0060 and \u0060jax/experimental/pallas/ops/gpu/reduce_scatter_mgpu.py\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 123 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/pallas/ops/gpu/all_gather_mgpu.py"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"5136e406101fe886b95515e228057b12ef20f4331ec570c187f60c15cd765a3f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u20138 lines \u00D7 2): jax/experimental/pallas/ops/tpu/flash_attention.py:423-430 | jax/experimental/pallas/ops/tpu/flash_attention.py:1211-1217 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060jax/experimental/pallas/ops/tpu/flash_attention.py:423\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/pallas/ops/tpu/flash_attention.py"},"region":{"startLine":423}}}],"partialFingerprints":{"codehealthFindingId/v1":"6587207eccacfd068e4cb327c0359b6a5344cf6e2079497466030601728e6873"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): jax/experimental/pallas/ops/tpu/paged_attention/paged_attention_kernel.py:434-441 | jax/experimental/pallas/ops/tpu/paged_attention/paged_attention_kernel.py:442-449 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/pallas/ops/tpu/paged_attention/paged_attention_kernel.py"},"region":{"startLine":434}}}],"partialFingerprints":{"codehealthFindingId/v1":"0301a9ef6fc241722fd17860267c367a883080e0141d3fec0d09b646bdf241c6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): jax/experimental/pallas/ops/tpu/splash_attention/splash_attention_kernel.py:1098-1105 | jax/experimental/pallas/ops/tpu/splash_attention/splash_attention_kernel.py:1603-1610 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/pallas/ops/tpu/splash_attention/splash_attention_kernel.py"},"region":{"startLine":1098}}}],"partialFingerprints":{"codehealthFindingId/v1":"69a8b20fe8af50ec961afbb755013856786d4cef3c6a1c60c90053d8de9eccf6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u20138 lines \u00D7 2): jaxlib/gpu_rnn.py:60-67 | jaxlib/gpu_rnn.py:107-113 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jaxlib/gpu_rnn.py"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"77f6b5ec59890100c0f7d1a1dd189ef70b05615d4af8992e541459a9072284a8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): docs/autodidax.py:2003-2009 | docs/autodidax.py:2523-2529 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060docs/autodidax.py:2522\u0060 calls \u0060split_half\u0060 and \u0060docs/autodidax.py:2002\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/autodidax.py"},"region":{"startLine":2003}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4a849659aff7a3a99ab0b11b2cc947b9c445a00a39494b334cc67cb7d13880d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): jax/_src/checkify.py:1142-1151 | jax/_src/custom_derivatives.py:414-423 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/checkify.py"},"region":{"startLine":1142}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd999f15a64b5f4929f633dd0f65eefa18143d33f41234f51862d59aeb7d7236"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): jax/_src/compute_on.py:135-141 | jax/_src/xla_metadata.py:336-342 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/compute_on.py"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"c20e4e86489be79f6db9ae8ab91315664a3e88f9a745aa45756d67ec3f12efc7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): jax/_src/compute_on.py:309-315 | jax/_src/pjit.py:1856-1862 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060jax/_src/compute_on.py:309\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The \u0060return\u0060 at the foot of the matched lines is the enclosing body\u0027s own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that \u0060return\u0060 occupied \u2014 no decision has to be handed back and re-acted on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/compute_on.py"},"region":{"startLine":309}}}],"partialFingerprints":{"codehealthFindingId/v1":"cfd0d96703f1393c5bb40c5f87ed7fc093592260168aa4246239d2171491d3f6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): jax/_src/compute_on.py:350-361 | jax/_src/pjit.py:1971-1982 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/compute_on.py"},"region":{"startLine":350}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed8f318b222bc2d37b72e5b9d806ad32e98d874c6c6b13b9753d88bf246796e9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6\u20137 lines \u00D7 2): jax/_src/compute_on.py:408-414 | jax/_src/xla_metadata.py:521-526 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060jax/_src/compute_on.py:408\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/compute_on.py"},"region":{"startLine":408}}}],"partialFingerprints":{"codehealthFindingId/v1":"645bf3d043960b1199a15a8ff2bd740c8bdfa3d39e73b802e696e1f74447e536"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): jax/_src/compute_on.py:424-430 | jax/_src/xla_metadata.py:530-536 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. The \u0060return\u0060 at the foot of the matched lines is the enclosing body\u0027s own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that \u0060return\u0060 occupied \u2014 no decision has to be handed back and re-acted on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/compute_on.py"},"region":{"startLine":424}}}],"partialFingerprints":{"codehealthFindingId/v1":"23afd3686ef8c26e4542d28d5e6b1c693d3b0cbbaefa435bab89c563191d7e0a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): jax/_src/core.py:202-208 | jax/_src/core.py:255-261 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/core.py"},"region":{"startLine":202}}}],"partialFingerprints":{"codehealthFindingId/v1":"ddb03e608f4da1d3f8ab7d95ba0b8e600bfeeabfd912d6c15cd181e4e78167c8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): jax/_src/interpreters/partial_eval.py:1876-1882 | jax/_src/interpreters/partial_eval.py:1920-1926 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060jax/_src/interpreters/partial_eval.py:1876\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/interpreters/partial_eval.py"},"region":{"startLine":1876}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1a43b0a1724571fbd07dc409f3ceee8f45286f0f4139e83e58a21de2be76ac4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): jax/_src/lax/convolution.py:684-690 | jax/_src/lax/convolution.py:710-717 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/lax/convolution.py"},"region":{"startLine":684}}}],"partialFingerprints":{"codehealthFindingId/v1":"e02adbe33d4d55f032184622bb83a98ab796db78fa87ca9f937302af03d74038"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): jax/_src/lax/double_word.py:391-397 | jax/_src/lax/double_word.py:399-406 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060jax/_src/lax/double_word.py:391\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/lax/double_word.py"},"region":{"startLine":391}}}],"partialFingerprints":{"codehealthFindingId/v1":"91b943440ca32edcb877448428952f8cfdecc7520a38dce32c4d201f48d44f08"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6\u20137 lines \u00D7 2): jax/_src/lax/lax.py:10273-10279 | jax/_src/lax/slicing.py:3787-3792 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060jax/_src/lax/lax.py:10273\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/lax/lax.py"},"region":{"startLine":10273}}}],"partialFingerprints":{"codehealthFindingId/v1":"786615d2312219b3c41973c102de2708d623f4f7a88008b522ec7865bd32aaae"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): jax/_src/lax/linalg.py:1482-1488 | jax/_src/lax/linalg.py:1614-1620 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/lax/linalg.py"},"region":{"startLine":1482}}}],"partialFingerprints":{"codehealthFindingId/v1":"940cd1d12b173e12311224ea36bffbdb603435bedbb34d2daa4aa80c172f353a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): jax/_src/lax/linalg.py:2175-2181 | jax/_src/lax/linalg.py:2215-2221 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/lax/linalg.py"},"region":{"startLine":2175}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea5da7b4b6f03f0f50e5014cf1672f5f01ba1b2d85dd693ee414585e4b4f1d7e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): jax/_src/lax/slicing.py:3759-3765 | jax/_src/lax/slicing.py:3878-3884 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060jax/_src/lax/slicing.py:3759\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/lax/slicing.py"},"region":{"startLine":3759}}}],"partialFingerprints":{"codehealthFindingId/v1":"29821ba2f8d638eba86e7013f168e008360d6c07b83a0f6a293b6f6e1ad5f8c6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6\u20137 lines \u00D7 2): jax/_src/numpy/linalg.py:517-523 | jax/_src/numpy/linalg.py:634-639 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060jax/_src/numpy/linalg.py:517\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The \u0060return\u0060 at the foot of the matched lines is the enclosing body\u0027s own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that \u0060return\u0060 occupied \u2014 no decision has to be handed back and re-acted on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/numpy/linalg.py"},"region":{"startLine":517}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b7ef951e9051525a518f7407b9cb82f77d83e27c99011d402e4c913cf081a58"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): jax/_src/pallas/fuser/jaxpr_fusion.py:397-403 | jax/_src/pallas/fuser/jaxpr_fusion.py:407-413 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/fuser/jaxpr_fusion.py"},"region":{"startLine":397}}}],"partialFingerprints":{"codehealthFindingId/v1":"da1343cecdb4076390c67023a74222d8b5277bbeb8926f050ff7b76301b7c3c7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): jax/_src/pallas/hlo_interpreter.py:113-119 | jax/_src/pallas/mosaic/interpret/utils.py:492-498 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. The \u0060return\u0060 at the foot of the matched lines is the enclosing body\u0027s own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that \u0060return\u0060 occupied \u2014 no decision has to be handed back and re-acted on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/hlo_interpreter.py"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a07a061a92764777acbeb064a4e32eb1af47858a712d3aab45f0d0f1b23d334"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): jax/_src/pallas/mosaic/interpret/shared_memory.py:613-619 | jax/_src/pallas/mosaic/interpret/shared_memory.py:771-777 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060jax/_src/pallas/mosaic/interpret/shared_memory.py:613\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/mosaic/interpret/shared_memory.py"},"region":{"startLine":613}}}],"partialFingerprints":{"codehealthFindingId/v1":"195f5da273a86741cdf1e0d06551fbd76041a42083e73301c5cd2a0d4715226b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): jax/_src/pallas/mosaic/sc_lowering.py:231-237 | jax/_src/pallas/mosaic/sc_lowering.py:376-383 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060jax/_src/pallas/mosaic/sc_lowering.py:376\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/mosaic/sc_lowering.py"},"region":{"startLine":231}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e666ebbac5f80453ad45f76cf14857d397be9d984146e0c3018faf258514bab"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): jax/_src/pallas/mosaic_gpu/core.py:1720-1726 | jax/_src/pallas/mosaic_gpu/core.py:1745-1751 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/mosaic_gpu/core.py"},"region":{"startLine":1720}}}],"partialFingerprints":{"codehealthFindingId/v1":"43a7c23434fbfad74ac42836d3d1c614257ca8f214dc9dcbe5dff923dcc8e639"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): jax/_src/pallas/mosaic_gpu/primitives.py:5338-5345 | jax/_src/pallas/triton/primitives.py:336-342 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060jax/_src/pallas/mosaic_gpu/primitives.py:5338\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/mosaic_gpu/primitives.py"},"region":{"startLine":5338}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d149b305c7a3b56275110c0d891cde0c1083b61051ea530722c13610cc8a837"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): jax/_src/pmap.py:823-829 | jax/_src/pmap.py:908-914 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pmap.py"},"region":{"startLine":823}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1ae70eb9f11dfdeddfaccfdfafce26c7a368325076a76aff4bd7aba801ab7a7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): jax/_src/random/core.py:741-747 | jax/_src/random/core.py:1718-1724 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/random/core.py"},"region":{"startLine":741}}}],"partialFingerprints":{"codehealthFindingId/v1":"1dca4c8b217498817de1cbcd96015c60de8a5ca249a816d8b73c643518fb0218"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): jax/_src/random/core.py:2467-2473 | jax/_src/random/core.py:2980-2986 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/random/core.py"},"region":{"startLine":2467}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f5b650c62ef619a7765ac10fff73d5b5569f3321d1ebf38ccd230a08cfb4606"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): jax/_src/scipy/bessel.py:853-859 | jax/_src/scipy/bessel.py:1839-1845 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/scipy/bessel.py"},"region":{"startLine":853}}}],"partialFingerprints":{"codehealthFindingId/v1":"bfa5a4ac1be74e8dbdc375acb9a101228da33895f88188f1bc76b8ae3f8be90d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): jax/_src/scipy/sparse/linalg.py:568-574 | jax/_src/scipy/sparse/linalg.py:618-624 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/scipy/sparse/linalg.py"},"region":{"startLine":568}}}],"partialFingerprints":{"codehealthFindingId/v1":"d78312186759ce13eca66be63d2a27ef2c7cb50e0b3d2218ad250ce40010c42b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6\u20137 lines \u00D7 2): jax/_src/state/discharge.py:945-951 | jax/_src/state/discharge.py:966-971 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/state/discharge.py"},"region":{"startLine":945}}}],"partialFingerprints":{"codehealthFindingId/v1":"8503483fc735df98177e57cba6b03c96f0bdb0edf7d5a38439ef726de992ba7a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): jax/experimental/mosaic/gpu/utils.py:1772-1778 | jax/experimental/mosaic/gpu/utils.py:1788-1794 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/mosaic/gpu/utils.py"},"region":{"startLine":1772}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f59cd7ea7fe14b14eeaff24327de897ca6a23a9d18d13cf5db76405a4a3222b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): jax/experimental/pallas/ops/tpu/ragged_paged_attention/kernel.py:123-129 | jax/experimental/pallas/ops/tpu/ragged_paged_attention/kernel.py:630-637 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060jax/experimental/pallas/ops/tpu/ragged_paged_attention/kernel.py:123\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/pallas/ops/tpu/ragged_paged_attention/kernel.py"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"335dca45633d4296adc9dd600bd284dfaa13803ad7c1ca402bfa41d52f145f21"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): jax/experimental/roofline/rooflines.py:82-88 | jax/experimental/roofline/rooflines.py:798-805 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/roofline/rooflines.py"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"18aaa36a916ea64797481ce341a4810e7a69490ff38f41fa9381fbf5febe14e6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): jax/experimental/sparse/csr.py:85-92 | jax/experimental/sparse/csr.py:177-184 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. The \u0060return\u0060 at the foot of the matched lines is the enclosing body\u0027s own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that \u0060return\u0060 occupied \u2014 no decision has to be handed back and re-acted on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/sparse/csr.py"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"95c4374141fee453d8d3bf3feb333ccf893a4b26e73ede3a08af1381080d439b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 4): jax/experimental/sparse/ad.py:97-102 | jax/experimental/sparse/ad.py:125-130 | jax/experimental/sparse/ad.py:148-153 | jax/experimental/sparse/ad.py:171-176 \u2014 all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/sparse/ad.py"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"46f43d701862a88117f64ce9633b8869ca2ad2bbddc2ad6e806c1b29477ad684"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5\u20136 lines \u00D7 3): jax/_src/cudnn/fused_attention_stablehlo.py:482-487 | jax/_src/cudnn/fused_attention_stablehlo.py:602-606 | jax/_src/cudnn/fused_attention_stablehlo.py:1002-1006 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/cudnn/fused_attention_stablehlo.py"},"region":{"startLine":482}}}],"partialFingerprints":{"codehealthFindingId/v1":"779bedf430cbb66ed396c74ac93445635027a58955a616f214c98cfd72afc968"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): jax/_src/lax/slicing.py:3188-3193 | jax/_src/lax/slicing.py:3231-3236 | jax/_src/lax/slicing.py:3656-3661 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/lax/slicing.py"},"region":{"startLine":3188}}}],"partialFingerprints":{"codehealthFindingId/v1":"a96f265407af6e92faed76e2bf3f1977be360045cc1da06ddd23b4213333ed31"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): docs/_static/fault_tolerance/cancel_collectives.py:51-56 | docs/_static/fault_tolerance/collectives.py:41-46 \u2014 before extracting anything, compare \u0060docs/_static/fault_tolerance/cancel_collectives.py\u0060 and \u0060docs/_static/fault_tolerance/collectives.py\u0060 as WHOLE FILES: 97% of the shorter file\u0027s lines also appear in the other, so this reads as one file having been copied from the other rather than as a helper waiting to be extracted. The 2 duplicated block(s) this scan matched between them are fragments of that copy, not the extent of it \u2014 treat the file pair as the unit. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060docs/_static/fault_tolerance/cancel_collectives.py:49\u0060 calls \u0060_live_devices\u0060, \u0060devices\u0060 and \u0060docs/_static/fault_tolerance/collectives.py:39\u0060 does not \u2014 after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/_static/fault_tolerance/cancel_collectives.py"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"b43031d0c649c59cd92beba7b8a2589661a80a5e397075fa2689b57cda9737e6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): docs/autodidax.py:1308-1313 | docs/autodidax.py:1425-1430 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. The \u0060return\u0060 at the foot of the matched lines is the enclosing body\u0027s own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that \u0060return\u0060 occupied \u2014 no decision has to be handed back and re-acted on. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060docs/autodidax.py:1424\u0060 calls \u0060new_dynamic\u0060 and \u0060docs/autodidax.py:1307\u0060 does not \u2014 after which the two agree again for 4 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/autodidax.py"},"region":{"startLine":1308}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc8bfe2aa7e73f95536569f68d1157f33c64cb6727c141c478ff25f65f4cf4d6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): jax/_src/ad_checkpoint.py:948-954 | jax/_src/shard_map.py:2271-2276 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060jax/_src/ad_checkpoint.py:948\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The \u0060return\u0060 at the foot of the matched lines is the enclosing body\u0027s own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that \u0060return\u0060 occupied \u2014 no decision has to be handed back and re-acted on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/ad_checkpoint.py"},"region":{"startLine":948}}}],"partialFingerprints":{"codehealthFindingId/v1":"80b4dfd6a9a2f8ec1ecfbdaac2bfcff533e3e0b6ef5ee70d7f0703e75f116b3c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): jax/_src/ad_checkpoint.py:1102-1107 | jax/_src/ad_checkpoint.py:1157-1162 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/ad_checkpoint.py"},"region":{"startLine":1102}}}],"partialFingerprints":{"codehealthFindingId/v1":"daaf3361e08edf69d47aed537a451e49c270d4675525f5f0ea4afe2ef2cb68dd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (4\u20136 lines \u00D7 4): jax/_src/compute_on.py:250-255 | jax/_src/lax/eval_jaxpr.py:61-64 | jax/_src/program_order.py:260-263 | jax/_src/xla_metadata.py:432-437 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 4 call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made 4 times. Read the line range as the matched WINDOW rather than a finished unit: at \u0060jax/_src/compute_on.py:250\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060jax/_src/compute_on.py:255\u0060 calls \u0060split_list\u0060 and \u0060jax/_src/lax/eval_jaxpr.py:64\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/compute_on.py"},"region":{"startLine":250}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2fad84a6be7c7fa36d51b48f43892c07bc1fdd7aa9b682c32bd09f5fc5f8688"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): jax/_src/compute_on.py:287-292 | jax/_src/pjit.py:1813-1818 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060jax/_src/compute_on.py:287\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/compute_on.py"},"region":{"startLine":287}}}],"partialFingerprints":{"codehealthFindingId/v1":"ddb6250d23558f752a6f5a3ad3177bf78eadad2bcbff5948615eef726b8f4182"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): jax/_src/config.py:753-758 | jax/_src/config.py:806-811 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/config.py"},"region":{"startLine":753}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac59d4deba13b3b7587188d6f66e819984416dbdc7135a84ee4dd2935f8b85a3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (4\u20136 lines \u00D7 3): jax/_src/lax/control_flow/conditionals.py:379-384 | jax/_src/lax/control_flow/loops.py:557-562 | jax/_src/lax/control_flow/loops.py:581-584 \u2014 there are 3 copies across 2 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 3 sites; resolving a subset leaves the remainder to drift apart. Read the line range as the matched WINDOW rather than a finished unit: at \u0060jax/_src/lax/control_flow/conditionals.py:379\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060jax/_src/lax/control_flow/loops.py:581\u0060 calls \u0060_capitalize\u0060 and \u0060jax/_src/lax/control_flow/conditionals.py:379\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/lax/control_flow/conditionals.py"},"region":{"startLine":379}}}],"partialFingerprints":{"codehealthFindingId/v1":"fade16ae2928ea7b57c7564797e26704110f46768bf6f09c9c6deae7e3639413"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201313 lines \u00D7 2): jax/_src/lax/eval_jaxpr.py:98-109 | jax/_src/xla_metadata.py:446-458 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/lax/eval_jaxpr.py"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc02f623741a32f939c252fcc29a271c76000acb72915c606fa9e91f82fcb8f3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): jax/_src/lax/lax.py:8681-8687 | jax/_src/lax/lax.py:8817-8823 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/lax/lax.py"},"region":{"startLine":8681}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4880b823bf1ca3d5c6802aabc884beaa84595695445763a4d09eb539355c9d0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): jax/_src/lax/lgamma.py:649-654 | jax/_src/lax/lgamma.py:1312-1317 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/lax/lgamma.py"},"region":{"startLine":649}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5746d5ac7764c12b0fbc9ae4a2681dca91c5402cefa5990c95463da4bd839c9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): jax/_src/lax/trig.py:407-412 | jax/_src/lax/trig.py:460-465 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/lax/trig.py"},"region":{"startLine":407}}}],"partialFingerprints":{"codehealthFindingId/v1":"a386af8e97a605be437a4a558145c2902c8255b6237c81a6c56e2e2d69945726"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): jax/_src/lax_reference.py:58-63 | jax/_src/lax_reference.py:69-74 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060jax/_src/lax_reference.py:58\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The \u0060return\u0060 at the foot of the matched lines is the enclosing body\u0027s own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that \u0060return\u0060 occupied \u2014 no decision has to be handed back and re-acted on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/lax_reference.py"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d390a62d04788fac6cc0e89a1dc4885deef9faccee07669e20cc638acdcd438"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): jax/_src/numpy/ufuncs.py:3773-3778 | jax/_src/numpy/ufuncs.py:3792-3797 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/numpy/ufuncs.py"},"region":{"startLine":3773}}}],"partialFingerprints":{"codehealthFindingId/v1":"b270bd27d6ea28efbeaaaf7da9e851135246ade913eaaf625239261bc8d263e5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): jax/_src/random/core.py:2341-2347 | jax/_src/random/core.py:2899-2905 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060jax/_src/random/core.py:2341\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/random/core.py"},"region":{"startLine":2341}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ae6ca61d6c6a1adaaad0e27c02430d2e5f68a394ce3b8ea6ee6f957cb88140f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): jax/_src/random/threefry4x32.py:251-256 | jax/_src/random/threefry4x32.py:303-308 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060shape\u0060 to \u0060prng.Shape\u0060 in one and \u0060tuple[int, ...]\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/random/threefry4x32.py"},"region":{"startLine":251}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee06a223a0aae13b3840588b229a7724e86b47159a72a7aed563d588d81fccb0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): jax/_src/scipy/bessel.py:2113-2121 | jax/_src/scipy/bessel.py:2339-2344 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060jax/_src/scipy/bessel.py:2339\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060jax/_src/scipy/bessel.py:2111\u0060 calls \u0060zeros_like\u0060, \u0060ones_like\u0060 and \u0060jax/_src/scipy/bessel.py:2339\u0060 does not \u2014 after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/scipy/bessel.py"},"region":{"startLine":2113}}}],"partialFingerprints":{"codehealthFindingId/v1":"09aa98a2672b49c42e4223bb32adec00323c0e3fffb52ba3e48c523d0e12ca84"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): jax/_src/scipy/fft.py:117-122 | jax/_src/scipy/fft.py:348-353 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060jax/_src/scipy/fft.py:117\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060jax/_src/scipy/fft.py:126\u0060 calls \u0060_dct_interleave\u0060 and \u0060jax/_src/scipy/fft.py:358\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/scipy/fft.py"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"c73e05435b7ecd064ae293db226da88b89bc54349d44249dc44611e422d5c10b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): jax/experimental/mosaic/gpu/fragmented_array.py:4909-4915 | jax/experimental/mosaic/gpu/fragmented_array.py:5603-5608 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060jax/experimental/mosaic/gpu/fragmented_array.py:4909\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/mosaic/gpu/fragmented_array.py"},"region":{"startLine":4909}}}],"partialFingerprints":{"codehealthFindingId/v1":"aab202064af70bd143ed2247731163c5b5fa5d2ae71c92c46c390651a7247504"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): jax/experimental/multihost_utils.py:264-269 | jax/experimental/multihost_utils.py:427-432 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/multihost_utils.py"},"region":{"startLine":264}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd78cae0c44c09adbb091fab866ff1625ec4d06047db4dec8f546022f17ba19f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): jax/experimental/pallas/ops/gpu/attention_mgpu.py:182-189 | jax/experimental/pallas/ops/gpu/attention_mgpu.py:746-753 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/pallas/ops/gpu/attention_mgpu.py"},"region":{"startLine":182}}}],"partialFingerprints":{"codehealthFindingId/v1":"c948e5f4866c71a2408af4b91ff87add0a8b23e99df08b25d3ab7937aa8250d8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): jax/experimental/pallas/ops/gpu/collective_matmul_mgpu.py:80-85 | jax/experimental/pallas/ops/gpu/hopper_mixed_type_matmul_mgpu.py:89-94 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/pallas/ops/gpu/collective_matmul_mgpu.py"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b13300a8c0806fb0bd0eb58119b4ea4c59ce25f4b5f70b7e6f92206b90cc0f3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): jax/experimental/pallas/ops/gpu/hopper_matmul_mgpu.py:106-111 | jax/experimental/pallas/ops/gpu/hopper_mixed_type_matmul_mgpu.py:134-166 \u2014 before extracting anything, compare \u0060jax/experimental/pallas/ops/gpu/hopper_matmul_mgpu.py\u0060 and \u0060jax/experimental/pallas/ops/gpu/hopper_mixed_type_matmul_mgpu.py\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 161 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060jax/experimental/pallas/ops/gpu/hopper_matmul_mgpu.py:106\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/pallas/ops/gpu/hopper_matmul_mgpu.py"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"c70b970f5fb52b23e0364fc9388bd66a22608e8cbad0c21941d34c90dd78f12a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): jax/experimental/pallas/ops/tpu/splash_attention/splash_attention_kernel.py:1008-1013 | jax/experimental/pallas/ops/tpu/splash_attention/splash_attention_kernel.py:1016-1021 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/pallas/ops/tpu/splash_attention/splash_attention_kernel.py"},"region":{"startLine":1008}}}],"partialFingerprints":{"codehealthFindingId/v1":"2dbb88fa2a6832b4205ee610b6d1add3ef40c7d94bfab59d058172c82e38a7a6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): jax/experimental/sparse/_lowerings.py:83-88 | jax/experimental/sparse/_lowerings.py:209-214 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/sparse/_lowerings.py"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"dfbabe5c3b36e9a1357d725c328436220f34707fb625ed92a4f5f63673879aa2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): jax/experimental/sparse/bcoo.py:2540-2548 | jax/experimental/sparse/bcsr.py:893-901 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. The \u0060return\u0060 at the foot of the matched lines is the enclosing body\u0027s own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that \u0060return\u0060 occupied \u2014 no decision has to be handed back and re-acted on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/sparse/bcoo.py"},"region":{"startLine":2540}}}],"partialFingerprints":{"codehealthFindingId/v1":"46e30b45c57e84fc6e199f53a641c1612dfd98a164ad8418f4b765e0fe12f784"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): jax/_src/compute_on.py:198-204 | jax/_src/xla_metadata.py:382-388 | jax/experimental/fused.py:92-98 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made 3 times. Read the line range as the matched WINDOW rather than a finished unit: at \u0060jax/_src/compute_on.py:198\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The \u0060return\u0060 at the foot of the matched lines is the enclosing body\u0027s own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that \u0060return\u0060 occupied \u2014 no decision has to be handed back and re-acted on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/compute_on.py"},"region":{"startLine":198}}}],"partialFingerprints":{"codehealthFindingId/v1":"45f747b5dcf6fd9e844255ddafa9ee796758bf142004719e7762626949b876b4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): jax/_src/compute_on.py:411-416 | jax/_src/pjit.py:2002-2007 | jax/_src/xla_metadata.py:523-528 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from all 3 call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060jax/_src/compute_on.py:411\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060eqn\u0060 to \u0060pe.JaxprEqn\u0060 in one and \u0060core.JaxprEqn\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/compute_on.py"},"region":{"startLine":411}}}],"partialFingerprints":{"codehealthFindingId/v1":"cbe507b19e941f8e906abe9cf6c549c221ec57b5c3cc5cd6a8eec30219146351"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): jax/_src/cudnn/fused_attention_stablehlo.py:440-444 | jax/_src/cudnn/fused_attention_stablehlo.py:460-464 | jax/_src/cudnn/fused_attention_stablehlo.py:926-930 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060jax/_src/cudnn/fused_attention_stablehlo.py:440\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/cudnn/fused_attention_stablehlo.py"},"region":{"startLine":440}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a4163cb038cd2164f1e9c48161a742c4ded76e4ac7406061ede9481ebb71bb9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): jax/_src/scipy/linalg.py:1582-1586 | jax/_src/scipy/linalg.py:1593-1598 | jax/_src/scipy/linalg.py:1608-1612 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060jax/_src/scipy/linalg.py:1593\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/scipy/linalg.py"},"region":{"startLine":1582}}}],"partialFingerprints":{"codehealthFindingId/v1":"38b31ce80c959208be3ebd2c094f5b7768bb4acf15af870f8deabbca8b7189d7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): docs/401/cute_dsl_jax/cute_dsl_jax_kernels.py:60-69 | docs/401/cute_dsl_jax/cute_dsl_jax_kernels.py:91-100 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/401/cute_dsl_jax/cute_dsl_jax_kernels.py"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa417a03f4f37c25122eb81f6c2bdbb539f99f875512785bee35b0464bbd7552"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): jax/_src/ad_checkpoint.py:1226-1230 | jax/_src/ad_checkpoint.py:1279-1283 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/ad_checkpoint.py"},"region":{"startLine":1226}}}],"partialFingerprints":{"codehealthFindingId/v1":"99a6e3e2bbc478e934aba1fb42a62894e85c0467ac77f308e465bf433cd2d513"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): jax/_src/cudnn/fused_attention_stablehlo.py:889-894 | jax/_src/cudnn/fused_attention_stablehlo.py:953-958 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060jax/_src/cudnn/fused_attention_stablehlo.py:959\u0060 calls \u0060any\u0060 and \u0060jax/_src/cudnn/fused_attention_stablehlo.py:895\u0060 does not \u2014 after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/cudnn/fused_attention_stablehlo.py"},"region":{"startLine":889}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd4545f8cc866a305282ab0b739993beb331fb8bc90fc909f8fb76ab752e75d2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): jax/_src/custom_derivatives.py:514-518 | jax/_src/custom_derivatives.py:1325-1329 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060jax/_src/custom_derivatives.py:1323\u0060 calls \u0060pop\u0060 and \u0060jax/_src/custom_derivatives.py:513\u0060 does not \u2014 after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/custom_derivatives.py"},"region":{"startLine":514}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b6a1563ce9f190eff50ac3f11adaffdf7ab50d4220451ba8e0b15ee3a0b2589"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): jax/_src/export/_export.py:1615-1619 | jax/_src/interpreters/mlir.py:2778-2782 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/export/_export.py"},"region":{"startLine":1615}}}],"partialFingerprints":{"codehealthFindingId/v1":"db429c0f89cf578e0ef496cafa484f4f6b1c52a8ceb9b0d8c7d1ee8b2cec2188"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): jax/_src/image/scale.py:152-157 | jax/_src/image/scale.py:161-166 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/image/scale.py"},"region":{"startLine":152}}}],"partialFingerprints":{"codehealthFindingId/v1":"97fb12295ad0d29c36d36bd2124f1ffc6c02ed55d0778effc20967c194e0ae4b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): jax/_src/interpreters/ad.py:751-755 | jax/_src/interpreters/ad.py:781-785 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060jax/_src/interpreters/ad.py:751\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/interpreters/ad.py"},"region":{"startLine":751}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc1cdc37772688e082312836d61cb67a9a1b4ff060273bfba43dbecb697f06a0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): jax/_src/interpreters/batching.py:363-369 | jax/_src/interpreters/batching.py:375-381 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/interpreters/batching.py"},"region":{"startLine":363}}}],"partialFingerprints":{"codehealthFindingId/v1":"649803f98236b36d238541ecca4ce8b2bb986032adde59383ba0031e27e35292"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): jax/_src/interpreters/partial_eval.py:1065-1069 | jax/_src/interpreters/partial_eval.py:1114-1118 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060jax/_src/interpreters/partial_eval.py:1065\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/interpreters/partial_eval.py"},"region":{"startLine":1065}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b53f0ab94e8996c07080d5aa7eee0fa369a74672e7d082116ddcacbc622d3b4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): jax/_src/interpreters/partial_eval.py:2498-2503 | jax/_src/program_order.py:323-328 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/interpreters/partial_eval.py"},"region":{"startLine":2498}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4b6bfe3f53b26160ad02796c36dd9e75570daaead6ded76da5376e087162ebf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): jax/_src/lax/control_flow/loops.py:788-792 | jax/_src/lax/control_flow/loops.py:928-937 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060jax/_src/lax/control_flow/loops.py:788\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/lax/control_flow/loops.py"},"region":{"startLine":788}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e004691021e18b1671ad9e78292a4884d4127d0d47b0c56bd23dcc64ac6c750"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): jax/_src/lax/slicing.py:1609-1614 | jax/_src/lax/slicing.py:1800-1805 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. The \u0060return\u0060 at the foot of the matched lines is the enclosing body\u0027s own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that \u0060return\u0060 occupied \u2014 no decision has to be handed back and re-acted on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/lax/slicing.py"},"region":{"startLine":1609}}}],"partialFingerprints":{"codehealthFindingId/v1":"1891d591634df15488b8385d63d0eca8e363ffe43981f9dca172647b2c057e12"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): jax/_src/lax/slicing.py:3769-3773 | jax/_src/lax/slicing.py:3892-3898 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/lax/slicing.py"},"region":{"startLine":3769}}}],"partialFingerprints":{"codehealthFindingId/v1":"03ea0d94e0508a8f6981292eb5c06eeb657087e0db8b40c261405883408cb25c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): jax/_src/lax/special.py:404-408 | jax/_src/lax/special.py:538-542 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/lax/special.py"},"region":{"startLine":404}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3753f83f5ed1c313afe913c9307d0e234a3cf50427c7021509a200332b8e3a5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): jax/_src/lax/special.py:628-633 | jax/_src/lax/special.py:650-655 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060jax/_src/lax/special.py:628\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/lax/special.py"},"region":{"startLine":628}}}],"partialFingerprints":{"codehealthFindingId/v1":"669612e0d7dc44995ce53b090900aa1b1ecdd0b29de56a2c8c2206c16c149ad1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): jax/_src/lib/__init__.py:53-57 | jaxlib/plugin_support.py:90-95 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/lib/__init__.py"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad0c2ce2c7f2250d05891675cba34e25bcd47c2020dd1a6cae3b85dcf954cefb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): jax/_src/pallas/hlo_interpreter.py:372-376 | jax/_src/pallas/hlo_interpreter.py:500-504 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/hlo_interpreter.py"},"region":{"startLine":372}}}],"partialFingerprints":{"codehealthFindingId/v1":"5bc661496b3e761b8f65baf9b221923dac6347678de62a1ad79e54daddd6bd0e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): jax/_src/pallas/mosaic/lowering.py:3645-3649 | jax/_src/pallas/mosaic/lowering.py:3987-3996 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/mosaic/lowering.py"},"region":{"startLine":3645}}}],"partialFingerprints":{"codehealthFindingId/v1":"709807945ce017c9e98de5491891c9eb0462f067704ffbaf611aa78aa030c42a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): jax/_src/pallas/mosaic/sc_primitives.py:535-541 | jax/_src/pallas/mosaic/sc_primitives.py:586-592 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/mosaic/sc_primitives.py"},"region":{"startLine":535}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3b50c07712c37ce55c2646c106ff23b034b78a21486ea0ef464555014e69387"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): jax/_src/scipy/bessel.py:519-525 | jax/_src/scipy/bessel.py:548-552 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060jax/_src/scipy/bessel.py:519\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/scipy/bessel.py"},"region":{"startLine":519}}}],"partialFingerprints":{"codehealthFindingId/v1":"41b895da51f5cfd048f574e88352930df13756cdd271e59c4a3d76a53ff1c573"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): jax/_src/scipy/bessel.py:694-700 | jax/_src/scipy/bessel.py:1733-1737 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060jax/_src/scipy/bessel.py:694\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/scipy/bessel.py"},"region":{"startLine":694}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e5dc6f20868f413ef0e200954ef9193902adfacf6ce7d73daa3df483ccfd94a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): jax/_src/shard_map.py:1296-1301 | jax/_src/shard_map.py:1307-1312 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/shard_map.py"},"region":{"startLine":1296}}}],"partialFingerprints":{"codehealthFindingId/v1":"fba6fa17675c07bfe3ca247eadc2f29527d8ba7ce96692fd917cb538e9f33082"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): jax/_src/shard_map.py:1707-1711 | jax/_src/shard_map.py:1759-1763 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060jax/_src/shard_map.py:1707\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/shard_map.py"},"region":{"startLine":1707}}}],"partialFingerprints":{"codehealthFindingId/v1":"604758dc746c4d9a2d95f3c73f2030c6d293a5c97e5de1a6a549edb8f976a445"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): jax/_src/shard_map.py:1839-1844 | jax/_src/shard_map.py:1930-1935 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/shard_map.py"},"region":{"startLine":1839}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c1c26cccaf96a077cf74ecd7c9854fe271713a2d883f80c5abe98f7e3901c0d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): jax/experimental/mosaic/gpu/tcgen05.py:2077-2081 | jax/experimental/mosaic/gpu/tcgen05.py:2122-2126 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/mosaic/gpu/tcgen05.py"},"region":{"startLine":2077}}}],"partialFingerprints":{"codehealthFindingId/v1":"41308c3d41f7e95a29687879fff472624571aff386bc0c3fc96f469c46c09782"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): jax/experimental/pallas/ops/gpu/blackwell_matmul_mgpu.py:272-276 | jax/experimental/pallas/ops/gpu/hopper_matmul_mgpu.py:276-280 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/pallas/ops/gpu/blackwell_matmul_mgpu.py"},"region":{"startLine":272}}}],"partialFingerprints":{"codehealthFindingId/v1":"0edb7d446a9b5de740afad91df746fbaee2c733a6868c5b98f022d25e23f55ce"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): jax/experimental/pallas/ops/tpu/random/philox.py:167-173 | jax/experimental/pallas/ops/tpu/random/threefry.py:98-104 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/pallas/ops/tpu/random/philox.py"},"region":{"startLine":167}}}],"partialFingerprints":{"codehealthFindingId/v1":"d46c6a48fb1e8f82b2acc7bb4c119806e2fa387c94130ec340ac0f7187989481"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): jax/experimental/pallas/ops/tpu/splash_attention/splash_attention_kernel.py:324-328 | jax/experimental/pallas/ops/tpu/splash_attention/splash_attention_kernel.py:2356-2360 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060jax/experimental/pallas/ops/tpu/splash_attention/splash_attention_kernel.py:324\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/pallas/ops/tpu/splash_attention/splash_attention_kernel.py"},"region":{"startLine":324}}}],"partialFingerprints":{"codehealthFindingId/v1":"89d246b15da16d9c7806780ea3740eb0ac5a6f2f21eba7bb644710f2e18d5d52"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): jax/experimental/sparse/csr.py:125-129 | jax/experimental/sparse/csr.py:198-203 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060jax/experimental/sparse/csr.py:198\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The \u0060return\u0060 at the foot of the matched lines is the enclosing body\u0027s own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that \u0060return\u0060 occupied \u2014 no decision has to be handed back and re-acted on. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/sparse/csr.py"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"670b2c6789086b632dcca13a2075b2420bac98142bfab411c7adbc47d2c3957d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): jax/experimental/sparse/csr.py:475-480 | jax/experimental/sparse/csr.py:588-593 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/sparse/csr.py"},"region":{"startLine":475}}}],"partialFingerprints":{"codehealthFindingId/v1":"18d4396cb3eb4707fd8c93c44250d84b894ef4e2659a231d8c008172b40f09bb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 4): jax_plugins/cuda/plugin_setup.py:40-54 | jax_plugins/oneapi/plugin_setup.py:27-61 | jax_plugins/rocm/plugin_setup.py:38-54 | jaxlib/setup.py:24-50 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 4 call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made 4 times. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060jax_plugins/oneapi/plugin_setup.py:63\u0060 calls \u0060open\u0060, \u0060read\u0060 and \u0060jax_plugins/cuda/plugin_setup.py:56\u0060 does not \u2014 after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax_plugins/cuda/plugin_setup.py"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"0080040d885a2e7d5625d4e9eba1cfb54365c2e0956dcbbb8709291e423bbeff"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): jaxlib/tools/build_gpu_kernels_wheel.py:87-98 | jaxlib/tools/build_gpu_plugin_wheel.py:90-102 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060jaxlib/tools/build_gpu_kernels_wheel.py:87\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060jaxlib/tools/build_gpu_kernels_wheel.py:83\u0060 calls \u0060is_windows\u0060 and \u0060jaxlib/tools/build_gpu_plugin_wheel.py:86\u0060 does not \u2014 after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jaxlib/tools/build_gpu_kernels_wheel.py"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"df7c633341383d2375d30a274ac3a4ed4105eb687f9a7c6f2902318894226949"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): jax/_src/core.py:432-438 | jax/_src/interpreters/partial_eval.py:1687-1693 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Note what the matched lines are: every one of them assigns one field to another, so the block is a hand-written mapper between two data shapes rather than behaviour with a helper inside it. Extracting one shared function only works if both sites map the SAME pair of types in the same direction \u2014 check that first, because inverse or differently-typed mappers have no single function they can both call. Where they do not, the moves that exist are a generated or reflective mapper, a common embedded/base type the fields live on once, or accepting the run and covering it with a test that fails when a field is added to one side only."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/core.py"},"region":{"startLine":432}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4ad09c448ee43725d7aaa06b44ff57997209d516b035b7c4e5c6e1cb1ac3f54"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): jax/_src/random/philox2x32.py:211-218 | jax/_src/random/philox4x32.py:244-251 | jax/_src/random/threefry4x32.py:315-332 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from all 3 call sites, so a change lands once. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/random/philox2x32.py"},"region":{"startLine":211}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe8de9d97314a344d5de7005cb281d6c850efda3f368c0fb43f76a1dd1863536"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): jax/experimental/sparse/bcoo.py:273-290 | jax/experimental/sparse/bcsr.py:207-229 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060mat\u0060 to \u0060Array\u0060 in one and \u0060ArrayLike\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/sparse/bcoo.py"},"region":{"startLine":273}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d3cb452bd9399cea9185624ef77cad2d68b6350f3a856db5cefdb47f2e90135"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): docs/notebooks/shard_map.py:1168-1176 | docs/notebooks/shard_map.py:1269-1277 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/notebooks/shard_map.py"},"region":{"startLine":1168}}}],"partialFingerprints":{"codehealthFindingId/v1":"1dee70e12d7cd43c58c77578d1772c95ed2cc4feefdbdc749439377eb972ffb4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): jax/_src/checkify.py:635-639 | jax/_src/checkify.py:653-657 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. The \u0060return\u0060 at the foot of the matched lines is the enclosing body\u0027s own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that \u0060return\u0060 occupied \u2014 no decision has to be handed back and re-acted on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/checkify.py"},"region":{"startLine":635}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb0f3dd5a58385d3811e9e3938cb8a01b0cb536b6216775a815f2d2a76597255"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): jax/_src/cudnn/fused_attention_stablehlo.py:415-419 | jax/_src/cudnn/fused_attention_stablehlo.py:423-427 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/cudnn/fused_attention_stablehlo.py"},"region":{"startLine":415}}}],"partialFingerprints":{"codehealthFindingId/v1":"fbef98b5f0e2899aa97ceb15e92e1dea4f3f40dae59efe74926ed6c6c798d48b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): jax/_src/custom_derivatives.py:275-279 | jax/_src/custom_derivatives.py:850-854 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/custom_derivatives.py"},"region":{"startLine":275}}}],"partialFingerprints":{"codehealthFindingId/v1":"c07dc63061266d62918969719adba2e2d2900e812673bcd7f2ac32fa25e7f138"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): jax/_src/hijax.py:735-739 | jax/_src/hijax.py:752-756 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/hijax.py"},"region":{"startLine":735}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce19522f1bd977ea899d9fbc58509001ba975aa0919d69ac394d9b8c135315d7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): jax/_src/interpreters/ad.py:572-576 | jax/_src/interpreters/ad.py:591-595 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060jax/_src/interpreters/ad.py:572\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/interpreters/ad.py"},"region":{"startLine":572}}}],"partialFingerprints":{"codehealthFindingId/v1":"747f7bd308db098c2801e3a2436bd8324e08de29180508bd20721ec9936b8c57"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): jax/_src/interpreters/partial_eval.py:439-444 | jax/_src/interpreters/partial_eval.py:464-469 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/interpreters/partial_eval.py"},"region":{"startLine":439}}}],"partialFingerprints":{"codehealthFindingId/v1":"9feacfa55f64a542685133ff7f443cc83fba7ebbff7d745e45ec46ad0b6033a1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): jax/_src/interpreters/pxla.py:195-199 | jax/_src/interpreters/pxla.py:205-209 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/interpreters/pxla.py"},"region":{"startLine":195}}}],"partialFingerprints":{"codehealthFindingId/v1":"37fdcb7aa55833e34f4a884b42980848ef21cdd00d5e4ea4b40f665728d3e42e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): jax/_src/lax/eval_jaxpr.py:44-48 | jax/_src/program_order.py:243-247 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. The \u0060return\u0060 at the foot of the matched lines is the enclosing body\u0027s own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that \u0060return\u0060 occupied \u2014 no decision has to be handed back and re-acted on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/lax/eval_jaxpr.py"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"95e71c13061acac48e0eb3f17a0bb6256fad43e05505e25df227fd1e00eec3e1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): jax/_src/lax/lax.py:5218-5223 | jax/_src/lax/lax.py:5249-5254 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/lax/lax.py"},"region":{"startLine":5218}}}],"partialFingerprints":{"codehealthFindingId/v1":"8537cc4ed382beb452f7124ac22fab66e581c85d4789532ca8a9ef4a3fdc2ac0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): jax/_src/lax/lax.py:5881-5885 | jax/_src/lax/lax.py:5938-5942 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/lax/lax.py"},"region":{"startLine":5881}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5364a32ee562fa9f16fef51bd3afcb773be1c4531e088a750e1d35ca94e99bd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): jax/_src/lax/lax.py:7202-7207 | jax/_src/lax/lax.py:7208-7213 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/lax/lax.py"},"region":{"startLine":7202}}}],"partialFingerprints":{"codehealthFindingId/v1":"492a9faef3aab29be0a49615670a5f5bdb8ca61691775a47665ff800060daf12"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): jax/_src/lax/lax.py:10952-10956 | jax/_src/lax/lax.py:10963-10967 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060jax/_src/lax/lax.py:10952\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/lax/lax.py"},"region":{"startLine":10952}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8e1d5a729493f34908417172ff4e7ad6e1c905107b4aca3ea9d3e3949345a35"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): jax/_src/lax/special.py:621-626 | jax/_src/lax/special.py:643-648 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/lax/special.py"},"region":{"startLine":621}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1bb164f6a011a5d81b4cf7db2b7bc5fbdde3cac8bb18983bb82cc4b6bc7cfac"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): jax/_src/pallas/mosaic/lowering.py:4152-4156 | jax/_src/pallas/mosaic_gpu/lowering.py:3014-3018 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/mosaic/lowering.py"},"region":{"startLine":4152}}}],"partialFingerprints":{"codehealthFindingId/v1":"086242f8f2e7df9baf0a84b3071dfc0b0711d4b915c70bd2890b3595326968a5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): jax/_src/pjit.py:1885-1889 | jax/_src/pjit.py:1906-1910 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pjit.py"},"region":{"startLine":1885}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f3ad09d76a7dcbf1fefbecc296e03aa736ae70f069930a2e551a74c976eba7d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): jax/_src/scipy/bessel.py:864-870 | jax/_src/scipy/bessel.py:1906-1912 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. The \u0060return\u0060 at the foot of the matched lines is the enclosing body\u0027s own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that \u0060return\u0060 occupied \u2014 no decision has to be handed back and re-acted on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/scipy/bessel.py"},"region":{"startLine":864}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d6f08c9015ec7c4c80b522e5c380f6ccfc15b18caa94252aa57fdb37cdde9a0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): jax/_src/scipy/special.py:1928-1934 | jax/_src/scipy/special.py:1967-1973 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/scipy/special.py"},"region":{"startLine":1928}}}],"partialFingerprints":{"codehealthFindingId/v1":"7659e92f2a87b26eba1e36a7cc0083361d1d32f98c884462b6db5e1902db5766"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): jax/experimental/sparse/_lowerings.py:314-318 | jax/experimental/sparse/_lowerings.py:341-345 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060jax/experimental/sparse/_lowerings.py:314\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The \u0060return\u0060 at the foot of the matched lines is the enclosing body\u0027s own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that \u0060return\u0060 occupied \u2014 no decision has to be handed back and re-acted on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/sparse/_lowerings.py"},"region":{"startLine":314}}}],"partialFingerprints":{"codehealthFindingId/v1":"011f5a8757f27fa50ada2934bb62b2ddc10b81feabd186f2222cad0a075259d3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): jax/experimental/sparse/_lowerings.py:327-331 | jax/experimental/sparse/_lowerings.py:354-358 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060jax/experimental/sparse/_lowerings.py:327\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The \u0060return\u0060 at the foot of the matched lines is the enclosing body\u0027s own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that \u0060return\u0060 occupied \u2014 no decision has to be handed back and re-acted on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/sparse/_lowerings.py"},"region":{"startLine":327}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5dde6428b199365529a34169e6a0c35b5f064e8dca1d652568ae97e12866fa2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): jaxlib/gpu_rnn.py:84-88 | jaxlib/gpu_rnn.py:131-135 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jaxlib/gpu_rnn.py"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d1d550870325279ff3e5dc1f178817aa9a4e72bfc50a2ac1e74c83782fe941c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (21 corresponding lines): jax/example_libraries/stax.py:68-88 | jax/example_libraries/stax.py:95-115 \u2014 These two members are one piece of code written twice and then edited apart: 21 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/example_libraries/stax.py"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"f75454fb5c5e148897b05edc822697b2365af92a9e756e02da5bd66501870bb4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 30\u002B corresponding lines): jax/example_libraries/optimizers.py:295-327 | jax/example_libraries/optimizers.py:360-389 | jax/example_libraries/optimizers.py:430-460 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 30 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/example_libraries/optimizers.py"},"region":{"startLine":295}}}],"partialFingerprints":{"codehealthFindingId/v1":"b23aa5afd005c7b3f1eb3d3623b80f78d03eef734603498370ec358c0db10d3b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 23\u002B corresponding lines): jax/example_libraries/optimizers.py:241-263 | jax/example_libraries/optimizers.py:268-290 | jax/example_libraries/optimizers.py:332-355 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 23 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/example_libraries/optimizers.py"},"region":{"startLine":241}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e227fca1225663a0421ad3f955b8f710b5e79e633bb955d742e9cbebee1893b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): examples/ffi/src/jax_ffi_example/cuda_examples.py:39-45 | examples/ffi/src/jax_ffi_example/cuda_examples.py:49-58 \u2014 These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/ffi/src/jax_ffi_example/cuda_examples.py"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"e566744dae14924e34f567e6ccee6acf8899e6da3e2af56934f90f5eb375d531"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (3 corresponding lines): examples/spmd_mnist_classifier_fromscratch.py:54-57 | jax/experimental/jax2tf/examples/mnist_lib.py:156-158 \u2014 These two members are one piece of code written twice and then edited apart: 3 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/spmd_mnist_classifier_fromscratch.py"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"cdea7fd0073fda7399da39fcc2d2e677f1b2b6317b999e37fc38bb39ee00959a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (2 corresponding lines): examples/mnist_classifier_fromscratch.py:32-33 | examples/spmd_mnist_classifier_fromscratch.py:29-32 \u2014 These two members are one piece of code written twice and then edited apart: 2 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/mnist_classifier_fromscratch.py"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"6321a4a40441a15f5270ad1af3a7ff9e8c997b312df2dc03cf2ab4f34363ddc1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 4\u002B corresponding lines): examples/differentially_private_sgd.py:129-132 | examples/mnist_classifier.py:42-45 | examples/mnist_classifier_fromscratch.py:51-54 | examples/spmd_mnist_classifier_fromscratch.py:62-65 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 4 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/differentially_private_sgd.py"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"5da4481862c16eddb100970f5da0dc12f25bcc4f3e628171f72a014eda0a64b4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 3\u002B corresponding lines): examples/differentially_private_sgd.py:122-125 | examples/mnist_classifier.py:37-39 | examples/mnist_classifier_fromscratch.py:46-48 | examples/spmd_mnist_classifier_fromscratch.py:47-49 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 3 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/differentially_private_sgd.py"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d22995f5285777dd1b47ac2cb6782dc7e714065103717a42f54710e55133084"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (23 lines \u00D7 2): jax/example_libraries/optimizers.py:394-416 | jax/example_libraries/optimizers.py:430-452 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/example_libraries/optimizers.py"},"region":{"startLine":394}}}],"partialFingerprints":{"codehealthFindingId/v1":"38476ad60e6d37645595a46b3d35976d39461d8f678ea9970f791c24aa2e77fc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): jax/experimental/mosaic/gpu/examples/flash_attention.py:164-177 | jax/experimental/mosaic/gpu/examples/flash_attention.py:365-378 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060jax/experimental/mosaic/gpu/examples/flash_attention.py:364\u0060 calls \u0060get_signless\u0060 and \u0060jax/experimental/mosaic/gpu/examples/flash_attention.py:163\u0060 does not \u2014 after which the two agree again for 4 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/mosaic/gpu/examples/flash_attention.py"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f6b34359703784d3ca46f038036231d52d6764aac48f9a96980cbc76d9432a9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201314 lines \u00D7 2): jax/experimental/mosaic/gpu/examples/flash_attention.py:193-206 | jax/experimental/mosaic/gpu/examples/flash_attention.py:416-427 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060jax/experimental/mosaic/gpu/examples/flash_attention.py:193\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060jax/experimental/mosaic/gpu/examples/flash_attention.py:208\u0060 calls \u0060c\u0060, \u0060wait\u0060 and \u0060jax/experimental/mosaic/gpu/examples/flash_attention.py:429\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/mosaic/gpu/examples/flash_attention.py"},"region":{"startLine":193}}}],"partialFingerprints":{"codehealthFindingId/v1":"bcae734e84c631a7ef9ba56ed47f9a4c9b3b2bc62bf5b9aa7659be45189af82d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): jax/experimental/mosaic/gpu/examples/flash_attention.py:272-285 | jax/experimental/mosaic/gpu/examples/flash_attention.py:496-509 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060jax/experimental/mosaic/gpu/examples/flash_attention.py:271\u0060 calls \u0060arrive\u0060 and \u0060jax/experimental/mosaic/gpu/examples/flash_attention.py:495\u0060 does not \u2014 after which the two agree again for 4 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/mosaic/gpu/examples/flash_attention.py"},"region":{"startLine":272}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a88289cfa2203db7c4d60eb01e9b32d8c5e1373734a0e1ff006c7ee770352c1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): jax/experimental/mosaic/gpu/examples/flash_attention.py:260-270 | jax/experimental/mosaic/gpu/examples/flash_attention.py:485-495 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060jax/experimental/mosaic/gpu/examples/flash_attention.py:271\u0060 calls \u0060arrive\u0060 and \u0060jax/experimental/mosaic/gpu/examples/flash_attention.py:496\u0060 does not \u2014 after which the two agree again for 4 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/mosaic/gpu/examples/flash_attention.py"},"region":{"startLine":260}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4e1f8a8a5da602a2f9b9e78293a743307a900dedb5fae67530b2d8dc9ad5c8b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): jax/example_libraries/stax.py:68-77 | jax/example_libraries/stax.py:95-104 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/example_libraries/stax.py"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"885009200b819745784d4de7b0a508cfb999734390beb8711fce27d83bd8bc32"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): jax/experimental/mosaic/gpu/examples/flash_attention.py:213-223 | jax/experimental/mosaic/gpu/examples/flash_attention.py:435-445 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060jax/experimental/mosaic/gpu/examples/flash_attention.py:432\u0060 calls \u0060only_wg\u0060, \u0060c\u0060, \u0060wait\u0060 and \u0060jax/experimental/mosaic/gpu/examples/flash_attention.py:211\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/mosaic/gpu/examples/flash_attention.py"},"region":{"startLine":213}}}],"partialFingerprints":{"codehealthFindingId/v1":"d174326eac270c730fa1820c175666cfb980cc1667d2c24deac32920428909f7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): jax/experimental/mosaic/gpu/examples/flash_attention.py:230-238 | jax/experimental/mosaic/gpu/examples/flash_attention.py:463-471 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060jax/experimental/mosaic/gpu/examples/flash_attention.py:229\u0060 calls \u0060arrive\u0060 and \u0060jax/experimental/mosaic/gpu/examples/flash_attention.py:462\u0060 does not \u2014 after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/mosaic/gpu/examples/flash_attention.py"},"region":{"startLine":230}}}],"partialFingerprints":{"codehealthFindingId/v1":"a63c6a71774ced1adfb7a5c6a1b481aa07529d36cc761922d9cf88dc3f563700"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): examples/mnist_classifier_fromscratch.py:36-43 | examples/spmd_mnist_classifier_fromscratch.py:36-43 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. The \u0060return\u0060 at the foot of the matched lines is the enclosing body\u0027s own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that \u0060return\u0060 occupied \u2014 no decision has to be handed back and re-acted on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/mnist_classifier_fromscratch.py"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"77d20fd9b8504df72097b45dcb20ecfbddfbc3c96920394a323fe9b89d9937d7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): jax/example_libraries/stax.py:79-85 | jax/example_libraries/stax.py:106-112 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060jax/example_libraries/stax.py:79\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/example_libraries/stax.py"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d98553883a86223e9c127dadf79f74a7ab201fac84d5bfd3067d27b1a19d954"}},{"ruleId":"D5","level":"warning","message":{"text":"Unstable project //jax/_src/pallas/fuser:fusible_dtype: //jax/_src/pallas/fuser:fusible_dtype has instability 0.82 with 3 dependents."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"327e8724ab7a6347b79dd9ca7902793ed8cefb078aa9fe192280a7af802c228d"}},{"ruleId":"D5","level":"warning","message":{"text":"Unstable project //jax/_src/pallas/fuser:jaxpr_fusion: //jax/_src/pallas/fuser:jaxpr_fusion has instability 0.90 with 2 dependents."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"5837be4e4657cdaafaa8e8c55b481dfb2e037bdafc27941282ba012bc6965ba1"}},{"ruleId":"D5","level":"warning","message":{"text":"Unstable project //jax/_src/pallas/mosaic/interpret:interpret_pallas_call: //jax/_src/pallas/mosaic/interpret:interpret_pallas_call has instability 0.96 with 1 dependents."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"9ef71204de3a592518308f0d159b3f109f73cd301092093e935f936b2678bbe6"}},{"ruleId":"D5","level":"warning","message":{"text":"Unstable project //jax/_src/pallas/mosaic:lowering: //jax/_src/pallas/mosaic:lowering has instability 0.86 with 5 dependents."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"7bdc58ccd5ed5d3109188f8607bd9739386d03ad414d0a37ba3c3c78722f4155"}},{"ruleId":"D5","level":"warning","message":{"text":"Unstable project //jax/_src/pallas/mosaic:pallas_call_registration: //jax/_src/pallas/mosaic:pallas_call_registration has instability 0.95 with 1 dependents."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"0954701d60fbe830af9f3d0171a67722f34fd6447a7d9d6dc71fce6b158bdb57"}},{"ruleId":"D5","level":"warning","message":{"text":"Unstable project //jax/_src/pallas/mosaic:prefetch: //jax/_src/pallas/mosaic:prefetch has instability 0.86 with 1 dependents."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"0a7d398aa9bd2a8d08b00f6a8b4dd558f027e7dfccfe0b4e74bfa1d0ac27ca1d"}},{"ruleId":"D5","level":"warning","message":{"text":"Unstable project //jax/_src/pallas/mosaic:sc_lowering: //jax/_src/pallas/mosaic:sc_lowering has instability 0.85 with 2 dependents."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"26738e5adf75c7fa74ac4a9016b7fccda7e0e0313496f8c3b50007b1be4948fa"}},{"ruleId":"D5","level":"warning","message":{"text":"Unstable project //jax/_src/pallas/mosaic:sc_primitives: //jax/_src/pallas/mosaic:sc_primitives has instability 0.93 with 1 dependents."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"3868e0e8a2f14fb1d2b653f0c238d1aed761453ab04ccbadc4a99307e245cbb8"}},{"ruleId":"D5","level":"warning","message":{"text":"Unstable project //jax/_src/pallas/mosaic_gpu/interpret:gpu_callbacks: //jax/_src/pallas/mosaic_gpu/interpret:gpu_callbacks has instability 0.87 with 2 dependents."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"1b6e055c264c79eb76f57bb21b2620575946b567167a64bbecc398d1bb9f0f80"}},{"ruleId":"D5","level":"warning","message":{"text":"Unstable project //jax/_src/pallas/mosaic_gpu/interpret:interpret_pallas_call: //jax/_src/pallas/mosaic_gpu/interpret:interpret_pallas_call has instability 0.93 with 1 dependents."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"53b7ef9f1ba8c83b7f51ca3f46093f4af3989b57c40f21b695358514bcfd4586"}},{"ruleId":"D5","level":"warning","message":{"text":"Unstable project //jax/_src/pallas/mosaic_gpu/interpret:jaxpr_interpret: //jax/_src/pallas/mosaic_gpu/interpret:jaxpr_interpret has instability 0.92 with 1 dependents."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"810be7bd099b1108ce1e1fa24eb6236d0c1d292b129bb0bb7c328ed493c441ba"}},{"ruleId":"D5","level":"warning","message":{"text":"Unstable project //jax/_src/pallas/mosaic_gpu:helpers: //jax/_src/pallas/mosaic_gpu:helpers has instability 0.86 with 1 dependents."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"475566be3c0aeec6e6900934dc1c1f6456f3ee92e968eb846e27070af3449f05"}},{"ruleId":"D5","level":"warning","message":{"text":"Unstable project //jax/_src/pallas/mosaic_gpu:layout_rules: //jax/_src/pallas/mosaic_gpu:layout_rules has instability 0.83 with 1 dependents."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"8539f4c47467f8d2515b05b7142de7910afbecc470ce8223f3924dafb3cd4f25"}},{"ruleId":"D5","level":"warning","message":{"text":"Unstable project //jax/_src/pallas/mosaic_gpu:lowering: //jax/_src/pallas/mosaic_gpu:lowering has instability 0.88 with 3 dependents."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"8aae3abe7eef063def583775c8ae8d5dfb4a4e9018c5543a41871d5d6764b5b3"}},{"ruleId":"D5","level":"warning","message":{"text":"Unstable project //jax/_src/pallas/mosaic_gpu:pallas_call_registration: //jax/_src/pallas/mosaic_gpu:pallas_call_registration has instability 0.82 with 2 dependents."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"3be192c351ee1b3ee28895d8449eb52175552f9977515352a5be31f17ab9e7be"}},{"ruleId":"D5","level":"warning","message":{"text":"Unstable project //jax/_src/pallas/triton:lowering: //jax/_src/pallas/triton:lowering has instability 0.89 with 2 dependents."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"ffd3403a066905e092558c48048721e444a1627cf919484b878e33f457522747"}},{"ruleId":"D5","level":"warning","message":{"text":"Unstable project //jax/_src/pallas/triton:pallas_call_registration: //jax/_src/pallas/triton:pallas_call_registration has instability 0.89 with 1 dependents."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"744f22b7d6cb4ba3cf31269166f6a9b63aef76a28d6799eaa5e3fec315008d65"}},{"ruleId":"D5","level":"warning","message":{"text":"Unstable project //jax/_src/pallas/triton:primitives: //jax/_src/pallas/triton:primitives has instability 0.92 with 1 dependents."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"449b75773672db8e4f90e4060b552b2adac2be48aa0ba793a804f0f97fc940bd"}},{"ruleId":"D5","level":"warning","message":{"text":"Unstable project //jax/_src/thunky:thunky: //jax/_src/thunky:thunky has instability 0.90 with 1 dependents."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"f9ee986cd1a738cb6f0e0f7b941fda89f77ccfbbb1ee063a6a11394fe8ab5e46"}},{"ruleId":"D5","level":"warning","message":{"text":"Unstable project //jax/_src:buffer_callback: //jax/_src:buffer_callback has instability 0.90 with 1 dependents."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"bfc5ad2a0e68426aeda591c82faae8152759f4403897d7ed0bf923092a0298b6"}},{"ruleId":"D5","level":"warning","message":{"text":"Unstable project //jax/_src:checkify: //jax/_src:checkify has instability 0.86 with 4 dependents."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"20f536954d640c5592182938099569260e10c4816e0310a75d69201f9701c3ef"}},{"ruleId":"D5","level":"warning","message":{"text":"Unstable project //jax/_src:compute_on: //jax/_src:compute_on has instability 0.93 with 1 dependents."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"16abd0672b0e18d58f9e1ff9c02500787ebfb797606d729fb434f7e913d56689"}},{"ruleId":"D5","level":"warning","message":{"text":"Unstable project //jax/_src:cudnn: //jax/_src:cudnn has instability 0.93 with 1 dependents."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"c5ce98e4944b9b96d98ce316f74a3bd3d8dcaee4fd4f21c32cdc50673a11db0e"}},{"ruleId":"D5","level":"warning","message":{"text":"Unstable project //jax/_src:custom_batching: //jax/_src:custom_batching has instability 0.93 with 1 dependents."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"1c206c0bf864f8adf8e090f5dfc17ff416a10470ab49e42f4b55e1f430da7556"}},{"ruleId":"D5","level":"warning","message":{"text":"Unstable project //jax/_src:custom_partitioning: //jax/_src:custom_partitioning has instability 0.88 with 2 dependents."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"047ec93cd4bcb6ad6f7fd544031ebf75ff8b73c778e3101df2bb99b45ce96ab1"}},{"ruleId":"D5","level":"warning","message":{"text":"Unstable project //jax/_src:export: //jax/_src:export has instability 0.81 with 5 dependents."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"90e0a6c7fa69c9099ec48aa713cbc5d05081c22f503a6d68c5cc998765c66689"}},{"ruleId":"D5","level":"warning","message":{"text":"Unstable project //jax/_src:nn: //jax/_src:nn has instability 0.93 with 1 dependents."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"354e6791cc86875a950f5eec82fcafabb5a2a61870e55ae32ef5492500f85097"}},{"ruleId":"D5","level":"warning","message":{"text":"Unstable project //jax/_src:program_order: //jax/_src:program_order has instability 0.94 with 1 dependents."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"3610e7ca4ed5a987d51612a99256cda4dc784f16fc4d83f6e82b78536cd7cb04"}},{"ruleId":"D5","level":"warning","message":{"text":"Unstable project //jax/_src:scipy: //jax/_src:scipy has instability 0.93 with 1 dependents."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"249e30d50034c56b39313c8d0f127770efa47b90fa2c0d2bf356b51fe4277037"}},{"ruleId":"D5","level":"warning","message":{"text":"Unstable project //jax/_src:stateful_rng: //jax/_src:stateful_rng has instability 0.88 with 1 dependents."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"2d42a8e690393dd2386a0a5c2a70cea661a9b49370237fef2a4cf2bf77adc709"}},{"ruleId":"D5","level":"warning","message":{"text":"Unstable project //jax/_src:tpu: //jax/_src:tpu has instability 0.89 with 1 dependents."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"5a727bd9e4441e18d25ca0a5c9de160459ca5c7edecbe1ee44908698867fc9ec"}},{"ruleId":"D5","level":"warning","message":{"text":"Unstable project //jax/experimental:pallas_tpu: //jax/experimental:pallas_tpu has instability 0.83 with 1 dependents."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"c5c180cc4c80741174c25ebe60e5d69fb2a714abb2a7b44da07437871b2588a1"}},{"ruleId":"D5","level":"warning","message":{"text":"Unstable project //jax/experimental:sparse: //jax/experimental:sparse has instability 0.95 with 1 dependents."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"84cc9095888231aeee4891215419886b6f044a8239654d7de0515e0d582b6873"}},{"ruleId":"D5","level":"warning","message":{"text":"Unstable project //jax/pallas:fuser: //jax/pallas:fuser has instability 0.88 with 1 dependents."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"4321aaf7f1f403a6590b2b5544dc987798b1eff2ccfe4dc436e132f5da55b5f4"}},{"ruleId":"D5","level":"warning","message":{"text":"Unstable project //jax/pallas:mosaic_gpu: //jax/pallas:mosaic_gpu has instability 0.91 with 1 dependents."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"2604ffa7d1a6e02e03de3ee02e93dae42eed648816b402aa6a61f8783b4e8cb7"}},{"ruleId":"D5","level":"warning","message":{"text":"Unstable project //jax/pallas:tpu: //jax/pallas:tpu has instability 0.92 with 1 dependents."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"51af5bd97e036a865ce397bbd5fac4af8ce479402f2db8dff3e779ccc081a093"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: Primitive (LCOM4 6): Primitive\u0027s methods fall into 6 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 6 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/core.py"},"region":{"startLine":611}}}],"partialFingerprints":{"codehealthFindingId/v1":"a308999560176680ec040683784d3600ad629279fc7f0be7d4dfddeb7c276a59"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: _DimExpr (LCOM4 4): _DimExpr\u0027s methods fall into 4 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 4 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/export/shape_poly.py"},"region":{"startLine":421}}}],"partialFingerprints":{"codehealthFindingId/v1":"42406bbc07c12afc5965b645664e52f35f65d0ab72082d4c471db091e483bb05"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: Mesh (LCOM4 4): Mesh\u0027s methods fall into 4 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 4 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/mesh.py"},"region":{"startLine":239}}}],"partialFingerprints":{"codehealthFindingId/v1":"daea9d107de5894fcb3e8c75570ba7a34aa21674b8fd7df96208f3b1d68ee7b8"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: jax/_src/interpreters/mlir.py: jax/_src/interpreters/mlir.py changed 47 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 103 in mlir.lower_jaxpr_to_fun at line 1779. 2 of those changes were fix/bug commits, and the other 45 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 16:26:16 -08:00\u0027 --until=\u00272026-11-13 16:26:16 -08:00\u0027 --full-history --no-merges -- jax/_src/interpreters/mlir.py\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/interpreters/mlir.py"},"region":{"startLine":1779}}}],"partialFingerprints":{"codehealthFindingId/v1":"478d0578efdb2e187605122cda52f97ecb92ad8e1eeba2d591dbd83625c423a5"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: jax/_src/lax/lax.py: jax/_src/lax/lax.py changed 137 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 23 in lax._dot_general_layout_rule at line 7166. 19 of those changes were fix/bug commits, and the other 118 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 16:26:16 -08:00\u0027 --until=\u00272026-11-13 16:26:16 -08:00\u0027 --full-history --no-merges -- jax/_src/lax/lax.py\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/lax/lax.py"},"region":{"startLine":7166}}}],"partialFingerprints":{"codehealthFindingId/v1":"8bfcbeffcbf479fb1ed467916631c89405eb31e24d31f522e47af50409c01371"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: jax/experimental/mosaic/gpu/tcgen05.py: jax/experimental/mosaic/gpu/tcgen05.py changed 24 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 128 in tcgen05.mma at line 216. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 16:26:16 -08:00\u0027 --until=\u00272026-11-13 16:26:16 -08:00\u0027 --full-history --no-merges -- jax/experimental/mosaic/gpu/tcgen05.py\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/mosaic/gpu/tcgen05.py"},"region":{"startLine":216}}}],"partialFingerprints":{"codehealthFindingId/v1":"2cbdd1dead61689c67a0220600d97d477f44ca5a5f916ac17ea44dc9f098dda9"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: jax/_src/pallas/mosaic/lowering.py: jax/_src/pallas/mosaic/lowering.py changed 71 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 41 in lowering.lower_jaxpr_into_pipelined_module at line 1104. 3 of those changes were fix/bug commits, and the other 68 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 16:26:16 -08:00\u0027 --until=\u00272026-11-13 16:26:16 -08:00\u0027 --full-history --no-merges -- jax/_src/pallas/mosaic/lowering.py\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/mosaic/lowering.py"},"region":{"startLine":1104}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1e7542fefd317b501b2f2ef0e22d0ede1a4619337ac6dd39683072d6b15ecc1"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: jax/experimental/mosaic/gpu/launch_context.py: jax/experimental/mosaic/gpu/launch_context.py changed 23 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 110 in LaunchContext.async_copy at line 1473. 1 of those changes was a fix/bug commit, and the other 22 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 16:26:16 -08:00\u0027 --until=\u00272026-11-13 16:26:16 -08:00\u0027 --full-history --no-merges -- jax/experimental/mosaic/gpu/launch_context.py\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/mosaic/gpu/launch_context.py"},"region":{"startLine":1473}}}],"partialFingerprints":{"codehealthFindingId/v1":"80a7bae7784f5c046997afa1f0abe548663771b56a29585890472ac3cfdf5238"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: jax/experimental/mosaic/gpu/fragmented_array.py: jax/experimental/mosaic/gpu/fragmented_array.py changed 22 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 106 in FragmentedArray.astype at line 2507. 3 of those changes were fix/bug commits, and the other 19 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 16:26:16 -08:00\u0027 --until=\u00272026-11-13 16:26:16 -08:00\u0027 --full-history --no-merges -- jax/experimental/mosaic/gpu/fragmented_array.py\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/mosaic/gpu/fragmented_array.py"},"region":{"startLine":2507}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3d4f669747807a59757542846a555cd39cb7e5dc18517380552e1b6ff8955fb"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: jax/_src/pallas/mosaic_gpu/primitives.py: jax/_src/pallas/mosaic_gpu/primitives.py changed 41 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 52 in primitives._copy_gmem_to_smem_lowering at line 975. 3 of those changes were fix/bug commits, and the other 38 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 16:26:16 -08:00\u0027 --until=\u00272026-11-13 16:26:16 -08:00\u0027 --full-history --no-merges -- jax/_src/pallas/mosaic_gpu/primitives.py\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/mosaic_gpu/primitives.py"},"region":{"startLine":975}}}],"partialFingerprints":{"codehealthFindingId/v1":"9004fae973cb551847baf92713e6bf318feee3e7a768696039bab963534604d5"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: jax/experimental/mosaic/gpu/utils.py: jax/experimental/mosaic/gpu/utils.py changed 37 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 28 in utils.parse_indices at line 1086. 3 of those changes were fix/bug commits, and the other 34 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 16:26:16 -08:00\u0027 --until=\u00272026-11-13 16:26:16 -08:00\u0027 --full-history --no-merges -- jax/experimental/mosaic/gpu/utils.py\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/mosaic/gpu/utils.py"},"region":{"startLine":1086}}}],"partialFingerprints":{"codehealthFindingId/v1":"37b28b8b9013ef99dcc5513ba66be473fcd8e5e2edc5e2fc9747e09d3b132bd2"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: jax/_src/pallas/mosaic_gpu/lowering.py: jax/_src/pallas/mosaic_gpu/lowering.py changed 39 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 26 in lowering._swap_lowering_rule at line 2004. 2 of those changes were fix/bug commits, and the other 37 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 16:26:16 -08:00\u0027 --until=\u00272026-11-13 16:26:16 -08:00\u0027 --full-history --no-merges -- jax/_src/pallas/mosaic_gpu/lowering.py\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/mosaic_gpu/lowering.py"},"region":{"startLine":2004}}}],"partialFingerprints":{"codehealthFindingId/v1":"20337dac441787b84a45876ffae4bed31d90cf3d9fec5318b3ef0e92808f678b"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: jax/experimental/mosaic/gpu/core.py: jax/experimental/mosaic/gpu/core.py changed 30 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 30 in core._launch at line 751. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 16:26:16 -08:00\u0027 --until=\u00272026-11-13 16:26:16 -08:00\u0027 --full-history --no-merges -- jax/experimental/mosaic/gpu/core.py\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/mosaic/gpu/core.py"},"region":{"startLine":751}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed36cb07b959731596b4a5707da0f9a87c3476835d3928c96315fa61f6afb3b7"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: jax/_src/tpu_custom_call.py: jax/_src/tpu_custom_call.py changed 19 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 46 in CustomCallBackendConfig.to_json at line 251. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 16:26:16 -08:00\u0027 --until=\u00272026-11-13 16:26:16 -08:00\u0027 --full-history --no-merges -- jax/_src/tpu_custom_call.py\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/tpu_custom_call.py"},"region":{"startLine":251}}}],"partialFingerprints":{"codehealthFindingId/v1":"1bf445bb718cc3b478117b995144f718a23ab0f9fe27ad51b9e3c637bb4965ae"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: jax/_src/pallas/mosaic/pipeline.py: jax/_src/pallas/mosaic/pipeline.py changed 36 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 21 in BufferedRef.create at line 648. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 16:26:16 -08:00\u0027 --until=\u00272026-11-13 16:26:16 -08:00\u0027 --full-history --no-merges -- jax/_src/pallas/mosaic/pipeline.py\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/mosaic/pipeline.py"},"region":{"startLine":648}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd483a9d77ab5fd042dc6d74ca4e7755b4c6423241f0c539f19c4719838dd79b"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: jax/_src/numpy/reductions.py: jax/_src/numpy/reductions.py changed 11 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 58 in reductions._quantile at line 2720. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 16:26:16 -08:00\u0027 --until=\u00272026-11-13 16:26:16 -08:00\u0027 --full-history --no-merges -- jax/_src/numpy/reductions.py\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/numpy/reductions.py"},"region":{"startLine":2720}}}],"partialFingerprints":{"codehealthFindingId/v1":"61f456033ee277c4eb3aafcf137b9fefbb4191e615351bfbb19a5340041e9221"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: jax/_src/pallas/mosaic/interpret/interpret_pallas_call.py: jax/_src/pallas/mosaic/interpret/interpret_pallas_call.py changed 13 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 48 in interpret_pallas_call._interpret_jaxpr at line 1349. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 16:26:16 -08:00\u0027 --until=\u00272026-11-13 16:26:16 -08:00\u0027 --full-history --no-merges -- jax/_src/pallas/mosaic/interpret/interpret_pallas_call.py\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/mosaic/interpret/interpret_pallas_call.py"},"region":{"startLine":1349}}}],"partialFingerprints":{"codehealthFindingId/v1":"1eea0764b17fa46a6370f1cf301f6eafaf59620d84f80881671359a4f1e257a1"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: jax/_src/lax/control_flow/loops.py: jax/_src/lax/control_flow/loops.py changed 30 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in loops.while_loop at line 1677. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 16:26:16 -08:00\u0027 --until=\u00272026-11-13 16:26:16 -08:00\u0027 --full-history --no-merges -- jax/_src/lax/control_flow/loops.py\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/lax/control_flow/loops.py"},"region":{"startLine":1677}}}],"partialFingerprints":{"codehealthFindingId/v1":"6466c34e055dba5beafc318dc10b660c3688999753e111fa2e4ccdb8c7d22b15"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: jax/_src/random/core.py: jax/_src/random/core.py changed 26 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in core._multivariate_normal at line 1544. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 16:26:16 -08:00\u0027 --until=\u00272026-11-13 16:26:16 -08:00\u0027 --full-history --no-merges -- jax/_src/random/core.py\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/random/core.py"},"region":{"startLine":1544}}}],"partialFingerprints":{"codehealthFindingId/v1":"13ea17e02221af4696208a3419337148c1d022ba48107451eabf07025e1f2acd"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: jax/_src/shard_map.py: jax/_src/shard_map.py changed 25 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in shard_map._shmap_checks at line 371. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 16:26:16 -08:00\u0027 --until=\u00272026-11-13 16:26:16 -08:00\u0027 --full-history --no-merges -- jax/_src/shard_map.py\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/shard_map.py"},"region":{"startLine":371}}}],"partialFingerprints":{"codehealthFindingId/v1":"039d75d16f0f9d69afcd6d6f1c297b6f1ca62d287e22f38d380a6e16bfd8af0e"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: jax/_src/pallas/mosaic/sc_lowering.py: jax/_src/pallas/mosaic/sc_lowering.py changed 17 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 25 in sc_lowering._store_lowering_rule at line 258. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 16:26:16 -08:00\u0027 --until=\u00272026-11-13 16:26:16 -08:00\u0027 --full-history --no-merges -- jax/_src/pallas/mosaic/sc_lowering.py\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/mosaic/sc_lowering.py"},"region":{"startLine":258}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff3ebb5dbad93a0b7cf91661fb86b3451be7d915c20585f3c8f5f2c86a4ece9c"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: jax/_src/lax/slicing.py: jax/_src/lax/slicing.py changed 21 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 20 in slicing._gather_collective_rule at line 2590. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 16:26:16 -08:00\u0027 --until=\u00272026-11-13 16:26:16 -08:00\u0027 --full-history --no-merges -- jax/_src/lax/slicing.py\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/lax/slicing.py"},"region":{"startLine":2590}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9f2a3b73003767512be850436b8ce4d67712b34eee9d053817d9640241b4df3"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: jax/_src/export/_export.py: jax/_src/export/_export.py changed 15 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 26 in _export._export_lowered at line 698. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 16:26:16 -08:00\u0027 --until=\u00272026-11-13 16:26:16 -08:00\u0027 --full-history --no-merges -- jax/_src/export/_export.py\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/export/_export.py"},"region":{"startLine":698}}}],"partialFingerprints":{"codehealthFindingId/v1":"612b8a2030fb5906b1fd472685197bbbd0907f167b2f2d7db85a57259b89824e"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: jax/_src/custom_derivatives.py: jax/_src/custom_derivatives.py changed 20 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 in custom_vjp.__call__ at line 806. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 16:26:16 -08:00\u0027 --until=\u00272026-11-13 16:26:16 -08:00\u0027 --full-history --no-merges -- jax/_src/custom_derivatives.py\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/custom_derivatives.py"},"region":{"startLine":806}}}],"partialFingerprints":{"codehealthFindingId/v1":"e10e40bd09159580caa9bb91b86d6f305b9a5ccbb9a72e0655fe3d19a3595ba3"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: jax/_src/lax/control_flow/conditionals.py: jax/_src/lax/control_flow/conditionals.py changed 16 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 23 in conditionals.cond at line 195. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 16:26:16 -08:00\u0027 --until=\u00272026-11-13 16:26:16 -08:00\u0027 --full-history --no-merges -- jax/_src/lax/control_flow/conditionals.py\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/lax/control_flow/conditionals.py"},"region":{"startLine":195}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7a042f3c73dd74f51239d7969f8f399010ba968e1a6dac260b561d73e96b416"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: jax/_src/pallas/mpmd.py: jax/_src/pallas/mpmd.py changed 14 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 25 in mpmd._mpmd_map_abstract_eval at line 91. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 16:26:16 -08:00\u0027 --until=\u00272026-11-13 16:26:16 -08:00\u0027 --full-history --no-merges -- jax/_src/pallas/mpmd.py\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/mpmd.py"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6485b044b53044be69b5ec540cd20bd0102dc4b6986b299140511321e08462f"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: jax/_src/pallas/mosaic/primitives.py: jax/_src/pallas/mosaic/primitives.py changed 20 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in primitives.dma_start_discharge_rule at line 508. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 16:26:16 -08:00\u0027 --until=\u00272026-11-13 16:26:16 -08:00\u0027 --full-history --no-merges -- jax/_src/pallas/mosaic/primitives.py\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/mosaic/primitives.py"},"region":{"startLine":508}}}],"partialFingerprints":{"codehealthFindingId/v1":"13dfcff88e3445a03f210b8f303d414dba887c44ff81cee8868cc270bdf423ec"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: jax/_src/numpy/indexing.py: jax/_src/numpy/indexing.py changed 11 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 27 in indexing._index_to_gather at line 1405. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 16:26:16 -08:00\u0027 --until=\u00272026-11-13 16:26:16 -08:00\u0027 --full-history --no-merges -- jax/_src/numpy/indexing.py\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/numpy/indexing.py"},"region":{"startLine":1405}}}],"partialFingerprints":{"codehealthFindingId/v1":"3abbb05ccbb0c1ebd223cc788adc5331495cb9a35db75b84522fe779176a00df"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: jax/_src/interpreters/ad.py: jax/_src/interpreters/ad.py changed 12 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 23 in ad.backward_pass3 at line 300. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 16:26:16 -08:00\u0027 --until=\u00272026-11-13 16:26:16 -08:00\u0027 --full-history --no-merges -- jax/_src/interpreters/ad.py\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/interpreters/ad.py"},"region":{"startLine":300}}}],"partialFingerprints":{"codehealthFindingId/v1":"31e4713242396729398970a3eb9820c783fc31958900fa62d165aae5cf5cd822"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: jax/_src/state/discharge.py: jax/_src/state/discharge.py changed 10 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 21 in discharge._eval_jaxpr_discharge_state at line 233. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 16:26:16 -08:00\u0027 --until=\u00272026-11-13 16:26:16 -08:00\u0027 --full-history --no-merges -- jax/_src/state/discharge.py\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/state/discharge.py"},"region":{"startLine":233}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c1854dc202409442374f2ca3e3a22aa07df7099d4c618948c3de110445a8e26"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: jax/_src/pallas/mosaic_gpu/interpret/shared_memory.py: jax/_src/pallas/mosaic_gpu/interpret/shared_memory.py changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 26 in Barrier._wait at line 1380. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 16:26:16 -08:00\u0027 --until=\u00272026-11-13 16:26:16 -08:00\u0027 --full-history --no-merges -- jax/_src/pallas/mosaic_gpu/interpret/shared_memory.py\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/mosaic_gpu/interpret/shared_memory.py"},"region":{"startLine":1380}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d4ffa259dd33001139ce93a80044ecfe9e16737e261cea8cb4835545a8623f6"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: jax/experimental/pallas/ops/tpu/splash_attention/splash_attention_kernel.py: jax/experimental/pallas/ops/tpu/splash_attention/splash_attention_kernel.py changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 30 in splash_attention_kernel._splash_attention_forward at line 912. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 16:26:16 -08:00\u0027 --until=\u00272026-11-13 16:26:16 -08:00\u0027 --full-history --no-merges -- jax/experimental/pallas/ops/tpu/splash_attention/splash_attention_kernel.py\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/pallas/ops/tpu/splash_attention/splash_attention_kernel.py"},"region":{"startLine":912}}}],"partialFingerprints":{"codehealthFindingId/v1":"e769b677dd736e7cabafdcf619846c82229e13225ba9ec7a47615f622f36c8f8"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: jax/_src/pallas/mosaic/pallas_call_registration.py: jax/_src/pallas/mosaic/pallas_call_registration.py changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 29 in pallas_call_registration.mpmd_map_tpu_lowering_rule at line 612. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 16:26:16 -08:00\u0027 --until=\u00272026-11-13 16:26:16 -08:00\u0027 --full-history --no-merges -- jax/_src/pallas/mosaic/pallas_call_registration.py\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/mosaic/pallas_call_registration.py"},"region":{"startLine":612}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1e25e990b6e92f478a7de30f58cd9a190bb62c43fb0c267cc03b18eb168aad8"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: jax/_src/numpy/array_constructors.py: jax/_src/numpy/array_constructors.py changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 44 in array_constructors.array at line 107. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 16:26:16 -08:00\u0027 --until=\u00272026-11-13 16:26:16 -08:00\u0027 --full-history --no-merges -- jax/_src/numpy/array_constructors.py\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/numpy/array_constructors.py"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b76cd6ef91ecf3c6db1296c548ce61b1069a8bc614b2880e8423cdbde5a2d26"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: jax/_src/distributed.py: jax/_src/distributed.py changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 25 in State.initialize at line 92. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 16:26:16 -08:00\u0027 --until=\u00272026-11-13 16:26:16 -08:00\u0027 --full-history --no-merges -- jax/_src/distributed.py\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/distributed.py"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"76757d5e54a385b5f2aff7752f55eb017cd1c98b9b26ca25f3b1bc886443b57b"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: jax/_src/pallas/mosaic_gpu/pipeline.py: jax/_src/pallas/mosaic_gpu/pipeline.py changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 21 in pipeline.emit_pipeline_warp_specialized at line 660. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 16:26:16 -08:00\u0027 --until=\u00272026-11-13 16:26:16 -08:00\u0027 --full-history --no-merges -- jax/_src/pallas/mosaic_gpu/pipeline.py\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/mosaic_gpu/pipeline.py"},"region":{"startLine":660}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9dbc160785c9ac4d378535abc552e517a8034b808f993c496412306ef38bad8"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: jax/_src/scipy/bessel.py: jax/_src/scipy/bessel.py changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 20 in bessel._yn_series at line 930. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 16:26:16 -08:00\u0027 --until=\u00272026-11-13 16:26:16 -08:00\u0027 --full-history --no-merges -- jax/_src/scipy/bessel.py\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/scipy/bessel.py"},"region":{"startLine":930}}}],"partialFingerprints":{"codehealthFindingId/v1":"fdb0ee41f36690b9c443eeb8752439beddd82456a1ffffcf20b6c9f596c14206"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: jax/_src/cudnn/fused_attention_stablehlo.py: jax/_src/cudnn/fused_attention_stablehlo.py changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 25 in fused_attention_stablehlo.dot_product_attention at line 2032. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 16:26:16 -08:00\u0027 --until=\u00272026-11-13 16:26:16 -08:00\u0027 --full-history --no-merges -- jax/_src/cudnn/fused_attention_stablehlo.py\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/cudnn/fused_attention_stablehlo.py"},"region":{"startLine":2032}}}],"partialFingerprints":{"codehealthFindingId/v1":"01459dfe99d3fc621f1654c7660fe67569a0018ddfb5e6d8bbf799f0af413691"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: jax/_src/callback.py: jax/_src/callback.py changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in callback.emit_python_callback at line 764. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 16:26:16 -08:00\u0027 --until=\u00272026-11-13 16:26:16 -08:00\u0027 --full-history --no-merges -- jax/_src/callback.py\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/callback.py"},"region":{"startLine":764}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ed9022eaaf19d6edbb6990209e0f42164c9aedc2aa2b4ce07a5196cfb76bcb0"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: jax/experimental/mosaic/gpu/mma_utils.py: jax/experimental/mosaic/gpu/mma_utils.py changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 23 in mma_utils.create_descriptor at line 116. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 16:26:16 -08:00\u0027 --until=\u00272026-11-13 16:26:16 -08:00\u0027 --full-history --no-merges -- jax/experimental/mosaic/gpu/mma_utils.py\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/mosaic/gpu/mma_utils.py"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"08630e9d1118ca58716f9e4891fcb36ccedc356198909c3319248de238869751"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: jax/_src/dtypes.py: jax/_src/dtypes.py changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 21 in dtypes._issubdtype_cached at line 554. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 16:26:16 -08:00\u0027 --until=\u00272026-11-13 16:26:16 -08:00\u0027 --full-history --no-merges -- jax/_src/dtypes.py\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/dtypes.py"},"region":{"startLine":554}}}],"partialFingerprints":{"codehealthFindingId/v1":"e626dde55806edb9ed98e9f6f45c10eac1f79bfe787c573c10a8eac8f3acc11e"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: jax/_src/compiler.py: jax/_src/compiler.py changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 27 in compiler.get_compile_options at line 187. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 16:26:16 -08:00\u0027 --until=\u00272026-11-13 16:26:16 -08:00\u0027 --full-history --no-merges -- jax/_src/compiler.py\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/compiler.py"},"region":{"startLine":187}}}],"partialFingerprints":{"codehealthFindingId/v1":"36e828d169a3ee254559994f850fbb05480c68e9d549112c5c1d9526911243a0"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: jax/_src/state/indexing.py: jax/_src/state/indexing.py changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 20 in NDIndexer.from_indices_shape at line 184. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 16:26:16 -08:00\u0027 --until=\u00272026-11-13 16:26:16 -08:00\u0027 --full-history --no-merges -- jax/_src/state/indexing.py\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/state/indexing.py"},"region":{"startLine":184}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5544a1dbb5064b4d478c9dcb478e3d70afc4bce4268d377b03bfc82ef7966dc"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: jax/_src/dlpack.py: jax/_src/dlpack.py changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 23 in dlpack.from_dlpack at line 234. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 16:26:16 -08:00\u0027 --until=\u00272026-11-13 16:26:16 -08:00\u0027 --full-history --no-merges -- jax/_src/dlpack.py\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/dlpack.py"},"region":{"startLine":234}}}],"partialFingerprints":{"codehealthFindingId/v1":"89d04274f4114b89ab2f1a07facf37132ed0ea50b048c9e3ff39069d1d589a59"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: jax/experimental/mosaic/gpu/wgmma.py: jax/experimental/mosaic/gpu/wgmma.py changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 31 in wgmma._wgmma_m64 at line 119. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 16:26:16 -08:00\u0027 --until=\u00272026-11-13 16:26:16 -08:00\u0027 --full-history --no-merges -- jax/experimental/mosaic/gpu/wgmma.py\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/mosaic/gpu/wgmma.py"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2a81c1cc32d8942001b2760632c1e6b07d4d96dff65ca17969a35599a9b06ed"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: jax/_src/pallas/hlo_interpreter.py: jax/_src/pallas/hlo_interpreter.py changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 in hlo_interpreter.pallas_call_hlo_interpret at line 316. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 16:26:16 -08:00\u0027 --until=\u00272026-11-13 16:26:16 -08:00\u0027 --full-history --no-merges -- jax/_src/pallas/hlo_interpreter.py\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/hlo_interpreter.py"},"region":{"startLine":316}}}],"partialFingerprints":{"codehealthFindingId/v1":"21a1ba4cd491ab034060043a2dba59249c9960723e58a325eba1801cef22a722"}},{"ruleId":"D16","level":"note","message":{"text":"Off-boarding risk: anonymized user #1: If anonymized user #1 becomes unavailable, 9 significant file(s) lose their only recent owner: jax/_src/numpy/index_tricks.py, jax/_src/scipy/stats/chi2.py, jax/_src/scipy/stats/uniform.py, benchmarks/math_benchmark.py, jax/_src/scipy/stats/t.py, jax/_src/scipy/stats/laplace.py, jax/_src/random/__init__.py, jax/_src/scipy/stats/multinomial.py (\u002B1 more). Pair on, review, or document these before any departure."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"3f79e6424960bd0b8162f974c2751d0093707b499ad64c1010f7f4b8500d5274"}},{"ruleId":"D16","level":"note","message":{"text":"Off-boarding risk: anonymized user #2: If anonymized user #2 becomes unavailable, 3 significant file(s) lose their only recent owner: jax/_src/lax/erf.py, jax/_src/image/scale.py, benchmarks/linalg_benchmark.py. Pair on, review, or document these before any departure."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"7172097d936871e2ecbd81a44d3c39f7c866f0fe5265599b3fcdebe7fd06a97e"}},{"ruleId":"D16","level":"note","message":{"text":"Off-boarding risk: anonymized user #3: If anonymized user #3 becomes unavailable, 3 significant file(s) lose their only recent owner: jax/_src/internal_test_util/export_back_compat_test_data/export_with_multiple_meshes.py, jax/_src/internal_test_util/export_back_compat_test_data/export_with_specified_sharding.py, jax/_src/internal_test_util/export_back_compat_test_data/export_with_unspecified_sharding.py. Pair on, review, or document these before any departure."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"3dab312f7f68a2beea2c762359eb409af5b4918a2bbcd38913565841bb66fabb"}},{"ruleId":"D16","level":"note","message":{"text":"Further sole-owners (lower concentration): 4 other contributor(s) are each the sole owner of a small amount of code below the off-boarding threshold \u2014 folded into the bus-factor score and metrics (19 single-owned of 458 analysed files in total, counted over production source files of roughly 2,400 bytes or more, excluding vendored, generated, example/demo and scaffolding-template trees and test files identified by path convention, largest first; 458 of the 682 production source files in this repository met that bar). They are anonymized user #4 (1 file(s)), anonymized user #5 (1 file(s)), anonymized user #6 (1 file(s)), anonymized user #7 (1 file(s)) \u2014 spread or document their files in the same way, at lower priority than the named off-boarding risks above. The files folded here: jax/example_libraries/stax.py, jax/_src/pallas/mosaic/prefetch.py, benchmarks/pallas/mgpu_planar_snake_bench.py, benchmarks/shape_poly_benchmark.py."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"6eac528f2429e724e1a97ed868f79eefbcf1888dab4af9a9e673429369bb5b2f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(gulsumgudukbay): add a rocm8 extra once those wheels ship. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"setup.py"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"71784e026bbc6f0c3e84997693446b554b621901141c6e076fa2aae68b4db53a"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(b/258315194) Investigate probability property when input is around \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/ann_test.py"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"4dbd4b5e33a951b580df5c9aa51e6212388c3c7fdb360fe0f862af954814a4c7"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(frostig): remove \u0060wrap\u0060 once we always enable_custom_prng \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/api_test.py"},"region":{"startLine":1006}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4616683a017efbbcf3f8ecc4d0ca23db3ea068e63965986ba974a60e28cb7a8"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(zhangqiaorjc): Test pruning constants after DCE pass prunes primitive \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/api_test.py"},"region":{"startLine":1155}}}],"partialFingerprints":{"codehealthFindingId/v1":"1032b9d5d58fe9d6b24db0fa26f361c15d0623aac7aa16386ef6a80175468102"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(b/261771737): add support for uncompiled cost analysis in C API. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/api_test.py"},"region":{"startLine":1346}}}],"partialFingerprints":{"codehealthFindingId/v1":"7fd859214909b00bac4761c28f032140696fe0bf9a180de8e5996cb328b57514"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(phawkins): merge these tests with the \u0060xla_computation\u0060 tests. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/api_test.py"},"region":{"startLine":3415}}}],"partialFingerprints":{"codehealthFindingId/v1":"047b6241a67eb9ddfcb42c87c75e00600eccc5704c44b51ef71e9d81fd9bc299"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(dougalm): rethink what this should do under stackless \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/api_test.py"},"region":{"startLine":4068}}}],"partialFingerprints":{"codehealthFindingId/v1":"7705703a38866fec8ef4cda9a3c9206a18130c792f8c72855659039f7438c426"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(jakevdp): re-enable this if possible. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/api_test.py"},"region":{"startLine":4166}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d671d9c1d99d6c19b77c5d5d25a5ad4a719049e9511c94ae4f99bcaf21a42a4"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(mattjj): full test msg below fails (harmlessly) on CI, investigate \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/api_test.py"},"region":{"startLine":4426}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1dcf3711b2d527c358f1475546a6dca597de5db404e25c942d4fb06f23b75e2"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(dougalm): figure out with Matt what to do with this feature \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/api_test.py"},"region":{"startLine":5864}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8576f19ec437670ced6358541aba56e25d9ca4d5f32ab52cbd360976521ee4e"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(mattjj,phawkins): we broke this on purpose, as it probably isn\u0027t \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/api_test.py"},"region":{"startLine":6166}}}],"partialFingerprints":{"codehealthFindingId/v1":"58f9e257aefb6b7a447a75e74f9bd36a3d5c24282c1197c9138dee79d823661d"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(mattjj,dougalm): this test was flakey on CI; figure out how to enable? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/api_test.py"},"region":{"startLine":6180}}}],"partialFingerprints":{"codehealthFindingId/v1":"885991f0e8c6bd20f1722121565b04b820a8d288116d53d517e34e882d1ca291"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(mattjj,dougalm): re-enable if we set auto_dce=True by default \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/api_test.py"},"region":{"startLine":6239}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec1e198cdc8480ab58cc92f40afa190359dc47ea19027ec1a75e40c32a08f05d"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(mattjj): Raise an error message. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/api_test.py"},"region":{"startLine":10281}}}],"partialFingerprints":{"codehealthFindingId/v1":"e73dd08f933d3ef928e57209284dbf4bf227111caba7f14a4d9c290b25d41229"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(dougalm): shoud be able to get this down to 2 or 3 \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/api_test.py"},"region":{"startLine":10495}}}],"partialFingerprints":{"codehealthFindingId/v1":"7204b23b4ab263449577363fb0aa72e3d0ff2b924e122e3327cc7e6d04ae23ad"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(dougalm): improve this \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/api_test.py"},"region":{"startLine":10505}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd1a969485e75cc3d68d6ae66defa5dfe1752c3b63cae0ec9ee6dc25040b2483"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(dougalm): improve this \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/api_test.py"},"region":{"startLine":10516}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f9034730f89be7e62b7b630f2b377e7225a8fddd753a6bd927c272279898fa0"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(dougalm): improve this \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/api_test.py"},"region":{"startLine":10527}}}],"partialFingerprints":{"codehealthFindingId/v1":"af133e36e191d6b892e7a91890df85f66340e94a76f1d118ed4f0fd0c04ce0c3"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(micky774): Remove when jnp.clip deprecation is completed \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/array_api_test.py"},"region":{"startLine":338}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7f35b70c5cf5832540bca39203dfb2b70e99fe56eef97b2ce9fb83d137ea7db"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(jakevdp): commented APIs are ones which do not yet support \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/array_extensibility_test.py"},"region":{"startLine":241}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4ebaee8dbadcb342daf0197bb716d184ba9bd3b22c21a3337e13b287d970067"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(b/470156950): Remove this once a proper fix is in place \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/array_interoperability_test.py"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c4b8996c3225ed22ef08e40edf56dbfe91b2575012433f5e8b0cecf53c62749"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(b/470156950): Remove this once a proper fix is in place \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/jax2tf/tests/jax2tf_test.py"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5f3e93c1346d2e34a0e897659262aa73fee3cf5134589fb521dfbcae58766e4"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(b/470156950): Remove this once a proper fix is in place \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/jax2tf/tests/sharding_test.py"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d45b608e63b9fc625ed25237f50a6ed5079a5eac20f08b6c98d9bf6d20c037e"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(b/470156950): Remove this once a proper fix is in place \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/jax2tf/tests/multiprocess/jax2tf_multiprocess_test.py"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0f693cd353dd02938dcad65101053ff768dd874c0181125986a7822788cca7b"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(parkers): Remove after setting \u0027stream\u0027 properly below. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/array_interoperability_test.py"},"region":{"startLine":213}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ec4d9ef92d69584a0be1db1e0a3b9239e7931a230a353da4478879ef873b053"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(parkers): Remove after setting \u0027stream\u0027 properly below. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/array_interoperability_test.py"},"region":{"startLine":771}}}],"partialFingerprints":{"codehealthFindingId/v1":"52fd5f29d27412f0c2790b54a76f57f95e39666bb7accc23bea158a63802886f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(parkers): Remove after setting \u0027stream\u0027 properly. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/array_interoperability_test.py"},"region":{"startLine":239}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2afff264c8ba7f50ac35aa5f6a5d42258b4d86e9fa550612e761cc8a64d8936"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(parkers): Remove after setting \u0027stream\u0027 properly. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/array_interoperability_test.py"},"region":{"startLine":311}}}],"partialFingerprints":{"codehealthFindingId/v1":"6375b0d736e863732206f34c9909ff117f5bcb2a2b4a689455f18e81180f1560"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(parkers): Remove after setting \u0027stream\u0027 properly. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/array_interoperability_test.py"},"region":{"startLine":731}}}],"partialFingerprints":{"codehealthFindingId/v1":"dfa9754581a3b9bdea976bf7e3d8fe950fbc3c9998dce4a8578bee28649f57f1"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(Intel-tf): Remove the skip once kDLOneAPIHost is added and supported. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/array_interoperability_test.py"},"region":{"startLine":252}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e2ed97dcc7d0de3b1f6f77dfb2c32618801d2d0f2289b1f7a8abdec49f9f15d"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(b/171320191): this line works around a missing context initialization \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/array_interoperability_test.py"},"region":{"startLine":313}}}],"partialFingerprints":{"codehealthFindingId/v1":"15015310bdd882901220b27cf5205a9ad45f33786c805ef1a671fb6f72589a35"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(b/171320191): this line works around a missing context initialization \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/jax2tf/tests/call_tf_test.py"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea59132df423eb46944db6c2297d37b1b840c8a4087f3c968e32d1261720fc57"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(b/171320191): this line works around a missing context initialization \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/jax2tf/tests/call_tf_test.py"},"region":{"startLine":870}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f3d6a5d546a23eebde2f539239f1bd00ca5729ae8c28224ff76cd703d9aa95d"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(b/171320191): this line works around a missing context initialization \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/jax2tf/tests/call_tf_test.py"},"region":{"startLine":1164}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a2d407692bbd7ff5c01ce3e24d12af00fbd23ea75af8b0c8be72fe9bacd04b8"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(b/399879011): GPU is the only platform that has an implementation for \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/array_test.py"},"region":{"startLine":680}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd0dc22ab2dba2571d61de5cec8e20f232c1aa31a7354350a98c5160cd15465c"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(skyewm): check that defragmentation actually happened. I originally \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/array_test.py"},"region":{"startLine":708}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b58bcff8b43219451aaec8a20616650964c69a7c86a203892416f4593211f02"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(mattjj): don\u0027t make this a pytree \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/batching_test.py"},"region":{"startLine":1285}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8fce99dfd77957eca8081affa488f9cb12d9aade976a43a06a54a5894d64a10"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: There\u0027s an XLA:GPU/CUDA bug that causes a segfault when \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/buffer_callback_test.py"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5a8cf055a5aaee8095ab01df2ba55c39dbf5a70403542d9dcbb1dc558680f67"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(phawkins): this test flakes if test concurrency is enabled. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/cache_key_test.py"},"region":{"startLine":168}}}],"partialFingerprints":{"codehealthFindingId/v1":"12919e54f8bb5bbeb91a7c45c838b72c80fc8f02b6aa01fa1b1f9d12acc34753"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(lenamartens): numpy reports index -5 here, need to normalize? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/checkify_test.py"},"region":{"startLine":181}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf741df2f2ad89acd0d262f4fdee89cffbddd39e7f150911d5130a14933ed197"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(lenamartens): re-enable assertions below. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/checkify_test.py"},"region":{"startLine":1401}}}],"partialFingerprints":{"codehealthFindingId/v1":"aca497ba9354b6fbe4c56138532c57caa98f182afeac5071b04c3bea9a9ed4eb"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(lenamartens): re-enable assertions below. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/checkify_test.py"},"region":{"startLine":1430}}}],"partialFingerprints":{"codehealthFindingId/v1":"321f20241506d77040f599c828eea2650258a0e704f2ec20c6fd0e114e61ef02"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(hyeontaek): Infer \u0060devices\u0060 from the output spec computed using the \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/colocated_python_test.py"},"region":{"startLine":808}}}],"partialFingerprints":{"codehealthFindingId/v1":"647b42a8ffd290ce1b282d7229b2d9b4ff34e8ccf4fd698aa5ec25a2c3eee22f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: create a test for calling pmap with the same input more than once \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/compilation_cache_test.py"},"region":{"startLine":224}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e43b24d639d1888537488c72c41554eee519888579713a1a7142308214c8e2e"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(mattjj): write test \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/custom_api_test.py"},"region":{"startLine":457}}}],"partialFingerprints":{"codehealthFindingId/v1":"06af7839d5346a28761f11faa4e2ca73fa4e555701a2d009e6d1cfd2720b4456"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(mattjj): write test \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/custom_api_test.py"},"region":{"startLine":460}}}],"partialFingerprints":{"codehealthFindingId/v1":"acb92f81986d2801cbc1e006068d9f9d128ce0a135db2d1cd30b148cc46d264a"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(mattjj): write test \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/custom_api_test.py"},"region":{"startLine":2231}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ce5c692974ac5e6a2a7f38e5f8e63e9a376a5987f5f0b7e7e46c6bc6972eee7"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(mattjj): write test \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/custom_api_test.py"},"region":{"startLine":2234}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e2fc309250654f696fb32e44540602a396bdcfa952ee2eee50a27b3fac0b9fb"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(mattjj): do we want to support autodiff here too? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/custom_api_test.py"},"region":{"startLine":1587}}}],"partialFingerprints":{"codehealthFindingId/v1":"19c9e8178158e8094a03784fc9a51493170fff2daf3b833ecd76e5267963bd2f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(mattjj): we don\u0027t yet support this behavior for CustomVJPTraced \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/custom_api_test.py"},"region":{"startLine":3534}}}],"partialFingerprints":{"codehealthFindingId/v1":"3861dde41f9416428d39fcfe61e8efb2cc56d6b9e31c4b426e1139337c91066b"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(mattjj): remove this test when the config option is removed \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/custom_api_test.py"},"region":{"startLine":3760}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a81d6c8a580a192b2d9315fb71ff4cfca27eb2286762064f41202dc98b0291d"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(necula): result_paths? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/debug_info_test.py"},"region":{"startLine":621}}}],"partialFingerprints":{"codehealthFindingId/v1":"14d85bd3e1839a715c3c4c7053d9d6820e88ed465bc8923ee15b6d0bb834683d"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(necula): result_paths? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/debug_info_test.py"},"region":{"startLine":951}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c2f8432e8f3cfe08ff282c25008a8d7196ed1bd2ade08f103146fea02aa469c"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(necula): result_paths? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/debug_info_test.py"},"region":{"startLine":1919}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b44c48792b66ecedc3ee90dfb9e78a094a5e10a0e2cb8c979dc9840780c3033"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(necula): remove the conditional \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/debug_info_test.py"},"region":{"startLine":880}}}],"partialFingerprints":{"codehealthFindingId/v1":"d26bd9f3bd7b308c1c8f94bde2ac2edf061163dc09599ace8f682045080d6f23"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(necula): missing arg_names \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/debug_info_test.py"},"region":{"startLine":918}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff2c64504fa3b037dbd7b4d7fe15ed657b0d210bd4724508b5781213f007bf45"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(necula): missing arg_names \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/debug_info_test.py"},"region":{"startLine":948}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a20d3662b2c395955ffcb946f34fd187585bd03a75c90b6251fd1ff7383a725"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(necula): missing result names \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/debug_info_test.py"},"region":{"startLine":923}}}],"partialFingerprints":{"codehealthFindingId/v1":"73408676f36ff447a22d8612f4904832636d2c1ab6c7d5716c226542f76bba4d"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(b/398208230): Re-enable this test after fixing. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/debug_info_test.py"},"region":{"startLine":928}}}],"partialFingerprints":{"codehealthFindingId/v1":"2629840a17fe32faa5caf09e49c434e0699a8283d11d3ad3e17dc2beb859c9d2"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(necula): arg_names? result_paths? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/debug_info_test.py"},"region":{"startLine":940}}}],"partialFingerprints":{"codehealthFindingId/v1":"b495133baa23f57061c5e6d7076376f9f59e7bd5c6ccb032dcb38513e68623af"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(necula): missing debug info \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/debug_info_test.py"},"region":{"startLine":977}}}],"partialFingerprints":{"codehealthFindingId/v1":"88205f0a5fd4e3c42dfad48ad50e9afaf4d48e7c06c66ce43821161e9488fe02"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(necula): missing debug info \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/debug_info_test.py"},"region":{"startLine":1491}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ccefd165bb53e9838a3441cee6062a1b4f3ca24860224335de9f85c06a980d0"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(necula): what are these flat_index components? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/debug_info_test.py"},"region":{"startLine":1005}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a529dbe317fdd6384ef493c4ba50f60f273f3c29788cb0b7a75167b70835ec6"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(necula): from None? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/debug_info_test.py"},"region":{"startLine":1042}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ea107bb467f2354e9efccd2319fcae1c061aef534cc3f97316a58d6510d1510"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(necula): from None? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/debug_info_test.py"},"region":{"startLine":1110}}}],"partialFingerprints":{"codehealthFindingId/v1":"7930c036c2a5723580c70879843f01277dfad7f111fa80b7c63d41aa0397573d"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(necula): from None? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/debug_info_test.py"},"region":{"startLine":1170}}}],"partialFingerprints":{"codehealthFindingId/v1":"60ac026e59006c89c9c8729a170de4cce152700c0467fe6234603ab042cdf0c5"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(necula): arg_names \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/debug_info_test.py"},"region":{"startLine":1071}}}],"partialFingerprints":{"codehealthFindingId/v1":"7bcf1871ddffd9d527f484689d862481c415ff3b11197e155636562c84eead31"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(necula): from None \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/debug_info_test.py"},"region":{"startLine":1077}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa5d1e92dd438ee46c58b1737d0540572d4f1b078ca19a860febf84ea716af80"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(necula): from None \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/debug_info_test.py"},"region":{"startLine":1141}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef1b14ce5e0d4943dadc0db81cb35971d5e8abbbbb7c66da2452a9c423f3ebca"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(necula): from None \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/debug_info_test.py"},"region":{"startLine":1301}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c339b725fb893da6a26f59b56d183885d07279316911621555222c553c7b255"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(necula): None \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/debug_info_test.py"},"region":{"startLine":1079}}}],"partialFingerprints":{"codehealthFindingId/v1":"affa524a736369d17a3c93b62e8a3f1cc85f7d4114c0d992ae04b546259e2adc"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(necula): We should not include \u0060call_wrapped\u0060 in the debug info. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/debug_info_test.py"},"region":{"startLine":1503}}}],"partialFingerprints":{"codehealthFindingId/v1":"82a6786aad2a08313c3fe922eb4f44340bf3c136d528b2218ea4cffe1bcd72cb"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(necula): We should not include \u0060call_wrapped\u0060 in the debug info. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/debug_info_test.py"},"region":{"startLine":1550}}}],"partialFingerprints":{"codehealthFindingId/v1":"cde4b97b7d0dfa50da661fcfbea03a602725f6ee32797bd72755efb05121056f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(necula): We should not include \u0060call_wrapped\u0060 in the debug info. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/debug_info_test.py"},"region":{"startLine":1592}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ff4e13382342afe76166dd9558c6835565ec0abcaac0bcc1f4ce505f3d83170"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(necula): We should not include \u0060call_wrapped\u0060 in the debug info. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/debug_info_test.py"},"region":{"startLine":1627}}}],"partialFingerprints":{"codehealthFindingId/v1":"5eb3beb54a249a93dd71cc8ab8c7b657d6135d98b1df3e737073b7bd685c9e5d"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(necula): We should not include \u0060call_wrapped\u0060 in the debug info. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/debug_info_test.py"},"region":{"startLine":1782}}}],"partialFingerprints":{"codehealthFindingId/v1":"525f7ba3c172fdaaf11861d5ebde55e8c4a7ecc561c27fad46842b621f4e4746"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(necula): missing debug_info \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/debug_info_test.py"},"region":{"startLine":1609}}}],"partialFingerprints":{"codehealthFindingId/v1":"a84e8752ce93e35f25f4db23ce6d22c04b242c619e4f7e077c33c414e881eb9d"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(necula): missing result_paths \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/debug_info_test.py"},"region":{"startLine":1700}}}],"partialFingerprints":{"codehealthFindingId/v1":"e853c1a6ec36a9d413969341033dfe399b4fb81d24e572120b2b0343043cd063"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(necula): warning during lowering \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/debug_info_test.py"},"region":{"startLine":1812}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a60af6a9a73b27e3d3084dd48eeee7f6009c996ab53fe555a641e7f237e3cd5"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(necula): why pointers to internal functions, arg_names, result_paths? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/debug_info_test.py"},"region":{"startLine":1846}}}],"partialFingerprints":{"codehealthFindingId/v1":"31b2203b24b92fda3186a3d7622c68d2b45dcbcacfe68ae64cf25f19d261bbd6"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(necula): there are missing debug info \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/debug_info_test.py"},"region":{"startLine":1858}}}],"partialFingerprints":{"codehealthFindingId/v1":"f25b8ea7073ba81790c29dfc8c41c426e3aa90bb8af9a71dc679fbb0d1f707dc"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(necula): there are missing debug info \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/debug_info_test.py"},"region":{"startLine":1889}}}],"partialFingerprints":{"codehealthFindingId/v1":"b37adeeea6a46ed1fbcdf9cb78981afcb0879dfacc3f479e35e727b6d46be1c3"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(necula): internal function? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/debug_info_test.py"},"region":{"startLine":1882}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6170e6395029eea7f445500b5ae017c608cf7796899e670b1e52899ea54b9b8"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # We need interpret mode on CPU. TODO(necula) \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/debug_info_test.py"},"region":{"startLine":1926}}}],"partialFingerprints":{"codehealthFindingId/v1":"22a5297f8965fab88c7a83d8d28c40eab095ca35b957f76ca2be711340187576"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # We need interpret mode on CPU. TODO(necula) \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/debug_info_test.py"},"region":{"startLine":1958}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c7c33bf78fc6a1c75fb4c90845940fa561f068f7c743f3b8a2dcd271e341f3b"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(necula): function source location points in JAX internals \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/debug_info_test.py"},"region":{"startLine":1950}}}],"partialFingerprints":{"codehealthFindingId/v1":"43729be45987b90a79586cbfb9f18388f8da0e8e436357729c6dcf2b0c29ad51"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(necula): arg_names and result_paths are wrong \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/debug_info_test.py"},"region":{"startLine":1951}}}],"partialFingerprints":{"codehealthFindingId/v1":"d62d518ebb732029c382d62987737684d04dc3b932d20fa65e24f77d900617c0"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(mattjj,sharadmv) \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/debugging_primitives_test.py"},"region":{"startLine":420}}}],"partialFingerprints":{"codehealthFindingId/v1":"40ac1ec6c6f9b2a4e8cc3501e341892587b2ca5cfd261097156b0b88339d564d"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(mattjj,sharadmv) \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/core.py"},"region":{"startLine":736}}}],"partialFingerprints":{"codehealthFindingId/v1":"1dbe32d51ddd2b04e23c6229da1d964d50b13b731860e8c6f41f7e58c92d1da3"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(mattjj,sharadmv) \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/mosaic/pallas_call_registration.py"},"region":{"startLine":267}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d63b3e519c6c04d20ef4922762a1938cf3cc23f8de8c0a0b1b6504288bcac5f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: in Python 3.14, use template string syntax directly \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/debugging_primitives_test.py"},"region":{"startLine":1458}}}],"partialFingerprints":{"codehealthFindingId/v1":"a42ede2d5528d914ffb10f0664b2c6eb2804f1d01a8341d4bf25c2a67e12f214"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: in Python 3.14, use template string syntax directly \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/debugging_primitives_test.py"},"region":{"startLine":1471}}}],"partialFingerprints":{"codehealthFindingId/v1":"6084fd52572c9be9afaa7fdaeb3051713d2ff63c5064cab92efc9137d5855c96"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: in Python 3.14, use template string syntax directly \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/debugging_primitives_test.py"},"region":{"startLine":1490}}}],"partialFingerprints":{"codehealthFindingId/v1":"86579c0fce347aabef438133f6ffd934746cacb964547e418cd22faa726e4a18"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: in Python 3.14, use template string syntax directly \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/debugging_primitives_test.py"},"region":{"startLine":1503}}}],"partialFingerprints":{"codehealthFindingId/v1":"a92b75c2643e07786c4a445b136f7d46f328eb5ada516ea57685f6e34f0a6af9"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(phawkins): Enable after https://github.com/jax-ml/jax/issues/11222"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/distributed_test.py"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"6da46f59dac00403214ec9459d7b399b6275631c8621d68974488e03bd46ff10"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(jakevdp): un-skip these. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/documentation_coverage_test.py"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"6cc073a88511d7cab64ce2009028a9712b3b81b5c3501958689ef4fd8483fcc9"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(ivyzheng): currently documented as jax.experimental.pallas. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/documentation_coverage_test.py"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2fe3541aeb9a191148ac3a98713927283102aeae362834631aa0d10ea302032"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(zhangqiaorjc): Consider more dtype promotion rules for fp8. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/dtypes_test.py"},"region":{"startLine":312}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad6368d24458154883fab1914f2ae922baa030581a79e4e16d1e78396070717d"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(zhangqiaorjc): Consider more dtype promotion rules for fp8. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/dtypes_test.py"},"region":{"startLine":321}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a61d540237a05f66522a59d7a28dc8f3b6e1adb6d0d610ebc91cec8c7c3ea2b"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(mattjj): make jit=False work \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/dtypes_test.py"},"region":{"startLine":778}}}],"partialFingerprints":{"codehealthFindingId/v1":"6dfcdaba0c5fac18950d9ff38a4079446a39cf4a8bad745157d8f696aed209db"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(b/343490729): Remove continue once the bug is fixed. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/dtypes_test.py"},"region":{"startLine":1317}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a2cf6ceb6e9549bade89f2700cf1ffcff38a29abdcfc095eb1027f1e79db2f0"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(rmlarsen: enable on other devices) \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/eigh_test.py"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"510d6db4b1fc13206eacd09b5d9d825ec7f3425f2ffd785aa6f23ea2a7206c15"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(GulsumGudukbay): Unskip once fixed. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/eigh_test.py"},"region":{"startLine":188}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc72d11b84b6e8cc11a89f36a65ba5ac28d19832bb845a260adcff0ccef8fe7a"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: Re-enable this test when the hipSolver issue is resolved. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/eigh_test.py"},"region":{"startLine":229}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a5efc05678f133989aabfd254379450b42142f723752b8c92a4e149488d4ed1"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: The ROCm 0.10.0 plugin is not yet released. This will be \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/eigh_test.py"},"region":{"startLine":403}}}],"partialFingerprints":{"codehealthFindingId/v1":"51962eb526fcf5a5bb5af4793af6f6fcb5ca6bad8dee1a5351c7717d2b2845c4"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: AOT tests fails with the tracer leak checker. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/error_check_test.py"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f710097e14ce1754ae065d8110c286b043f542b869b1d0cb91faf4d833c59b6"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(ruturaj4): Bidirectional doesn\u0027t quite work well with rocm. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/experimental_rnn_test.py"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0ab6ed87b7b2195c6ed6a0a86dc39825cee46233a9a580fcce8bd075c393c94"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO Re-enable this test when ROCm numerical errors in gtsv2 are fixed. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/export_harnesses_multi_platform_test.py"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"50b1ef76014eb27443cbf1580fa5eb94d69b1684310eb881482062d67d498505"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(necula): Check HLO equivalence for the ultimate test. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/export_harnesses_multi_platform_test.py"},"region":{"startLine":176}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac4298d3aa789872dee67e85ecf5acdbf9e812df6ed9cf735a38d5ebe3ef2b15"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(necula): a situation when the out_shardings is not the SOT, because \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/export_test.py"},"region":{"startLine":1583}}}],"partialFingerprints":{"codehealthFindingId/v1":"5bbf281c26232bc387b6908a5f2b37afe54d9c533142f30e7213cb2442421665"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(necula): this test should work on TPU also \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/export_test.py"},"region":{"startLine":1605}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd298ef0e2c9345ccc3f857f8937358ba20898d8135d8c6035c7a70424fe01a7"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(b/448574823) - Expect an all-gather in the \u0060contracting2\u0060 test case. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/export_test.py"},"region":{"startLine":1695}}}],"partialFingerprints":{"codehealthFindingId/v1":"f08207559e08122f1e5cdee88ee9714d5e842e5be96dab6d28b4e8f25573ed09"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(b/448574823) - Expect an all-gather in the \u0060contracting2\u0060 test case. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/pjit_test.py"},"region":{"startLine":5015}}}],"partialFingerprints":{"codehealthFindingId/v1":"76457173cf534654a5dc5b3b9c8caef2f06c6e39b21e7005f7a371a9840be296"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(necula): revert this change once we deprecate the old wrap_init \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/extend_test.py"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"578c170334f58bbf4b9f8a3c4a0eee1079c66cfcd7326322e144d4f7a9efd309"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(skye): can we be more precise? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/fft_test.py"},"region":{"startLine":167}}}],"partialFingerprints":{"codehealthFindingId/v1":"9164af254de646f59e8cbfc123890c9477f6e2d6fa3fe8f6072ecaf1091d0f83"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(skye): can we be more precise? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/fft_test.py"},"region":{"startLine":413}}}],"partialFingerprints":{"codehealthFindingId/v1":"2de44d4782d9915d997e81b0d415488a2d4c241c02a56a8a13efb8f9c69aaa08"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(skye): can we be more precise? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/fft_test.py"},"region":{"startLine":458}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f7cf0f196f088a5804b40c79706bed3096421927150cead07860ab09d4e93ba"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: Remove this test once cuDNN adds broader dbias support. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/fused_attention_stablehlo_multigpu_test.py"},"region":{"startLine":622}}}],"partialFingerprints":{"codehealthFindingId/v1":"207290a6cb2692d44c3808f757ae3f8e4630b5c12fccddef4ff5d97dd57ded4f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(dougalm): randomize this \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/generated_fun_test.py"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"f630221b98343ff9ed9787038e5e8ad1406cd2919ece355f1c6dd4d0e4d0e25e"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(dougalm): different sizes and dtypes \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/generated_fun_test.py"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"20cae087fcde22084074ece0801100e2c6e00fb8ea449f9fb77a9b861d994b5e"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: generate slices and paddings to match shapes \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/generated_fun_test.py"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"09e3c0a67c714b5be99d997ef0e230fd20b5ab160c40b09dc42d9d1b49fd6101"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(dougalm): re-enable once we\u0027ve tackled the less pedantic bugs \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/generated_fun_test.py"},"region":{"startLine":221}}}],"partialFingerprints":{"codehealthFindingId/v1":"12a0ba1f535a1e869810b5fc16c8f661b845e589a6a6ee513ca1d45c284425f1"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/hijax_test.py"},"region":{"startLine":848}}}],"partialFingerprints":{"codehealthFindingId/v1":"10d2cbe0b4450812e2b4d3be723653fc2a65dae1c9ffe018279059b307ece737"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/ad_checkpoint.py"},"region":{"startLine":959}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c67991004caefef821317e0c8744cc386d4b318c3a2f867ad6c1f08f5c03041"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/ad_checkpoint.py"},"region":{"startLine":1171}}}],"partialFingerprints":{"codehealthFindingId/v1":"ddabfb45f131c993dd4c2725cb8863922ed333c01c8030e6901d71026b02be8c"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/interpreters/remat.py"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2138405cf36a90c96df6a70615a87ba7096d5084c3f5a93a8cdba0ffb246ed1"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/autodidax.py"},"region":{"startLine":2836}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8ba278e7ea1e138aafe4ec0bafd43ff4e385ffb00afbc110766225934cf7948"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: #   # TODO(mattjj,yashkatariya): this errors too late, make shmap checks work \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/hijax_test.py"},"region":{"startLine":1186}}}],"partialFingerprints":{"codehealthFindingId/v1":"66dd8393703c2266f92bbf5a676757dd7b2f247ffcae1add2e897c417c4c85f0"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(mattjj): debug xla failures \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/hijax_test.py"},"region":{"startLine":2499}}}],"partialFingerprints":{"codehealthFindingId/v1":"004c1c7be069d2911c10562edcaa0c1fec29818c34c66287837544b7c3c40a39"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(phawkins): debug this. There is a small mismatch between TF and JAX \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/image_test.py"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"fafde85dbcc9fb0a7f26d32740abd7c84506cd76c820c9db5b0a21b20337217a"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(phawkins): I suspect we\u0027re simply handling ties differently for \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/image_test.py"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c57655ef8170b2df7c6d308f53f489252862de33e3819d6e9d4a3003f8fa79f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(jakevdp): add appropriate logic to jaxlib device_put and update this test. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/jax_jit_test.py"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b2ca5dedbd1f33c5db0b9f977ae45906aa61ee14bc525a3e5d89e6fcd2910af"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(b/408148001): Fix thread safety issue. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/jax_numpy_error_test.py"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7d5e320b8fc5106b5aa6574df08b662d5b486bad8256609d6d48dab386ae2ea"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(https://github.com/jax-ml/jax/issues/27470): Not yet supported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/jax_numpy_error_test.py"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"7adb8c04ba475502a1784e42193492a7fb549dbdcee8710fd16cfb828c1b1ada"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(jlebar): Ideally we\u0027d check that hlo_proto can be deserialized to a \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/jax_to_ir_test.py"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"09520bec0a125246d95f8286d0a24cc4e6a78d7522730362b7b83eb83f3577c7"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(dsuo): Remove this once we bump tensorflow version. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/jax_to_ir_test.py"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"547a81163fe2bbca8ccbd44e5a2ef9605a8f5e67317def79389bfc74ef667d09"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(b/307211483): Investigate failure \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/jaxpr_effects_test.py"},"region":{"startLine":597}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6381ea6c176429199fe288c620272811dc707ac266223160b2a9b81221cd864"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(mattjj,sharadmv): don\u0027t require data dependence for jax.linearize! \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/jaxpr_effects_test.py"},"region":{"startLine":762}}}],"partialFingerprints":{"codehealthFindingId/v1":"bde0709a51ddf622d85b79f22527a315fe73238d15f60f972f2da27a40f97e5b"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(duvenaud): Check all types of padding \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/jet_test.py"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5283dc2ce16947a216b2abcbe0db47af4eb13a9f68d6e89986b55487929c57f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(jakevdp): This test is very sensitive to the inputs, so we use a known \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/jet_test.py"},"region":{"startLine":395}}}],"partialFingerprints":{"codehealthFindingId/v1":"1144b8ad1990c3a1cd318fd22df8f40e661f8f1021c8262625a194ce8d28a0f6"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(jakevdp): implement this case \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/key_reuse_test.py"},"region":{"startLine":303}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5e10b9f283c975e10be5cff46d3d7eccea94ee4a87a62e01054a28066a0a2be"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(jakevdp): should we allow repeated fold-ins? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/key_reuse_test.py"},"region":{"startLine":416}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec394353983456265870ac2c9dd0fbdcd0062261184eedce678b22c7ce495634"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(mattjj,vanderplas): teach key reuse checking to see through \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/key_reuse_test.py"},"region":{"startLine":606}}}],"partialFingerprints":{"codehealthFindingId/v1":"39c1fadfcec216bc2a16af781598d7af37bd209ad16df079e9ac5231a7536e81"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(proteneer): atan2 input is already a representation of a \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/lax_autodiff_test.py"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3b9b64d93dd789c86a918938edb7415ac9fcb21c120d8de2e569d303d035d3d"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: #                dtypes=grad_float_dtypes),  # TODO(mattjj): enable \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/lax_autodiff_test.py"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"d46c540ebd18e1b3e76e0e620bcb323e235ac5e70d859ecb499c7807537fb744"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(mattjj): make some-equal checks more robust, enable second-order \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/lax_autodiff_test.py"},"region":{"startLine":168}}}],"partialFingerprints":{"codehealthFindingId/v1":"f651792e597b1b7e1708ee5ce5bfb20304e9a6d5c38202834ba5fbfe3f33bb0c"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(mattjj): resolve \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/lax_autodiff_test.py"},"region":{"startLine":469}}}],"partialFingerprints":{"codehealthFindingId/v1":"1aa9b4f649e614523e66e37a68f8e50e274116c6afb0553ec0460d005e9f5128"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(jakevdp) special-case zero in a way that doesn\u0027t break other cases \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/lax_autodiff_test.py"},"region":{"startLine":655}}}],"partialFingerprints":{"codehealthFindingId/v1":"da5f8e4a34fa91d9c495898c2d7e758d967b0eb0f07df5a41e38453da166762b"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(b/31565929): enable when fixed. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/lax_autodiff_test.py"},"region":{"startLine":961}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4fa66eba5393e03a7bb80c7a36264c904a9ebcec29c67ecf8734d61706a2307"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(b/205052657): enable more tests when supported \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/lax_autodiff_test.py"},"region":{"startLine":1006}}}],"partialFingerprints":{"codehealthFindingId/v1":"ffdd293805ae6511f0621f6a5e7b2d7fb7aa4d06db0cb4b36ffd34c142387ede"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(b/205052657): enable more tests when supported \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/lax_autodiff_test.py"},"region":{"startLine":1021}}}],"partialFingerprints":{"codehealthFindingId/v1":"90fc3b66c89cfd5b359ea8f0ba962cb1167b77f9dbf70c5f32386a0bc0d9648f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(mattjj): make this a more systematic test \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/lax_autodiff_test.py"},"region":{"startLine":1329}}}],"partialFingerprints":{"codehealthFindingId/v1":"0759758cc73a389fdccdd5fc4202415792ffb679a8965215f26dac91ec19216b"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(parkers): tpu bug exhibited here \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/lax_control_flow_test.py"},"region":{"startLine":1474}}}],"partialFingerprints":{"codehealthFindingId/v1":"a758b275f529cecca883e3c7e78b71ca5e6e0694a731541f0b5b1793abfc84d9"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(mattjj): should we re-enable this check? The constants are now \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/lax_control_flow_test.py"},"region":{"startLine":2800}}}],"partialFingerprints":{"codehealthFindingId/v1":"74ae02a98d8563221a757e60f31222cf5e5c16276212cebc61af32bbc53926ad"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(mattjj): make the numpy.ndarray test pass w/ remat \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/lax_control_flow_test.py"},"region":{"startLine":2809}}}],"partialFingerprints":{"codehealthFindingId/v1":"15d1a40e4c22207a7d7a7f6b4c3eb2b9050250f6bc6ca0edf692a02004b8391e"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # _ = g()  # TODO(necula): enable this, requires fixing leaks in the \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/lax_control_flow_test.py"},"region":{"startLine":3203}}}],"partialFingerprints":{"codehealthFindingId/v1":"d773914f872dce5d1dd7fae45a4bd1df499a73d773539f601c03e063d7783957"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(mattjj): remat3 saves \u0060a\u0060 for false_fn too, since the remat code \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/lax_control_flow_test.py"},"region":{"startLine":3631}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ba10782f53aa86366dd56fc0fe3638d3fa054201d3c30a23b861e98bbc93f0b"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(mattjj,dougalm): add higher-order check \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/lax_numpy_indexing_test.py"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab68afdf182bc32007ea04b0292c7627f27b7079e953de75dc3ed1cafb9a0d50"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(jakevdp): make these _check_raises \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/lax_numpy_indexing_test.py"},"region":{"startLine":1467}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7b912bfd808d19e3db169d8974ab1e29e6af1d3921f88547edb9af8eff861a3"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(jakevdp): move this implementation to jax.dtypes \u0026 use in scatter? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/lax_numpy_indexing_test.py"},"region":{"startLine":1529}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5e1fa2ea857257fa29d22ea7ce6f7ef1556f650504eff855df530fb2c419511"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(b/142975473): on CPU, tanh for complex128 is only accurate to \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/lax_numpy_operators_test.py"},"region":{"startLine":155}}}],"partialFingerprints":{"codehealthFindingId/v1":"de1fd4c706c54aa80e6a200e5d4b715f042352e58da4b49bb8dbd823bdf8b92c"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(b/142975473): on CPU, tanh for complex128 is only accurate to \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/internal_test_util/lax_test_util.py"},"region":{"startLine":224}}}],"partialFingerprints":{"codehealthFindingId/v1":"602d187d3ea71b6ef0ad8f895954915d47c71e074f28021fd55557c79823d6d9"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(b/143135720): on GPU, tanh has only ~float32 precision. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/lax_numpy_operators_test.py"},"region":{"startLine":157}}}],"partialFingerprints":{"codehealthFindingId/v1":"2eebf9598518f95e9714a2d86aed995c38539eac5ac12f42fc32a5a157a72740"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(b/143135720): on GPU, tanh has only ~float32 precision. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/internal_test_util/lax_test_util.py"},"region":{"startLine":226}}}],"partialFingerprints":{"codehealthFindingId/v1":"1793c11d1a1fffc7ee01ccffa7f3d8aa6e69f06afb8f0ad277a9586afc2d485f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(b/142975473): on CPU, expm1 for float64 is only accurate to ~float32 \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/lax_numpy_operators_test.py"},"region":{"startLine":210}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1f6e1a9f552c09a44efc45a78a62f66e7f8b8102a594050e664e40fbd9abaad"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(b/142975473): on CPU, expm1 for float64 is only accurate to ~float32 \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/internal_test_util/lax_test_util.py"},"region":{"startLine":205}}}],"partialFingerprints":{"codehealthFindingId/v1":"432ad6ae6f7f3c218ad8a2a1b549312c00c82c75c7b56a57f6a112970a210be1"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(phawkins): np.unwrap does not correctly promote its default period \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/lax_numpy_operators_test.py"},"region":{"startLine":293}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d5bbd55c5e70640576db81494505f76a3ac3f2fc7776e2aeef9652aef7728d9"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(mattjj): __invert__ fails on bool dtypes because ~True == -2 \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/lax_numpy_operators_test.py"},"region":{"startLine":349}}}],"partialFingerprints":{"codehealthFindingId/v1":"2dd1b787d221f957d784bec19a842fbf3f9016ade006629aaf1112165b6d45ee"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(mattjj): investigate these failures \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/lax_numpy_operators_test.py"},"region":{"startLine":351}}}],"partialFingerprints":{"codehealthFindingId/v1":"f934b7c8d0ae3d594f142b06c913aeff66f6fee8528d047ec9e2558397486813"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(mattjj): clean up \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/lax_numpy_operators_test.py"},"region":{"startLine":524}}}],"partialFingerprints":{"codehealthFindingId/v1":"96148fb4a9b6fbf379ea68f398dcc64baa425bcffc8005f5491f88f954c5600e"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO numpy always promotes to shift dtype for zero-dim shapes: \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/lax_numpy_operators_test.py"},"region":{"startLine":622}}}],"partialFingerprints":{"codehealthFindingId/v1":"05aa3b953457e5576c3f8a107960b2a9743be103c2af07486793a42bbbab51de"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(phawkins): we currently set dtype=False because we aren\u0027t as \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/lax_numpy_reducers_test.py"},"region":{"startLine":944}}}],"partialFingerprints":{"codehealthFindingId/v1":"d565865eee76bc4a057d39a97467f78378482ebaa124880c0dd53b4eca376000"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(phawkins): we currently set dtype=False because we aren\u0027t as \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/lax_numpy_reducers_test.py"},"region":{"startLine":985}}}],"partialFingerprints":{"codehealthFindingId/v1":"e25a304bda5ae917dbf0081d4672aed4e5ca3e2a501a282f84aa4fb88598d059"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(jakevdp): remove this helper when minimum required NumPy is version 2.6.0. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/lax_numpy_test.py"},"region":{"startLine":175}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a13dd315c7f7d8a698d53012d00e11e859e451c394275e2640c49101f6cd646"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(phawkins): support integer dtypes too. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/lax_numpy_test.py"},"region":{"startLine":791}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d3f635f446ead4345f4a1460cb63c8108c8ebb4e0226ad4e11f8fd8a33c352d"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(phawkins): there are float32/float64 disagreements for some inputs. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/lax_numpy_test.py"},"region":{"startLine":812}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a00af34030a161487d733333600f4a3ec08514d5c00724e760a8a0174228a0f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: Fails with uint8/uint16 output dtypes (integer overflow?) \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/lax_numpy_test.py"},"region":{"startLine":2804}}}],"partialFingerprints":{"codehealthFindingId/v1":"976167dc08682df313e49420b0f8f3452c861412e862964bbbf4c00883f1eb5e"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(mattjj): test infix operator overrides \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/lax_numpy_test.py"},"region":{"startLine":4209}}}],"partialFingerprints":{"codehealthFindingId/v1":"a037d96b4d9e13f8168056567dba9e234c8fda8b8948c8e97adc629401d932cb"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(mattjj): test other ndarray-like method overrides \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/lax_numpy_test.py"},"region":{"startLine":4591}}}],"partialFingerprints":{"codehealthFindingId/v1":"231705c98a7a66dbcbe3464bd21e1becdb9a9411f0cfb3a73a7170d2f9b1bed0"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(jakevdp): switch to stable=stable when supported by numpy. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/lax_numpy_test.py"},"region":{"startLine":4644}}}],"partialFingerprints":{"codehealthFindingId/v1":"42e43dd4e739fb55cb6843073dcb4f327b71390aa3530cbb505adf690816b991"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(phawkins): float32/float64 type mismatches \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/lax_numpy_test.py"},"region":{"startLine":5506}}}],"partialFingerprints":{"codehealthFindingId/v1":"048af676857d917888992b07fdf7c167ceea20dc8ffda7d48e73ce43cd74f58b"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(jakevdp): fix and re-enable this test. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/lax_numpy_test.py"},"region":{"startLine":6765}}}],"partialFingerprints":{"codehealthFindingId/v1":"e914af5a070fad47b2f0b86e194788f16b12e7bab97475d7e21fcd9c5f5048e1"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(jakevdp): fix and re-enable this test. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/lax_scipy_test.py"},"region":{"startLine":572}}}],"partialFingerprints":{"codehealthFindingId/v1":"6294bbdd73cfb870ebed9a8ac418f0437cab42ae801fb0483cb2bb40ca7527f4"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(jakevdp): fix some of the following signatures. Some are due to wrong argument names. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/lax_numpy_test.py"},"region":{"startLine":7343}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b03975e2d9faaa65d0395f3c8dd0289fb6642d5314d02dc3ae502fe3449592f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(jakevdp): migrate histogram APIs to match newer numpy versions. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/lax_numpy_test.py"},"region":{"startLine":7414}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b2f1bac7852df51e0d2ce4d35e7be548f9b064690243976af4e6aed36c7e9bf"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(dfm): After our deprecation period for the clip arguments ends \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/lax_numpy_test.py"},"region":{"startLine":7422}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d19809df8ce60dce360fa2edfeeb439606d3150942adb9c3a934b75d1e54736"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(jakevdp): implement missing ufuncs. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/lax_numpy_test.py"},"region":{"startLine":7474}}}],"partialFingerprints":{"codehealthFindingId/v1":"bbb3b7c21a6a88b4601cef55bb7797d877ef0a0a346cae5da3b00629ada88976"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(jakevdp): remove this when possible. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/lax_numpy_ufuncs_test.py"},"region":{"startLine":307}}}],"partialFingerprints":{"codehealthFindingId/v1":"3dfb389240ad43abd2b0b73a376f04687acf9d84e7ab09f674cbd4bdb90b1fb0"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(jakevdp): figure out how to fix test cases. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/lax_numpy_ufuncs_test.py"},"region":{"startLine":603}}}],"partialFingerprints":{"codehealthFindingId/v1":"c52e12151a70b3d55dbb5b4f0e4d59ddded82e4befe3c7f9a7ffe69cf892fc49"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(phawkins): we should probably separate out the function domains used for \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/lax_scipy_special_functions_test.py"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9f7f19c4521a03c2e976ea54cadd0ed662424f9ca81fbd695d179a1771ff829"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: gammaln has slightly high error. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/lax_scipy_special_functions_test.py"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"e575e8a9af0a2a3a41420cc7b92466180b33054333e1f0fa8546ac509ceb9be1"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(phawkins): gradient of entr yields NaNs. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/lax_scipy_special_functions_test.py"},"region":{"startLine":185}}}],"partialFingerprints":{"codehealthFindingId/v1":"52c00ffde7782edfb44e205772ddaa6f9a00541933d7e5f44c4931fe1471ff68"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: float64 produces aborts on gpu, potentially related to use of jnp.piecewise \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/lax_scipy_special_functions_test.py"},"region":{"startLine":199}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba9e2d949d3ebaa4ba4025b5c1043a877bc99c54a34b092a5dacd63a8f42487d"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(pearu): enable tiny samples when a fix to scipy/scipy#22682"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/lax_scipy_special_functions_test.py"},"region":{"startLine":825}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4ac1d83dc223d2feecf8ec50818d2fba7e532c5ebc5ed089fbe1781b079a40b"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(mattjj): test autodiff \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/lax_scipy_test.py"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"860fb55fc2939e5ac0c8de728bac29eabc9cf418f394adb13515a17ca2e913b3"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO test shift_left, shift_right_arithmetic, shift_right_logical \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/lax_test.py"},"region":{"startLine":414}}}],"partialFingerprints":{"codehealthFindingId/v1":"501620366616b1b10ec15c25a1c427fe4f00f13e12b6fce7fa8fedaf72e5541c"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(phawkins): raise a ValueError in the future \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/lax_test.py"},"region":{"startLine":443}}}],"partialFingerprints":{"codehealthFindingId/v1":"926d2f8790c333d7f5918974cf2b335bce020369e933605c4f33468d06a4880d"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(b/183565702): Support integer convolutions on CPU/GPU. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/lax_test.py"},"region":{"startLine":647}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e3f9a822660459391a1d523d6fcb21dd20fbceb8867f66a626a9320e569365f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(b/183565702): Support integer convolutions on CPU/GPU. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/lax_test.py"},"region":{"startLine":757}}}],"partialFingerprints":{"codehealthFindingId/v1":"db12e0f005a775236c71c3ea9bb7b81da0f9211d80073c392468204136aa4a22"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(b/183565702): Support integer convolutions on CPU/GPU. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/lax_test.py"},"region":{"startLine":813}}}],"partialFingerprints":{"codehealthFindingId/v1":"de1f0ec6312fec5a0c18bbb8b34c4b8cffb12083c4a01ee88b1a31ccad434b2c"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(b/183565702): Support integer convolutions on CPU/GPU. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/lax_test.py"},"region":{"startLine":963}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6005cccd21041fcc93f00f5304e6689e9b389f1e6183d0374334932690f0963"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(mattjj): test conv_general_dilated against numpy \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/lax_test.py"},"region":{"startLine":1109}}}],"partialFingerprints":{"codehealthFindingId/v1":"884fc173d02e3b92e2204c08e0675e6cb9ff0ec1455452aa72d35a6a27936213"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(Intel-tf): Remove this skip once OneAPI supports TF32 presets. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/lax_test.py"},"region":{"startLine":1450}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd3b234aa1219cb95685320b8b22a46d75a8e29541d674a951b36e500a6bc554"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(samginzburg): Calibrate bfloat16 X4 accuracy bounds on SM 8.9. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/lax_test.py"},"region":{"startLine":1545}}}],"partialFingerprints":{"codehealthFindingId/v1":"6060c68366758a7726c115618bd4d3a1be978f9f9db873355b18f60e1c0f7d6a"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(b/189287598) \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/lax_test.py"},"region":{"startLine":1743}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f57fe93ec14642f0fdbed26d83751aef4019d1ec06d1d3dbd9d0515de236560"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(voz): I broke these out to their own test for 2 reasons: \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/lax_test.py"},"region":{"startLine":2658}}}],"partialFingerprints":{"codehealthFindingId/v1":"35036a588cc9c766e93d91762d7f0565bb5d7523baeceeaf1573a3533942d733"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(voz): Look into the \u0022monoid\u0022 paths and collapse them as necessary. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/lax_test.py"},"region":{"startLine":2840}}}],"partialFingerprints":{"codehealthFindingId/v1":"214e054f1af027d18998cac3b761ea58e0f5a7c7f24aed71a5df1194168b3ace"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(b/183233858): variadic reduce-window is not implemented on XLA:GPU \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/lax_test.py"},"region":{"startLine":2890}}}],"partialFingerprints":{"codehealthFindingId/v1":"8adcbf7e35caf10c208c4fc6cd4a429a98e2b8fbce845971cd6058dddc4bccc9"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(mattjj): re-enable (1001, 1001), (101, 101, 101), \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/lax_test.py"},"region":{"startLine":4575}}}],"partialFingerprints":{"codehealthFindingId/v1":"27a3f080b20b8b239963539cb724d4d55d85642a3929946ccdc1399fb6e015aa"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(frostig,mattjj): more polymorphic primitives tests \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/lax_test.py"},"region":{"startLine":5147}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c1c1d4ebc7933634b99e9d28f815b95e3cf818d93f111d73b62e3a5b87e532c"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(frostig,mattjj): more polymorphic primitives tests \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/random_test.py"},"region":{"startLine":1339}}}],"partialFingerprints":{"codehealthFindingId/v1":"e264e6266ac03a643d808789007e8d6ac4e7b094c3db3b9eca240c3ffcdfa6d6"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: remove is_arm_cpu as previously arm cpu related failures \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/lax_test.py"},"region":{"startLine":5240}}}],"partialFingerprints":{"codehealthFindingId/v1":"94a9cf4ac01dd4c8c654bd38e027714fab7306b498a87456b4231860d814cd59"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(pearu): eliminate this if-block when a fix to mpmath#787"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/lax_test.py"},"region":{"startLine":5249}}}],"partialFingerprints":{"codehealthFindingId/v1":"32045a927849cb1a210ae9d9e1f39cc60806df5f28d6294a89dd19affc22e2c2"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: Remove \u0027ninfj\u0027 and \u0027pinfj\u0027 from the list once all supported XLA \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/lax_test.py"},"region":{"startLine":5363}}}],"partialFingerprints":{"codehealthFindingId/v1":"275bee0d3884e1e27167ff278fdc25b8d9319d58b62271c576ce149636f9ca82"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(mattjj) \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/lax_vmap_test.py"},"region":{"startLine":255}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9116071cb2631e1b9f264226c0b2483f8d03974cb9ad2b49288714d5b404baa"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(mattjj) \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/pmap_test.py"},"region":{"startLine":1770}}}],"partialFingerprints":{"codehealthFindingId/v1":"0367d82edc20eaf50e5c7550df1d5bff56048bf30146167d22999cebec9c5405"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO Concatenate \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/lax_vmap_test.py"},"region":{"startLine":779}}}],"partialFingerprints":{"codehealthFindingId/v1":"23691dc7403ecce3af6980c956bd1bcc4e9424db25333ad0948ede0f0ddfdf4d"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO Reverse \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/lax_vmap_test.py"},"region":{"startLine":780}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e945dd1312cd5b9593ed854b7974ecd69fe69728d6cff4ea82ce82bceeba3e4"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO DynamicSlice \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/lax_vmap_test.py"},"region":{"startLine":781}}}],"partialFingerprints":{"codehealthFindingId/v1":"c069b3123088a101ab3e81100b8d350b7bdb62eaafe443fe58988899c09b7878"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO DynamicUpdateSlice \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/lax_vmap_test.py"},"region":{"startLine":782}}}],"partialFingerprints":{"codehealthFindingId/v1":"22cc0132a9cad2451e3434114bb41f391af8fd2157cb4dd4bcee68d3b55ee882"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO Collapse \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/lax_vmap_test.py"},"region":{"startLine":783}}}],"partialFingerprints":{"codehealthFindingId/v1":"824ed638770c35c7097a67c10e7834b4f174696b26aca290f0e39fc6c214b1c9"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO Scatter \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/lax_vmap_test.py"},"region":{"startLine":784}}}],"partialFingerprints":{"codehealthFindingId/v1":"02fc2e93bfbeea60cdd458538bfe7a2809d5264311cc6b57a7cbfdbef98563a9"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(mattjj): complex64 unstable on large sizes? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/linalg_test.py"},"region":{"startLine":187}}}],"partialFingerprints":{"codehealthFindingId/v1":"f119a61702aba780f201ef94399b802bc1b4aa9fad390fc8d3d0bbfd45486c60"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(phawkins): Test sometimes produces NaNs on TPU. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/linalg_test.py"},"region":{"startLine":233}}}],"partialFingerprints":{"codehealthFindingId/v1":"90f712b3465f5fd1bf6eaa4bbcfc26529d37a734de84c2c4ec8ccfab743a7b5e"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(phawkins): CUSOLVER\u0027s implementation does not pass this test. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/linalg_test.py"},"region":{"startLine":393}}}],"partialFingerprints":{"codehealthFindingId/v1":"da0e93923b040d5b68ae15b922a666a1c11bb4e986114f2afa421b1fbdf0b7f2"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(phawkins): these tolerances seem very loose. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/linalg_test.py"},"region":{"startLine":826}}}],"partialFingerprints":{"codehealthFindingId/v1":"a48e14a13223c3231bb6ab8beaaf4db346b17da633e4f5b4fb183e0eb944b35a"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # Original note: TODO(#2203): numerical errors"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/linalg_test.py"},"region":{"startLine":996}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ca028c3701bb6c3ced9c8a04dafe57d4a5acf824b642313edc48f879721624c"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(phawkins): 6e-2 seems like a very loose tolerance. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/linalg_test.py"},"region":{"startLine":1140}}}],"partialFingerprints":{"codehealthFindingId/v1":"50fedb8b0afb43343458a123ed4d376930a7c86b831e4b3782ea7da9cce2106b"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/linalg_test.py"},"region":{"startLine":1276}}}],"partialFingerprints":{"codehealthFindingId/v1":"fdcd62200224b96a45f59576671bf4efab64939322d2e999d5cce604137c04ed"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(phawkins): there are some test failures on GPU for k=0 \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/linalg_test.py"},"region":{"startLine":1985}}}],"partialFingerprints":{"codehealthFindingId/v1":"02ab5bfc54d0d4ad498a8ff81696a80319756be0cd8e5b021230a84893b20d24"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(zhangqiaorjc): Reduce tol to default 1e-15. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/linalg_test.py"},"region":{"startLine":2196}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba0acaea4969c9ac9cdd794ce4e95b0d86f574a36cc437860bac55ed30e6570e"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(zhangqiaorjc): Reduce tol to default 1e-5. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/linalg_test.py"},"region":{"startLine":2239}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f9eae1ef27d6f0279215540a48510f5ce4b267aa21364877831a8fbebe899b2"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(magaonka-amd): Re-enable once hipSPARSE gtsv2 numerical issues are resolved. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/linalg_test.py"},"region":{"startLine":2806}}}],"partialFingerprints":{"codehealthFindingId/v1":"03c65f07337f415bc54ede52054b9a43d63e0cd903458823ae2df8bb4057e48c"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(yashkatariya): Enable this once we can compute on host. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/memories_test.py"},"region":{"startLine":312}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ff186e18e763e8e0b898d6b2b56199f1c687f46b3c2871495728469c161bc3d"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(b/446898771) This test fails on GPU in OSS, it will work \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/memories_test.py"},"region":{"startLine":1525}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb82ab50b494a83f9c307dd73aa18d64bb43b909358f0f99df01be5389fa432d"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(jekbradbury) \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/metadata_test.py"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"039eb80357e64fe7307ae19d2e585da94e354538ee28b9a0da1d7b4b294be7ba"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(mattjj): include log_softmax in these extra tests if/when we add a \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/nn_test.py"},"region":{"startLine":842}}}],"partialFingerprints":{"codehealthFindingId/v1":"a12f76f5cb8a48934f0d7ac5ad9dfc4657ef19e967addd03a900bd8b222dc278"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(mattjj): re-enable \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/optimizers_test.py"},"region":{"startLine":216}}}],"partialFingerprints":{"codehealthFindingId/v1":"4499f9b1c335521e65c87e8960a4f3d57360eb6760d80e7a2a8cd1cffd0c021b"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(jakevdp): expand test to other public modules. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/package_structure_test.py"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"c484caf0b576bd6d471a651b49f9e116f3abf55486b57365029a08f7e3752d4e"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(b/37664749): Remove this flag once the bug is fixed. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/pgle_test.py"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"030be57efd19371ffcc5b6a5ceab8cbfb798bf3881511b83e30eef95330ca317"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(b/376647494): Remove this flag once the bug is fixed. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/pgle_test.py"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e9edc626ba8a20b9db1379c9531f37fce55fb8bd0b93ca74c82e8d05ae2c1cb"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(b/376647494): Remove this flag once the bug is fixed. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/pgle_test.py"},"region":{"startLine":231}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6f038941ca0cf9d82059b363dfe13aa28953526ecdf8d73b34eb2d589410403"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(yashkatariya): Enable this after collectives \u002B S-\u003EU cast is enabled. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/pjit_test.py"},"region":{"startLine":11018}}}],"partialFingerprints":{"codehealthFindingId/v1":"dcb6776fe1c3674ae2986bacc2258ee2cd823bf95107b96eb8c64af4c28d63c6"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(apaszke,mattjj): Disable implicit list casts and enable this \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/pjit_test.py"},"region":{"startLine":15319}}}],"partialFingerprints":{"codehealthFindingId/v1":"3666eda01f634d89723dbc42be01f28cf874cc6fc2b7372fbbdc7621e56dcfaf"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(apaszke): Disable implicit list casts and enable this \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/pjit_test.py"},"region":{"startLine":15325}}}],"partialFingerprints":{"codehealthFindingId/v1":"17e9f8e989b24c75e2a18fcb15e097a3dad56ed3334f12fe75c929e8da2da37d"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # self.assertEqual(count(), 0)  # TODO(mattjj): don\u0027t compile for constants \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/pmap_test.py"},"region":{"startLine":1274}}}],"partialFingerprints":{"codehealthFindingId/v1":"9afc96474380a4752f34eef93ba0002629239cbb1032e69b296319805f89bb6b"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(mattjj,sharadmv): fix physical layout with eager pmap, remove \u0027if\u0027 \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/pmap_test.py"},"region":{"startLine":1280}}}],"partialFingerprints":{"codehealthFindingId/v1":"af6c9e96b97306e99200834bbd2a5c986bfd617b37e72ede5ca65a949df7bb09"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(sharadmv, mattjj): investigate and fix this issue \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/pmap_test.py"},"region":{"startLine":1851}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a1fadb4080c3728f1df3a4b5a8ef4e7b957c369c5a91176dfc7db231670dc35"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(apaszke) \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/pmap_test.py"},"region":{"startLine":1957}}}],"partialFingerprints":{"codehealthFindingId/v1":"30168d15b96b032525b77cdb05ac3ab566791ec1db73f3cd05402471fb71a7b8"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: these tests fail without fixed PRNG seeds. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/polynomial_test.py"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ca99bdc7fcc865cdec8bd1da60933d85eec7fcffd75ca4ee1482a77beda3036"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(phawkins): no nonsymmetric eigendecomposition implementation on TPU. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/polynomial_test.py"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e2b99086ed35b961e9d164b78b05a99ac5c4b78a3a1138a34535b474965dd06"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(phawkins): no nonsymmetric eigendecomposition implementation on TPU. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/polynomial_test.py"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"56b4633eb6cffc50788bb84ef7af9422a5dc1a0bff88403c5065c9320ba41995"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: b/443121646 - Enable PM sampling test on JAX OSS once the Github CI \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/profiler_test.py"},"region":{"startLine":367}}}],"partialFingerprints":{"codehealthFindingId/v1":"320744a13a82584a691f23fc746057a857428f5fd99e9a37cc4ea2d6a1cddc54"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(zce): If I pin to 1 device below (jax.devices()[:1]) then this test \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/python_callback_test.py"},"region":{"startLine":1517}}}],"partialFingerprints":{"codehealthFindingId/v1":"8644595df6beb53678a7358d5355813768f3ca236c76b13152ae04f741d40d33"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(frostig): This reads enable_custom_prng as a proxy for \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/random_lax_test.py"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"148b7c40d192b2789bb5ade2eae1392abd10e059ba8f00b650ecbfcf7ef7585f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(jakevdp): key reuse checks for this OOM because of slice masking. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/random_lax_test.py"},"region":{"startLine":202}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e8b549ed4a1e0ae0172bf738b58e63ea0996ef51132aef23dcdba00b0d90240"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(mattjj): slow compilation times \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/random_lax_test.py"},"region":{"startLine":1044}}}],"partialFingerprints":{"codehealthFindingId/v1":"c740aa355b714ce4e54d87e12c00de18d441b11f9828336dd4b880def162e7de"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(shoyer): determine error bounds for moments more rigorously (e.g., \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/random_lax_test.py"},"region":{"startLine":1192}}}],"partialFingerprints":{"codehealthFindingId/v1":"a61b0470786953fd1a0cdaf472821f2fa3a371d5fb37d4d33cfddfa8063c1e5a"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(phawkins): slow compilation times \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/random_lax_test.py"},"region":{"startLine":1514}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ba7cbd72ddd3fb79bab62dc08facb30a7893f0a09e450ff822478f2aca32160"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(frostig): Currently this behaves like normal threefry, to \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/random_lax_test.py"},"region":{"startLine":2135}}}],"partialFingerprints":{"codehealthFindingId/v1":"524c49337f524645edc647c279383d1a0caeeaf40625a4035728ef9941b368d0"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(frostig): Currently this behaves like normal threefry, to \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/random_test.py"},"region":{"startLine":1361}}}],"partialFingerprints":{"codehealthFindingId/v1":"a51e5ad115ce5dbc0233e3925399e2ee25fb57cc2607326d8334c102e0f60b76"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(mattjj): enable this test if/when RngBitGenerator supports it \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/random_lax_test.py"},"region":{"startLine":2324}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e07fd6faa9a388ce250e3646d90eb9b9730911d750ad00c55ebd667b4fd701a"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(jakevdp) add coverage for other distributions. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/random_test.py"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6f6775894bb297235109e3e1bab6389ad608a48de27878d02adfc95057a59eb"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(frostig,jakevdp) add coverage for non-threefry bits \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/random_test.py"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b29bfd41afa499a470311b0543cf1c129b91c59a59cb4b3c6c99a9f831734d5"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(frostig): pull these string values somehow from the \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/random_test.py"},"region":{"startLine":200}}}],"partialFingerprints":{"codehealthFindingId/v1":"c137af1659b5b8469e67ea58312068ce56182d77a7e9e430b54ed1303007e232"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: add 64-bit if it ever supports this property. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/random_test.py"},"region":{"startLine":337}}}],"partialFingerprints":{"codehealthFindingId/v1":"f42e33b1d0012169984cdec66965c5a3e4a7876a1ee569fbc3156b22e72b6faa"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: will this property hold across endian-ness? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/random_test.py"},"region":{"startLine":338}}}],"partialFingerprints":{"codehealthFindingId/v1":"9008ab44192583b18472bfcafe28225a63707b6ed77b33c8ed519dcf4f11e52b"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(jakevdp): remove when enable_custom_prng no longer issues warnings \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/random_test.py"},"region":{"startLine":659}}}],"partialFingerprints":{"codehealthFindingId/v1":"069fa0f8c83053b7334e5a61c10ec6ed2a7a1b54690587f78e3a7050cae98bb1"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(jakevdp) remove this decorator when reuse checks move to C\u002B\u002B \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/random_test.py"},"region":{"startLine":836}}}],"partialFingerprints":{"codehealthFindingId/v1":"9dfdad4b6d56e71ff13d9e1815db7b36b351086b6107b3e15ec766d3e7df3a6a"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(jakevdp) remove this decorator when reuse checks move to C\u002B\u002B \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/random_test.py"},"region":{"startLine":853}}}],"partialFingerprints":{"codehealthFindingId/v1":"9fed6e279d7672b14fe7fb84a848c093df7f191322b6008550e454093936b249"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(frostig): check dtype too when available \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/random_test.py"},"region":{"startLine":959}}}],"partialFingerprints":{"codehealthFindingId/v1":"56be04d1498d331e7d344ab06767ea397da02087fd1ea989fe0eb0b81e677b25"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(frostig): check dtype too when available \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/random_test.py"},"region":{"startLine":966}}}],"partialFingerprints":{"codehealthFindingId/v1":"04e0b984c45d51dbaee9aeed20de89b1a38ba04c75805ecc492f53eed52aa3a9"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(yashkatariya): Enable this on TPU once XLA:TPU knows about inlineable \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/scheduling_groups_test.py"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f6a890f4148e56b098587a93828e05739d7d6c5df12877d1016e0ff9a0529ad"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: The incompleteness is due to the way we combine external constraints \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/shape_poly_test.py"},"region":{"startLine":914}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf65a55834a65ecbaf0818c5689fa231f4b6a4ef413184c719c614d5121494c2"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: The incompleteness is due to the way we combine external constraints \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/shape_poly_test.py"},"region":{"startLine":1157}}}],"partialFingerprints":{"codehealthFindingId/v1":"940ce7cf6f0e16d1c88a4cc245014c74de068274f6814a486c5af042f16e5ba6"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: The incompleteness is due to the way we combine external constraints \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/shape_poly_test.py"},"region":{"startLine":1160}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f04b6ce75cc16aeebc319163da0888cf6fa94c72887aa58e760f7cdc2140137"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: the following ought to work, but the way we wrote the equality \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/shape_poly_test.py"},"region":{"startLine":1038}}}],"partialFingerprints":{"codehealthFindingId/v1":"368242b582fef2c2c92bf284f0c164653c769c7d77996c23ee8c74e7a79d1658"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(necula): not yet supported, but also unlikely to come up. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/shape_poly_test.py"},"region":{"startLine":3328}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0807598de88e9d7fe04633425cd65afa1e7d1794333ce94c3db21dcc86a7e2e"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(mattjj): consider moving this method to be a helper in jtu \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/shard_map_test.py"},"region":{"startLine":2193}}}],"partialFingerprints":{"codehealthFindingId/v1":"db90adf4780043f512f03fda93f3ea8d164d18c0374b90fc27b361f878e09a0a"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(parkers,mattjj): get XLA to support this too \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/shard_map_test.py"},"region":{"startLine":3926}}}],"partialFingerprints":{"codehealthFindingId/v1":"91ea5ff1a399677fb48fbc515871f55ecaf540a6685e0e712388ce55c47f0839"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(yashkatariya): Enable grad test which requires adding psum_p support. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/shard_map_test.py"},"region":{"startLine":4355}}}],"partialFingerprints":{"codehealthFindingId/v1":"c091d3206a1c7b459d8cec73130894950319e2701958318c5bc7eb2be3ac1b66"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(mattjj): 0 axis sizes lead to XLA sigfpe, file bug! \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/shard_map_test.py"},"region":{"startLine":6913}}}],"partialFingerprints":{"codehealthFindingId/v1":"96e39ce65ff71c017b46fbe8294f95eb8a656c5cfb608af020767dcffeea70ea"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(justinfu): This fails on external but not internal builds. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/source_mapper_test.py"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"487893f6a1977e84f48d3a5098487f2d1f6a63183be399922aefc520d58bff32"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(justinfu): This fails on external but not internal builds. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/source_mapper_test.py"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8515473af5b04008246b316f7b0eb5f64230687d67dfa2fff37d39e9dd970fb"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(justinfu): Make the hlo:optimized test less strict. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/source_mapper_test.py"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"b95167cb7bed070df8d66c18bf317f0bf520e7b1b717c52c0f62f7040b477c00"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(tianjianlu): In some cases, this fails python_should_be_executing. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/sparse_bcoo_bcsr_test.py"},"region":{"startLine":556}}}],"partialFingerprints":{"codehealthFindingId/v1":"67a4b5c1fe6ea688d0b58adc9a1aee1196eeff97c651ca2ec74084f204d25d7a"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(jakevdp): uncomment once batching is supported again. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/sparse_bcoo_bcsr_test.py"},"region":{"startLine":601}}}],"partialFingerprints":{"codehealthFindingId/v1":"17f273ff49eaee23b9cfacc2b85f9487972f28a47877cc343a0521c09b1f76fe"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(jakevdp) fix forward-mode autodiff \u0026 enable tests here. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/sparse_bcoo_bcsr_test.py"},"region":{"startLine":761}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd34badac3808ab470b2a42a115a37a961a2b6719f2d3f4032dab3c517410a08"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(jakevdp): add tests with n_dense \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/sparse_bcoo_bcsr_test.py"},"region":{"startLine":1105}}}],"partialFingerprints":{"codehealthFindingId/v1":"70b28a46e1be7d5d1d26b07ebb1c17ff3025cbdde9a441dde03e04913e065861"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(jakevdp): add tests with n_dense \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/sparse_bcoo_bcsr_test.py"},"region":{"startLine":1124}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb13bfb4fdc54b00ac2eabf36eaf90c322494b7c6a86de96fd7f10015013415a"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(jakevdp): add broadcasted shapes (from bcoo_mul_dense) once sparse-sparse mul \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/sparse_bcoo_bcsr_test.py"},"region":{"startLine":1602}}}],"partialFingerprints":{"codehealthFindingId/v1":"9cb25933742c28055d7fc4f809a7f0f5d51c21e73c302d3befd2d3884509beaf"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(jakevdp): add tests for batch \u0026 dense dimensions. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/sparse_bcoo_bcsr_test.py"},"region":{"startLine":1615}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3c4483714350784c766942da3f8d49733cc07ede8334d975d5269969ef4f2f6"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(jakevdp): in case of length-0 or length-1 shapes errors/warnings will not be raised. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/sparse_bcoo_bcsr_test.py"},"region":{"startLine":1755}}}],"partialFingerprints":{"codehealthFindingId/v1":"27865df7168956b16c4c973c4fbc921c69313cca222e6e98b4f02110d46458ce"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(tianjianlu): Unify the testing for BCOOTest and BCSRTest. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/sparse_bcoo_bcsr_test.py"},"region":{"startLine":1811}}}],"partialFingerprints":{"codehealthFindingId/v1":"46723342ec445dea89bbf1ec285f7cba0be178a13c1058d9316c45700696cd0b"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(jakevdp): This will only be true in general when M_bcsr.indices is sorted. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/sparse_bcoo_bcsr_test.py"},"region":{"startLine":1870}}}],"partialFingerprints":{"codehealthFindingId/v1":"94b529874315350b8fe097658ca076eeff372054aa820078aa2c8b4e9ff89b86"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(jakevdp): track shared indices through while loop \u0026 use this \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/sparsify_test.py"},"region":{"startLine":515}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1bea86cba0dd5fdf1f9d9f108a1613637d11f9f918d4fcc27340ef94dea1a11"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(b/412112097): Enable this test on TPU version 7 and above once \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/unary_ops_accuracy_test.py"},"region":{"startLine":179}}}],"partialFingerprints":{"codehealthFindingId/v1":"44b130caf1a686a6b2ba4433f994d08be77ac840f2b53cd48c7e1cb60d7cc6c2"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(jakevdp): confirm that this includes a date string \u0026 commit hash? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/version_test.py"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc66826b669ade016b243e2ba1bfe2ce3f9211cf65346a3b5972b03dfc627d43"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(skyewm, yashkatariya): Fix this \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/xla_transform_test.py"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"794816921c43705cb6e5db13dd7a9422457779b66b17c1e37e9e810a1d73b1ac"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(sharadmv): why does this test time out? Mosaic padding bug? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/pallas/einshape_test.py"},"region":{"startLine":194}}}],"partialFingerprints":{"codehealthFindingId/v1":"723e812f08dc01ec3e813b2975d9baece8bbf9331f71609612657f4be37bd911"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: remove this 6 months after we remove pl.pallas_call for Mosaic GPU. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/pallas/export_back_compat_pallas_test.py"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1e62b6363d56c7fe11bef68a79ffefd9015f79d4b0ad6e39a14d5047a3b0120"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(slebedev): Update to use a current op \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/pallas/export_back_compat_pallas_test.py"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"55f3f00a7f52e6b3371478294193c30e3e987226fd1ebe41b342c2d5722cc858"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: crashes during compilation on TPU v4 \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/pallas/export_back_compat_pallas_test.py"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c390f8b84fbf40f2c847be115a9cef138e7c3fcb726bd731a1b6f79d41f072a"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: b/541298091 - Skip when NCCL_NVLS_ENABLE=\u00270\u0027 until b/541298091 is resolved. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/pallas/gpu_pallas_distributed_test.py"},"region":{"startLine":1470}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c86aa723eaefba7f7779b1e70f6e187d820dda5b02e621c6cdcb3289cad7737"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: b/541298091 - Skip when NCCL_NVLS_ENABLE=\u00270\u0027 until b/541298091 is resolved. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/pallas/gpu_pallas_distributed_test.py"},"region":{"startLine":1839}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d0153629e63d7a387503ebb752cdbb2e00915f98032ed1b8df9c0550c964b9d"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(bchetioui): support for multimem store. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/pallas/gpu_pallas_distributed_test.py"},"region":{"startLine":1484}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e3a66e1591baac98e1fba9391409c1df2751debebf77cd80e5deb88f122260a"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(nrink): Figure out how to safely run different instance of GPU \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/pallas/gpu_pallas_interpret_distributed_test.py"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"29374e2875c2d55c5dbb4835f6eee0707d9e63eb7b2bb41fc8ebb75118564e91"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(nrink): Figure out how to safely run different instance of GPU \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/pallas/gpu_pallas_interpret_test.py"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"22601d76c983430872c75bc36d9e4ad46098b5c25d3cc0027f304b41ace640eb"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(nrink): Figure out how to safely run different instance of GPU \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/pallas/gpu_pallas_interpret_test.py"},"region":{"startLine":3524}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad12a4a610d4eea5d7d27b22ffb13e90fb515dd942058bcbd583d122cabb8fbc"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(nrink): Matrix multiplication with \u0060@\u0060 is nor supported for real \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/pallas/gpu_pallas_interpret_test.py"},"region":{"startLine":767}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6fc52a3d9d901b3d03d0e9d59852afcaf4a3f695c0843943c23a3ab2cda37b3"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(nrink): Matrix multiplication with \u0060@\u0060 is nor supported for real \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/pallas/gpu_pallas_interpret_test.py"},"region":{"startLine":838}}}],"partialFingerprints":{"codehealthFindingId/v1":"53d5fd1679ab83ec6ff610aea4ae4ac7f69ac0383e16885d923c931dce62e884"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(nrink): This epilogue is needed to satisfy the requirement that all \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/pallas/gpu_pallas_interpret_test.py"},"region":{"startLine":1350}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1c0e0af63cc0e51fd521c0771fc1ec7e2a5082930fded6059ddee87e36ddf62"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(nrink): Add a variant of this test case that does not correctly use \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/pallas/gpu_pallas_interpret_test.py"},"region":{"startLine":1371}}}],"partialFingerprints":{"codehealthFindingId/v1":"67e8915229b287800421e71c56fe27c37aeb0b11810f504e8c15867d7e597b21"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(nrink): Matrix multiplication with \u0060@\u0060 is not supported for real \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/pallas/gpu_pallas_interpret_test.py"},"region":{"startLine":2076}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c8dd5e0fe8a98f4176387885fe3b95711cc94a3985ecddb9aeef00f8a55f23d"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(nrink): Matrix multiplication with \u0060@\u0060 is not supported for real \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/pallas/gpu_pallas_interpret_test.py"},"region":{"startLine":2135}}}],"partialFingerprints":{"codehealthFindingId/v1":"6412b9036d84f08c055e0b2eb4030845a105e271f9c1484b3d9c44c592c85828"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(nrink): Investigate why this does not work with a single SMEM \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/pallas/gpu_pallas_interpret_test.py"},"region":{"startLine":2232}}}],"partialFingerprints":{"codehealthFindingId/v1":"5286e78e501f42ed81dcdcbc9d746586ae30453eddfbe5559b3c4a18daeb45ff"}},{"ruleId":"D17","level":"warning","message":{"text":"HackComment: # hack to reuse the same fn for np cat \u2014 a workaround marked in source: record what it is compensating for and what would allow its removal (the upstream fix, the API it is waiting on, the invariant it restores), so the next reader can judge whether it is still needed rather than rediscovering why it is there."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/pallas/indexing_test.py"},"region":{"startLine":420}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f05afed09800398df9bdc8e0ead2e21c142eefb1a9204d2579a26f43c0e8429"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(sharadmv,apaszke): enable rank 0 and rank 1 Refs \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/pallas/indexing_test.py"},"region":{"startLine":456}}}],"partialFingerprints":{"codehealthFindingId/v1":"65f13a335a7ec690c3c578af5c2a2d77ab02084219ff23370290646882f9c198"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(sharadmv,apaszke): enable vmapping over batch axes in 2 minormost \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/pallas/indexing_test.py"},"region":{"startLine":475}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ee41bee2670ea6f7ce649b2c7cd98d7080d2ca8250ac5b4a2dc0a15e7aef07b"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(ayx): Fix all test cases here \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/pallas/indexing_test.py"},"region":{"startLine":769}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef8c47c77a00e5ce9742f9dde2726dd1a41666db65911735cf7e3be8047fc492"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(pobudzey): Undo when we upgrade to cuda 12.9.1. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/pallas/mgpu_attention_test.py"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e314a179e84a791a5e27100852bbd4b3a8293e799e0558b186ee925823b4d5c"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(pobudzey): Undo when we upgrade to cuda 12.9.1. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/pallas/ops/gpu/attention_mgpu.py"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5c5f24ed96494efa7dc1ef93ced8e16741a71f55f8b0a781df96a6dc498e72d"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(pobudzey): Undo when we upgrade to cuda 12.9.1. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/pallas/ops/gpu/attention_mgpu.py"},"region":{"startLine":865}}}],"partialFingerprints":{"codehealthFindingId/v1":"d04b99ec7c49dc5ec63270b155bbe744ab21bf7b546df2dfbdf70c8fae44def0"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(pobudzey): Replace with \u0060jtu.check_grads\u0060 when it\u0027s fixed. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/pallas/mgpu_attention_test.py"},"region":{"startLine":166}}}],"partialFingerprints":{"codehealthFindingId/v1":"197cc6d970e4388b054f0e4a2221646dbaafe0ae3488a3ec41aa41071e57e6cc"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(bchetioui): add int4. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/pallas/mgpu_matmul_test.py"},"region":{"startLine":250}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9077cf89ab67b704fe62b7924d67282a6d83ec98f84f02c4d6e6a5b8dcf1b21"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(justinfu): Test empty groups \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/pallas/mgpu_ragged_dot_test.py"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"76394fbe40bed921b59d88bf4595de078cc0da621f38ea0cdfcf1ecf0db887c9"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(slebedev): Remove this once \u0060\u0060FragmentedArray\u0060\u0060 supports \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/pallas/mosaic_gpu_test.py"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"bdd1936c12d5de11ea2e311ab6fb77f7b17104ff81bc29605e9ed7dfb3baec97"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(slebedev): Support integral types. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/pallas/mosaic_gpu_test.py"},"region":{"startLine":537}}}],"partialFingerprints":{"codehealthFindingId/v1":"92b04914a4ad20c241a70e1deae3f2f842aa88629791dd9c387d058b8fc0d6fc"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(b/540761884): If we skip the layout, we end up inferring WGStrided \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/pallas/mosaic_gpu_test.py"},"region":{"startLine":2432}}}],"partialFingerprints":{"codehealthFindingId/v1":"395e17860a034bb2b29652e4d77f3a24dcf3cd85b15cc1a60579b9004f530005"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(b/462499936): Re-enable when test passes on MIG partition. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/pallas/mosaic_gpu_test.py"},"region":{"startLine":2618}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1146e8522ad92fff0b8fccd5dda6d15d0b25423a2312dfca5d0f77a594d591d"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(allanrenucci): \u0060UntilingTransform.commute_ndindexer\u0060 does not do \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/pallas/mosaic_gpu_test.py"},"region":{"startLine":2901}}}],"partialFingerprints":{"codehealthFindingId/v1":"1837956de260c5e41bfa2d2acefd7cdb474b4d688de119791d34025361a98439"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(apaszke): Add support for f8 (MLIR/LLVM barfs at the moment). \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/pallas/mosaic_gpu_test.py"},"region":{"startLine":4348}}}],"partialFingerprints":{"codehealthFindingId/v1":"463bd41e9787b5cfc217ad9d69f5e11fb9158f47d2383917da2826c617e4c6ca"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(allanrenucci): Manually specify transforms when supported for WG \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/pallas/mosaic_gpu_test.py"},"region":{"startLine":4670}}}],"partialFingerprints":{"codehealthFindingId/v1":"62f230bba66a24e12c32779f3da7c93e8e35699d4bfe5852ed731196d7245ebd"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(slebedev): Support unsigned int types. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/pallas/mosaic_gpu_test.py"},"region":{"startLine":5090}}}],"partialFingerprints":{"codehealthFindingId/v1":"75bbdd12aa572bbfd680cd60fa4a0104367e5efe8539db5f07c8002f2ce24b96"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(apaszke): Add support for single-buffering in pallas_call. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/pallas/mosaic_gpu_test.py"},"region":{"startLine":7348}}}],"partialFingerprints":{"codehealthFindingId/v1":"56296a372fda73f3901af21eba1ab5a144d20886f8df27fb837c84418f778a58"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(bchetioui): remove this check once minimum jaxlib version is \u003E= 0.12.1. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/pallas/mosaic_gpu_test.py"},"region":{"startLine":7958}}}],"partialFingerprints":{"codehealthFindingId/v1":"0570262f921e60b8fbbcd5f02c02cfad2e813356617a17ba9d178a95d89e203f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(apaszke): Use 2WGs once we add support for outputs. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/pallas/mosaic_gpu_test.py"},"region":{"startLine":9745}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e32ef79d78d61fa97646aaa727897c6e4e8e09f708178b34feac7d5c5a47d5a"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(apaszke): Use 2WGs once we add support for outputs. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/pallas/mosaic_gpu_test.py"},"region":{"startLine":9863}}}],"partialFingerprints":{"codehealthFindingId/v1":"18ad32fc966803659250cd443f8d97f7473d2454327e1267fc573d2102133cb5"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(apaszke,justinfu): Fix the bug (this test freezes) and remove this restriction. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/pallas/mosaic_gpu_test.py"},"region":{"startLine":10042}}}],"partialFingerprints":{"codehealthFindingId/v1":"703c932086d525a502e0d2637d43e73349e3076c89eb049cee0a5b1d3c11e266"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(slebedev): Remove \u0060\u0060grid_tile_n\u0060\u0060 to simplify the test. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/pallas/mosaic_gpu_test.py"},"region":{"startLine":10445}}}],"partialFingerprints":{"codehealthFindingId/v1":"075bcdf8f6b34dbe3567bc596bff3481e706bbb91e1203cbc1bffc5d41fe1da3"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(apaszke): Clusters and multicast \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/pallas/mosaic_gpu_test.py"},"region":{"startLine":11177}}}],"partialFingerprints":{"codehealthFindingId/v1":"decba1381051d8160d94767943952a633d806911112fe53c4cd8607ea21f5d15"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(apaszke): Add 8-bit floats. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/pallas/ops_test.py"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"53f573e286bb36fe08e87b6ce6fc2c3bfb8c80acc46fb34cde64d94b657fad6c"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(sharadmv,apaszke): enable bf16 \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/pallas/ops_test.py"},"region":{"startLine":171}}}],"partialFingerprints":{"codehealthFindingId/v1":"9851290ac86ed6d39d29b69cb1bc80a18357815194ed4003fb8628301879861f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(sharadmv,apaszke): enable passing bool arrays into Pallas kernels \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/pallas/ops_test.py"},"region":{"startLine":180}}}],"partialFingerprints":{"codehealthFindingId/v1":"93d9f26ddae148404ad9cd55c6ce41fa07f3a734c017e1c0eb2f01ac8f2b11bd"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(sharadmv,apaszke): enable zero rank \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/pallas/ops_test.py"},"region":{"startLine":199}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1a6ca2a991c96043deb69f6f34474d16dde909ad26b3ea5bf0636d4e8b98b78"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(sharadmv,apaszke): enable one rank \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/pallas/ops_test.py"},"region":{"startLine":200}}}],"partialFingerprints":{"codehealthFindingId/v1":"ccef083b7f10ac0421d8ff410a9f50287d7d8cc72d8677556eec86b1a8a6d18b"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(sharadmv,apaszke): enable zero dim sizes \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/pallas/ops_test.py"},"region":{"startLine":201}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e6df6ba469ceaa11a6beb4e6c086d109c9fc57c126a3f2cac9093f7599ced6b"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(sharadmv,apaszke): enable one dim sizes \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/pallas/ops_test.py"},"region":{"startLine":202}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e7506429d10890dca124df20919c6c2a860100e20c86425ec608f7846c5aa88"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(sharadmv): test rank \u003C 2, size \u003C 2 \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/pallas/ops_test.py"},"region":{"startLine":589}}}],"partialFingerprints":{"codehealthFindingId/v1":"728ab11c5a05cb1fe8624b39ed3d524e0c551a24b9f65af067a9a2f2fa1cef52"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(b/538128436): Remove this logistic branch once mosaic TPU has a \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/pallas/ops_test.py"},"region":{"startLine":669}}}],"partialFingerprints":{"codehealthFindingId/v1":"0263c4da8a488ea03d0a36caa2296db12acfacbf84fa6f5313d774682bf75628"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: b/343490729 - XLA convert(f32[16, 128]) fails on v5p. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/pallas/ops_test.py"},"region":{"startLine":737}}}],"partialFingerprints":{"codehealthFindingId/v1":"fdadbf1d57b89b95c55a74c0e5be0a4e4767552c7386d9eab0d5f6ff2103e1c9"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: b/459440496 - Support more shapes for int2. The number of rows is \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/pallas/ops_test.py"},"region":{"startLine":738}}}],"partialFingerprints":{"codehealthFindingId/v1":"901d071a8f60012b6a4d9b36575fa6b3dbee8acbb84c0b8f2e211a393f6b0d33"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(bchetioui): rework the test shapes to make this work. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/pallas/ops_test.py"},"region":{"startLine":796}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef50f3bcbe6749021e7573eb3f359aba94b61458bc733bc1188fac02ff25e935"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(b/343490729): XLA doesn\u0027t work well with int2. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/pallas/ops_test.py"},"region":{"startLine":811}}}],"partialFingerprints":{"codehealthFindingId/v1":"6721e310238ac4536faeeffecf6b9dabeb15afc0bc4b263423472a72d6159d11"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(sharadmv,apaszke): add support for the following casts \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/pallas/ops_test.py"},"region":{"startLine":821}}}],"partialFingerprints":{"codehealthFindingId/v1":"9232225955a6e0a0b4966bc634c1d1d2cc0e5f9fd6e627ace1681ac627134560"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: not implemented \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/pallas/ops_test.py"},"region":{"startLine":941}}}],"partialFingerprints":{"codehealthFindingId/v1":"80012cd4ead5d532591d2bd6ea1cb5acf8f2d19ce6a8584da3b0efcc3706822a"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(twsung): Add more types once lowering is implemented. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/pallas/ops_test.py"},"region":{"startLine":1022}}}],"partialFingerprints":{"codehealthFindingId/v1":"f592ac90206b8f6257dddeaefbf613b463887d6c6566f958b90c834df8a06975"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(b/370578663): implement these lowerings on TPU \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/pallas/ops_test.py"},"region":{"startLine":1263}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d9e1426896af6d2667355113fa5b32ed5d2c71bbaeb136c93e777ad9df94ae4"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(b/370578663): implement these lowerings on TPU \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/pallas/ops_test.py"},"region":{"startLine":1329}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b5aed6ec0dec3b13d5c6f05969db056bfe3fb7769d7f92a239e9e08ae84d87d"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: b/438321086 - investigate and fix jnp.dot with int4. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/pallas/ops_test.py"},"region":{"startLine":2399}}}],"partialFingerprints":{"codehealthFindingId/v1":"9efa05e94dea30b5d67687a22a2c6c8b7f67d1357956799b92ef3c64cc1fcc20"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: skipped due to https://github.com/jax-ml/jax/issues/24023"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/pallas/ops_test.py"},"region":{"startLine":2597}}}],"partialFingerprints":{"codehealthFindingId/v1":"67d1bd6bc9ef30f3a0da6adf9d0f47f2122ad6c3eeb457928e4df54bd783ae42"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(mvoz): platform_index_p on GPU \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/pallas/ops_test.py"},"region":{"startLine":2949}}}],"partialFingerprints":{"codehealthFindingId/v1":"528af10cc8026082baf0b85c270a1d4af7be842192be1494b9e1851c3c4fc69d"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(mvoz): Hypothesis? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/pallas/ops_test.py"},"region":{"startLine":2963}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a102620a25cf3f0de3e3d143b3903200c120b292b98731448daec4b49d785eb"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(justinfu): This is off by a factor of 2 because run_state \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/pallas/pallas_cost_estimate_test.py"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab5c5c075a500fb6fc7dc2572c0ab37556e3f31a476d5029c417e7637ef0e91e"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(necula): we normalize out_shape to a tuple, we shouldn\u0027t. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/pallas/pallas_test.py"},"region":{"startLine":203}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3e6ce2ed07727a3ce47d8b225f57a82736a2be7e31056160e1cefa136c1189c"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: RET_CHECK failure \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/pallas/pallas_test.py"},"region":{"startLine":385}}}],"partialFingerprints":{"codehealthFindingId/v1":"df4414d8afd68e548b781eddc8a7d6a6e0442dccfba9f72c16c4990e5ad59842"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(cjfj): Investigate why this fails on GPU with \u0060k == 16\u0060. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/pallas/pallas_test.py"},"region":{"startLine":778}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e6049843adcdb7c25d9fe70c22eb4beff5e2d195225a9e2708a2a50ac78d647"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(hmckenzie): Investigate further why this occurs. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/pallas/pallas_test.py"},"region":{"startLine":2210}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c66bec540535a4405e662395604522950eeab51d8ad8575ebae1eb4c64cd8ea"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: most tests fail on TPU in non-interpret mode \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/pallas/pallas_test.py"},"region":{"startLine":2344}}}],"partialFingerprints":{"codehealthFindingId/v1":"92f8aae6140cfb8aebd86afc15e31faea0027957bda9c93d7b0c8ff90e1648d2"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: most tests fail on TPU in non-interpret mode \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/pallas/pallas_vmap_test.py"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"09aa5c154d1709d4339e10ff29d0cbc0a3ab8fc3444cd92587e5635dd1dc4bb1"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: improve tolerance setting \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/pallas/pallas_test.py"},"region":{"startLine":2346}}}],"partialFingerprints":{"codehealthFindingId/v1":"20d25ebce1345176dbd6497e7c76c8f1c3e83ea727991cfb94e6a40cacf10bae"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(justinfu): This test has low precision on GPU. Improve precision. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/pallas/pallas_test.py"},"region":{"startLine":2580}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f4343300c3b15ce4dc6a6a528f18845b3bc9bda731290f383b576c518d9e371"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(justinfu): Move to non-interpret checkify class. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/pallas/pallas_test.py"},"region":{"startLine":2598}}}],"partialFingerprints":{"codehealthFindingId/v1":"5cede59e47d4acda942ed2bcf18597ea6707a078d80abdcd9cc1a9cd645c3340"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(justinfu): Move to non-interpret checkify class. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/pallas/pallas_test.py"},"region":{"startLine":2614}}}],"partialFingerprints":{"codehealthFindingId/v1":"53c51d91c98d635440081824625b2493e0d77bbe9a4610d3e353f850fa39be4f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(): Enable dynamic grid size via axis_size primitive. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/pallas/pallas_test.py"},"region":{"startLine":2691}}}],"partialFingerprints":{"codehealthFindingId/v1":"dccc95580d62c663728d602d0f262ee443df8c3236049cdc9d9e9079eb91849b"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(sharadmv, apaszke): enable this on a wider variety of shapes \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/pallas/tpu_all_gather_test.py"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d7aae20f6430042a372c8da4a2a0911702a32e46c31ddea66f96cbd02ced769"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(sharadmv,apaszke): enable these shapes \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/pallas/tpu_all_gather_test.py"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"5db720aa2d7af030e76356413e9ad772e01765094a8b19f83212e3b5c99a5f24"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # jnp.float16,  # TODO(sharadmv,apaszke): enable float16 all gather \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/pallas/tpu_all_gather_test.py"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"3caaa22d2c717a953ef2463db22fb253b91e9e3e0c209c23d8dbe8895d1eef49"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # jnp.int16,  # TODO(sharadmv,apaszke): enable int16 all gather \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/pallas/tpu_all_gather_test.py"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"18e34b4f8e7beb8febb230695cd62a1126e8eb2b2fb3ec0271f514e9ed48caa0"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # jnp.int8,  # TODO(sharadmv,apaszke): enable int8 all gather \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/pallas/tpu_all_gather_test.py"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"72b316a2400968126b60a1cfcdcc9ca19166475c3968a5c47651519c89f8caf3"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(sharadmv,apaszke): expand support to more versions \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/pallas/tpu_all_gather_test.py"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"86f81c416770d2648712861ebe8ba2c2196732ea3c6556ccba58288c72d73e50"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(sharadmv): This is a hack. We should be able to pass in the scalar \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/pallas/tpu_fusible_matmul_test.py"},"region":{"startLine":168}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e2379e4ead14b336d4bdc51fbfc96195dc72c8c84a1c088be44929e6b5eb9da"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(sharadmv): This is a hack. We should be able to pass in the scalar \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/pallas/tpu_fusible_matmul_with_stateful_fusions_test.py"},"region":{"startLine":189}}}],"partialFingerprints":{"codehealthFindingId/v1":"8adf837a2057a75f0aa2557569d0653572ffbbbf5d6cae63d4c7d367395b8524"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(sharadmv): fix this test \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/pallas/tpu_fusible_matmul_test.py"},"region":{"startLine":653}}}],"partialFingerprints":{"codehealthFindingId/v1":"99d057ef96d5c43787bb68462d849ec2686aceb628a640d65d48fcdc64edf23c"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(tgale): Fix errors with strict dtype promotion. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/pallas/tpu_gmm_test.py"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"05bb2d228377617791a5bf4c463a96c9a94387261fd1522c38d3576de42a73de"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(apaszke): Add int4. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/pallas/tpu_ops_test.py"},"region":{"startLine":707}}}],"partialFingerprints":{"codehealthFindingId/v1":"92927b971774bd6917472bfe98a02226a63bc4f218dc23ace11a86b37096d816"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(b/581748519): Remove once the minimum jaxlib and libtpu versions \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/pallas/tpu_ops_test.py"},"region":{"startLine":1654}}}],"partialFingerprints":{"codehealthFindingId/v1":"27367e06c38c7e6ca2b3397d151ac1da2e943c79df169b9671e73d56cc8f09c4"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(b/368123537): add more tests \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/pallas/tpu_pallas_async_test.py"},"region":{"startLine":201}}}],"partialFingerprints":{"codehealthFindingId/v1":"baafd857a973a04d5ae6e2bec0b0494e7441a2dbed3325b0913615e33058dba1"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(jburnim): Figure out how to safely run different instance of TPU \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/pallas/tpu_pallas_interpret_distributed_test.py"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"51901938e87bf6d222f11a5bae34db7f67d8d4eb7730336dd8e60b3ef4b942cc"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(jburnim): Figure out how to safely run different instance of TPU \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/pallas/tpu_pallas_interpret_test.py"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"4764ee778c6409206d18fbd8e1437809905e8f79a225bf8362da774f5fb0fafe"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(jburnim): Figure out how to safely run different instance of TPU \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/pallas/tpu_pallas_interpret_thread_map_test.py"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"d55d4a0dc19a6f16a9c06dcce692fa676553371c0571d81dce61e6d07ec9a90f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(jburnim): Check for \u0027o_ref[0, 0] = x_ref[100, 0]\u0027 and \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/pallas/tpu_pallas_interpret_distributed_test.py"},"region":{"startLine":1147}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f96db54e58c4be203b857a1696dddcb9bfb09cef02c5ec91f11e73df4ec6864"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(jburnim): Check for \u0027vmem_ref[0, 0] = vmem_ref[100, 0]\u0027 and \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/pallas/tpu_pallas_interpret_distributed_test.py"},"region":{"startLine":1199}}}],"partialFingerprints":{"codehealthFindingId/v1":"501ac5db9117386d5d3b7d6d670391d7679ce60585869289ba0b0ccf9e207de1"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(jburnim): Check for \u0027vmem_ref[0, 0] = vmem_ref[100, 0]\u0027 and \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/pallas/tpu_pallas_interpret_test.py"},"region":{"startLine":1017}}}],"partialFingerprints":{"codehealthFindingId/v1":"1dc230583d624e3720c081e76d896e72aee05c30b35b562face7cb1da9fa34bd"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(nrink): This test is a bit different in style from the others in this \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/pallas/tpu_pallas_interpret_test.py"},"region":{"startLine":1714}}}],"partialFingerprints":{"codehealthFindingId/v1":"81144bd4929076fe60a6ccb85e4808a5509ec25ef4abc3990828de777f0799a8"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(rdyro): hlo_interpreter (interpret=True) lowers run_scoped_p \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/pallas/tpu_pallas_interpret_test.py"},"region":{"startLine":1897}}}],"partialFingerprints":{"codehealthFindingId/v1":"f94081e926fcecb4dfece13500279e1e0ad7cd4f10773b7a0cdb2d27a7f25ad2"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(slebedev): Inline once \u0060\u0060pl.core_map\u0060\u0060 is gone. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/pallas/tpu_pallas_memory_space_test.py"},"region":{"startLine":300}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b6474d69091d43bf1e8ea3bba228ab19c6e439f883927a60fb96b5f5a88809e"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(slebedev): Make sure mpmd_map also fails here. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/pallas/tpu_pallas_memory_space_test.py"},"region":{"startLine":344}}}],"partialFingerprints":{"codehealthFindingId/v1":"17658359533e6939e58d572e872cf769131ef1454c25fb0e98a77bddc87942ff"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(rdyro): A temporary workaround to avoid flakiness. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/pallas/tpu_pallas_mpmd_test.py"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b39831b1862b8e1248578273beaf9cddae3f426b32e21458e0558d93478740b"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(rdyro): A temporary workaround to avoid flakiness. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/pallas/tpu_pallas_mpmd_test.py"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"19d784df33000388943c1f1dcbed94f06eb4e54f90364e7ddd022d34d6587c67"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(rdyro): A temporary workaround to avoid flakiness. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/pallas/tpu_pallas_mpmd_test.py"},"region":{"startLine":316}}}],"partialFingerprints":{"codehealthFindingId/v1":"00e6b9c83d32764d5728b5c5a5cf1053957893a070459f2fadc894cd3eed64dc"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(rdyro): A temporary workaround to avoid flakiness. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/pallas/tpu_pallas_mpmd_test.py"},"region":{"startLine":1941}}}],"partialFingerprints":{"codehealthFindingId/v1":"99bc2b5692a55b2b89b4e21943864a5eed27e348484d6fcc36f784410059a21a"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(rdyro): A temporary workaround to avoid flakiness. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/pallas/tpu_pallas_mpmd_test.py"},"region":{"startLine":2104}}}],"partialFingerprints":{"codehealthFindingId/v1":"d48d6889c17f097aae479e36129d6ececf2da86324d89245e4f2a147290932e4"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(rdyro): Add support for this, vmap of pallas_call with emit_pipeline. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/pallas/tpu_pallas_pipeline_test.py"},"region":{"startLine":3350}}}],"partialFingerprints":{"codehealthFindingId/v1":"91b2e70f8cd4a8dfe736263b26de0615f812fdbee1aeed78b254b485fd8a6145"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(rdyro): Remove once the primitive is the default. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/pallas/tpu_pallas_pipeline_test.py"},"region":{"startLine":3782}}}],"partialFingerprints":{"codehealthFindingId/v1":"a17c13c0ffde53f6ef908f0c5d419cc051261d9d6e3b476c983294b486f058bd"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(justinfu): Make this error more specific to pallas PRNG usage. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/pallas/tpu_pallas_random_test.py"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"81b85eaf5f6645d9891b2d0b07ff636a5182182551de708f59a7281980528da6"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(apaszke): Add tests for scalar_prefetch too \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/pallas/tpu_pallas_test.py"},"region":{"startLine":715}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2a6d5990edc910845e453be292ccd6b261537c133124bd7aa57d317749b4163"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(b/345534352): Add interpret support for semaphore signal/wait. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/pallas/tpu_pallas_test.py"},"region":{"startLine":1188}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e5379471c396f768643761652239c16c87901e4d6c3b076e15d959101c5e004"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(b/345534352): Add interpret support for semaphore signal/wait. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/pallas/tpu_pallas_test.py"},"region":{"startLine":1212}}}],"partialFingerprints":{"codehealthFindingId/v1":"28b3ec073487c1a9e26d6d642b63205d3c93b04b58d70daedb6f88563c9737b1"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(b/413602952) \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/pallas/tpu_pallas_test.py"},"region":{"startLine":3628}}}],"partialFingerprints":{"codehealthFindingId/v1":"3da6f84f809e198bc271a280f615d316b8193a384cb2d194b361eead54b47453"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(b/413602952) \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/pallas/tpu_pallas_test.py"},"region":{"startLine":3645}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d7630a6c2d3ff0f10c24b4cc95250533b55681fd01b3d92c14a0c5f9785acc5"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(b/348033431): Add an official lowering API to get the MLIR. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/pallas/tpu_pallas_test.py"},"region":{"startLine":4415}}}],"partialFingerprints":{"codehealthFindingId/v1":"64058984d2c67d320390eed02d3228ca0f4d44937dbc28212b3e5c9b62e3626c"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(b/348033431): Add an official lowering API to get the MLIR. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/pallas/tpu_pallas_test.py"},"region":{"startLine":4443}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0f2ddbae7a5a44066c27fbc168db6356cabca9426a20b525298c0d1b2cdc66d"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(bchetioui): clean up by supporting transforms on accumulators. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/pallas/tpu_pallas_test.py"},"region":{"startLine":7047}}}],"partialFingerprints":{"codehealthFindingId/v1":"663c41e9510496e5a8a683cc094d31739d4d32eb47606c99ab6b5de157fd76e9"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(apaszke): Add a way to push the RHS without a matmul. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/pallas/tpu_pallas_test.py"},"region":{"startLine":7138}}}],"partialFingerprints":{"codehealthFindingId/v1":"ddba5425beff18fcfab61a5b36552b496e54c79867d68c6e7d8ad8585e704bcf"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(apaszke): Accumulate in f32 \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/pallas/tpu_pallas_test.py"},"region":{"startLine":7143}}}],"partialFingerprints":{"codehealthFindingId/v1":"54b3b0733a12c3b12fab20dc1286ab3398a81144c0ca68cb39b85b64f5182339"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(bchetioui): clean up to be 3D once reshape transform is supported. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/pallas/tpu_pallas_test.py"},"region":{"startLine":7241}}}],"partialFingerprints":{"codehealthFindingId/v1":"e53040f6f3afa8bed41309d24c8a72cbfbb971c178b6da06e576be14a9c57b90"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: support int4 and int8 \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/pallas/tpu_ragged_paged_attention_test.py"},"region":{"startLine":200}}}],"partialFingerprints":{"codehealthFindingId/v1":"db705663b5efa65bd2350ad3de02a166165ad6cb782fa5f398bb4b38ffad2a63"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(jevinjiang): Support more num_heads! \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/pallas/tpu_ragged_paged_attention_test.py"},"region":{"startLine":343}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6222b3e48fe4ab6d2f199de5474231f8430d7dd5040fb23b15cbd2b1709b264"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(b/434082000): Investigate why (12, 2) does not work after libtpu-2025-07-21. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/pallas/tpu_ragged_paged_attention_test.py"},"region":{"startLine":344}}}],"partialFingerprints":{"codehealthFindingId/v1":"db468685f752f711c9ea5888efb84424d76bd89879163dd7c0b53e070ed1dcbb"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(jevinjiang): Support non-128 head_dim! \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/pallas/tpu_ragged_paged_attention_test.py"},"region":{"startLine":362}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e4e21c75636b8069e15001d14aaf96c06e92c07a5fbb335771ab73c44cf6b67"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(jevinjiang): Support non-128 head_dim! \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/pallas/tpu_ragged_paged_attention_test.py"},"region":{"startLine":397}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4c63327b36bdb421bf034018ee81667f9c8ea8922e25fbe74530fd033999f31"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(b/479427406): Remove this once the bug is fixed. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/pallas/tpu_sparsecore_pallas_bounds_check_test.py"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"67848bd307138006cbbd8693f865fed947ce7d9f0db2a5912d65725815321484"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(b/479427406): Remove this once the bug is fixed. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/pallas/tpu_sparsecore_pallas_debug_check_test.py"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0e8734b075df864488119c1757aa7e9f1b511d7984f6dab3edaf29cf2482654"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(bchetioui): Replace this with linear stream add. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/pallas/tpu_sparsecore_pallas_distributed_test.py"},"region":{"startLine":337}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f0bb770911ed942b8c59e9deed1f4e647d026436d84b0ef4da60b9d6b7f258b"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: b/469486032 - Figure out why the test gets stuck on v5p, v6e, and v7. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/pallas/tpu_sparsecore_pallas_scalar_debug_check_test.py"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"e894029514d2a55c0196b8e6349ad35a41d936937e9b2b95c6605979231ca778"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(slebedev): Investigate this and remove the skip. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/pallas/tpu_sparsecore_pallas_test.py"},"region":{"startLine":283}}}],"partialFingerprints":{"codehealthFindingId/v1":"2cbe9cd2f0efc23a9e78bbb5a620d84d63cfd1e74061f3d56d9b7cdfa6bb7f4a"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(slebedev): This should not be necessary. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/pallas/tpu_sparsecore_pallas_test.py"},"region":{"startLine":366}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0ac843fe045cdb55ad3e79b72a59cc00ab830b5f6f30698c917bfb5a22e331b"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: b/565826801 - simplify. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/pallas/tpu_sparsecore_pallas_test.py"},"region":{"startLine":1460}}}],"partialFingerprints":{"codehealthFindingId/v1":"f167c2d8791f8004725c8c6f9ad3d82086d106790fd4f7cf2f11cca7196cec14"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: b/434208146 - Test with reduce!=1 when we support v6e packed masks \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/pallas/tpu_sparsecore_pallas_test.py"},"region":{"startLine":1610}}}],"partialFingerprints":{"codehealthFindingId/v1":"888cc5c84af4c780e41af5d1e95d4293e773236b49726bdba42b7929f835d463"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: b/434208146 - Test with reduce!=1 when we support v6e packed masks \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/pallas/tpu_sparsecore_pallas_test.py"},"region":{"startLine":1771}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9cd5474292d4a13b808d045fca734884f9df55cf0c301a6c9f9c2b7ccefb7ff"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(selebedev): Allow mixing array and ref indexers in \u0060\u0060.at\u0060\u0060. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/pallas/tpu_sparsecore_pallas_test.py"},"region":{"startLine":2504}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3cab1c7972ca2767b18b2b883ca1ee4be73d1f6d7030c55af433678a275f45c"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(anlunx): Allow compiling with O{0,1}. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/pallas/tpu_sparsecore_pallas_test.py"},"region":{"startLine":3165}}}],"partialFingerprints":{"codehealthFindingId/v1":"652d6a2bc375b919e5cd70267258bdfd9978d07aef88eab0b9b9ed698487e802"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(b/478865387): Remove the skip once the bug is fixed. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/pallas/tpu_sparsecore_pallas_test.py"},"region":{"startLine":3428}}}],"partialFingerprints":{"codehealthFindingId/v1":"60a58451749b8d8e7ee094d5a513b858df44d1b6490a92ef3385e2973597bb3c"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(sharadmv): These shapes fail right now. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/pallas/tpu_sparsecore_pallas_test.py"},"region":{"startLine":3738}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d80bdec55859300ef645c744232b5477908ef1eefd27562768c0af6c10d0caa"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(b/487587946): unable to put this inside dma1 \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/pallas/tpu_sparsecore_pallas_test.py"},"region":{"startLine":3802}}}],"partialFingerprints":{"codehealthFindingId/v1":"43ee879a920b3829b5b5822f6b44821f5400c8df644674ec8dfbde80fb4b3502"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(amagni) Composing masks creates masks that produce minor numerical \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/pallas/tpu_splash_attention_kernel_test.py"},"region":{"startLine":181}}}],"partialFingerprints":{"codehealthFindingId/v1":"4fccd97036da2a3acaf7787781050679d3e848f9bd9771c3515fee4951cf9eda"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(b/327487669): selectively re-enable tests that works on TPU v3. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/pallas/tpu_splash_attention_kernel_test.py"},"region":{"startLine":311}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f1ff72f40664c7ba5d999feaa1304caba36d7c92e5990b268944f0edc1718ba"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(sharadmv): Enable these tests. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/pallas/tpu_splash_attention_kernel_test.py"},"region":{"startLine":317}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b20d1bc372fe04c668bd47a6292b4ad5e88a462bf9d0faedd27224708695428"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(amagni): this mask can be improved by bringing all the padding on one \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/pallas/tpu_splash_attention_mask_test.py"},"region":{"startLine":1802}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b8812931a952e791ac27c29774d36a965e148ca07a8c93031c5ffd0461919b9"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(emilyaf): Smaller sizes fail on TPU because the dst buffer size \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/multiprocess/array_test.py"},"region":{"startLine":1027}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a276a8e2608333575cefb28f8daa3c0ab9f6def94ffecd6c1a83fee7f7e9c31"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(phawkins): TPU process IDs won\u0027t necessarily match the global \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/multiprocess/device_id_test.py"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ea26f2417d0138663e11df90019548e21a88fe4f3a00dbbbdc0a36ec3b46cb1"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(patrios): Remove this flag once b/376647494 is fixed. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/multiprocess/pgle_test.py"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"8cae666f81aa2b801561bd017f1190db2f1f32843124aebd77edd3b3606d4a6f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(b/529787598): Don\u0027t dump fdo profiles for non-optimized HLOs. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/multiprocess/pgle_test.py"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"fed6a5f859b239a400f933bb3237406d2198bc4eefa106500271e994064859cf"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(allanrenucci): Add support for reducing tiled layouts when keep_dims=True. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/mosaic/gpu_constraints_test.py"},"region":{"startLine":264}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7c212f30d5de185393d00600d1ae0cf71fd661239f2e16961e0d90e7275a351"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(allanrenucci): Add support for reducing tiled layouts when keep_dims=True. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/mosaic/gpu/constraints.py"},"region":{"startLine":304}}}],"partialFingerprints":{"codehealthFindingId/v1":"584a0cde511ef219aa5b2c1c291a53055426dd106445261f99799342f6f3ce3f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(allanrenucci): Add support for reducing tiled layouts when keep_dims=True. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/mosaic/gpu/layout_inference.py"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"46b5c94225e0be9af66a39ccc3daeaa98a9374e7d4fde58ede94e0e21375a2d9"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(bchetioui): simplify other use sites to use the aliases directly. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/mosaic/gpu_dialect_test.py"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"fbf39e86c6197cc6292c56654eb8c344fa3e3bba62981189ee52f0dbd58ed496"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(allanrenucci): Use \u0060ub.poison\u0060 once Python bindings are available. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/mosaic/gpu_dialect_test.py"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"261f710aa854ce452bf75b6366ff9b4e5a5f88eba42b661c893b7a8454cc1c9e"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(bchetioui): remove \u0060hasattr\u0060 check once minimum jaxlib version is \u003E= 0.12.1. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/mosaic/gpu_dialect_test.py"},"region":{"startLine":263}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd04c1024e549ca6c2827c8b95b7c3aada52bb6605fdb8960c96ac38a35d8f7f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(bchetioui): remove \u0060hasattr\u0060 check once minimum jaxlib version is \u003E= 0.12.1. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/mosaic_gpu/primitives.py"},"region":{"startLine":3313}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9adad8e1951de967e3e2a58d523e45f8903040ac899caf76a58e4857a4de116"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(bchetioui): pass \u0060strict\u0060 unconditionally once minimum jaxlib version \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/mosaic/gpu_layout_inference_test.py"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"99ab13ae4220e77e671eebed441967527eb7cf2e586addb0fe53188cd89b0c34"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(bchetioui): remove this check once minimum jaxlib version is 0.12.0. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/mosaic/gpu_layout_inference_test.py"},"region":{"startLine":966}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5a0356444340e3c7714bcd49e873c05e637b9cadbc49efdccfae881c7b149a0"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(bchetioui): remove this check once minimum jaxlib version is 0.12.0. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/mosaic/gpu_layout_inference_test.py"},"region":{"startLine":1127}}}],"partialFingerprints":{"codehealthFindingId/v1":"e69df65105de3669ab4fe96c741a53e672b229ce1c311ab5486c808dad1412fc"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(cperivol): Investigate why this is indexing OOB and uncomment. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/mosaic/gpu_test.py"},"region":{"startLine":418}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e7e0ad44f9731c2359ca2d301a340e0a2518fbd718a6175d08056a8551f7c04"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(apaszke,bchetioui): bf16/f32 -\u003E f8e4m3fn \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/mosaic/gpu_test.py"},"region":{"startLine":1018}}}],"partialFingerprints":{"codehealthFindingId/v1":"79fe8ff41cf24315005d1501268f0d53c067be8063294a13464f96b8e36a9981"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(apaszke): Add support for f32 \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/mosaic/gpu_test.py"},"region":{"startLine":1446}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0a8fe5f0b152103757d10685bc1e9e7a8622669ec4b7f9d9c58fa97543bea50"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(bchetioui): relax this when ptxas is fixed. As of ptxas 12.8, \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/mosaic/gpu_test.py"},"region":{"startLine":1466}}}],"partialFingerprints":{"codehealthFindingId/v1":"5578a79c193c408115b9da0eb382c096c67e0433b108204b5e53ddce624524cd"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(bchetioui): relax this when ptxas is fixed. As of ptxas 12.8, \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/mosaic/gpu/wgmma.py"},"region":{"startLine":333}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ae8e70dace22492f456d26719f60d29a2bcbeef38137f2c58ba791e923b0afa"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(apaszke): f32 \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/mosaic/gpu_test.py"},"region":{"startLine":2069}}}],"partialFingerprints":{"codehealthFindingId/v1":"c72be35837e2f6bba31425e76d3551357e495a1116446a3d96af67cdfefafa72"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(apaszke): f32 \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/mosaic/gpu_test.py"},"region":{"startLine":2273}}}],"partialFingerprints":{"codehealthFindingId/v1":"317271f47e63679eda5804d935d41ca68c676dd5170df6ee91fbffaf3bb5fe1d"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(apaszke): 64, 192, 256 \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/mosaic/gpu_test.py"},"region":{"startLine":2071}}}],"partialFingerprints":{"codehealthFindingId/v1":"6233f032c03d23a279c102550a7a26bc5a42140c013c00f45fc16cd318c77866"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(apaszke): 64, 192, 256 \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/mosaic/gpu_test.py"},"region":{"startLine":2275}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6406b779bcd795dd0183259f55424d278e225cb94cc5b1e1220df15ce398379"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(apaszke): 64, 192, 256 \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/mosaic/gpu_test.py"},"region":{"startLine":4174}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b55a767041765d264b72f8040c662661f36c8bc3faf7e471d23b6b5fae2079d"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(apaszke): 192, 256 \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/mosaic/gpu_test.py"},"region":{"startLine":2099}}}],"partialFingerprints":{"codehealthFindingId/v1":"e255e64e7ecd1820404e03e988390eb05c00b751e1cb884ef02b59fe3c7863c5"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(apaszke): 192, 256 \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/mosaic/gpu_test.py"},"region":{"startLine":3852}}}],"partialFingerprints":{"codehealthFindingId/v1":"f965929b82bd178b07b5a4f4f187c9254c2e61d269d8accf20c63e5bc20fa550"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(apaszke): 256 \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/mosaic/gpu_test.py"},"region":{"startLine":2544}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b588be66c73bf21b69d2bd2d00e178908db8fbc9ec07e1f01defe55a46c8a89"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(apaszke): 256 \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/mosaic/gpu_test.py"},"region":{"startLine":3180}}}],"partialFingerprints":{"codehealthFindingId/v1":"3da48398ad4ecf38c122923d75a6ef86b26e6643cb276717ae462c5ba6d1495c"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(apaszke): 256 \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/mosaic/gpu_test.py"},"region":{"startLine":3301}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3534465e71a5233943d53658e1bb6404d12e7f2200ffacd3bea996b1c7a684a"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(apaszke): 256 \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/mosaic/gpu_test.py"},"region":{"startLine":3416}}}],"partialFingerprints":{"codehealthFindingId/v1":"2906b581d44e9a06419903222f17efb53809b11e5fde9f8c68f7e2baf43c60bb"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: increase k to allow sparse K=192 on sm_107a \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/mosaic/gpu_test.py"},"region":{"startLine":3715}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7b1781bc730382af0c075b3b8cfbf198d8698512c0fac2f7f82c10c7e32fc2b"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(apaszke): ptxas seems to freeze when generating code for copy with \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/mosaic/gpu_test.py"},"region":{"startLine":5378}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a43568cbdecf4cf0f1aff1e2f2fe53c338e32f47d95c2d822c6b0bcfb92c353"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(apaszke): ptxas seems to freeze when generating code for copy with \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/mosaic/gpu_test.py"},"region":{"startLine":5417}}}],"partialFingerprints":{"codehealthFindingId/v1":"7350b3a42320a0fa00c5b1f9e527e213a3017a96d98db0bf81087ebd5c4f3791"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(apaszke): ptxas seems to freeze when generating code for copy with \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/mosaic/gpu_test.py"},"region":{"startLine":5462}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd050c01d253cc3a9e77e39f6b368192e5eb7054bd4f2085382ef5a4d65e86ec"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(apaszke): ptxas seems to freeze when generating code for copy with \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/mosaic/gpu_test.py"},"region":{"startLine":5527}}}],"partialFingerprints":{"codehealthFindingId/v1":"884f8f18f5f1b604bd7d45ad484ac2871b759e9ad001b84b1ab80e8e6ba9aa7d"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(apaszke): Enable float8 \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/mosaic/gpu_test.py"},"region":{"startLine":5862}}}],"partialFingerprints":{"codehealthFindingId/v1":"3447d00458d1ae6eeb884fa7759296be4c31d3bc7ffc4cb43359d063e2cb8745"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(apaszke): More dtypes \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/mosaic/gpu_test.py"},"region":{"startLine":8386}}}],"partialFingerprints":{"codehealthFindingId/v1":"59883e71497db2fd90dc6190813cb23194273097294a9f8f5d057ba5ea402754"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(dasenov): Add tests for wgmma_col_layout output once \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/mosaic/gpu_test.py"},"region":{"startLine":9023}}}],"partialFingerprints":{"codehealthFindingId/v1":"da3e3a79fcc6f96dfe75e6cd4dd3d221cb422b01ac9821bf70960c34e5d01833"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(bchetioui): add layout inference logic to handle packed/unpacked int8s. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/mosaic/gpu_test.py"},"region":{"startLine":9955}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec1ebbdc6efd0d4b4fabc93d588e64faa782a19cb4af3f954fe7c47accba65d5"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(allanrenucci): Add 32-byte swizzle once implemented. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/mosaic/gpu_test.py"},"region":{"startLine":10217}}}],"partialFingerprints":{"codehealthFindingId/v1":"302ec8b00ad5a5e94595a0a8856d5b30c6c3069e4a8163636a18e25906de43bd"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(allanrenucci): Add 32-byte swizzle once implemented. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/mosaic/gpu_test.py"},"region":{"startLine":10532}}}],"partialFingerprints":{"codehealthFindingId/v1":"af2dee1cb3b284dae2abdab3ea3fd35d3a18db737f0aa73559b5935c3c44fc7c"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(olechwierowicz): Move these sync cp helpers in the top of the file. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/mosaic/gpu_test.py"},"region":{"startLine":10695}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e7a5875a6f9b42ba2db3a7391bef90934c652c34defe546d3b53ac8d7a010cc"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(b/408271232): Use a False condition once the bug is fixed. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/mosaic/gpu_test.py"},"region":{"startLine":11273}}}],"partialFingerprints":{"codehealthFindingId/v1":"88a093c626bac705442ad7324c3d1a640a23385b733969065d7555da73eccf0b"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(apaszke): Non-portable clusters (16 blocks) sometimes deadlock. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/mosaic/matmul_test.py"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a9a6c0c99a75d0c47d8527397e7d80dba250008fd49782911e0ec641208862f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: when the accuracy of lax.cos is fixed upstream, undo relevant parts of jax PR 19823 \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/filecheck/shapes.filecheck.py"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"361cefa2143748d30749b4a6946e67803eb5d2bc2be3c1e727625cb6e74f0df7"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: when the accuracy of lax.cos is fixed upstream, undo relevant parts of jax PR 19823 \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/filecheck/shapes.filecheck.py"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3c0eac340f58b93c1020a384d5009f4d9ebe14a50a503674a729f5e3ae9c411"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(rdyro): Remove this test when iterators throw an error. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jaxlib/pytree_test.py"},"region":{"startLine":230}}}],"partialFingerprints":{"codehealthFindingId/v1":"84e50533bc833ef40bf19eeae47a2a7bb29de6882c4e7a534fe0601eca893841"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(slebedev): Consider overriding instead. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jaxlib/triton/dialect.py"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"7eca9e6e503d5714677b9c4805fbfe4a072d5851fa3396eaa728e183ac4599ef"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(slebedev): Consider overriding instead. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jaxlib/triton/dialect.py"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"faa0f0a821d8649c5e7521459a8c3bbc61a855a846aae9df2d31d989f37c9df3"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(ybaturina): remove the method when we switch to the new wheel build rules \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jaxlib/tools/build_utils.py"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"9befd7846530ccd29fba14b1a9de2d2a30c9a7a82003e10ed1a388775f57ba28"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(ybaturina): remove the runfiles part when we switch to the new wheel \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jaxlib/tools/build_utils.py"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f6ad8a9842d0c156ec152e8fd673d372fb732a8a45bdd30733e19731627088c"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(ybaturina): remove the runfiles part when we switch to the new wheel \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jaxlib/tools/build_wheel.py"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"9831fb227c54ce479b89f7e4f9e723faa2c4d06e758522202946f16a56ff8a2f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO (sharadmv,skyewm): can we avoid patching this file? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jaxlib/tools/build_wheel.py"},"region":{"startLine":249}}}],"partialFingerprints":{"codehealthFindingId/v1":"19dacdda6533018298452203f8280365aa0aafc8732974b68810ba5542a27db3"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(phawkins): check the non-Python path here and error if not found. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax_plugins/cuda/__init__.py"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"970b377fa6f86d2b951384ac7eb296a056e7edfa42319c6bf7c62270e4e5a30b"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(phawkins): for some reason this check fails with a cusolver internal \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax_plugins/cuda/__init__.py"},"region":{"startLine":249}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd5b9ff6139b7bd3b5ad66e6d11de314631829b8bfaa21d852e76f9b2ee5ff53"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(phawkins): Deprecate and remove jax.lib. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/__init__.py"},"region":{"startLine":209}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2baf2f9fb9e503593d2a8a12c3b06213a71ea682882a2d3a24a2b7a36a98ab5"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # Deprecated in JAX v0.10.0, TODO(jakevdp) finalize after v0.11.0 \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/core.py"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"0096d53ff34a9a6d4e752f57cb1c358d89fa93c78885e8ef1822a5eedd7609f3"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(phawkins): switch callers to jnp.finfo?  # noqa: F401 \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/dtypes.py"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a8f2cf38b18b3a6817cb42bacf30c57ad67b1af42519f475c177cf571c51e9d"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(phawkins): switch callers to jnp.iinfo?  # noqa: F401 \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/dtypes.py"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"224e9cdf5afac2a0371c4601a7c1faf50a4d8dcc076916140324ea68fb5ec27c"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(phawkins): switch callers to jnp.issubdtype?  # noqa: F401 \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/dtypes.py"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c40eb76c1b9c3170965e50a21d8bcc642fdf2e1a63bd9f876f6459e134eb3ea"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(tomhennigan): Ideally we could avoid creating actual values here. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/tools/jax_to_ir.py"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"867d93a1720c3d69f91c376efaceccde00213da271587812e156b35d80a3ed27"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(twsung): Remove try-except once we upgrade to ml_dtypes \u003E 0.5.4 \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/numpy/__init__.py"},"region":{"startLine":246}}}],"partialFingerprints":{"codehealthFindingId/v1":"0fc9e1816b2ec617fce45dcddaf4fe78d8fb13e75ee3726f0c042bcfeadc7e97"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(dsuo): Temporarily maintain symbols related to callback lowering for sake \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/interpreters/mlir.py"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1f819fe1ae1e557d7c48727c4801e8a68c78b0818769fa9ff6ae62ba1fe3a97"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # Deprecated in JAX v0.8.2, TODO(jakevdp) finalize after v0.11.0 \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/interpreters/pxla.py"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9f1c84cc71dae1515ace44bff3555ed560cb26f1a23e61ade5a93c91b76e1fa"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(b/396086979): remove this once we pass debug_info everywhere. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/extend/linear_util.py"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"ffce521102547a2ba74d261bf4e92cab503c8cef52ed2e12f61ef1782eabd6d2"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(yashkatariya): Remove this after NamedSharding supports more complicated \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/extend/sharding.py"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"15054c90a5121e42fae49a52884b193a057d1e38b702b05afff944d2c44623e9"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(mattjj): why did i do jvp \u002B dce here, not ad.linearize_jaxpr? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/fused.py"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"359cda8e2e80a891695bc3f2c0b821be9196311292986032ab89add288c568d9"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(mattjj): consider supporting pytree inputs \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/jet.py"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"961bf498e162363924bba1834715fa79f5cd141e8ba190ff4cc8d8a5b2e8542f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(mattjj): avoid always instantiating zeros \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/jet.py"},"region":{"startLine":258}}}],"partialFingerprints":{"codehealthFindingId/v1":"24eab0e1c018171f166249aab41b95928936785879f2084e8a66e5d6c0449036"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(mattjj): don\u0027t just ignore custom jvp rules? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/jet.py"},"region":{"startLine":271}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d9205a738230825c0e6238b79af9d4d88001a0d1d0dfca35f75aac2e9d19f5d"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(mwhittaker): Make devices optional. If it\u0027s not provided, use \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/multihost_utils.py"},"region":{"startLine":668}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f101123c975f45a6c10d77214431dbbed8a907c2b78c35f0b1109f58cd13dc0"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(zhangqiaorjc): Handle ragged seq_lengths. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/rnn.py"},"region":{"startLine":323}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c9afdc6bf874f13a69209e74f18eaf2d268ce2e102fcbf3c7621edbd35bc78e"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(jakevdp) support for batched matvec. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/sparse/_lowerings.py"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"6884545125d535422cf1a43de22c30c8de92d7b8430c1dbbdb1b4efff82aebd7"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(jakevdp) support for batched matmat. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/sparse/_lowerings.py"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"7cdd09f4bb2f50b9826d30354d7cf8c0437136c47a994f811f502ba84a027271"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(tianjianlu): use batch stride to trigger different mode of batch \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/sparse/_lowerings.py"},"region":{"startLine":152}}}],"partialFingerprints":{"codehealthFindingId/v1":"42de8193507d5255171dceec868f1fb04360d8daae22af3485888d1e6ab73a38"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(tianjianlu) support for batched matvec. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/sparse/_lowerings.py"},"region":{"startLine":189}}}],"partialFingerprints":{"codehealthFindingId/v1":"d71b5f4ce2e135658a86c4b28ab5b4e8ef55f8b1fd6827589c1b59495354792b"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(tianjianlu) support for batched matmat. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/sparse/_lowerings.py"},"region":{"startLine":241}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c7e1e6aecf1841e76cee4d020fb0ad5413b3f579a0e907495e31daea6293682"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(jakevdp) this can be problematic when used with autodiff; see \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/sparse/bcoo.py"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"8adb38dcb0092e987debbe77ca9fbe22b890b818b0c780abb64b2b215db649f9"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(jakevdp) can we handle this case without explicit broadcasting? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/sparse/bcoo.py"},"region":{"startLine":480}}}],"partialFingerprints":{"codehealthFindingId/v1":"49545c9feb2642bfaf834b455f394ffc7af24a3b113a6bc0d74eb23030306cce"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(jakevdp) can we handle this case without explicit broadcasting? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/sparse/bcsr.py"},"region":{"startLine":441}}}],"partialFingerprints":{"codehealthFindingId/v1":"343bb53646290023536bfafc3669c2c766bab3ee7336ab470014660f8f575e7a"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(jakevdp) avoid dummy indices? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/sparse/bcoo.py"},"region":{"startLine":584}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4a4b46d1ba532027051954e221baf27685231825867bd256f6537b0f84333e7"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(jakevdp) make use of these? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/sparse/bcoo.py"},"region":{"startLine":632}}}],"partialFingerprints":{"codehealthFindingId/v1":"168e41e7491d8a6faa883a2769d126dc608e502834068fbf793686ffed874874"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(jakevdp): perhaps this should be part of the bcoo_dot_general primitive? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/sparse/bcoo.py"},"region":{"startLine":674}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ffed28737e486ddaf21c03b50706e334d884ed46e5b8cd3b0f435a4e0295ae5"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: support contraction of dense dimensions? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/sparse/bcoo.py"},"region":{"startLine":758}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d5c28bc423210f486989adb20cce9268fc2d0645645d2f0ee35e65e207cb3cf"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: support contraction of dense dimensions? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/sparse/bcsr.py"},"region":{"startLine":551}}}],"partialFingerprints":{"codehealthFindingId/v1":"df208da7d6660e8da2150d15b19018e9ce4faa752b0ca76af856d5b1ac8b89e3"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(jakevdp, tianjianlu): add support for batched lowerings \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/sparse/bcoo.py"},"region":{"startLine":817}}}],"partialFingerprints":{"codehealthFindingId/v1":"489ddca7f7bc69dffd3158221af54508ac865b30180d276aa17f4e0a94418c2f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(jakevdp): explore implementing the efficient approach without actually un-transposing \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/sparse/bcoo.py"},"region":{"startLine":883}}}],"partialFingerprints":{"codehealthFindingId/v1":"1695798d7f5f88cb57f51ecffc53a33e0b4bfcbe2df31d7877204813c3aad31f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(jakevdp) generalize this \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/sparse/bcoo.py"},"region":{"startLine":970}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ed201e9a3a8f7f84ecaadd81192a28d1bda295b501ef6211ef54e05023fb5e4"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(jakevdp) generalize this \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/sparse/bcoo.py"},"region":{"startLine":992}}}],"partialFingerprints":{"codehealthFindingId/v1":"6250395b217074ff68a74e249c56c60d88ce78d8061f8abf8523f24c2678b476"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(jakevdp): add fast approach for more general cases / combine the following: \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/sparse/bcoo.py"},"region":{"startLine":1034}}}],"partialFingerprints":{"codehealthFindingId/v1":"9fc38c8ee33167aaf48ca38a0b173434b4e59e021bf5cce3976fa123418a753a"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(jakevdp): can we do this more efficiently than using an outer product? Note that \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/sparse/bcoo.py"},"region":{"startLine":1132}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4ab016c230db4c51582f5237045666fba5363a489a3e0a5d66aad928261b99b"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(jakevdp): handle dense dimensions \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/sparse/bcoo.py"},"region":{"startLine":1210}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e25ddd9c9e859ce5d72556d43eceb0c39852bad6d81a7aaaee53199e830c28d"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(jakevdp): should we warn here if output is effectively dense? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/sparse/bcoo.py"},"region":{"startLine":1231}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c442a89deba64672055c20f02a76be6d6ea8911706fc51c9bf5b095bd7849f6"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(JVP): transpose rule \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/sparse/bcoo.py"},"region":{"startLine":1292}}}],"partialFingerprints":{"codehealthFindingId/v1":"3aed92ba1a064c3918c381f29858eef07f96db7f19678c24c693c9451168dcbf"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: check if \u0060indices_sorted\u0060 is True. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/sparse/bcoo.py"},"region":{"startLine":1471}}}],"partialFingerprints":{"codehealthFindingId/v1":"673426fbc55d14762542897ca554e47c52d4a3420bfc18d6ed02d37f97b193e0"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(jakevdp): allow specification of nse? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/sparse/bcoo.py"},"region":{"startLine":1598}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f85ee34e3ec15335baf39ca6dad034702f787c3077d0d3296955a7899c62bb2"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(jakevdp): there is room for some improvements here: \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/sparse/bcoo.py"},"region":{"startLine":1599}}}],"partialFingerprints":{"codehealthFindingId/v1":"16ce6b471672d44eb1ef8a35e8f9bcb84cba91cf922a4b6e69a18f0c9a67ce65"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(jakevdp): are efficiency warnings necessary when nse is 0 or 1? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/sparse/bcoo.py"},"region":{"startLine":1633}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e66d0ed61542be7162d872e98649a67f024673f15dd9ce767f6426c4fbef549"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(jakevdp): Should new trailing dimensions be dense by default? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/sparse/bcoo.py"},"region":{"startLine":1742}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7c4e99d27120875897eaced416980fb63a2455901c0c2ec2c517ef54a14023f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(jakevdp) should we implement this? In general it results in a wasteful \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/sparse/bcoo.py"},"region":{"startLine":1831}}}],"partialFingerprints":{"codehealthFindingId/v1":"edd2e06839dacd6768e1cde7b1cb1a1d34975f3d0d10dc7fabfcb9043e30d7f1"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(jakevdp) implement this case via broadcast_in_dim \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/sparse/bcoo.py"},"region":{"startLine":1857}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ac44e10b66788d9000e3b9af3a99734dbf72502afc6a6d6d40185eff6419f93"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(jakevdp): this can be made more efficient by utilizing batch structure. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/sparse/bcoo.py"},"region":{"startLine":2235}}}],"partialFingerprints":{"codehealthFindingId/v1":"a290989c7f3e069e253c540238937842826a2281064cfdf5d2331fb94061ff6e"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(jakevdp): this nse can be tightened to min(lhs.nse, rhs.nse) if there \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/sparse/bcoo.py"},"region":{"startLine":2245}}}],"partialFingerprints":{"codehealthFindingId/v1":"21874ec2dc1f2ea9cee1d531df098cf9112a42c07e53cc15a442ab5225a88dff"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(jakevdp): this is pretty inefficient. Can we do this membership check \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/sparse/bcoo.py"},"region":{"startLine":2249}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d08fff5edc297a695a97291d7ddd5590d8ad438863a64504094d281cc150ad4"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(jakevdp): the logic here is similar to bcoo_extract... can we reuse that? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/sparse/bcoo.py"},"region":{"startLine":2274}}}],"partialFingerprints":{"codehealthFindingId/v1":"773cf1e807c41b1555cb0867319919d6f92d7ac33302dbdab06832582112d427"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(jakevdp) make use of unique_indices and indices_are_sorted? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/sparse/bcoo.py"},"region":{"startLine":2309}}}],"partialFingerprints":{"codehealthFindingId/v1":"17ebe411cc99a3cdea4268e150970841d1b51cba045e6fa85b4c41479fb6a5db"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: jakevdp more granular approach here. Can we do this in a \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/sparse/bcoo.py"},"region":{"startLine":2355}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a3ef5b783f460a76a131649b9d86f0e8eff432f5699042d8023f812627af333"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: determines sorted and unique indices for scipy conversion. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/sparse/bcoo.py"},"region":{"startLine":2578}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e4ff215f14b25bf42e9f3bcebcf9543cf6c4d625308423b496689f6bf21194d"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: address the corner cases that the transposed indices are sorted. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/sparse/bcoo.py"},"region":{"startLine":2713}}}],"partialFingerprints":{"codehealthFindingId/v1":"424f792bc78d68bf913f3ffeb816dc0b3c904f0e40691da63a4d2dea9c050288"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(jakevdp): handle this by moving bdim to front? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/sparse/bcsr.py"},"region":{"startLine":433}}}],"partialFingerprints":{"codehealthFindingId/v1":"39d9cd9ff685a8b6e75733be09c3b4f18621a2fabcee0da8e44dbf07693f0413"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(jakevdp): implement this in terms of bcsr_dot_general \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/sparse/bcsr.py"},"region":{"startLine":578}}}],"partialFingerprints":{"codehealthFindingId/v1":"c256e305fa4bd26f41642ce8d6d8083905c428ed924f89170af759baff0f954e"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(vanderplas, tianjianlu): lower batched matmuls to GPU \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/sparse/bcsr.py"},"region":{"startLine":643}}}],"partialFingerprints":{"codehealthFindingId/v1":"51e72fa041f44d8f5f5d49e91336324504eab7b7ecdc4c45322e8d2956649fb3"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(willfroom): Add support for batched matrices. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/sparse/bcsr.py"},"region":{"startLine":720}}}],"partialFingerprints":{"codehealthFindingId/v1":"28c66a18b13304aaac2243ca796e0be1afa3a62998ae25799b3093646660b7fb"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(willfroom): Add support for non-canonical dots. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/sparse/bcsr.py"},"region":{"startLine":736}}}],"partialFingerprints":{"codehealthFindingId/v1":"29cc6b1a884cb8be274605cae9681ee885355b4a920ee631737f1ca2f900f7d9"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(jakevdp): would be benefit from lowering this to cusparse sort_rows utility? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/sparse/coo.py"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a7fc889cb2b25fcce21efc7eb2b41459fa09f954601e559a41a2619d1500264"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(jakevdp): this can be done more efficiently. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/sparse/csr.py"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7599f9bde3f2d59f9880639d5100d94c2986302031c4e8cf876c1f868ac8a5b"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(vladf): support mixed_precision flag, which allows f64 Rayleigh-Ritz \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/sparse/linalg.py"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"a32516fd3d3f93607083cab280b5c754e55d9c6909b454f17aba09eefe2d3f93"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(vladf): support preconditioning for bottom-k eigenvectors \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/sparse/linalg.py"},"region":{"startLine":159}}}],"partialFingerprints":{"codehealthFindingId/v1":"32d74ef4e61531fa2099cebf5172880e56c025b096e2038f1ff22ab872a1f3d4"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(jakevdp): can we do this without an explicit transpose? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/sparse/linalg.py"},"region":{"startLine":585}}}],"partialFingerprints":{"codehealthFindingId/v1":"74aad2a6d92ea6444674069220f330f160a1ab0ef508226a70dd33c5d077f18e"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(jakevdp): handle the jvp here \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/sparse/transform.py"},"region":{"startLine":353}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c9fddadd31d84d7fed6219f69c5c6e5031b1012af2bf0c1aa616655acfaa2b9"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(jakevdp): currently this approach discards all information about \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/sparse/transform.py"},"region":{"startLine":785}}}],"partialFingerprints":{"codehealthFindingId/v1":"32147e3e6aac255a36d79d15b48885f83b002ebf72b24e3595f6b1bc30ea6781"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: #   don\u0027t work in corner cases (see associated TODO in sparsify_test.py) \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/sparse/transform.py"},"region":{"startLine":788}}}],"partialFingerprints":{"codehealthFindingId/v1":"64ee7b498b2f639130cee669c69078ad9b441549c795454a340db534c982eed7"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(frostig,jakevdp): This closes over \u0060spenv\u0060, which can bring \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/sparse/transform.py"},"region":{"startLine":792}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd9dc45c383f35749b0f6e5d57820702c6ea109ebbf4b7571297937714d06b50"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(yashkatariya, vanderplas): Flatten twice and set the correct sharding \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/sparse/transform.py"},"region":{"startLine":842}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c2efc95ab540894d17b0580d6fd4be0104bc22635727b017b04f5c3f4c6e604"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(jakevdp): we don\u0027t want to pass xs_spvalues, we want to pass one row \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/sparse/transform.py"},"region":{"startLine":881}}}],"partialFingerprints":{"codehealthFindingId/v1":"b61e93c332422b6d8775107d7ddcacdb91726cad3568ec2cd20f509c0cb36e77"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(jakvdp): we should assert that tree is PytreeDef(*) \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/sparse/transform.py"},"region":{"startLine":917}}}],"partialFingerprints":{"codehealthFindingId/v1":"42abec214fffbe9c435ff441df335775d19d8762b02b40e705ecf0f02f4486d6"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: possibly make these primitives, targeting cusparse routines \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/sparse/util.py"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"95c1f6fff93bac59a54904cfa0a942446d47c8171dcf574b5031ec78a2af2072"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(justinfu): Remove when new format is the default. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/source_mapper/hlo.py"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"53badaca6c7c7d1121fb1061a2f31a2869ec83f023efbc0bd2c19e14f73cab01"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(justinfu): Make a proper parser for MLIR dumps. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/source_mapper/mlir.py"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1891c0a23178b67f6d4bf4befa48d3586e4b6a3e13e6693dfe2eeac76e72db8"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(justinfu): This happens on fusion locations - need to implement. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/source_mapper/mlir.py"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"b467b5fb374b8f719e2d1e4c923cab44ba748f7a878c95992247d99452ae1c05"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(slebedev): remove these for JAX v0.13.0. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/pallas/__init__.py"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b410ba6f125a9dc9d97e3b7d6516caeff25ab3f4803ec62d931ca7f013bb5ae"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(slebedev): remove these for JAX v0.13.0. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/pallas/tpu.py"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"327c7746d74033446add0f237675ec6bf41f65fb8337b7796fe732e5bcf97429"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(allanrenucci): remove for JAX v0.13.0. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/pallas/mosaic_gpu.py"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"22a580281687f0a84e321c90c3d73ebd359bdbf96979348f4b1cbdc4ea6f3bbf"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(slebedev): remove these for JAX v0.14.0. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/pallas/tpu.py"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"84861dc2356d3ea251a1654558d4cbcdc00f5fae06f3a5baf0821e0a3d38eba4"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(sharadmv): could speed this up having the first remote DMA go from \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/pallas/ops/tpu/all_gather.py"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"903743d9c3d07d3d5961c5aaef10b8836d45115789bcad822cf5258556b7a890"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(sharadmv): enable all gather over multiple axes \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/pallas/ops/tpu/all_gather.py"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"6890fdcb14fafea1a833235a941a0daabee2be883cad152eb879079acb74ebdb"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(apaszke,sharadmv): Select better parameters based on a heuristic. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/pallas/ops/tpu/flash_attention.py"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"ebf4388ed6212fefd503fabe4519b3139d26a623c9f96d2257070ec832a2add7"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(apaszke,sharadmv): Select better parameters based on a heuristic. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/pallas/ops/tpu/splash_attention/splash_attention_kernel.py"},"region":{"startLine":549}}}],"partialFingerprints":{"codehealthFindingId/v1":"690cceeaa5c07dc9226c5f2eabf6aaeeadea866c5cb9bb1a0bb681b1d52096d9"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(tanburn) Should the attention bias be added before or after \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/pallas/ops/tpu/flash_attention.py"},"region":{"startLine":400}}}],"partialFingerprints":{"codehealthFindingId/v1":"3bcfbed4a38d5b903afed63f352f27482e09d9143347ff2028e5ad0b27389bb2"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(apaszke): Tile over heads as well. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/pallas/ops/tpu/flash_attention.py"},"region":{"startLine":611}}}],"partialFingerprints":{"codehealthFindingId/v1":"42cf982ecc3c01516e66ca5b84dc4a4c30ad78731aa82a16d7171a53d30864c2"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(tlongeri): Maybe we could use a deduction similar to jnp.dot \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/pallas/ops/tpu/matmul.py"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"816313788d7e24e47487c58b4437c1a148f1a17b32e9533df790b46a25cfdc23"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(amagni/sharadmv): when adding block_compute, make sure that is a \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/pallas/ops/tpu/splash_attention/splash_attention_kernel.py"},"region":{"startLine":1470}}}],"partialFingerprints":{"codehealthFindingId/v1":"4979095aa9ddac08875cb317f6c381bc41b7bbb893d91aadc25c6d24d8b09923"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(apaszke): Remove the sublane expansion once Mosaic has all retilings \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/pallas/ops/tpu/splash_attention/splash_attention_kernel.py"},"region":{"startLine":2123}}}],"partialFingerprints":{"codehealthFindingId/v1":"810e91f255638d8b13bffd764a027af820e41487bc0c5dca11852d31d05dcd60"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(apaszke): Remove the sublane expansion once Mosaic has all retilings \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/pallas/ops/tpu/splash_attention/splash_attention_kernel.py"},"region":{"startLine":2130}}}],"partialFingerprints":{"codehealthFindingId/v1":"80bcb995cb997b2801668309f98cae95468510c2c183e0a000c3327cba984d80"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(amagni): Transform FullMask into a _ComputableMask. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/pallas/ops/tpu/splash_attention/splash_attention_mask.py"},"region":{"startLine":531}}}],"partialFingerprints":{"codehealthFindingId/v1":"02b49d68bf39d618b98c11ae82f56cbd4d53da97875812f449ce2747bce3c20b"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(sharadmv,amagni): In the future we could think of a dynamic mapping of \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/pallas/ops/tpu/splash_attention/splash_attention_mask_info.py"},"region":{"startLine":623}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f7a96a37b4434152eb567535be55724186a0cc8e282c33301837974eb641b72"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(amagni): checking the validity of the masks is slow for large masks. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/pallas/ops/tpu/splash_attention/splash_attention_mask_info.py"},"region":{"startLine":635}}}],"partialFingerprints":{"codehealthFindingId/v1":"80c2820118f2a736f0abbb2e283f9cec2f735bbbc0911355b8a39991d261d502"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(justinfu): Support hi bits on count. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/pallas/ops/tpu/random/philox.py"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"d234c2bd5c94fa18ec8333ab9b8bcc879f25555deaeacc4ff6f665f0b8ee2bb1"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(justinfu): Support hi bits on count. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/pallas/ops/tpu/random/threefry.py"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a674b963be348299fe181a12afe70c6e77b3535771ca3acc0edfbec9be3bf2b"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(jevinjiang): Only fetch dynamic shape in need! This will insert \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/pallas/ops/tpu/ragged_paged_attention/kernel.py"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"74c9bf074267078c0d8393c557299139ba60688937f65454a07ede71ff59019f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(jevinjiang): if OOM in SMEM, consider pack to other scalar refs. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/pallas/ops/tpu/ragged_paged_attention/kernel.py"},"region":{"startLine":296}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b16160e9beaaf84ef961ce9e60a8cd3869aae104beb5fff752dc7d0b725c02e"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(jevinjiang): Add these to Mosaic: \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/pallas/ops/tpu/ragged_paged_attention/kernel.py"},"region":{"startLine":358}}}],"partialFingerprints":{"codehealthFindingId/v1":"a50c3c0e3afc13f7b0370a04913c89415dc737f641447bf86f3681f375802558"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(chengjiyao): use the general strided loading logic for bf16 after \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/pallas/ops/tpu/ragged_paged_attention/kernel.py"},"region":{"startLine":373}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a30ca3ea3e5458beac704faa267cc8a634ed430bceab05ad9d835175f6ed92a"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(jevinjiang): reuse the same buffer if it is already prefetched! \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/pallas/ops/tpu/ragged_paged_attention/kernel.py"},"region":{"startLine":605}}}],"partialFingerprints":{"codehealthFindingId/v1":"27812d682d431c98d3b2bc829f5403fe1e05124153951b90cf651989e1479047"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(jevinjiang): only fetch effective dynamic size to hold kv_len and \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/pallas/ops/tpu/ragged_paged_attention/kernel.py"},"region":{"startLine":606}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad431580028f38434710bd79f2a14cb5b607a589d3a44e339fd6536fefe1680f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(jevinjiang): extra handling for packed type that can start at \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/pallas/ops/tpu/ragged_paged_attention/kernel.py"},"region":{"startLine":640}}}],"partialFingerprints":{"codehealthFindingId/v1":"46406697b67118aa08c34a112ea00fb8fb2d7fe581d51f8f6e9340d5bea274c3"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(jevinjiang): support unaligned number of heads! \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/pallas/ops/tpu/ragged_paged_attention/kernel.py"},"region":{"startLine":695}}}],"partialFingerprints":{"codehealthFindingId/v1":"91631ce3d9ecdb19c865768f7e53122add46f3bbb9d5488a4eb8fff4313705fe"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(jevinjiang): we can choose smaller tiling for packed type if large \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/pallas/ops/tpu/ragged_paged_attention/kernel.py"},"region":{"startLine":704}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c1c646e5ecd218b85471f3739b154470717708742047fa963b0009f19e73d31"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(jevinjiang): create a write_to_kv_cache kernel! \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/pallas/ops/tpu/ragged_paged_attention/kernel.py"},"region":{"startLine":734}}}],"partialFingerprints":{"codehealthFindingId/v1":"0cab45c98e99d5e66c9a1fd20a1dce8196f91b787eb22ea48bda7521313c622e"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(jevinjiang): use 128 instead of 1 is due to Mosaic does not support \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/pallas/ops/tpu/ragged_paged_attention/kernel.py"},"region":{"startLine":838}}}],"partialFingerprints":{"codehealthFindingId/v1":"a601823520163ab08ad8d86471e16130794769606b731d57c0774d20b4a38b27"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(dinghua): get the actual cores per chip once there\u0027s an official API. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/pallas/ops/tpu/paged_attention/paged_attention_kernel.py"},"region":{"startLine":484}}}],"partialFingerprints":{"codehealthFindingId/v1":"4facb811c4b69c6e9083fde4608b6ac708ed3ade7a2624191f33de629b92e04b"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(enriqueps): Clean this up and use a namedtuple \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/pallas/ops/tpu/megablox/gmm.py"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"bcb39308c55441016688d6832e754083f1602f971e793055d06b29204de560b9"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(tgale): Invert the \u0027partial_tile_mask\u0027 predicates to be more clear. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/pallas/ops/tpu/megablox/gmm.py"},"region":{"startLine":211}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f133b3327bed028b23429f614833cf7fd1767b5d5e79ad47841f40470fec82c"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(tgale): Move this offset into the kernel to avoid these rolls. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/pallas/ops/tpu/megablox/gmm.py"},"region":{"startLine":243}}}],"partialFingerprints":{"codehealthFindingId/v1":"47464478d5c1678746acb6379f07bd824fd50445fcd751aede14266a96f98d3e"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(tgale, enriqueps, apaske): Fuse this transposition into the tgmm. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/pallas/ops/tpu/megablox/ops.py"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"b38fe0d9e216125e6f9d8989d2b422c4e2d5765e84696cf26d5b25273a155241"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(apaszke): 8 is just an arbitrary unrolling factor. Tune it! \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/pallas/ops/gpu/all_gather_mgpu.py"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"59ec7919d76f09bcfb9b878fbd47af2ac9832e6a11a710cd7a3a32cceaf36785"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(apaszke): 8 is just an arbitrary unrolling factor. Tune it! \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/pallas/ops/gpu/reduce_scatter_mgpu.py"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d87c7990d9b445423a8bc4cdf333c7858190e9afc6da0b695dc975cdfa6f2d6"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(apaszke): Use a TMA pipeline \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/pallas/ops/gpu/all_gather_mgpu.py"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"3830b195d6fedd05003336537f60c6047e1e3ba63c647314698e40519b5eaf14"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(apaszke): Invert and multiply to avoid expensive divisions. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/pallas/ops/gpu/attention_mgpu.py"},"region":{"startLine":241}}}],"partialFingerprints":{"codehealthFindingId/v1":"b71c7dafb13fa8b85cabee64a009f355be01c2ff76484fd71768089305a97e23"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(apaszke): Invert and multiply to avoid expensive divisions. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/mosaic/gpu/examples/flash_attention.py"},"region":{"startLine":281}}}],"partialFingerprints":{"codehealthFindingId/v1":"03d457a56e6dba874a446700ab4e9a3dae42f3ef8632f343814ab18bbd711e21"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(apaszke): Invert and multiply to avoid expensive divisions. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/mosaic/gpu/examples/flash_attention.py"},"region":{"startLine":505}}}],"partialFingerprints":{"codehealthFindingId/v1":"64b03e84bd98389e97ee5bd39af02b14cde39a7d00bfa975f0a3a0d6be9a63e0"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(justinfu): Merge with blackwell_matmul_mgpu.py \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/pallas/ops/gpu/blackwell_ragged_dot_mgpu.py"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f2eae485982d7101b8d25bc8071154e5296c36a74b77820289ce32ab5b5e32c"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(apaszke): This contains run_scoped inside, meaning that it will \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/pallas/ops/gpu/collective_matmul_mgpu.py"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ac936e43167ea7300ff13dab4723a3c3594eed811a1e10e8a898c48bbdd5e97"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(apaszke): We could do this signal a lot earlier if we better \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/pallas/ops/gpu/collective_matmul_mgpu.py"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"77258f39a300c2fba4831484e8b56f4c98e53b67c014e9c0feaea1443f2d53a1"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: Consider using triple-buffering so to not end up issuing \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/pallas/ops/gpu/hopper_matmul_mgpu.py"},"region":{"startLine":196}}}],"partialFingerprints":{"codehealthFindingId/v1":"c82e4b25454123d585990204d4801784104b7901bd79790629bc80f18b34082c"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(bchetioui): consider defining an interface for variable keys that carry \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/mosaic/gpu/constraints.py"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"9231f93544b2dee90f1edb13a54667b83df4ec9e7b7ae102f484ec6c8a77f38a"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(olechwierowicz): We should raise here because this constraint is \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/mosaic/gpu/constraints.py"},"region":{"startLine":746}}}],"partialFingerprints":{"codehealthFindingId/v1":"86df853c4e13a2b50707e30aa1adce9810079b72ac11c700888b3fb8e5694905"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(apaszke): Implement a proper system for managing kernel lifetimes \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/mosaic/gpu/core.py"},"region":{"startLine":187}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e3a97965460efec03a07a9ff4f437bd097950e6657e172cacb66e92a39857d1"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(patrios): Remove once the minimum jaxlib version is \u003E= 0.12.1. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/mosaic/gpu/core.py"},"region":{"startLine":303}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7581b5ac8469e2d2875d7ea42d388766230c3fae2406b47bfc692d38f368e0b"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(apaszke): This is quadratic, but it shouldn\u0027t matter for now... \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/mosaic/gpu/core.py"},"region":{"startLine":583}}}],"partialFingerprints":{"codehealthFindingId/v1":"4213d28f178feffdabcbcde7f8aec57788e2861ee2fb39d5598823c8dde00639"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(justinfu): This can trigger misaligned barrier allocations \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/mosaic/gpu/core.py"},"region":{"startLine":691}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b8a0007773d02377b947037c2088398612aa40196d7faa6d6dcc6cf590c355c"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(apaszke): Inline this \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/mosaic/gpu/core.py"},"region":{"startLine":749}}}],"partialFingerprints":{"codehealthFindingId/v1":"69f377512f557b3dab7fb75bf4f4675f27b62a60317d8cecdb200ddea949b679"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(apaszke): Skip fences if no barriers or TMEM is initialized. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/mosaic/gpu/core.py"},"region":{"startLine":891}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3af0e621fa31083cb706d9980101e405d352e09033c6d76b623550f10ed9965"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(apaszke): Only initialize cluster barriers before the cluster wait. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/mosaic/gpu/core.py"},"region":{"startLine":892}}}],"partialFingerprints":{"codehealthFindingId/v1":"e41e7cfde40465f3dc969f01bd143e8351cd09e894d062cf3756e5ba67df2e14"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(olechwierowicz): Alternatively we should be able to thread in \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/mosaic/gpu/core.py"},"region":{"startLine":916}}}],"partialFingerprints":{"codehealthFindingId/v1":"c667095e28f292f6b3befd6a433db004c0415edcef6a65d2d9bdad149bdba15b"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: Retry \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/mosaic/gpu/core.py"},"region":{"startLine":1310}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef46534cb8b5d08be7e931277fee96a6bea81a63d72573a2b6e3e144ef19da1f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(bchetioui): make sure all layouts are set here. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/mosaic/gpu/dialect_lowering.py"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"596d929e668462aedd99cd103637d2d8b3d995998064419c49cf8d00b96edecf"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(bchetioui): Change \u0060\u0060expected_transforms\u0060\u0060 to be a \u0060\u0060Sequence\u0060\u0060. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/mosaic/gpu/dialect_lowering.py"},"region":{"startLine":232}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b98585b6622f5975dc50b39130af182b9470c975dacce8eee8251cd511348cb"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(bchetioui): Process transforms. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/mosaic/gpu/dialect_lowering.py"},"region":{"startLine":418}}}],"partialFingerprints":{"codehealthFindingId/v1":"74d46189977e646d63cff7d873e94a0a8a3e807493e6e06d178396adb136eeea"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(apaszke): DO NOT IGNORE TRANSFORMS. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/mosaic/gpu/dialect_lowering.py"},"region":{"startLine":482}}}],"partialFingerprints":{"codehealthFindingId/v1":"18efe9c75ded05eef50f236dcdbd630916e03d4b207711384ccb6baafb2594d8"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(bchetioui): this should be trivial to relax if ever necessary. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/mosaic/gpu/dialect_lowering.py"},"region":{"startLine":1064}}}],"partialFingerprints":{"codehealthFindingId/v1":"16bc89b85d7537cc4722753bd37bf057ccb58e23751ba41618882115c3ba1b9d"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(dasenov): async_copy requires all GMEM strides except the last one \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/mosaic/gpu/dialect_lowering.py"},"region":{"startLine":1171}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0488cbca7aae309adb6c05a4c83a0ed855055583cacba5aef5ef5b6a5a4505a"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(dasenov): async_copy requires all GMEM strides except the last one \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/mosaic/gpu/dialect_lowering.py"},"region":{"startLine":1293}}}],"partialFingerprints":{"codehealthFindingId/v1":"63476346ba73475542d8a658f31bfa33988154e4bd979da27a622699fa44b663"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(dasenov): Add support for the remaining op properties. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/mosaic/gpu/dialect_lowering.py"},"region":{"startLine":1180}}}],"partialFingerprints":{"codehealthFindingId/v1":"6239693b3e208259cf2f803cc0e2a41c5c88ea31fdeb250001cf0e2069719aff"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(dasenov): Add support for the remaining op properties. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/mosaic/gpu/dialect_lowering.py"},"region":{"startLine":1310}}}],"partialFingerprints":{"codehealthFindingId/v1":"0aef3760622354ab38789d10b2c19e48662ae42a46126be7de2ab19534f0ae18"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(slebedev): Remove \u0060\u0060hasattr\u0060\u0060 once the minimum jaxlib version is \u003E0.12.0. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/mosaic/gpu/dialect_lowering.py"},"region":{"startLine":1204}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c4420f409cdc6dea4c7261ad217c913b3d97b06c498f1cef663e0c84c5803f8"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(slebedev): Remove \u0060\u0060hasattr\u0060\u0060 once the minimum jaxlib version is \u003E0.12.0. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/mosaic/gpu/layout_inference.py"},"region":{"startLine":2284}}}],"partialFingerprints":{"codehealthFindingId/v1":"42145a66ce6313fb532c24ee8d9a62eafd155432471ef548b327c3169dcc1f18"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(bchetioui): support transposed offsets. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/mosaic/gpu/dialect_lowering.py"},"region":{"startLine":2028}}}],"partialFingerprints":{"codehealthFindingId/v1":"69c8be7b88e8ff1f7d3cc7f349b37d4f6cb58f04e4633bc8365d311c9694c31f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(olechwierowicz): Support multiple transforms. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/mosaic/gpu/dialect_lowering.py"},"region":{"startLine":2163}}}],"partialFingerprints":{"codehealthFindingId/v1":"57ddc60b5070e304a5b9e2e56b51a842db3693ce7a9b59b95140c419ae27244b"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(bchetioui): find a way to consolidate the logic that is shared logic with \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/mosaic/gpu/dialect_lowering.py"},"region":{"startLine":2251}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b7ec7fe042c7b17aa117427dd40950161a1ba7b053716983a7fd97390059d64"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(cjfj): simplify when minimum jaxlib version is 0.12. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/mosaic/gpu/dialect_lowering.py"},"region":{"startLine":2613}}}],"partialFingerprints":{"codehealthFindingId/v1":"983efc799758690e221f012820cd0d1609439046a0921297b401d5e32cc5e77e"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(bchetioui): remove \u0060getattr\u0060 once minimum jaxlib version is \u003E= 0.12.1. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/mosaic/gpu/dialect_lowering.py"},"region":{"startLine":2616}}}],"partialFingerprints":{"codehealthFindingId/v1":"939e972894438e0020944348860171b06adce17680820ab161b0a96eba560747"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(apaszke,bchetioui): Make sure the layouts match. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/mosaic/gpu/dialect_lowering.py"},"region":{"startLine":3030}}}],"partialFingerprints":{"codehealthFindingId/v1":"eba88abf2f85193b7b240857fe8c8ac21ac6125291e966780adcb5b971d0537d"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(bchetioui): rethink this API. It doesn\u0027t make sense to pass in a full \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/mosaic/gpu/dialect_lowering.py"},"region":{"startLine":3031}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f93c00a103213a1b344c66e5c5c33bb2031f40fa99ded3ce0ea04af154d65aa"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(apaszke): Support JAX dtypes here as well? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/mosaic/gpu/fragmented_array.py"},"region":{"startLine":2506}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c32a169c0a701ed374ccbd836d8c56dc479064a3edbf8cd5e59cf8948911613"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(apaszke,bchetioui): Using 8 helps some (but not all) cases. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/mosaic/gpu/fragmented_array.py"},"region":{"startLine":2641}}}],"partialFingerprints":{"codehealthFindingId/v1":"93ff0dc2417e1ca1e905bae24b0055fd1b7ab015679fea5de6939535d39d6e9f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(apaszke,bchetioui): Add the slice optimization here. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/mosaic/gpu/fragmented_array.py"},"region":{"startLine":2642}}}],"partialFingerprints":{"codehealthFindingId/v1":"767d529d6e0f0da7e41896de90361381c26c0809d26fb6fa12cb14be954ad9d3"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(apaszke): Figure out proper satfinite control. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/mosaic/gpu/fragmented_array.py"},"region":{"startLine":3070}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e8914ac163a948fe3c2fd53ac5a4281ed4e730e7baf6bc52bfab45e2255a7d2"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(bchetioui): support conversions between float types of width 8. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/mosaic/gpu/fragmented_array.py"},"region":{"startLine":3245}}}],"partialFingerprints":{"codehealthFindingId/v1":"10c2f5aa0ca9bbf7ed918a5cbe441f65d882216a341855a4d925bd8597c45e7a"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(bchetioui): support conversions between float types of width 8. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/mosaic_gpu/lowering.py"},"region":{"startLine":2444}}}],"partialFingerprints":{"codehealthFindingId/v1":"8eec2beb22cd1e633c123ce4f5589b73f38f8d5432adb3e6b0bccb18d81fae19"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(apaszke): Support other rounding modes. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/mosaic/gpu/fragmented_array.py"},"region":{"startLine":3275}}}],"partialFingerprints":{"codehealthFindingId/v1":"2dd7cd33ac93cb0ec9db0c9865cf1f4aa09681cc7cc9907934c0903e148db7e9"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(apaszke): Support other rounding modes. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/mosaic/gpu/fragmented_array.py"},"region":{"startLine":3279}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5a4e2a1c4e39c074efea011dccd31276a905abb86aeb4b3b0f90f0405195bee"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(apaszke): For associative reductions that reduce both inside and \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/mosaic/gpu/fragmented_array.py"},"region":{"startLine":3385}}}],"partialFingerprints":{"codehealthFindingId/v1":"52514135a754e5c0c7f2d4d6f069d4fb443d3b03f67ac1810961ee3609cc5c92"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(cjfj): Consider bumping to 16 for f16/bf16. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/mosaic/gpu/fragmented_array.py"},"region":{"startLine":3394}}}],"partialFingerprints":{"codehealthFindingId/v1":"b389adcaf11ec83ec108f9bfe084a0164706ee0ab5ea4093c3d8ddd0b107dc42"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(apaszke): Use redux.sync on Blackwell for f32. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/mosaic/gpu/fragmented_array.py"},"region":{"startLine":3397}}}],"partialFingerprints":{"codehealthFindingId/v1":"13060813ef31bd465da28c16543bc5349b1035f003bfab2c0b5fea80937e9b5a"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(bchetioui): investigate whether adding predication here can yield \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/mosaic/gpu/fragmented_array.py"},"region":{"startLine":3700}}}],"partialFingerprints":{"codehealthFindingId/v1":"18c6e6edf429c111ca51dbc736d708be3a550b003ad57571a0f70ea45a71b969"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(bchetioui): there are still load conflicts in the case where \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/mosaic/gpu/fragmented_array.py"},"region":{"startLine":3736}}}],"partialFingerprints":{"codehealthFindingId/v1":"576178be1ccaa6c09dfea7d99cc116fdeb76b1ab29d0be91ddb9da3ec442949c"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(bchetioui): these paths are optimizable. The above logic is \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/mosaic/gpu/fragmented_array.py"},"region":{"startLine":3754}}}],"partialFingerprints":{"codehealthFindingId/v1":"cdac8e8a3a520fcd96343771d71ddbf2f8e49b717099ade1829a2aab89cd5617"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(apaszke): All lanes that replicate data can share the same scratch. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/mosaic/gpu/fragmented_array.py"},"region":{"startLine":3803}}}],"partialFingerprints":{"codehealthFindingId/v1":"69ca9f1836b506b49f60fe7385af4e911674fcaad81c1b11afa75e00c3479c5d"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(bchetioui): explore pipelining computer\u002Bstore and loads\u002Breduce \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/mosaic/gpu/fragmented_array.py"},"region":{"startLine":3830}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f190db61ce99d095811984fff432b3ce2dc445939e37266156e38471605e226"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(apaszke): If the staggering forms a permutation with a small \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/mosaic/gpu/fragmented_array.py"},"region":{"startLine":5149}}}],"partialFingerprints":{"codehealthFindingId/v1":"672da5e214384de1eb92b6c41533f77cde495741e88242558d6d381eae3b08ab"}},{"ruleId":"D17","level":"warning","message":{"text":"XxxComment: # XXX: We must keep tx_pair_nested_tiled_dim minor! \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/mosaic/gpu/fragmented_array.py"},"region":{"startLine":5209}}}],"partialFingerprints":{"codehealthFindingId/v1":"b862e7c5395b38a7be2c83cda2e4ac08403dda4d94df9b00629126ffe018a07b"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(apaszke): We could also just change the layout to guarantee this. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/mosaic/gpu/fragmented_array.py"},"region":{"startLine":5493}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0da5f76fb82572d49d9e31c726b4f4802add7a371d09f2b7cf2063378270436"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(apaszke): Rewrite this function in terms of transfer_bytes (that we get \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/mosaic/gpu/fragmented_array.py"},"region":{"startLine":5638}}}],"partialFingerprints":{"codehealthFindingId/v1":"be5996d4c1212d18068a7522ac9ecf42f52dceab746a8c34ad779fee6565682b"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(apaszke): For now, when performing transfers narrower than a bank, \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/mosaic/gpu/fragmented_array.py"},"region":{"startLine":5670}}}],"partialFingerprints":{"codehealthFindingId/v1":"87dbd8d89cb4c9e09bb0499b63bffb874ca9fbf2c16f92491853e86aab4f10a7"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(apaszke): Pad to match alignment \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/mosaic/gpu/launch_context.py"},"region":{"startLine":923}}}],"partialFingerprints":{"codehealthFindingId/v1":"615e8c98d95b22d0d4a779d72557e4b75dcaf9436a8b59251e5795f1cdb21ed5"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(apaszke): Better verification (e.g. slice is non-zero) \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/mosaic/gpu/launch_context.py"},"region":{"startLine":1073}}}],"partialFingerprints":{"codehealthFindingId/v1":"5787396aa0ec2ed916ac9ab96a8a675d9d281096dd0fefe9ec50d3fe637066af"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(apaszke): We always know strides statically. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/mosaic/gpu/launch_context.py"},"region":{"startLine":1074}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c824b03cb78f3cec5e7913d6b7ef082dc9ede5eb407d4df4ad7887f2da22120"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(olechwierowicz): We cover only TMA path, non-TMA one has a separate \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/mosaic/gpu/launch_context.py"},"region":{"startLine":1258}}}],"partialFingerprints":{"codehealthFindingId/v1":"479b69ae8426608658077222808af93b7c4578b62926a62f25c688ac70d1d33d"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(bchetioui): move the creation of the \u0060TransposeTransform\u0060 \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/mosaic/gpu/launch_context.py"},"region":{"startLine":1362}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a7db6b9b8345eb85d68d8e7b473510ee7b0bf68c99ee88ad4e3cf57645ac881"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(apaszke): This should be quite easy? The only complication is that \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/mosaic/gpu/launch_context.py"},"region":{"startLine":1629}}}],"partialFingerprints":{"codehealthFindingId/v1":"69f62c4fb282107d1ebf612062208148c4244b641ca58be63581084f162a780d"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(apaszke): Just use the pointer directly. After all it is an arg. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/mosaic/gpu/launch_context.py"},"region":{"startLine":2766}}}],"partialFingerprints":{"codehealthFindingId/v1":"56f182b2989f24bd77311821b41fa2614c55f81d3613a5e0fbae53bef1d61d7e"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(bchetioui): flatten this call hierarchy. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/mosaic/gpu/layout_inference.py"},"region":{"startLine":446}}}],"partialFingerprints":{"codehealthFindingId/v1":"52cc9f5d0fdf4542b9dcd0ec542550b2685998e8755a4ca7447e40fdd88fd879"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(allanrenucci): We should be able to short-circuit the search here if \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/mosaic/gpu/layout_inference.py"},"region":{"startLine":489}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c3e1177b4d1209fdccfd585ae9d79fae9ab32ef519b3cb74b82faa1d6d7c626"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(olechwierowicz): Consider inferring a standalone swizzle here. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/mosaic/gpu/layout_inference.py"},"region":{"startLine":529}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ae665f270315796efb3e100dd36ddef5b23913cfcccf13318445d31f9b19f6c"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(bchetioui): should we have a way to give a useful dump to the user \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/mosaic/gpu/layout_inference.py"},"region":{"startLine":611}}}],"partialFingerprints":{"codehealthFindingId/v1":"32a87a7fd170a8a30b784c44a10e13c5ab0c0a9f8646dc3a0da4b490d2565052"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(bchetioui): let\u0027s see if we need to parametrize this by depth. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/mosaic/gpu/layout_inference.py"},"region":{"startLine":1025}}}],"partialFingerprints":{"codehealthFindingId/v1":"209a5efde79c0479e97fea91c71d44c54ecb36ba79aa1072467cfd1c08c35bbe"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(bchetioui): remove \u0060getattr\u0060 once minimum jaxlib version is 0.12.0. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/mosaic/gpu/layout_inference.py"},"region":{"startLine":1122}}}],"partialFingerprints":{"codehealthFindingId/v1":"5298837b998ecf52f6b72653a58ac8237f6aca8917fbed25f7948e3d07e2fb1a"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(allanrenucci): Add support for strided layout. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/mosaic/gpu/layout_inference.py"},"region":{"startLine":1367}}}],"partialFingerprints":{"codehealthFindingId/v1":"73be846872a803bad3d1bb79ef0e1253e7c1bb7a227c3746542a83092322d6c7"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(allanrenucci): Remove once vectors with splat and strided layouts \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/mosaic/gpu/layout_inference.py"},"region":{"startLine":1435}}}],"partialFingerprints":{"codehealthFindingId/v1":"e545ebc0b0986f10ffb49af544eeb61c339aa1f8e995f1d8111c0798b83f7ad5"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(allanrenucci): Remove once vectors with splat and strided layouts \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/mosaic/gpu/layout_inference.py"},"region":{"startLine":1467}}}],"partialFingerprints":{"codehealthFindingId/v1":"88921130689e6d580b8624222384d7727f8fe9725a4a99562f3265035d4e5b62"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(allanrenucci): Remove once vectors with splat and strided layouts \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/mosaic/gpu/layout_inference.py"},"region":{"startLine":1494}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7a3cc2288525e64339bea81112aa9eb53f88a080b5dfaa93816cc6d72ed2364"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(b/447079781): Consider creating the final constraint system using \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/mosaic/gpu/layout_inference.py"},"region":{"startLine":1529}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d13af039d774617a988750761dd52858bdd2b3996758e832d6a1cde5add7316"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(bchetioui): enforce that the parent is a TmemAllocOp. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/mosaic/gpu/layout_inference.py"},"region":{"startLine":1883}}}],"partialFingerprints":{"codehealthFindingId/v1":"aca1f7561b66fde07e989538310dcdc7e0c1c63d57f913855585dcb5eafa2fe8"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(bchetioui): We could generate an inverse expression \u0060ExpandShape\u0060 in \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/mosaic/gpu/layout_inference.py"},"region":{"startLine":2095}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ba041e7bf19c980c7acbe4b4e3355717c964fe194c18109e3bcd651742aed33"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(olechwierowicz): We should eliminate \u0060kNoSwizzle\u0060, representing \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/mosaic/gpu/layout_inference.py"},"region":{"startLine":2153}}}],"partialFingerprints":{"codehealthFindingId/v1":"f32a6f0fb9c6728c9a962b37ecdbd7959b257f8e01d351dc1e423224c2ff23a6"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(olechwierowicz): If only len(multiple) \u003C len(tiling) candidates \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/mosaic/gpu/layout_inference.py"},"region":{"startLine":2711}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ff955fe272fdcc910be35cd940483d061dc397cb0ef6f31be8bc13b36703283"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(olechwierowicz): We check for dynamic_gcd == 1, but a \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/mosaic/gpu/layout_inference.py"},"region":{"startLine":2723}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ae086731a06038c538fa7b35999b8950ca16d858b8f855458df6e383907d393"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(bchetioui): handle other constraint types. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/mosaic/gpu/layout_inference.py"},"region":{"startLine":2739}}}],"partialFingerprints":{"codehealthFindingId/v1":"e49a84865f39ac394b512ee15f9cf91dc5941d608f90d9081b7efa985f9949ad"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(bchetioui): add more error diagnostics. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/mosaic/gpu/layout_inference.py"},"region":{"startLine":2836}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d94ef5f6cc3a34770068060942d44ba5facaa0af9b91bd6831a3da914b70502"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(bchetioui): handle TMEM_NATIVE relayouts, which can be free. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/mosaic/gpu/layout_inference.py"},"region":{"startLine":2847}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae3eebbf517d90be30b55497bbc704a0e53c4c056ddccd85a646dafa2917cacf"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(bchetioui): refine to figure out whether it\u0027s a cheap relayout. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/mosaic/gpu/layout_inference.py"},"region":{"startLine":2870}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5c44fc76cb41c94fcbb54de3ea09b8a8fb97c1954020e87370fe456760fb542"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(bchetioui): rework this to raise a nicer error message here too. This \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/mosaic/gpu/layout_inference.py"},"region":{"startLine":2964}}}],"partialFingerprints":{"codehealthFindingId/v1":"897a7aa7f19783eaec12e0838003114805ed6d0d763f4de76d63eee60b2f84c7"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(bchetioui): Support sm_80 via the \u0060m8n8k4\u0060 MMA shape. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/mosaic/gpu/mma.py"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef80a8e93abaac77d8ab48a55b374caa2d74952d0ad2a2f24712f5db1dbe0869"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # todo(cperivol): A tile shape can have dimensions that are higher \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/mosaic/gpu/mma.py"},"region":{"startLine":225}}}],"partialFingerprints":{"codehealthFindingId/v1":"11e81fdff742259131a12ba4383f375ff6e94dd6f092c0e152dc4d44d29b488f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: We only need to check this if N is the minormost dim in B. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/mosaic/gpu/tcgen05.py"},"region":{"startLine":311}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6b2367cad6f364e0a021007f928bc854cde1998e7249f49d7d7b638e154d93a"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: We could relax those constraints if we have multiple n_lane_groups, \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/mosaic/gpu/tcgen05.py"},"region":{"startLine":439}}}],"partialFingerprints":{"codehealthFindingId/v1":"10891a2837c1ee56185930f668bd43fa5c77bc65a6a42dc8532f484b87b05b6b"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(apaszke): Require users to bitcast input refs to tf32 before MMA. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/mosaic/gpu/tcgen05.py"},"region":{"startLine":451}}}],"partialFingerprints":{"codehealthFindingId/v1":"3fa4471073d0a93f1a2f49591ceaddee639adb66bec5d331a0ab5fa3126521f9"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(olechwierowicz): Lift this restriction once collective M=128 MMAs \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/mosaic/gpu/tcgen05.py"},"region":{"startLine":534}}}],"partialFingerprints":{"codehealthFindingId/v1":"59c00e9257dbc306a2b53380ad231302d6122716eed46c90e5bf305cb21f00c3"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: support larger K values on newer hardware \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/mosaic/gpu/tcgen05.py"},"region":{"startLine":715}}}],"partialFingerprints":{"codehealthFindingId/v1":"2dff04ddf9f4169ec87de938a415d8f60eeaeae5e40ed0725ff2024a5716a83e"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(apaszke): This does not really describe this layout and we can\u0027t do it \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/mosaic/gpu/tcgen05.py"},"region":{"startLine":1299}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1f08a7a997160b9edfb1633769cb7e2fac9a33b4dbea4e513f34efc6bd3262a"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: Do we have to do this?? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/mosaic/gpu/tcgen05.py"},"region":{"startLine":1354}}}],"partialFingerprints":{"codehealthFindingId/v1":"a26972de662cfd296c9d5986cdd407a53823338d91d1347d977b5f129d92ee71"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(olechwierowicz): \u0060sparse_meta_layout()\u0060 does not really describe the \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/mosaic/gpu/tcgen05.py"},"region":{"startLine":1472}}}],"partialFingerprints":{"codehealthFindingId/v1":"45c452401915e55e7d6fe3b896654fe6e935e31d2b0237a3a9564e43e9b65e57"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(olechwierowicz): \u0060sparse_meta_layout()\u0060 does not really describe the \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/mosaic/gpu/tcgen05.py"},"region":{"startLine":1588}}}],"partialFingerprints":{"codehealthFindingId/v1":"77a93d0d0fc82d3e10a1eb1d7b376248a226dddd72b860cbf2d974624198a3a6"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(apaszke): We raise NotImplemented here because technically for some \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/mosaic/gpu/tcgen05.py"},"region":{"startLine":1496}}}],"partialFingerprints":{"codehealthFindingId/v1":"02b0a04e0e7b4bb68d05892edf40495bbd434a22f47757840152e7296d44b955"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(apaszke): Support the case where we have a long vector length in the \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/mosaic/gpu/tcgen05.py"},"region":{"startLine":1510}}}],"partialFingerprints":{"codehealthFindingId/v1":"62d6cc692f276009ee2cf2f48bbedde2ab42701bb710f578a09f4a43d5e24a2c"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(apaszke): Support the case where we have a long vector length in the \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/mosaic/gpu/tcgen05.py"},"region":{"startLine":1606}}}],"partialFingerprints":{"codehealthFindingId/v1":"8cfd20dd8c21a186e6f78806d05ef07985e10856c5a737350231f96363993ed0"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(apaszke): Support a wider range of layouts when dealing with unpacking. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/mosaic/gpu/tcgen05.py"},"region":{"startLine":1608}}}],"partialFingerprints":{"codehealthFindingId/v1":"d510930fefc9d0b832acb58b9708570e4a1558e1a2b40ecd72d94abf6a417412"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(apaszke): Make this print logical, not physical location. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/mosaic/gpu/tcgen05.py"},"region":{"startLine":1655}}}],"partialFingerprints":{"codehealthFindingId/v1":"9018d8a3160aab0c7541eb3cef72c4f547967acd5314e30bb8fbb529694d5d18"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(apaszke): More general register splitting code, not just 2x32b. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/mosaic/gpu/tcgen05.py"},"region":{"startLine":1750}}}],"partialFingerprints":{"codehealthFindingId/v1":"c19569c4f0c81cfcf8958657e3384e2dfea63c7fb518398c6a0a7b820876fe87"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(apaszke): This should only matter for the two minor dims. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/mosaic/gpu/tcgen05.py"},"region":{"startLine":2008}}}],"partialFingerprints":{"codehealthFindingId/v1":"86d4e21ad2c91df3d0cc082a8e57d2727a92656fb93a1dfad96bd1e8180c9431"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(apaszke): Need to figure out the TMEM layout otherwise and MMA doesn\u0027t \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/mosaic/gpu/tcgen05.py"},"region":{"startLine":2052}}}],"partialFingerprints":{"codehealthFindingId/v1":"4408fa8275e2fff646f95844658b3be61001036a69d62d3fd404d95d8e36ddcf"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(bchetioui): revisit whether this default of writing to stdout is the \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/mosaic/gpu/utils.py"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"7852a60afcdf0960aefb67150b9787e258ab08142a722a9a7b51c753475858e4"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(apaszke): Check that slice is within the memref (indices might be \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/mosaic/gpu/utils.py"},"region":{"startLine":756}}}],"partialFingerprints":{"codehealthFindingId/v1":"537b93f0aa9ef17f2ac3512f53490dc26de6758667be609eefce7ec6edb6feba"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(cperivol): Implement dependent fold-unfolds for subsections \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/mosaic/gpu/utils.py"},"region":{"startLine":823}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6669052055ae0b0f0d68eb836d2e912929fdd0a1864a8e68c8e0d24e8054929"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(apaszke): consider using a single lane \u002B barrier for waiting \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/mosaic/gpu/utils.py"},"region":{"startLine":1319}}}],"partialFingerprints":{"codehealthFindingId/v1":"1852166c9b229c97d90ef1171bde0d97c439c48da892dcf72618c9a93c619578"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(slebedev): Why is it safe to use None here? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/mosaic/gpu/utils.py"},"region":{"startLine":1563}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1282695e11ffb65829251bceec4dfc001b2d1953e6785d6b4076e0ce96bd483"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(bchetioui): expand for multiple collective dimensions. Not sure \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/mosaic/gpu/utils.py"},"region":{"startLine":1586}}}],"partialFingerprints":{"codehealthFindingId/v1":"e998f9a092073d260ec7faa1c15a5a600661ca50d50093c222b1459e52f3ad92"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(bchetioui): adapt or delete case of dims containing sequences \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/mosaic/gpu/utils.py"},"region":{"startLine":1592}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f1860c2b44bde0804ae9869fda5315c3cbee6a68cb582a6209b5530c4a9d530"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(apaszke): Make sure this gets hoisted outside of any loops. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/mosaic/gpu/utils.py"},"region":{"startLine":2098}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ea228c3c6cedb04e5192f2cf80172e8f52e5dae93a14e8fdf393973d0bd343e"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(apaszke): Remove this once we figure out the export story. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/mosaic/gpu/utils.py"},"region":{"startLine":2678}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c6753290c408e5c77c5e1ad949ca8a185dd6006bd1b12c415ed12f20b51b89e"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(bchetioui): add u8 support in the future. Currently we always \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/mosaic/gpu/wgmma.py"},"region":{"startLine":223}}}],"partialFingerprints":{"codehealthFindingId/v1":"a26b370ed0ae3c3a5ae90b1174d1ed92e7725b3acf7e1f3a8d52aed2ed560679"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(apaszke): Require users to bitcast input refs to tf32 before WGMMA. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/mosaic/gpu/wgmma.py"},"region":{"startLine":400}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d0f620145667477c553aa2eba6d73c3f21a28929c62fe8630ca28a55335577f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(apaszke): Implement a Q-scaled, base2 exp implementation. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/mosaic/gpu/examples/flash_attention.py"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ce541055db000ca5e87a79d3cc82b09488ee3354d7e1fa74bfafd413c6b136f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(apaszke): Support WGMMA without an initial accumulator. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/mosaic/gpu/examples/flash_attention.py"},"region":{"startLine":219}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a8a1fb6d4a20f990ecfcf0b21aa7196c19b171c8c4eb0d6cf5b28005c55a35b"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(apaszke): Support WGMMA without an initial accumulator. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/mosaic/gpu/examples/flash_attention.py"},"region":{"startLine":441}}}],"partialFingerprints":{"codehealthFindingId/v1":"180e49b4b641199cc7e2b5e9fbed5a5ebaa30d5c674e8882ae669400e048fab6"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(jakevdp) should we generate an unknown signature here? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/key_reuse/_core.py"},"region":{"startLine":228}}}],"partialFingerprints":{"codehealthFindingId/v1":"10cea4e483959e7e3bbc3b0af0074979688c13191d32a6ee87fffe8603327db3"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(jakevdp): should fold_in sink its input key? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/key_reuse/_core.py"},"region":{"startLine":293}}}],"partialFingerprints":{"codehealthFindingId/v1":"9fda8f20cc518308d54e398cbaca8c70236bbb259b298d4227b575f234d46067"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(jakevdp): broadcast should probably consume the input to avoid implicit duplication \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/key_reuse/_core.py"},"region":{"startLine":298}}}],"partialFingerprints":{"codehealthFindingId/v1":"b08e42bee397472c62c2348011e96fe886d8c6f6d8babd2372a447fe0a08c8c7"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(jakevdp): should unwrap sink its input key? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/key_reuse/_core.py"},"region":{"startLine":309}}}],"partialFingerprints":{"codehealthFindingId/v1":"b678f80d8bb6cb9277959cf93fde2523f40aafd59f31867a3db0bf2bb586ee51"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(jakevdp): should this signature be more granular? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/key_reuse/_core.py"},"region":{"startLine":459}}}],"partialFingerprints":{"codehealthFindingId/v1":"49dacc159fb8cfcba5a72f7acce9afff12596ad5fea02056b7911a51db73a34e"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(jakevdp): check that masks match \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/key_reuse/_core.py"},"region":{"startLine":517}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce9b514d80cad64ff2e192710cfc17bdcd13ee1f9d8e975d019c5eeb075a5c1c"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(jakevdp): check masks at each index? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/key_reuse/_core.py"},"region":{"startLine":551}}}],"partialFingerprints":{"codehealthFindingId/v1":"fbcc20c889be4bb5817f1d92cd652d4e6868f9246f2a8a04b7d8f4d569f42aa0"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(jakevdp): should we use an unknown signature here? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/key_reuse/_core.py"},"region":{"startLine":593}}}],"partialFingerprints":{"codehealthFindingId/v1":"4458cb8059b2fcfd00d65412a31e48f4b6be1a2dc95a505419964230e314ec97"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: deprecate \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/jax2tf/__init__.py"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"1231a8b7bdac9981e721c4894905d231939dd15aa8e75c1745c4e868bcc69fdb"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: deprecate \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/jax2tf/jax2tf.py"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d5075bb7bc8bdcdc5aa2087393b11bceb22e621128bc060964749023a104b63"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: deprecate \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/export/shape_poly.py"},"region":{"startLine":1486}}}],"partialFingerprints":{"codehealthFindingId/v1":"090d66492223cfe776a60b02aa546f2046ba70b42dd34b3c43dbdbfb657e1027"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(b/279454591): This strange error is from TF. Eager function suppose \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/jax2tf/call_tf.py"},"region":{"startLine":312}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6cf65b426f53aba7eb588512e5d2328c0ec2d84d556d1179b72d382715a1479"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(necula): on TPU this copies to the host! \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/jax2tf/call_tf.py"},"region":{"startLine":352}}}],"partialFingerprints":{"codehealthFindingId/v1":"a00db20fd5b280e31c3f9ca7d3329b8bc0c4924a90236feef9147a26c792c9cd"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(necula): It is dangerous to modify global state when lowering because \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/jax2tf/call_tf.py"},"region":{"startLine":675}}}],"partialFingerprints":{"codehealthFindingId/v1":"281dadcea4a53ad140126be7e8ceb51562a20cf1209c7808897f19fbfb1e2f13"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: is there a better way to check if we are inside a transformation? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/jax2tf/jax2tf.py"},"region":{"startLine":252}}}],"partialFingerprints":{"codehealthFindingId/v1":"494d398ee75b8658303694fce4ace102e06b7ee150d376b0f46f7a2f975c21f5"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(necula): For now we export the polymorphic shapes using \u0060str\u0060. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/jax2tf/jax2tf.py"},"region":{"startLine":456}}}],"partialFingerprints":{"codehealthFindingId/v1":"614fc8db5ad35826747e1924bbd3e26d2c7c05e2b60702087e67b3ea0c0e44e9"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: enable higher-order gradients \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/jax2tf/jax2tf.py"},"region":{"startLine":511}}}],"partialFingerprints":{"codehealthFindingId/v1":"b01bcd1d2ea26d5fe179635e82f84d6fc019d26ad5870495d12a6c788f0d9428"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(b/278940799): Replace the TF v1 API with public TF2 API. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/jax2tf/jax2tf.py"},"region":{"startLine":650}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b0aee38000786b20bbb971a53d5ae57d8849e2cba9672ac0ad7262aa4bfd367"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(document): We assume that the value of a constant does not \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/jax2tf/jax2tf.py"},"region":{"startLine":752}}}],"partialFingerprints":{"codehealthFindingId/v1":"053e46110a415b14208f27d6b9e0ca94ed9cc3b16ab7b7534fc8655e475e291c"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: this is only for sharded_jit. Either remove, or implement in terms \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/jax2tf/jax2tf.py"},"region":{"startLine":804}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9f52ebf07ba751acec8e92582aa8bb1eb222fba6361a8253eb9ffc5fd882197"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(necula): if we remove the tf.function and we have multiple platforms \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/jax2tf/tests/call_tf_test.py"},"region":{"startLine":803}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e7db43b40c69d4815382ceb111edc943e96a0e3cbca4c02adaa3f94161bffa6"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: clean this up b/191117111: it should fail with a clear error \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/jax2tf/tests/call_tf_test.py"},"region":{"startLine":1027}}}],"partialFingerprints":{"codehealthFindingId/v1":"5bcf2ab8cc29fed7f1bb722b8823d586806137b1d73030c636d1cfeb02023a58"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: clean this up b/191117111: it should fail with a clear error \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/jax2tf/tests/savedmodel_test.py"},"region":{"startLine":152}}}],"partialFingerprints":{"codehealthFindingId/v1":"fcd388fbdef7dd300344342448770ad140c56fa52a8e6e4f5c5eafa00f74d5f4"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(necula): this should work in op-by-op mode, but it fails because \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/jax2tf/tests/call_tf_test.py"},"region":{"startLine":1275}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d26259a7e1048e1162ac7f6e4218a2ed42da4b9e154990b50e9dda8b4d64dfc"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: in jit more the error pops up later, at AddV2 \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/jax2tf/tests/call_tf_test.py"},"region":{"startLine":1348}}}],"partialFingerprints":{"codehealthFindingId/v1":"a19fcfdd40cae0e967b829b4d67d9af52f78c31072348a53e7e1ac41b8374cf1"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(b/268386622): call_tf with shape polymorphism and native serialization. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/jax2tf/tests/call_tf_test.py"},"region":{"startLine":1351}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b0a08e289d20eb29c5a3c37fe2b89267b5ce22adfe740cd53202bf6e2c5a7c1"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(b/293927250): call_tf_graph=True only accept concrete_function. The \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/jax2tf/tests/call_tf_test.py"},"region":{"startLine":1710}}}],"partialFingerprints":{"codehealthFindingId/v1":"85689c25d00f0ffb2361d76f12d0a94edcf6c1cb8bac61597f069099175e5146"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: replace this with JAX cross-platform API, without going through \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/jax2tf/tests/cross_compilation_check.py"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"518939fcaa17312035eae1e93dd996fd62202f7123b352688bd25dd6769011e2"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: it would be best if the limitations with tolerance are mutually exclusive \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/jax2tf/tests/jax2tf_limitations.py"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f9e2daa25de0100a5b5b58b4319f95878d1f66918604e99213507065ee1107a"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: we made this an instance method only so that we don\u0027t have to import \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/jax2tf/tests/jax2tf_limitations.py"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"054af9e9530b6e5c0f6e3d604d1f1f8d62ee20fb307e8ae1d009bf3d07a0ee50"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(bchetioui): discrepancies between TF \u0026 JAX when comparing with NaN; \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/jax2tf/tests/jax2tf_limitations.py"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"95ce9259df00e3ca519398444766dd0468ae34799197f15ece297f792329455b"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(bchetioui): discrepancies between TF \u0026 JAX when comparing with NaN; \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/jax2tf/tests/jax2tf_limitations.py"},"region":{"startLine":170}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a2f0ae66eb64772e729b215d58cb89f39214018c2efea8c74987b14b0e37e2d"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(b/269996580) \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/jax2tf/tests/jax2tf_limitations.py"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"631baa2eca3f59db482f1eb9384fcd8dbbaeebab80e7e2279c73d8bc2c988f5a"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(b/269996580) \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/jax2tf/tests/jax2tf_limitations.py"},"region":{"startLine":177}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5ec7dd378fe5b818fff02d992b69653049978eafb8d3529ce5efc317bc16ff3"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(b/207464757): TF compilation is disabled \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/jax2tf/tests/jax2tf_test.py"},"region":{"startLine":203}}}],"partialFingerprints":{"codehealthFindingId/v1":"464522d2ccce692a63227ab106a95368ef681187ad5ec0bd0fa35e7950cdc91b"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(marcvanzee): This fails when \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/jax2tf/tests/model_harness.py"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d77f20ac1c8f86f63f277dfe499e7d25119134c23b313bab72b3ed5fd152b09"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(marcvanzee): Figure out the right multiple for these dimensions. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/jax2tf/tests/model_harness.py"},"region":{"startLine":286}}}],"partialFingerprints":{"codehealthFindingId/v1":"7cedc8df5302209f23cb69ba8ec237d3420b04e5c7afd97a2794e2e7566dc000"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(marcvanzee): Figure out the right multiple for these dimensions. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/jax2tf/tests/model_harness.py"},"region":{"startLine":315}}}],"partialFingerprints":{"codehealthFindingId/v1":"eef1c276b3ac6fce991ae5d8ce58c10c1f58ae5d7c9a818a085f4cdef0cfb5fc"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(marcvanzee): Figure out the right multiple for these dimensions. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/jax2tf/tests/model_harness.py"},"region":{"startLine":335}}}],"partialFingerprints":{"codehealthFindingId/v1":"a592b2822a20543470e46824e87121c9f711feef635a4575e70247751af759f2"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(marcvanzee): Figure out the right multiple for these dimensions. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/jax2tf/tests/model_harness.py"},"region":{"startLine":414}}}],"partialFingerprints":{"codehealthFindingId/v1":"61c87b462204d2dc09739ee92bbaf76d1dcc38a4cbd518bb21888c358d98c42c"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(b/264596006): custom calls are not registered properly with TF in OSS \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/jax2tf/tests/primitives_test.py"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"699c2c1e2fe15265362d4ebdb693b0618437943d160d3c440a46d58a863e9240"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: there is a problem if we add a None output \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/jax2tf/tests/shape_poly_test.py"},"region":{"startLine":750}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad9c465fc533b5e89c533c241f52d184fc0aeff2d0dfe581e16f725226e25578"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(necula): TensorFlow doesn\u0027t support getting the optimized_hlo on TFRT \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/jax2tf/tests/sharding_test.py"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"46df3e407f185a94754508b272405df791776ca62ab7f99def05b9e2baf2a500"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(b/326476605): Change the condition below if required. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/jax2tf/tests/sharding_test.py"},"region":{"startLine":242}}}],"partialFingerprints":{"codehealthFindingId/v1":"21f8292c7bd08c0d3ced35e8083032ce81ca921e787cdd9f569ab5339e519773"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(b/326476605): Change the condition below if required. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/jax2tf/tests/sharding_test.py"},"region":{"startLine":433}}}],"partialFingerprints":{"codehealthFindingId/v1":"7286d76fd78aa8296bec2905a0780a7fa53a65c508ee42fb483a34fc046adad3"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(necula): move this test also to use jit. Currently, if we replace \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/jax2tf/tests/sharding_test.py"},"region":{"startLine":338}}}],"partialFingerprints":{"codehealthFindingId/v1":"038a9fbb125b5df0120f4b09ccd1e0316c2fbc4e7393dda6c925b6160cbd0e81"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(necula): clean up the test harnesses to not require these flags \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/jax2tf/tests/tf_test_util.py"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"4edea88a3660046c2adf0a9e21d7e8c8aa105a86e7dce1705c4070b82704840e"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(hyeontaek): Remove this fallback path once a PjRt-IFRT backend defines \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/colocated_python/api.py"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"2670bb6def40266a06a3599e5096551fdf475b79a72de055b4694caadbbac783"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(hyeontaek): Allow Python values and automatically apply \u0060shard_arg\u0060 \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/colocated_python/func.py"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"18416cf9684978c430beb4fb99f038b8f40b25b5524d3c7fe479d2e39311cc46"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(hyeontaek): Implement colocated Python support in McJAX and remove \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/colocated_python/func.py"},"region":{"startLine":322}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1348debd2555aff8ec16ad3b80b2dd965217d23c3606e444d4b943ba512d19e"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(hyeontaek): Allow Python values in args_leaves, similar to the todo \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/colocated_python/func.py"},"region":{"startLine":594}}}],"partialFingerprints":{"codehealthFindingId/v1":"febfc756bed0296f4ea769f123253cb17c807c54de3218cf29b74b55c2baea8d"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(hyeontaek): Allow unspecified devices for zero-leaf \u0060in_specs\u0060 if \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/colocated_python/func.py"},"region":{"startLine":737}}}],"partialFingerprints":{"codehealthFindingId/v1":"9fd252bf9848f5a0d1531e2dc9542db0e08ce34e0740c1b6d31adc5e3e186cd5"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(hyeontaek): Instead of inspecting argument/result shardings, get \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/colocated_python/obj.py"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"29d5a6bf97a48edcaf56505b6a38fa502060a4f86598a8485d47d6152c6d06f0"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(hyeontaek): Support method specialization similar to function \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/colocated_python/obj.py"},"region":{"startLine":202}}}],"partialFingerprints":{"codehealthFindingId/v1":"6947b535680285c91244d7de80ec79d250781931a9741f0f343e5bc56f5f9c7d"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(hyeontaek): We should look up CPU devices for a specific CPU backend. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/colocated_python/serialization.py"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"c676910d0fdaee7f201c9b969639b39e98fa694de84756eea9ec76a4449b6154"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(jmudigonda): Revisit this when JAX supports HLO sharding for making \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/colocated_python/serialization.py"},"region":{"startLine":328}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e9d71247a710447dfdb80578b5cf12184475e8b7e808cf00b7916840bf21aef"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(rdyro): the awaitable future output is a workaround \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/array_serialization/pytree_serialization.py"},"region":{"startLine":508}}}],"partialFingerprints":{"codehealthFindingId/v1":"02606e02e273806688dd23aa34143bc4f23b9403f2f2ad7b57eecb668c27811f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(rdyro): Remove when serialization supports non-arrays \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/array_serialization/serialization_test.py"},"region":{"startLine":1041}}}],"partialFingerprints":{"codehealthFindingId/v1":"5358b89cf87e1284b2a5fcb51056314e33005733800a7f7714039f45ab79e15b"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(rdyro): think of a better way to detect which leaf is a ts config \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/array_serialization/tensorstore_impl.py"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"514152d084e1ebdde80ae3acaa12868dc6c82ec56ea6eb1d72169509ae06168d"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(rdyro): this is an opinionated merge, we should get user feedback \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/array_serialization/tensorstore_impl.py"},"region":{"startLine":182}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5d39dcc0062e68b5ddfee395e55007720ed7c48444bb6f9f1a545fe98ca8188"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(rdyro): Remove this function. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/array_serialization/tensorstore_impl.py"},"region":{"startLine":464}}}],"partialFingerprints":{"codehealthFindingId/v1":"e780396bd181134b66ea32754716718753bde92c7d1dba741094ba4ae18c235a"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(rdyro): Remove this function. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/array_serialization/tensorstore_impl.py"},"region":{"startLine":586}}}],"partialFingerprints":{"codehealthFindingId/v1":"1734aa39226240c4b972e3e084aca9011418fb0313ab1e6ff78481c0318b35af"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(yashkatariya): This is a band-aid fix. Figure out a better way to \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/array_serialization/tensorstore_impl.py"},"region":{"startLine":561}}}],"partialFingerprints":{"codehealthFindingId/v1":"aab604cab5458c1a2994ffc389a6c6ccaf7aa41c0e872142b20aef5e2c9bb904"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(phawkins): jnp.expand_dims should accept an axis tuple. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/example_libraries/stax.py"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"62af13bcbb9825155a6c1ceb471b6ddfd102aa32ba3c15544c238de300c1cd46"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO TODO this policy probably just doesn\u0027t work, split off this change \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/ad_checkpoint.py"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2f8e45ce0da98f340f83936a0a3f1196efbe281f24d2caf892a68029155c0c1"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(mattjj): actually we want to flag this case as problematic, ie some \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/ad_checkpoint.py"},"region":{"startLine":521}}}],"partialFingerprints":{"codehealthFindingId/v1":"f373e3d0389bba3a99776f53e3936b1eeabca9f43b414274242afd495da3646a"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(mattjj,sharadmv): de-duplicate with pe.dce_jaxpr_call_rule \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/ad_checkpoint.py"},"region":{"startLine":789}}}],"partialFingerprints":{"codehealthFindingId/v1":"0016ec63f142263bcf325e168bb63da67205e65e6a5e168c4958fdb159d7ee14"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO eval_jaxpr_p trace time \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/ad_checkpoint.py"},"region":{"startLine":1088}}}],"partialFingerprints":{"codehealthFindingId/v1":"634cf1560df1c87ff195a9c12aed68858cbcb98e8ecd6c7995c2d8da8780d689"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO don\u0027t instantiate \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/ad_checkpoint.py"},"region":{"startLine":1140}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ba56c6bbbcece6230b3194b19a8981fe2a5bb18d66115617d84b106010b6c37"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(mattjj,frostig): this forwards attr lookup to self.aval delegate; \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/ad_util.py"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"d93583cc75ee75c5e757f795676f4321c44e9957f26ef1e4b229a68c173f9bdc"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(mattjj): remove these after fixing downstream users relying on them \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/ad_util.py"},"region":{"startLine":172}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e57bc3211882a7289dea38afacb3e3439ec90b30edd475197309c5fb2a34df3"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(emilyaf): Shouldn\u0027t need this fallback. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/api.py"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc58a48e6106f02c22b16849d4cb2dfadf20ad12b4808c7766368a8297c01cff"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(slebedev): This ought to be a decorator, but it seems it makes \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/api.py"},"region":{"startLine":352}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3411500fb6057cbc3f6e9358a1eadf3fd8c742a7acbde986aeb2e49885907be"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(mattjj): better error message here \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/api.py"},"region":{"startLine":1340}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d735f6471241fbc3842933674d638638265600bd0cda3b49e33791f81023ed6"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(yashkatariya): Tweak error. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/api.py"},"region":{"startLine":1608}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec9def14301cbd5b6a166039647305ffbdc891c8a63fbe1a2d2456fb37c21a2d"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(mattjj): see similar function in custom_derivatives.py \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/api.py"},"region":{"startLine":1634}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a629be2ff1b020a07325f6c9508392c8c339212f215c45f1a80263a9e2d6e53"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(mattjj): improve this error  by flattening with keys in the first place \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/api.py"},"region":{"startLine":2016}}}],"partialFingerprints":{"codehealthFindingId/v1":"6533f522ff0d5084f62c7e5679ef9bf80caa793ad9d128f798d2072fd2f8582b"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(jakevdp): provide a default for devices that considers both local \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/api.py"},"region":{"startLine":2534}}}],"partialFingerprints":{"codehealthFindingId/v1":"a54d23a8827ab8060c600929ed4a85635e6e2c3de8b649b31afbca56086ce9e2"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(mattjj): consider revising \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/api.py"},"region":{"startLine":2618}}}],"partialFingerprints":{"codehealthFindingId/v1":"3638e09a17cead37523bb2d18113391019558ccb3ff0d365335572451804a4ae"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(parkers): Figure out how to make this a single gc.collect() call. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/api.py"},"region":{"startLine":2933}}}],"partialFingerprints":{"codehealthFindingId/v1":"ddf9200fdcb923dc6e764205f5d5ec9cb01ced0c6a0f2cd995f773bd14775a03"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(mattjj,apaszke): disable implicit list casts, remove \u0027or list\u0027 below \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/api_util.py"},"region":{"startLine":448}}}],"partialFingerprints":{"codehealthFindingId/v1":"feec03f2a075bdb2904964e200e7cb555270fc11290a2c5f4a7cf30e5a615d41"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(mattjj): currently hardcoded for pmap; generalize to vmap in followup \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/api_util.py"},"region":{"startLine":499}}}],"partialFingerprints":{"codehealthFindingId/v1":"425db1de9838a2b7710e18c17b18eb0982c1cb2c80ffe50a84440328bd9cee93"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(necula): check if we really need this, e.g., to speed up tracing? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/api_util.py"},"region":{"startLine":661}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d72c2d122218d4931e4425bfa0936a9ecee1d099bc4557cfa1b1b4c7ebec0eb"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(mattjj): make this function internal to this module \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/api_util.py"},"region":{"startLine":698}}}],"partialFingerprints":{"codehealthFindingId/v1":"754821e23067b593cb5121b8cdc27263d6f5134bd0ac9b2564d4d360f828d0b1"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(mattjj): make this function faster \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/api_util.py"},"region":{"startLine":774}}}],"partialFingerprints":{"codehealthFindingId/v1":"0fa7f99e464d997c50dde2c897a5c42bbf60f849eb4cdd602c45ddfd70d630d6"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(jakevdp): fix cycles and import this. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/array.py"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"07afc93be1f701e312e3e9d351a4ba69918c6c021a95db08f06ffe41823c02d3"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(yashkatariya): Don\u0027t bounce to host and use \u0060_chunk_iter\u0060 path \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/array.py"},"region":{"startLine":206}}}],"partialFingerprints":{"codehealthFindingId/v1":"27ff4479987954bb67a33f04c1f8e9e4ae940c69a9988308696514456ccda978"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(yashkatariya): Remove the deleted check from here. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/array.py"},"region":{"startLine":569}}}],"partialFingerprints":{"codehealthFindingId/v1":"15d0c960ae24648ce65fbb11bea2aca206d03f9d964e09adc748c64a72d65ec5"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(yashkatariya): Merge \u0060_process_has_full_value_in_mcjax\u0060 with \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/array.py"},"region":{"startLine":657}}}],"partialFingerprints":{"codehealthFindingId/v1":"96f33b9d7eda270fd6a29469123b88e77ff6e8279b9e427abb85614044028cec"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(yashkatariya): Remove None from callback input type. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/array.py"},"region":{"startLine":712}}}],"partialFingerprints":{"codehealthFindingId/v1":"86305eff37f81c63f062b7a0cfc6bcf5e988ea564cfe1332772a8c953abe4577"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(yashkatariya): Can this also use batched_device_put? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/array.py"},"region":{"startLine":829}}}],"partialFingerprints":{"codehealthFindingId/v1":"4687c4ba4a594901e5d9c037135d7a5e59a8a461d5297bf7fab5aff42ec4fb21"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(sandler): consider supporting partially specified global_shape or \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/array.py"},"region":{"startLine":992}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e7efe22b83dfa08f4fde76e20ee2cf77b20c499e1ecf74bf127974f8e3a8ef8"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(phawkins): ideally the cast() could be checked. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/array.py"},"region":{"startLine":1109}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e538089d1344769109ff0ce6a36ec21b43f19e53446db3c8aae7cb8babcbf89"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(yashkatariya): Ideally we would catch a custom exception from \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/array.py"},"region":{"startLine":1257}}}],"partialFingerprints":{"codehealthFindingId/v1":"64952e29d5051c5605e383433a01ece966da462e7c62736e04a3615636421a2e"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(yashkatariya): Maybe this should be set when we call the handler in \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/array.py"},"region":{"startLine":1310}}}],"partialFingerprints":{"codehealthFindingId/v1":"354cbe6ed7dafc2acba47242c7050182f917a53b9413e94e5b17f5c5fd667438"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(jakevdp): fix import cycles and define these. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/basearray.py"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"66b1c3b1396fba51001b03f7b981004a2310dc714f90067ee830700dc480f728"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(jakevdp): set __numpy_dtype__ = None after deprecation period. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/basearray.py"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"0514c7f09eccf7b68b44026fd2ef782d119e95e358ecf053a1761212de36052c"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(phawkins): On TPU, these have an embedded channel ID that should be \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/callback.py"},"region":{"startLine":244}}}],"partialFingerprints":{"codehealthFindingId/v1":"51ae6e604b26c20c42f53b71e5cd6933b61fc1f2aa43b46776347713a9ba4efb"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(phawkins): On TPU, these have an embedded channel ID that should be \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/callback.py"},"region":{"startLine":535}}}],"partialFingerprints":{"codehealthFindingId/v1":"6dba94694c2d2399e3a504eaaa679265b464cd6d9575999c00d9157ab8881e10"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(sharadmv,chky): Enable this fix in the runtime as opposed to in \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/callback.py"},"region":{"startLine":712}}}],"partialFingerprints":{"codehealthFindingId/v1":"cbe7c23acfa615f8b3f4b1f4b6c6c2f0ffcecd9c51c6a957f7e10029e7f1fc43"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(b/238239458): fix TPU Recv to work with empty arrays. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/callback.py"},"region":{"startLine":836}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5b5c4a22fd694248c2a60f5ac1b6a293ef5ccd61192c2ee19cfac00f7f7f2fe"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(dsuo): Remove this line once we deprecate the XLA custom call \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/callback.py"},"region":{"startLine":888}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa00d89aad4be3a55ee960a2982b074ddd942009309be41a050b34ae5705bffe"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(lenamartens): re-enable tracebacks when they don\u0027t leak tracers. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/checkify.py"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"b265a3e989b680755c2a35e5a156a618500012f26257f837aeab04a82dbb7f73"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(lenamartens): inherit from Exception instead of ValueError. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/checkify.py"},"region":{"startLine":490}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2f8764ac3e6d8e7694404ae02aa79bbbae18d083bd9a24eeeb9b90e595c9efa"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(lenamartens) add in-depth error explanation to link to in module docs. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/checkify.py"},"region":{"startLine":513}}}],"partialFingerprints":{"codehealthFindingId/v1":"6bb223b689fd3b0905e28aed8bb91b228ac00169ce511a34a90799995880c50d"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(lenamartens, sharadmv): support batched while. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/checkify.py"},"region":{"startLine":914}}}],"partialFingerprints":{"codehealthFindingId/v1":"edcd7cd3cde66a3b1f7961ebc9a8ca06735dbdd68d6889063efa3942c64007e9"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(mattjj): can we simplify this, or dedup with custom_derivatives.lift_jvp? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/checkify.py"},"region":{"startLine":1134}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c82ec018f7ea74e2d12d8b7328026a679b12db5465f9240603d904de02c7e7f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(lenamartens, sharadmv): why not checkify here? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/checkify.py"},"region":{"startLine":1171}}}],"partialFingerprints":{"codehealthFindingId/v1":"bbaf430693e9a745106440e8b0a0430f9c3541e8e659bdf28643125fb3b0cb8a"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(necula): the fwd result_paths are not quite the same as fun_jaxpr \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/checkify.py"},"region":{"startLine":1174}}}],"partialFingerprints":{"codehealthFindingId/v1":"3eab041e47fa968b3e35e92d887dc112cc0d563f4416980559a221720d6bb66e"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(lenamartens): we actually need to recharge, but this would be a \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/checkify.py"},"region":{"startLine":1231}}}],"partialFingerprints":{"codehealthFindingId/v1":"2505a5666a349b87a0827e39f23db6965620864a8223c1a534ae149a526a0492"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(phawkins): remove this case when we drop support for Python 3.13. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/compilation_cache.py"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"c558413dd577923793a100974d48b170161e1aeaf66c83f75cd814c983293260"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(skye): add warning when initializing cache on unsupported default \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/compilation_cache.py"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3753aaad443bed8b89978f13521ae26ab163bb438bde5f30d1ca4b7ddb93e5b"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(b/289098047): consider making this an API and changing the callers of \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/compilation_cache.py"},"region":{"startLine":282}}}],"partialFingerprints":{"codehealthFindingId/v1":"60379fd22ffda2a94e9e129bf07a2354559517299945e2df80522c9bc302c4d9"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(patrios): add check cache key method to cache interface. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/compilation_cache.py"},"region":{"startLine":321}}}],"partialFingerprints":{"codehealthFindingId/v1":"11303b1c91d2a8274cb3f7845f9345c9f27504364c643bdc830c324b356a8b28"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(b/289098047): consider refactoring this interface. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/compiler.py"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba888cb0bede46a612e51d41ecdbcb9e10af89388c4e5f79a8dc95c443a70c26"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(dsuo): Simplify this logic once we delete _jax.CompileOnlyPyClient. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/compiler.py"},"region":{"startLine":363}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b73a95b9dd1a02a4f66ea0e80e391506a9da2bdd5f7ec61d021eebc17e8b5bb"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(sharadmv): remove this fallback when all backends allow \u0060compile\u0060 \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/compiler.py"},"region":{"startLine":384}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b4636599d53062020e86585366ce246b89b6192c4bbaa20b2754161fcfa1ba1"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(sharadmv): remove this fallback when all backends allow \u0060compile\u0060 \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/compiler.py"},"region":{"startLine":400}}}],"partialFingerprints":{"codehealthFindingId/v1":"34cb72e3293062401b65cf35b653cd19a6647d9160f772f0f5a4bdd96b66b89d"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(b/376647494): remove the workaround when the bug is fixed; the JAX \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/compiler.py"},"region":{"startLine":570}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8d62fa92529a130ac76b4e91e50047cdd951bed15ec10b4efd8677f203ef8cc"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(b/214340779): remove flag when XLA:CPU is improved. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/config.py"},"region":{"startLine":1140}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b092635c9430df815d32b61386e217c44614cb9d6cff43a1a21f540828b5233"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO make it so people don\u0027t use this, this is internal... \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/config.py"},"region":{"startLine":1548}}}],"partialFingerprints":{"codehealthFindingId/v1":"db200d43ce1d5e2b74ba79c4206247c0f7c113d9446873fe867447f43aa92bed"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: Change default to all \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/config.py"},"region":{"startLine":1594}}}],"partialFingerprints":{"codehealthFindingId/v1":"d41c2b39198aa4bf5283a24538bee0e1c350dfcd49d89cac455a7e1a9eff2aea"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(ayx): Move these 3 flags out of config once we have a user-level \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/config.py"},"region":{"startLine":1808}}}],"partialFingerprints":{"codehealthFindingId/v1":"eaa5f427f812f1a7e1ae9d986f272075d78b5872124bfe548a70c841a1deb869"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(phawkins): remove after fixing users of FLAGS.x64_enabled. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/config.py"},"region":{"startLine":1855}}}],"partialFingerprints":{"codehealthFindingId/v1":"67ea464d2398a727258a56bcafde7cce1cda16c88a921e2bb60e2e98eb1e7202"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(skyewm): this is a workaround for non-PJRT Device types. Remove when \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/config.py"},"region":{"startLine":1864}}}],"partialFingerprints":{"codehealthFindingId/v1":"09d34cb4a5fc9550453622a319c3dbaf1936e147c7245bf37ac720876e5a1439"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(yashkatariya): False \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/config.py"},"region":{"startLine":1908}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7fae199dfddca86df64246412efe5e1bd5b64358d8afb159b048bc1577018b5"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(rdyro): Remove once we always enable emit_pipeline primitive. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/config.py"},"region":{"startLine":1977}}}],"partialFingerprints":{"codehealthFindingId/v1":"55440cf0bb1e9e75b6f9fad41da4d27be6de95503829fe567561aaf1df9ee009"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(tianjianlu): Removes once we always enable cusparse lowering. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/config.py"},"region":{"startLine":1987}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f5c01e8d5f177e0acb1d0daa0960292a26aaa15d85d83aab9d4e9df45170c45"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(b/262050896): Set to true after bug is fixed \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/config.py"},"region":{"startLine":1988}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5e35bc68df0ed3fd566226a854a651e7a3d2e23e9e9cc4e5e6444a080d9432d"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(mattjj, yashkatariya): remove once we land box plumbing \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/config.py"},"region":{"startLine":2035}}}],"partialFingerprints":{"codehealthFindingId/v1":"235e9c4bd0372e1eff9a0cf45b6d705f59c6b9d5108f47e218c4b10be8308e50"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(dsuo): Turn this into a list-valued flag. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/config.py"},"region":{"startLine":2423}}}],"partialFingerprints":{"codehealthFindingId/v1":"228dc2d3a7eea3a2b0352e190e3eca7a50406e3c57f1fb1d316a1a600dde3ee1"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(dougalm): remove uses and delete. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/core.py"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3dfa58b66d67df71865335bd29f5e1e0779711a6881524824f4dd32e5f2d564"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(dougalm): migrate callers and remove. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/core.py"},"region":{"startLine":194}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b78ab43354df1c9700f7c901c0b691faf9796944ee10b9906d0bea0e38b0106"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(dougalm): migrate callers and remove. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/core.py"},"region":{"startLine":272}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e6442f8fb6affaaa971f41d671f12703689773337ffe59d3ee4bd37040ceb96"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(https://github.com/jax-ml/jax/issues/26480)"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/core.py"},"region":{"startLine":220}}}],"partialFingerprints":{"codehealthFindingId/v1":"35d28404ddaeea510854e76073e4609f3ab6630f0d0624b9fe7ec97fa5f6b8a8"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(dougalm): remove this hack when we add contexts to jaxpr. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/core.py"},"region":{"startLine":334}}}],"partialFingerprints":{"codehealthFindingId/v1":"5cff8f843623e22f6c43c1e02ef850dc63f049c6511617f70143a50c01611f99"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(phawkins): update source_info.tracebacks to also be relative to the \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/core.py"},"region":{"startLine":421}}}],"partialFingerprints":{"codehealthFindingId/v1":"291a3dc21d1a8e0fdce7c21abbf2fe24f46505a32b40937ced264f726ed80d55"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(mattjj): call typecheck rules here, so we don\u0027t form bad eqns \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/core.py"},"region":{"startLine":464}}}],"partialFingerprints":{"codehealthFindingId/v1":"02f194ab3c7e85fadf18078b56e8e66e9ffa5d4533d37a5e28e62564f0ad5e87"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(yashkatariya): Casting to Explicit is not yet allowed. Maybe we \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/core.py"},"region":{"startLine":648}}}],"partialFingerprints":{"codehealthFindingId/v1":"071e376ce2bde3ab3ad6dbef05ef0b7dd7c5a61a0517f9412915e86d3d7006bb"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(dougalm): deprecate/delete \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/core.py"},"region":{"startLine":836}}}],"partialFingerprints":{"codehealthFindingId/v1":"d949f0303546872bb943b00f002ebe77e3896dd4786270f77155f1130d7b9c96"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(dougalm): deprecate/delete \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/core.py"},"region":{"startLine":840}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e8a535920bf757c6156a9d92a835886dceae137f5910ffb65eebea8dd4da3ad"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(dougalm): deprecate/delete \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/core.py"},"region":{"startLine":983}}}],"partialFingerprints":{"codehealthFindingId/v1":"e82fa64303a663de0d33ff31b06d5412c722a69a8ab90a47fe9e7045cc37d806"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(dougalm): deprecate/delete \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/core.py"},"region":{"startLine":1753}}}],"partialFingerprints":{"codehealthFindingId/v1":"f60b8c088d0f8db4f2f6f1b53f2bd87789dc029d9c33878f4e14d6b1512a27f8"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(jakevdp): can we change this and make them raise NotImplementedError instead? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/core.py"},"region":{"startLine":1121}}}],"partialFingerprints":{"codehealthFindingId/v1":"daad9985ed028b7ed557d0eeaeea617f0bcf060c5560ec8da08be2638436f641"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(dougalm): delete. this shouldn\u0027t be necessary \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/core.py"},"region":{"startLine":1262}}}],"partialFingerprints":{"codehealthFindingId/v1":"36c4fe8b7784a009f926cfbf609195db52e100dda19c3ddaba9e0b29d27355d0"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: this works for surprisingly subtle reasons. Function transformations \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/core.py"},"region":{"startLine":1278}}}],"partialFingerprints":{"codehealthFindingId/v1":"e385223b53b210a35bcfb44341bd8298cd23926b79dc525d670a18b98c11083e"}},{"ruleId":"D17","level":"warning","message":{"text":"HackComment: # hack. \u2014 a workaround marked in source: record what it is compensating for and what would allow its removal (the upstream fix, the API it is waiting on, the invariant it restores), so the next reader can judge whether it is still needed rather than rediscovering why it is there."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/core.py"},"region":{"startLine":1286}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c45482b066307f480e54db55bd1476ffeb5efa18e9424913779abf7de05b1a5"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(yashkatariya): Remove this once vmap handles mesh contexts correctly. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/core.py"},"region":{"startLine":1484}}}],"partialFingerprints":{"codehealthFindingId/v1":"c575eb82ade0a97eaf48c64b89d67e84d21177ee16f5359ea13e1a668c29403b"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(yashkatariya): Remove this once vmap handles mesh contexts correctly. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/core.py"},"region":{"startLine":1502}}}],"partialFingerprints":{"codehealthFindingId/v1":"94a0766b5522a107cf6ce6a24116ca61d0387ca0f21059099242e2598908c717"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(dougalm): deprecate this alias \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/core.py"},"region":{"startLine":1794}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7717b23a713c181cb01bb550bef275572cb6a20967d42373772fdb330993a46"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(phawkins): the return type should be AbstractValue. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/core.py"},"region":{"startLine":1950}}}],"partialFingerprints":{"codehealthFindingId/v1":"5426dda36e93c103d30ab2ca7615f829f71ba7157eeaf808268736872e1e5424"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(frostig): remove this case \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/core.py"},"region":{"startLine":2036}}}],"partialFingerprints":{"codehealthFindingId/v1":"28c5b66dc284b6287e3126c8532930b7e378bfd765c111625f7f704927c811fa"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(mattjj, yashkatariya): should use newly all_names in check_vma path? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/core.py"},"region":{"startLine":2556}}}],"partialFingerprints":{"codehealthFindingId/v1":"797469cb0aacc60b656fd80ee22535d218ef0e8f68a0296a035a0d4040e46528"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(yashkatariya): Diff between explicit unreduced and manual unreduced \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/core.py"},"region":{"startLine":2676}}}],"partialFingerprints":{"codehealthFindingId/v1":"daae507fb10c5e8db0eec7834a889eaa0cbce319ab4e1a259dc2a102da70f6b3"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(yashkatariya): Remove this handling and remove_size_one_mesh_axis_from_type \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/core.py"},"region":{"startLine":2715}}}],"partialFingerprints":{"codehealthFindingId/v1":"41f32a252f78c8794a499527399720f9e787b318b3b2a8d1f344dacb8b1979c7"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(yashkatariya): Remove this handling and remove_size_one_mesh_axis_from_type \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/lax/parallel.py"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"02ea3ed1a69add882312af7a4a6f25d54519051e923d7e64b82f46eecbc462fa"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(yashkatariya): Remove this handling and remove_size_one_mesh_axis_from_type \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/lax/parallel.py"},"region":{"startLine":2622}}}],"partialFingerprints":{"codehealthFindingId/v1":"52fe56c13519be3b318bc08a1bc3ac7b78c4128e850d3a357296ae5c396d714e"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(yashkatariya): Handle \u003E2 args too \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/core.py"},"region":{"startLine":2766}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9275e44fdfa0e8caea25b74739413e0d6f090a32d92a23ae4d536403fdfab35"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(yashkatariya): Handle partial reduced_vary_cast and partial pvary. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/core.py"},"region":{"startLine":2799}}}],"partialFingerprints":{"codehealthFindingId/v1":"41d0c4d87de154059a2975982faa5c67a297e7a32b68839bc12eba57a7207a1a"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(mattjj,dougalm): merge with ref_p \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/core.py"},"region":{"startLine":2991}}}],"partialFingerprints":{"codehealthFindingId/v1":"32547a08abcbb54f3e35747b7e1a6acdf0c7412ea4e7880b3228001b6d38781f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(mattjj,dougalm): merge with freeze_p \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/core.py"},"region":{"startLine":3019}}}],"partialFingerprints":{"codehealthFindingId/v1":"c016b72cc146c0b228774bde8d995b5d9f9ee2bf8a9c261688813e8175cb66e1"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(mattjj): Many ideas for improving this.  Crawl the stack and see if \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/core.py"},"region":{"startLine":3384}}}],"partialFingerprints":{"codehealthFindingId/v1":"a27c79912b0fb67f78fa3eb921e08f99d5ac6c4d7f5de482c8c4531b61a57f03"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(yashkatariya): take axis data \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/core.py"},"region":{"startLine":3462}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e573025a705961dfad41d1314fd9f321314698256bf16f3edbc47d2327be987"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(mattjj): revisit this unique axis name strategy \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/core.py"},"region":{"startLine":3516}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a65d763fee9a3ffde439a64b03edb9f3faaf9faad1133bd33f404cb10a74204"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(yashkatariya): Expand this to Manual and Auto mode. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/core.py"},"region":{"startLine":3601}}}],"partialFingerprints":{"codehealthFindingId/v1":"8cbf5f53d58a3d645a669a53c0948330aaa5d09b572407c6acdb77bf73780512"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(yashkatariya,mattjj): add check for sharding-in-types mismatch \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/core.py"},"region":{"startLine":3627}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d9c91b5c2d9d6c6b6afe1bd8c8b1921805d45fd4a1312f5ff9a1edd63aa8031"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(mattjj): improve this error message \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/core.py"},"region":{"startLine":3824}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f9fed511abba409e14568360f509233123bf7c81e6fff77c2cce30961af99e3"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(mattjj): include output type annotation on jaxpr and check it here \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/core.py"},"region":{"startLine":3830}}}],"partialFingerprints":{"codehealthFindingId/v1":"0690004521c4d0a179fe5ac2e7c6072ab6a106b27f28c7455b496c8fd39f83a9"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(mattjj): vars in error message are confusing b/c of Var.__repr__ \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/core.py"},"region":{"startLine":3863}}}],"partialFingerprints":{"codehealthFindingId/v1":"e14b99b640602c740721ada2625f74260650a702eeb7d5915009dcf2e9eea12b"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(yashkatariya): Maybe use \u0060get_abstract_mesh()\u0060 here but switch \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/core.py"},"region":{"startLine":4029}}}],"partialFingerprints":{"codehealthFindingId/v1":"f13f4e3ca2d75b44aa9d74db9fef75fb3672df1b2db715043c4d099058421ee5"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(slebedev): Come up with a more elaborate heuristic for name=. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/core.py"},"region":{"startLine":4191}}}],"partialFingerprints":{"codehealthFindingId/v1":"568a28898dcd5299971a1fe561acc8d7a9d51485fded9791fbc812107aa142a8"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(sharadmv): render an entire signature here \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/core.py"},"region":{"startLine":4351}}}],"partialFingerprints":{"codehealthFindingId/v1":"6202d5626cf8240d75dc4d402fc43a58625c769eb7d2f33f36f0f4c3161b7373"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(dougalm, jakevdp): expose these via jax.extend \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/core.py"},"region":{"startLine":4486}}}],"partialFingerprints":{"codehealthFindingId/v1":"9611b3e9a7033a5d9abc9279443b52aaf754cc78c5be0c6a8814503c86ca8566"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(douglam): deprecate/delete \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/core.py"},"region":{"startLine":4513}}}],"partialFingerprints":{"codehealthFindingId/v1":"e43565cf0aeaf6bb4f7f8fd1aa18e6c9e84afc607aebbab9f059aceea701bceb"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(douglam): deprecate/delete \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/core.py"},"region":{"startLine":4530}}}],"partialFingerprints":{"codehealthFindingId/v1":"db65a6808e6b6ae6859f90bdcecba3ec7795ab707060065dd5706c125e85deff"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(frostig): assert these also equal: \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/custom_batching.py"},"region":{"startLine":288}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a2b866d601c1d2ef9811614ce24f66a6d1594b254ad90ebcc8493ddc2b6fcd3"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(necula): fix the debug_info calling convention \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/custom_batching.py"},"region":{"startLine":307}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e759a4661e44897438b9fc2cc971baea6237ad08b8e664b73ca700ff0e69199"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(mattjj): could do more checking here... \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/custom_derivatives.py"},"region":{"startLine":431}}}],"partialFingerprints":{"codehealthFindingId/v1":"004e9646994f97b8df803fdac04f3e19de9251c0515e58244ec8b80fd37d66e2"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(necula): figure out how to construct the debug_bwd args \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/custom_derivatives.py"},"region":{"startLine":839}}}],"partialFingerprints":{"codehealthFindingId/v1":"c926cfbe24cc6f99ac007e249795a3ead002a47daf1901de981f7c8a60a5b26b"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(mattjj): remove both these exceptions to cotangent compatibility check \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/custom_derivatives.py"},"region":{"startLine":1166}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd2209ef21ff7bff0419521ce1dfd063ea288f4ec5e57451475bcc4d63ccf02c"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(phawkins,mattjj): make this primitive cacheable. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/custom_derivatives.py"},"region":{"startLine":1245}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4355073cd450c92138e1eccba7e4064260ea47caba1a827f1a7abcdffc26a91"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(phawkins,mattjj): make this primitive cacheable. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/custom_derivatives.py"},"region":{"startLine":1334}}}],"partialFingerprints":{"codehealthFindingId/v1":"5496b7f7fea1349dd6f3309d54d45b154301a81cef5690ab17229a6f097d210e"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(necula): the fun_transpose takes residual and output of fun! \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/custom_derivatives.py"},"region":{"startLine":1882}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8d8e2b1368602b260ea8864ca2f2a53011e353690c3b707cde542309b62f1c0"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(frostig,mattjj): We have no good way to translate a function \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/custom_derivatives.py"},"region":{"startLine":1968}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a7154f0a7d698c6f40551104550225222d9c74409f013036419ed96c118e8f5"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(mattjj): remove these stubs, which exist to avoid breaking internal users \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/custom_derivatives.py"},"region":{"startLine":2012}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d5257ccf2e42c3c32329f82c7c9312eae8679785314c622d3db6fdc14ec8b0a"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(dfm): Eventually this should probably be the default behavior for \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/custom_derivatives.py"},"region":{"startLine":2020}}}],"partialFingerprints":{"codehealthFindingId/v1":"06a7d28894dedcf033ad8eb524ba066ad4ab569e9bcf0e44bbc20b859849e26c"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(dfm): This probably shouldn\u0027t be too hard to support. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/custom_derivatives.py"},"region":{"startLine":2034}}}],"partialFingerprints":{"codehealthFindingId/v1":"e95a4311d574c7847cc2b912c5dafdf76bfaccf0f6179b556cd0e2e2d1a93206"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(dfm): This initial logic is duplicated from custom_vjp.__call__ \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/custom_derivatives.py"},"region":{"startLine":2040}}}],"partialFingerprints":{"codehealthFindingId/v1":"0402c9baf9688c14a72c67576d5d1bcef778a7b076a358e2bd5e321b9905ec0f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(dfm): It shouldn\u0027t be too hard to implement this as needed in the \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/custom_derivatives.py"},"region":{"startLine":2202}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d5f178ef84f80e8d61ea1d732e8aefaa87db04a229f2a10e97e0f56680147b2"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(sharadmv): implement in terms of rolled loop unstead of unrolled. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/debugging.py"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"19e7e892bd1e4cdfb36af1bfccd2e06169ddb1e243dd7d58f0d763af6adba255"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(mattjj): working around an apparent XLA or PjRt bug, remove eventually \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/debugging.py"},"region":{"startLine":1034}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9c5daa1533f4bea65f9522ed3a1e67be74d682fd021e74fb1698f086b68a4ae"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(yashkatariya): Investigate adding is_primitive to jit and never \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/dispatch.py"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d3da61c6a7341bb2e7f7fcc6ed5deae5db63a5e24c4e2fcb37fe61291562b03"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(necula): this cache will contain strong references to all \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/dispatch.py"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc3e81df8cafb1c7a67d7b5e4ff63290a164131915f4a92e9447e9c814663023"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(yueshengys): This might still be buggy in a multi-process SPMD \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/dispatch.py"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd9f980c85d928fe82a94d62def29f975253a377dde4712ca6fe8d91d65778de"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(mattjj,yashkatariya): handle donation \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/dispatch.py"},"region":{"startLine":509}}}],"partialFingerprints":{"codehealthFindingId/v1":"32662e153d57e1e7e91ed866fa91cd5419f72de194410c7997ec4f0004cd291d"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(yashkatariya,mattjj): Link to a doc about McJAX and jax.Array. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/dispatch.py"},"region":{"startLine":565}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e58f1f8fecee337d012bf4a910306facb8c31733771ba9548e323f6707ab178"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(yashkatariya): Maybe remove the special carve out for Host? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/dispatch.py"},"region":{"startLine":767}}}],"partialFingerprints":{"codehealthFindingId/v1":"43701f73930ddbc3df283464e08e027bb40286c51b73154842b596ecc5eec899"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(yashkatariya): Maybe we should add the custom calls anyways if it\u0027s \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/dispatch.py"},"region":{"startLine":799}}}],"partialFingerprints":{"codehealthFindingId/v1":"1530a7b53fdd2485b36e9b64cbb3bad50630d928260c8b93e91537fceeb6d674"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(vanderplas): remove this set \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/dlpack.py"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"89e85c5e7693fe2d0b4cc541f065293c5143076009befb2e531dbcc18996adb6"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(phawkins): when we are ready to support x64 arrays in \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/dlpack.py"},"region":{"startLine":371}}}],"partialFingerprints":{"codehealthFindingId/v1":"80d0ca04dc29217965949e95b21f448fa004aff711435d306fc32f67cd2bf546"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(jakevdp): consider whether to disallow None here. We allow it \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/dtypes.py"},"region":{"startLine":526}}}],"partialFingerprints":{"codehealthFindingId/v1":"a51687b33e0389d68fe74c36c553117c13b40c2b02c69a2ce4bad6a2e26842e1"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(phawkins): in the future, we would like to: \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/dtypes.py"},"region":{"startLine":1043}}}],"partialFingerprints":{"codehealthFindingId/v1":"779801becb030af7c8a452285eaaef79338bc7da937f71d306e0b430c5c834a4"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(jakevdp): fix return type annotation and remove this ignore. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/dtypes.py"},"region":{"startLine":1089}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd7a2424a22f0bae90218b181f7e49de7a8090770ce60cae961392c43ffdd528"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(jakevdp): explore removing this special case. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/dtypes.py"},"region":{"startLine":1105}}}],"partialFingerprints":{"codehealthFindingId/v1":"dcf9db919cf2a209b2985d88c13c107af1dad8f9b80426e27dac678394226077"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(mattjj): not implemented below here, need more methods from ArrayImpl \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/earray.py"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"314b96d639e56f61f82c7946172d295d4e7368b2a23df6cef99348b5c68d089e"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(mattjj): _set_array_base_attributes \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/earray.py"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e90924841aaa5958f9b0a2679e36c474c42d207f08efbc1d77a89426e068bd2"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(yashkatariya): \u0060layouts\u0060 should be converted to physical layouts. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/earray.py"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"0fd17081ed6aecd5480dbff1f3df9fd175ca1f7a0f1afa1ee9c43aa87df7001a"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(yashkatariya): \u0060layouts\u0060 should be converted to physical layouts. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/random/prng.py"},"region":{"startLine":508}}}],"partialFingerprints":{"codehealthFindingId/v1":"ddb0475c277f8dafe141f5c3a498a2537ea8aff176ad6e57b2fcfcb71d0f3aff"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(jakevdp): should we include other info, e.g. jax.config.values? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/environment_info.py"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"6587b6b86429268035a13c9f4126a5c59db82a1f62d87eb380ee5e910c1085e6"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(jakevdp): remove this import and express the following using lax APIs. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/error_check.py"},"region":{"startLine":157}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb7ec3cb7cf63db00aefc3c6b8f4089576754e487d46d4d2d52562a83ff410f2"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(ayx): support vmap and shard_map. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/error_check.py"},"region":{"startLine":212}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d8670c7c747479843ce416a2c21a7be71fff226fa2fc9a0c8454d0c0c6f2284"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(ayx): support vmap and shard_map. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/error_check.py"},"region":{"startLine":383}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b67aefacd8f4133fb7842bf3808de8af68f8aba7dbe805ef1ac7d1e230ce2be"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: we should be able to get rid of this case by ensuring that \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/flattree.py"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5a80a5ebdf714e27995efc8ae4754bd2a4e08f298efe08ee5ad38abae5b3951"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(dougalm): find a way to do this without roundtripping \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/flattree.py"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac7c7c591841cca45b1bf151ff0ab9ebdabaf06d01f5fb479aeba9d6d29a07a8"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: add other helpers like map3, zip, unzip3 etc. as needed \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/flattree.py"},"region":{"startLine":173}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ea1c2e660bf5faaf04f540e406726425aeb401f4812ec11b3598dd243ff6728"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: revise this away. We shouldn\u0027t need to get treedef from FlatTrees \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/flattree.py"},"region":{"startLine":176}}}],"partialFingerprints":{"codehealthFindingId/v1":"5051cfc8a49a10217cf8da1283ff8dc32f8130013ce4d727abc03ddaf85c89f4"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(dougalm): delete this case \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/flattree.py"},"region":{"startLine":192}}}],"partialFingerprints":{"codehealthFindingId/v1":"9fc3e066ae86bc1478746009525bcd1d582d1d0e33c2c097b22c275a3f159439"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: revise this away \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/flattree.py"},"region":{"startLine":194}}}],"partialFingerprints":{"codehealthFindingId/v1":"91ce8d9332ba92c73dd21de0445bb85612ad887dd6709be4475c43c09a4d62e6"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: check elements of args and kwargs are all flat trees \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/flattree.py"},"region":{"startLine":301}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a1c893247ac9bf95c2cca510e83faa823a11cecb1c736fab6dd6c879474dd29"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: this sucks. revise it away by using FlatTree in pjit instead of treedef. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/flattree.py"},"region":{"startLine":329}}}],"partialFingerprints":{"codehealthFindingId/v1":"783806b110eb78d07d8391c88a91502b8b3cf4a5812d5571eb0560757212c201"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(mattjj): not lovals \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/hijax.py"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"55d3dd8f6734a151b467cc7c647b0c446c068991a8b6fedcaab5f3225e711b7a"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(mattjj): jvp and transpose? does anyone rely on them? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/hijax.py"},"region":{"startLine":1295}}}],"partialFingerprints":{"codehealthFindingId/v1":"86c2df3a019d43158bc0a3807ec65765f0b7fbb638179f5c28ee47256196914a"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(yashkatariya): Define a way to strip away auto/manual axes on HiPspec \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/hijax.py"},"region":{"startLine":1561}}}],"partialFingerprints":{"codehealthFindingId/v1":"b974ed569db768a63ce6fe6849de27d351ab01c252ceb831ce1a9b001b040ebc"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO shift_right_logical \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/lax_reference.py"},"region":{"startLine":370}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f3802ac088169d21f7db39e63efd8d947cdb665584ba528e5a5fe39ba714e05"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(mattjj): select_and_scatter \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/lax_reference.py"},"region":{"startLine":634}}}],"partialFingerprints":{"codehealthFindingId/v1":"81afaf9abdce61c2bfdf5d7b8a4199c2ed28ec8bbc21b30e28a769c30daabf88"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # Backwards compat only. TODO: deprecate \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/linear_util.py"},"region":{"startLine":249}}}],"partialFingerprints":{"codehealthFindingId/v1":"73dd7b6a86e07885095c4e90037fec17a6572b6b39000d67cb109a95a7860d43"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # Backwards compat only. TODO: deprecate \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/linear_util.py"},"region":{"startLine":258}}}],"partialFingerprints":{"codehealthFindingId/v1":"0fddeb10606fb1cc84c88a28c5d8cbefcaf746815c4c218ecdab0ce7adb8c28e"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(skye): implement 2D mesh_shape logic here: \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/mesh_utils.py"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"25306e11a67fae550f40eae110cf1945440920735d7cb06097b0d41000ae87c6"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(b/303712469): Unit test these handler functions. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/mesh_utils.py"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b52fdd52b2d0ae3987aa67482f09221f90b84544701119f2a330924e76f652c"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(zhangqiaorjc): Due to limitations in XLA, 2D collectives only \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/mesh_utils.py"},"region":{"startLine":348}}}],"partialFingerprints":{"codehealthFindingId/v1":"c42229e8c958700d8d7222fcc15621d0d90e6626a92869e78843103c6a893636"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(rosun): Instead of using heuristics, replace this with a proper \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/mesh_utils.py"},"region":{"startLine":461}}}],"partialFingerprints":{"codehealthFindingId/v1":"8cf6db8c00cc57357545c759646432f7372d8560317cd91b4fd79d0df9e87b48"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(jekbradbury): handle non-uniform DCN topologies \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/mesh_utils.py"},"region":{"startLine":965}}}],"partialFingerprints":{"codehealthFindingId/v1":"38ce838f267e411da77539de41daa27e0cf306b62e012f765f3b1a75c34ff5af"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(mattjj,yashkatariya): if we take the \u0027true\u0027 path then we *must* fall \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pjit.py"},"region":{"startLine":573}}}],"partialFingerprints":{"codehealthFindingId/v1":"58a838050a4d07aa6bb86da6227f1a68679c90cb5842c4a9a63169ac966f4d97"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(yashkatariya): Make top-level use_abstract_mesh work with Auto mode \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pjit.py"},"region":{"startLine":634}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc5ab684fae4377ed297fe566c399a40a41a718576cb7e6eb057c273f2737ecf"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(yashkatariya): Remove this Tracer special case after \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pjit.py"},"region":{"startLine":1138}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8ab7209135d59ae181aa92f6dee3d07664b3c6df4afae05704f0afd57b54bc9"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(necula): remove num_const_args when fixing the C\u002B\u002B path \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pjit.py"},"region":{"startLine":1228}}}],"partialFingerprints":{"codehealthFindingId/v1":"195b656d1e60e37a13aa113fdf6ab9159a0185f99c3cd81a5dfe15301abda5f9"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(mattjj): Remove pjit_forwarding_rule and also in staging rule. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pjit.py"},"region":{"startLine":1332}}}],"partialFingerprints":{"codehealthFindingId/v1":"26ad076988c9ec9c0b7aab3cd4ce40764d30c2569f58333d7046de5b909133ed"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(b/228598865): non-top-level functions cannot have shardings set \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pjit.py"},"region":{"startLine":1384}}}],"partialFingerprints":{"codehealthFindingId/v1":"47de2fe05383b7ca8120db0bd883115ac93b689bdb43cf2ec39f547524742656"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(phawkins): this is marked uncacheable because it has its own cache and \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pjit.py"},"region":{"startLine":1462}}}],"partialFingerprints":{"codehealthFindingId/v1":"2cb38127a68881018115050180265936bb8ecf4349bb1a0149cffc3084a02907"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(yashkatariya): Figure out layouts should change under vmap. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pjit.py"},"region":{"startLine":1505}}}],"partialFingerprints":{"codehealthFindingId/v1":"c68fa6317d9759444325bb87ab5abea387a1790534cd1a9f3990dbd851d270ab"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(mattjj,yashkatariya): implement this? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pjit.py"},"region":{"startLine":1536}}}],"partialFingerprints":{"codehealthFindingId/v1":"55bde223f916d81427e6b53f1e9fad08f1e765b356c0d945cd77a77f4be71148"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(yashkatariya): Replace this with \u0060isinstance(l, ArrayLayout)\u0060. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pjit.py"},"region":{"startLine":3130}}}],"partialFingerprints":{"codehealthFindingId/v1":"67634451a7460595f3d2db76a4b61b158fee3b4f84f0ff105af6ef5034ec0432"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(sharadmv): speed this up by updating the generated \u0060trace.json\u0060 \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/profiler.py"},"region":{"startLine":324}}}],"partialFingerprints":{"codehealthFindingId/v1":"66de08503d6dc015914d3aa004fc24984d2430920b5edf29d5abb85df68a528d"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(reedwm): Upcasting int2/int4 to int8 will no longer be necessary once \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/public_test_util.py"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"61e22775647638081edf9e73fddea63de113083dafefb9fa896ca390cb87ff55"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(phawkins): surprisingly, assert_allclose sometimes reports invalid \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/public_test_util.py"},"region":{"startLine":161}}}],"partialFingerprints":{"codehealthFindingId/v1":"042e9ad4aa73afe944448b0b1a3ccabe29a9bde3556a84393dfa7baacc8e99a9"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(mattjj,yashkatariya): add user validation method \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/shard_map.py"},"region":{"startLine":469}}}],"partialFingerprints":{"codehealthFindingId/v1":"193093ab2e2ec47978617c1532a962b31e02da65456f68953f1d9f202792baa8"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(mattjj,yashkatariya): add user validation method \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/shard_map.py"},"region":{"startLine":505}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2df855f0354666667a336294b78b33075a498f17e835ba9398a3e1cdf0d6fa5"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO add underscore version, for direct-linearize to consume \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/shard_map.py"},"region":{"startLine":931}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4c604c2b7a6c2af6bb09350800ab49ba18f67b51bb8855ee10dede28bacc405"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(mattjj,parkers): check auto \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/shard_map.py"},"region":{"startLine":1053}}}],"partialFingerprints":{"codehealthFindingId/v1":"361ff9699884ac6dd9014973948810f58e3fc27b4e68c8e4b999c000b178726e"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(necula,yashkatariya): how to construct consts shardy shardings from \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/shard_map.py"},"region":{"startLine":1155}}}],"partialFingerprints":{"codehealthFindingId/v1":"bfc3e8ea86b05ce4aafdde3bd28ee5e7d72f4dc61cb747d46b62af263649573d"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(mattjj): add check in jit path \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/shard_map.py"},"region":{"startLine":1470}}}],"partialFingerprints":{"codehealthFindingId/v1":"4eb090a1c72b4bc1fd9cbf7ca6e743594cc7fa07405dcf5be36ea309bbc3c893"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(yashkatariya): Handle unreduced/reduced correctly. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/shard_map.py"},"region":{"startLine":1483}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b3740295ff72c34f8770a3ae3d96618cde75b4b39eb9c2a8df6f8bbcfdd2d90"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(yashkatariya): Handle unreduced/reduced correctly. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/shard_map.py"},"region":{"startLine":1495}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c6ed9eee4739bddbd00284d1fddf40b80be40389d25f36406a3ad6aa96b6140"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(yashkatariya): Remove add_explicit_mesh_axis_names when vmap \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/shard_map.py"},"region":{"startLine":1640}}}],"partialFingerprints":{"codehealthFindingId/v1":"5aec9b03e0bfc1b13e9819ecd1860e8d92ef789233f7b32765089c72567a9684"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(yashkatariya): Remove remove_explicit_mesh_axis_names when vmap \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/shard_map.py"},"region":{"startLine":1652}}}],"partialFingerprints":{"codehealthFindingId/v1":"a221268971bed6ad085d8674b37f114b8f71bbe9a194d999ac0acedcb2e93932"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(yashkatariya): Remove remove_explicit_mesh_axis_names when vmap \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/interpreters/batching.py"},"region":{"startLine":258}}}],"partialFingerprints":{"codehealthFindingId/v1":"00ae8ec9a2d3024d2214887dcd143e8e8de5058e8350f2f7cb7a26d0563a8fdf"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO make res_avals be the full set, not just the non-fwd ones \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/shard_map.py"},"region":{"startLine":1770}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ccd3c098a45308a247e70578f94b330a041a8f3a950522e02c85993517dca3a"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(mattjj): avoid round-tripping the jaxpr through eval_jaxpr here \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/shard_map.py"},"region":{"startLine":1880}}}],"partialFingerprints":{"codehealthFindingId/v1":"49f9e52ac43a9840925377d01661bfd741c7020574833bfa7e8a9238515b36c6"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(mattjj): remove this mechanism when we revise mesh scopes \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/shard_map.py"},"region":{"startLine":2187}}}],"partialFingerprints":{"codehealthFindingId/v1":"3550892e267f0c9c480264c5c655a2fb1c8d3373580e59ff626b0c683902eca5"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(mattjj): remove this mechanism when we revise mesh scopes \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/shard_map.py"},"region":{"startLine":2203}}}],"partialFingerprints":{"codehealthFindingId/v1":"3899874dc94ca7e42b59f20fe7f2e0191a297ebadffe341578903b8cf0aaa5d7"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(mattjj): de-duplicate with pe.dce_jaxpr_call_rule, and/or _pmap_dce_rule? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/shard_map.py"},"region":{"startLine":2212}}}],"partialFingerprints":{"codehealthFindingId/v1":"f863d87c81ab11813083cfcd4310d2f9a57ddc04ee2b41f9eeddd5f3a97dd427"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(sandler, yashkatariya): Consider making this function public. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/sharding_impls.py"},"region":{"startLine":610}}}],"partialFingerprints":{"codehealthFindingId/v1":"20fbd00c1bed940fde0b73f3fa50c6cbc5704067d3b7a5f528f7d8d5e49de250"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(sandler, yashkatariya): Consider making this function public. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/sharding_impls.py"},"region":{"startLine":752}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8c73492f3fa84ca0045572635a8fd3b17e0ee13dbc3ec8ee7a9fd1cbb61bd1d"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(yashkatariya): Maybe remove this check or do this at the pxla level? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/sharding_impls.py"},"region":{"startLine":819}}}],"partialFingerprints":{"codehealthFindingId/v1":"99abba4c592211c55c8129d197a6779cf8bd8ff55b3eba0b31eb2279ff717e62"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(yashkatariya): Remove this once we disallow different meshes and \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/sharding_impls.py"},"region":{"startLine":876}}}],"partialFingerprints":{"codehealthFindingId/v1":"7eaabddc53572d99a760c4a3823a1538854bbbfc7fd8028cdd376adf20df8113"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(yashkatariya): Maybe allow concrete mesh at the top level \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/sharding_impls.py"},"region":{"startLine":888}}}],"partialFingerprints":{"codehealthFindingId/v1":"0117a6c02b01fdeaa182b46a5f3fd85d79c7d2afa2f7a5300780965069e537b2"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(mattjj,phawkins): figure out why the commented-out reset_name_stack \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/source_info_util.py"},"region":{"startLine":318}}}],"partialFingerprints":{"codehealthFindingId/v1":"725047309dd4bdffce97e2c1a5e1fb7a87652e4e51b4ed5df04b53c526893012"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # todo: remove \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/stages.py"},"region":{"startLine":365}}}],"partialFingerprints":{"codehealthFindingId/v1":"1eba78f40ac2ae5d90a0d1c988f7c16243ef0c3d42a9dd07246e223974e9f01a"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(mattjj): when pmap is deleted, merge with pjit.py BUILD rule \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/stages.py"},"region":{"startLine":567}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6f16628b762733e3dc1788e93e3a9671aab49414fb85838640f0c07a85f7ad4"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(frostig): improve annotation (basic pytree of arbitrary structure) \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/stages.py"},"region":{"startLine":773}}}],"partialFingerprints":{"codehealthFindingId/v1":"52bb6831d7f3f960fdb09813afaa94b46c64c220e49fdbdd74f04ad2a20a2b81"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(frostig): improve annotation (basic pytree of arbitrary structure) \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/stages.py"},"region":{"startLine":834}}}],"partialFingerprints":{"codehealthFindingId/v1":"ecb047cdcf39a28b8e6c7fcd31d564e1b6c4302abeae85a8fda439e094f80188"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(frostig): improve annotation (basic pytree of arbitrary structure) \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/stages.py"},"region":{"startLine":852}}}],"partialFingerprints":{"codehealthFindingId/v1":"17315e643b8223cbf1f02fb468876c8e6acf01a8fa38aea2ea546cf2b5acd0d5"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(mattjj): improve wrong-number-of-args error \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/stages.py"},"region":{"startLine":965}}}],"partialFingerprints":{"codehealthFindingId/v1":"a88b1a4d360145b73b85ffe22cb6cef3c032a7e034aa21c6b8c6ed4e31d9bd25"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(mattjj): de-dup with partial_eval.py \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/stages.py"},"region":{"startLine":1015}}}],"partialFingerprints":{"codehealthFindingId/v1":"22ce99807f20ca1eab870f23ca0fb8a0b532429e05fdd76e9f9aa25e6db5c7c7"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(emilyaf): Enable multiprocess tests on Windows. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/test_multiprocess.py"},"region":{"startLine":296}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a04300e36578eada4f8bae808973a7ef73773164414eb1bdd34f7c92a5d514f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: Complex numbers are not correctly tested \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/test_util.py"},"region":{"startLine":880}}}],"partialFingerprints":{"codehealthFindingId/v1":"af7896c074cc062d3e586752d010e2064036f18998ee12dca7914661502a11a3"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: Complex numbers are not correctly tested \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/test_util.py"},"region":{"startLine":939}}}],"partialFingerprints":{"codehealthFindingId/v1":"4fcba9629b00c3a44292558aa4964a16982ccd3ac78a53fe86891d1cc679d6f1"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(mattjj): doesn\u0027t handle complex types \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/test_util.py"},"region":{"startLine":967}}}],"partialFingerprints":{"codehealthFindingId/v1":"3462203b1562d09563e02ab339d179da99bbaf433b9f897f3041da3e37f85977"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(necula): why doesn\u0027t this search in params? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/test_util.py"},"region":{"startLine":1053}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a44eaadfb6418998b425c22c359e829baf9d4c19fe4b280e811e3dc5ab973bb"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(b/489398450): Remove this \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/tpu_custom_call.py"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf7dca7148b098908cc56dc1a12a4885df173969b0d87516fcb0d65a120d3527"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(b/499085720): Remove this in favor of something principled. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/tpu_custom_call.py"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"ddbdbb8270fd77de5790259d487ea3303f4327fc2f0a6d26ff8e14d2626b56b3"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(slebedev): Bump to 19 after 2026-11-21. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/tpu_custom_call.py"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"a658ad1ae4e979f7127375f994c3de132bbc631e72ea7e6ec5842f9d83ac400a"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(sharadmv): Add support for SMEM (though atm, XLA will not \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/tpu_custom_call.py"},"region":{"startLine":316}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e1f320daf36af851f8e6d01d2ba668f88111001d772a28e823feb8ac256d8be"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(b/536052236): Always use core_ids after 2026-11-06. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/tpu_custom_call.py"},"region":{"startLine":473}}}],"partialFingerprints":{"codehealthFindingId/v1":"2785543582d5c3af547476375209fb099cbedf9a44d937c65e3f1c9654a74f22"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: b/543848756 - add the remaining dtypes. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/tpu_info.py"},"region":{"startLine":268}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8e14736f59c3d43b2fd7f2f3bf7f662e03fae8c6ff438468e7186d0f1ba83aa"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(sharadmv): Generalize Tiling to capture the various options \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/tpu_info.py"},"region":{"startLine":621}}}],"partialFingerprints":{"codehealthFindingId/v1":"9358dfe9762d6087403aeaf9e6377a3d0ab923dc4cd6995d6f7a0980570f8e4e"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(slebedev): use [C: Callable[..., Any]] once facebook/pyrefly#3329 is fixed."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/traceback_util.py"},"region":{"startLine":161}}}],"partialFingerprints":{"codehealthFindingId/v1":"c22c04eda4ca26c2440d3ea3c6df26c03680d28a1332544c800cb041ecdbfee0"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: import from the final location \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/traceback_util.py"},"region":{"startLine":234}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2926b47cd02702e8a7e9740aadfb63330c25292d58672b9272a2ee8dac7a97e"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: get rid of the tree registry system altogether (use FlatTree instead) \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/tree_util.py"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"92959b074b4aaa84b06deabdd45aeff390fa1065716e5f3c62e41efabc5337a6"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(mattjj): remove the Python-side registry when the C\u002B\u002B-side registry is \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/tree_util.py"},"region":{"startLine":446}}}],"partialFingerprints":{"codehealthFindingId/v1":"02496cc3e6f7a69e1bf2cd2b9ce7cd56cd196d0248c4294e72ea683132585849"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(jburnim): Merge \u0060broadcast_prefix\u0060 with this function? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/tree_util.py"},"region":{"startLine":677}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d13d8a2fe389879370abbdcb00c57b9d88a4b1e579e7f78035f57cd816be08d"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(jburnim): Should this traversal be done in C\u002B\u002B? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/tree_util.py"},"region":{"startLine":681}}}],"partialFingerprints":{"codehealthFindingId/v1":"0494342626a9d7cbbad6a20acb34759873fa8185f0c73757e66c2df8dd6998f9"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(mattjj): make equality_errors not print type name, avoid metaclass \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/tree_util.py"},"region":{"startLine":788}}}],"partialFingerprints":{"codehealthFindingId/v1":"24d0b891ca3b924a1206be136c14e98676a7a7e9d7c31615c97227202bc7b006"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(mattjj): maybe share some logic with _prefix_error? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/tree_util.py"},"region":{"startLine":794}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b39b92cccb8b3c4e46d73d332267941cf6d1d0d83e50e5ec365018167b5cf02"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(jakevdp, froystig): make ExtendedDType a protocol \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/typing.py"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"2eb47f09b6491b4ba426e8c26c99e38285ce8b418d8a1aa49c08a22815f8baed"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(jakevdp): consider whether to add ExtendedDtype to the union. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/typing.py"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f57b46fc4b297289eae5bdcf49f137586755a15a65da12ec5fb78cdc380de73"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(jakevdp): fix import cycles and import Array. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/util.py"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"c980e33a163b084c3eb7d91d87ab6b4c03a4884ae26bc0e4fac5fea274354eea"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: hashing, equality, printing etc \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/util.py"},"region":{"startLine":696}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a156872a472e22c27153e013128194214fff9ab6e872b994e720e3f02c49003"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(phawkins): Remove jax_xla_backend. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/xla_bridge.py"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c4275f791c664c17a90f0076399f66eeb7556346f0b605d5678529a20a709be"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(skye): warn when this is used once we test out --jax_platforms a bit \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/xla_bridge.py"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae8bea2365b6c0b664671fce942e8e373e2c536026e5838491d27a08e01e1638"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(skyewm): use distributed.is_initialized() after \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/xla_bridge.py"},"region":{"startLine":334}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f7f18b0ab73bc3e6df4a1268d722e469b6a660cf0db9757f571e06a995707ea"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(phawkins,skyewm): switch TPU plugin to use the PJRT plugin mechanism, \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/xla_bridge.py"},"region":{"startLine":377}}}],"partialFingerprints":{"codehealthFindingId/v1":"9abef35739bd3e96597f523ae7a03bc5425f9e869cdda53d9c82227095387671"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(skye): consider raising more descriptive errors directly from backend \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/xla_bridge.py"},"region":{"startLine":936}}}],"partialFingerprints":{"codehealthFindingId/v1":"429b1b4718dafbf443a34cc79fe35139a35fd205bb6944febcbe0aac7166fe3d"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(b/356678989): Only check \u0060backend.device_count()\u0060 when it counts \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/xla_bridge.py"},"region":{"startLine":940}}}],"partialFingerprints":{"codehealthFindingId/v1":"55e89bee2d9718053f91e57c425dea36fd57c7ff915cb1ff7dffee53fc2a2cce"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(mattjj,skyewm): remove this input polymorphism after we clean up how \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/xla_bridge.py"},"region":{"startLine":955}}}],"partialFingerprints":{"codehealthFindingId/v1":"0cbc9baca7451cc8e21f5ba4ed6ac0046fafde27d5b94f2f488ebdc7979b8842"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: remove this sometime after jax 0.2.13 is released \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/xla_bridge.py"},"region":{"startLine":1142}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1c7d67eb14d031549fd8d77dd8666b10897655850399f01990660c10f9129a6"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: remove this sometime after jax 0.2.13 is released \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/xla_bridge.py"},"region":{"startLine":1159}}}],"partialFingerprints":{"codehealthFindingId/v1":"87aef19481cc262f3bdc9282e817065191b59190c874a4d2b5cb548465f4957d"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: remove this sometime after jax 0.2.13 is released \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/xla_bridge.py"},"region":{"startLine":1183}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b92d0bf6209655de6b92c256cf557535bfa3208e0b55228fe5572d85ebb29c0"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(parkers): Get rid of this in favor of a generic way to get topologies. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/xla_bridge.py"},"region":{"startLine":1205}}}],"partialFingerprints":{"codehealthFindingId/v1":"31856611da40b2ac358cf07a7b631b94da9f2402a55cb09355e963298d71b4ca"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(nbasile): Implement tagging gradient ops with metadata. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/xla_metadata.py"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"db57cb732435f8305f046a9be7e8891482aa6595cdeff4a384f5b7bf99121f2e"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(yashkatariya): Figure out a way to reuse code with compute_on_p, fused_p \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/xla_metadata.py"},"region":{"startLine":294}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a2935096c863aef96d42640a897d6bc2b5adfd9f258f857a9dc040dfa93613f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(phawkins): consider extracting _mask/_slice/_update_slice into a \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/tpu/linalg/eigh.py"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"df02d8177e9da18ebbac611f95c71a7d9e723c6c0c0be9eb6840ac9af502955a"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: might be able to get away with lower precision here \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/tpu/linalg/eigh.py"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a74441e45dbb5f5a39000f4a799dabba7acf8301c95361bf10c901e4a444f7a"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: #   split_point = jnp.median(jnp.diag(H))  # TODO: Improve this? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/tpu/linalg/eigh.py"},"region":{"startLine":278}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5937bd1578014cb673560da8fc9f1aa8478dd805a17ca13438a050aeddc8053"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: Improve this? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/tpu/linalg/eigh.py"},"region":{"startLine":408}}}],"partialFingerprints":{"codehealthFindingId/v1":"fde4cec3f822b2e25e1c06e38c63577467cfb62b4b2c025ad3f5fc2f12d3d251"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: maybe we can relax the check below for shape polymorphism? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/tpu/linalg/eigh.py"},"region":{"startLine":601}}}],"partialFingerprints":{"codehealthFindingId/v1":"3718e5f398f7ed8c2195ce83adc45e379a697756db16622e086f8589fd4385d6"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: Add pivoting. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/tpu/linalg/qdwh.py"},"region":{"startLine":236}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c0ed2a91749b0d33101e7724d87c4212230ad31a2a2e3c2f2c935e8b6a96ec4"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: Possibly take advantage of Hermitian inputs to speed up the QDWH step. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/tpu/linalg/qdwh.py"},"region":{"startLine":267}}}],"partialFingerprints":{"codehealthFindingId/v1":"48551d0b8b5388bf1a038a5e2cea5ec941aeaca5949c40f6de9fa56d2b7dffbd"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: Uses \u0060eigvals_only=True\u0060 if \u0060compute_uv=False\u0060. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/tpu/linalg/svd.py"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"d31a19d63e0d4d58199e8311c55f842245cffb4dc4f3d7218898892423f9e5bf"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(sergei) \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/state/discharge.py"},"region":{"startLine":266}}}],"partialFingerprints":{"codehealthFindingId/v1":"4cf5f4981c3c519ce433ba4f2863c91a6b2682fa69094b69e87a4d30ed1db2c6"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(mattjj,yashkatariya): switch to create_linear once the \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/state/discharge.py"},"region":{"startLine":269}}}],"partialFingerprints":{"codehealthFindingId/v1":"162436a7cfef6bb84c06602cff603edf3995aafa808f5d098c5e19068fb29e1a"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(mattjj): Revise this unpin/re-pin spelling to use analogous ops on \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/state/discharge.py"},"region":{"startLine":503}}}],"partialFingerprints":{"codehealthFindingId/v1":"623b93318930733bb3f26458ca21b62239d1fb1a4b0c9f96335f5a109caf803f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(mattjj): Revise this unpin/re-pin spelling to use analogous ops on \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/state/discharge.py"},"region":{"startLine":652}}}],"partialFingerprints":{"codehealthFindingId/v1":"2233364175bd4fc876e561d91003be48537b59149f5db69f998d9409fc159c09"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(mattjj): Revise this unpin/re-pin spelling to use analogous ops on \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/state/discharge.py"},"region":{"startLine":672}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee201858da7a7487d28427c4dd955a329666c9fb4c6230b9f9b1cae766f5ce6b"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(sharadmv): compute this in the general case \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/state/discharge.py"},"region":{"startLine":900}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7772342a11aa3540442be1f598c483398f0281df419ed3705a3b78c3453b3be"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(slebedev): Flip this to be \u0060\u0060is_slice_indexing\u0060\u0060 and update callers. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/state/indexing.py"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"c95542ca27c44ef2d248b493883e48a2c8945fde36be68ffd4045f1ecd657e69"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(slebedev): Find a proper way to support custom indexer types. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/state/indexing.py"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"5853f55a8930950f6df5efcc8a0908a6ba2f0d3e3d9eac756062f0804adf0799"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(slebedev): Consider requiring \u0060indices\u0060 to be a Sequence. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/state/indexing.py"},"region":{"startLine":186}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d291b35eef1dcaaef2790d2c37b18bd1b50013304ec7d6c600ded3f3d624d1d"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(slebedev): Consider pushing these checks to lowering time. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/state/indexing.py"},"region":{"startLine":231}}}],"partialFingerprints":{"codehealthFindingId/v1":"301eabede7454d810daf8a99095408307ecd8c51a89d8fa9dd877f310be3a01a"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(slebedev,mattjj): replace with special handling of Python numeric types: \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/state/primitives.py"},"region":{"startLine":264}}}],"partialFingerprints":{"codehealthFindingId/v1":"09485041628bfe3448b372bd1b6a71c95b8f7c61f75948ebd67a53d45c1cd9d9"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(mattjj): aval.is_high does not imply the existence of ref_get_abstract_aval. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/state/primitives.py"},"region":{"startLine":414}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf865d19b2e07c60a22290c4811282d855e30e966d2469d87bf60b17391bbfbb"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(mattjj): aval.is_high does not imply the existence of ref_swap_abstract_aval. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/state/primitives.py"},"region":{"startLine":461}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0c4979c09f726bf02aecdce92510232abab2e2e736029aef69149186be4380c"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(sharadmv): handle vmap of multiple indexers \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/state/primitives.py"},"region":{"startLine":923}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a87e99a20ca35e7b5ce774d497bc002fdb9cbb7f2863c575a0f12138ace8021"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(sharadmv): handle vmap of multiple indexers \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/state/primitives.py"},"region":{"startLine":1007}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9cf8953653e4aef7380f783adfc03c45f1493c196c2edad749a767d2aa0839b"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(sharadmv): handle vmap of multiple indexers \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/state/primitives.py"},"region":{"startLine":1098}}}],"partialFingerprints":{"codehealthFindingId/v1":"104ee91838764f85255650428066f686a7fdc4f4659c1b4e2a8d001e51ebc5b3"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(mattjj): lin rule for freeze and accum_grad_in_ref? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/state/primitives.py"},"region":{"startLine":1226}}}],"partialFingerprints":{"codehealthFindingId/v1":"037ad7188595ee06b48d5eb7a2443257c3e63fdb73a5195a4dd7840a2380885b"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(sharadmv,mattjj,yashkatariya): merge memory spaces \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/state/types.py"},"region":{"startLine":485}}}],"partialFingerprints":{"codehealthFindingId/v1":"c53155d6719dc9ddcae582f69f2a97eae48cea805ab27c49ad2ac2921eea9e1e"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(dougalm): this is nonsense but it\u0027s here because in places like \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/state/types.py"},"region":{"startLine":726}}}],"partialFingerprints":{"codehealthFindingId/v1":"79ed2d597d2353d9de15097187a1780f3ed6307c9809e6714ba1d20773a328db"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(phawkins): requires dynamic shape support. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/scipy/linalg.py"},"region":{"startLine":1900}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3aff43caf35249f7550fb0625b2c24336528c0ae9c7ff4c8ea8be08f628c02f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(phawkins): return info also if the user opts in? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/scipy/linalg.py"},"region":{"startLine":2081}}}],"partialFingerprints":{"codehealthFindingId/v1":"15753374efbd4993156cd19a01de57ca2bc79fce4ba5148464875f1c0be680c3"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(jakevdp): potentially use next_fast_len to evaluate with a more efficient shape. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/scipy/signal.py"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd61b27c0715836e02551198f5bc242422369c9eaf1bded4d793d636d2372a55"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(jakevdp): implement get_window() in JAX to remove optional scipy dependency \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/scipy/signal.py"},"region":{"startLine":1152}}}],"partialFingerprints":{"codehealthFindingId/v1":"d303d1a751c4d1e6b8a173023ac6e08e9b5e8ab018e818eca3b321d4a5589393"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(jakevdp): use some sort of fixed-point procedure here instead? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/scipy/special.py"},"region":{"startLine":3004}}}],"partialFingerprints":{"codehealthFindingId/v1":"049183dc1909aa9581a2586a3a37b2ac87e203b877a5b241dff9dc5f70a12bea"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(jakevdp): mark non-integers as invalid rather than truncating \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/scipy/special.py"},"region":{"startLine":3849}}}],"partialFingerprints":{"codehealthFindingId/v1":"1dcb242495723177af8acc39fa618e912bad63e59d33d16ad3845cfd85a11e8b"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: return answer without nans included. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/scipy/stats/_core.py"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"7efc9e9f3b056d3ff1f9d8325927af51577ffb58ea7ff9ec43f1dbbe82c1502f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(shoyer): consider switching to only one iteration, like SciPy? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/scipy/sparse/linalg.py"},"region":{"startLine":419}}}],"partialFingerprints":{"codehealthFindingId/v1":"2345ceb1834f3c8f3b3e23e1ba010e3da32acc5a71c1f3ea1ade533b731d4c86"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(shoyer): \u0022Inner loop tolerance control\u0022 on ptol, like SciPy \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/scipy/sparse/linalg.py"},"region":{"startLine":573}}}],"partialFingerprints":{"codehealthFindingId/v1":"08d735a8fae16be1319a0c97859798dc253fab8e9444d08fd6c78eb99f133538"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(jakevdp): use a fixed-point procedure rather than type-casting? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/scipy/optimize/_lbfgs.py"},"region":{"startLine":186}}}],"partialFingerprints":{"codehealthFindingId/v1":"61f7d451d71fe06a48a9a4b3eb9e573a2de311011a1f7c108a2abd28a8252a3b"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(Jakob-Unfried) use rolling buffer instead? See #6053"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/scipy/optimize/_lbfgs.py"},"region":{"startLine":238}}}],"partialFingerprints":{"codehealthFindingId/v1":"647b6090a3b3db08f8ef873a09b53213ecbeee1619c9f2741cadaa9e32365b59"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(Jakob-Unfried) use rolling buffer instead? See #6053"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/scipy/optimize/_lbfgs.py"},"region":{"startLine":243}}}],"partialFingerprints":{"codehealthFindingId/v1":"22448aec42b33549dfcb5bb32f1c82b8aeff44cc7056f24a32daa30d76864f5b"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(jakevdp): should we use some sort of fixed-point approach here instead? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/scipy/optimize/line_search.py"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"55597ae08c04687293dd8d7a08f2b057db1d2596c96e7cd0e85f5126cdede110"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: Import or define these to match \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/random/core.py"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"3fda77996bdd9443c1b97777db51b2230c1aaff134d181d6cde28cc48afcdb20"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: Import or define these to match \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/nn/initializers.py"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"04b92665373e3ac2850e2bd17796c1b4cb440df7f053affd873c52d9fc129b9c"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(jakevdp): possibly remove this warning condition. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/random/core.py"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a305d31e470d8334af11d6500c360165d2869e3e674dc38ad39ea3ea3036599"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(frostig): remove once we always enable_custom_prng \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/random/core.py"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"d308cec66cfd6ea861ad5520c549116691b9076b4bd3031be37825d4005c6980"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(frostig,vanderplas): remove from public API altogether, or at \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/random/core.py"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"60153afe0869d9bc7fcf5cb49218fa0dbaedf7ea110c1ef4f6c4e4ecaef570ad"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(frostig,vanderplas): consider hiding all the attributes of \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/random/core.py"},"region":{"startLine":167}}}],"partialFingerprints":{"codehealthFindingId/v1":"259ecb0ba9640d4157bb4d741dff0114feb50e7566d0058ef05797e36038fe26"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(frostig,vanderplas): remove PRNGImpl from this union when it\u0027s \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/random/core.py"},"region":{"startLine":191}}}],"partialFingerprints":{"codehealthFindingId/v1":"20c857ef9c9c3953dbaf3808a0aae591562b3ae19d1f123bcd3928c1cc91827c"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(frostig,vanderplas): remove this case once we remove \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/random/core.py"},"region":{"startLine":203}}}],"partialFingerprints":{"codehealthFindingId/v1":"36c87f2dec9d83f2d7e1e98a43c8350521062d7e4f18361433f2f4ee44478161"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(jakevdp): make this Key \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/random/core.py"},"region":{"startLine":243}}}],"partialFingerprints":{"codehealthFindingId/v1":"56f9d0f52f97b1239b77e04d602252e5a32530b4c331dc87f23dbd09a4200633"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(jakevdp): make this Key \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/random/core.py"},"region":{"startLine":299}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0125894b260f969104adb34e024a8aa404388d426f3d9ee13314c9dedb4dbdb"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(jakevdp): make this Key \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/random/core.py"},"region":{"startLine":301}}}],"partialFingerprints":{"codehealthFindingId/v1":"f021ff986211deb94af787a37cb2e43a8e120fbdabc11bdb5b2e5596676d4cd5"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(jakevdp): make this Key \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/random/core.py"},"region":{"startLine":332}}}],"partialFingerprints":{"codehealthFindingId/v1":"00bf7121d4c11e9d7caa67deff4ad8cada80b5465eb07acb88fced73bc60560d"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(jakevdp): make this Key \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/random/core.py"},"region":{"startLine":334}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b667c7fc24c0b597f79c1c941e48c0d7a098a66288a466ea2b6f5c27a33243f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(jakevdp): make this Key \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/random/core.py"},"region":{"startLine":358}}}],"partialFingerprints":{"codehealthFindingId/v1":"1485db507ebbc93d5faf4fe14f344e7be5e32102badb53a7e26b8ad154388fed"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(jakevdp): make this Key \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/random/core.py"},"region":{"startLine":367}}}],"partialFingerprints":{"codehealthFindingId/v1":"966b5a7a0d2dde6af598c119e3980c828d98baca7ccaa1f5a6e5a6532f735845"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(jakevdp): make this Key \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/random/core.py"},"region":{"startLine":375}}}],"partialFingerprints":{"codehealthFindingId/v1":"d73697298cca316ca3da956914f97c47d48dd495f0222ddeb6f50290c32e6737"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(jakevdp): make this Key \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/random/core.py"},"region":{"startLine":647}}}],"partialFingerprints":{"codehealthFindingId/v1":"295f270d9d115e5eefd2cb6c3dfac52eddd6d4ed84df9045dc66344c12cdc3dd"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(jakevdp): make this Key \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/random/core.py"},"region":{"startLine":696}}}],"partialFingerprints":{"codehealthFindingId/v1":"6cfe8268537d4a105ccd4810c5b0edf9a7faea6f67e72295fd1acf7844913c4f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(jakevdp): make this Key \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/random/core.py"},"region":{"startLine":839}}}],"partialFingerprints":{"codehealthFindingId/v1":"eefce21ccc4abd41e79c24feda07b12845bbf9178dfe7637c42e9b4212d0aa70"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(jakevdp): make this Key \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/random/core.py"},"region":{"startLine":995}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e9f12ebffd8b75ac900570fe2c8cc65870183c91177e42fd55e91d71d3c88cf"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(jakevdp): make this Key \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/random/core.py"},"region":{"startLine":1108}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4a4b14b5528a0a4c5a88e2682f140865c4e9d3db2b6c2eb0fe6602f10733dda"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(jakevdp): make this Key \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/random/core.py"},"region":{"startLine":1197}}}],"partialFingerprints":{"codehealthFindingId/v1":"907fb4b3a9ae29e98be73a4ca6c4b6a92671988ce82f6d0b231c5efdf0a92ce6"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(jakevdp): make this Key \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/random/core.py"},"region":{"startLine":1411}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ddf096bc5d6cad1b5194852af65e2a781a66b5a620f77ef56e01f7a461b9c79"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(jakevdp): make this Key \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/random/core.py"},"region":{"startLine":1630}}}],"partialFingerprints":{"codehealthFindingId/v1":"f045dbb294da485aa2d2562ab126bdb77dbe67df1e4385c8f083eaa5ed97ef5f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(jakevdp): make this Key \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/random/core.py"},"region":{"startLine":1818}}}],"partialFingerprints":{"codehealthFindingId/v1":"494ca53da48cec75814c8663b5073acb648c5d26abac14d01b7dfe2b2c199839"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(jakevdp): make this Key \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/random/core.py"},"region":{"startLine":1899}}}],"partialFingerprints":{"codehealthFindingId/v1":"b349dc8f88e9d3717e844133247f256866b4a0931f31fc2f16a7ce8de476cc48"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(jakevdp): make this Key \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/random/core.py"},"region":{"startLine":1987}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6709aef70af0e10f2c1998f68f2d3f8e7907a50378f4045dca863bf6c69219f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(jakevdp): make this Key \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/random/core.py"},"region":{"startLine":2039}}}],"partialFingerprints":{"codehealthFindingId/v1":"e69459088fb54c936e38d83517fa2b85e6e963cdf16c26e8065d67d1e887bfd8"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(jakevdp): make this Key \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/random/core.py"},"region":{"startLine":2119}}}],"partialFingerprints":{"codehealthFindingId/v1":"720075cb52c8f64ce8fe72a919d6a602c2d76f9ae73eee650e28aff387eff233"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(jakevdp): make this Key \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/random/core.py"},"region":{"startLine":2480}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6659ca085c0e4b702713a600bbf3f9e46ad0010f479a1bdbb2a716386d3a23d"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(jakevdp): make this Key \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/random/core.py"},"region":{"startLine":2550}}}],"partialFingerprints":{"codehealthFindingId/v1":"4daee1886c0581b8306f61fedfdcd2a54eeb228e4e467f2971ed0041dbfa101a"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(jakevdp): make this Key \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/random/core.py"},"region":{"startLine":3162}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4c7422b45e6ca37785fcd1bb54c5e6bb03002f9e234b8e533d9438b55835dca"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(jakevdp): make this Key \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/random/core.py"},"region":{"startLine":3231}}}],"partialFingerprints":{"codehealthFindingId/v1":"afc6c45a4e02874871ff02e0f946a001a490550f7ba749fdab05dcbe28ba14a1"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(jakevdp): make this Key \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/random/core.py"},"region":{"startLine":3352}}}],"partialFingerprints":{"codehealthFindingId/v1":"29e13c0d2f83b7933bd3499026096ba3d8c2775df20d74f48e7ffae28098dc93"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(jakevdp): make this Key \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/random/core.py"},"region":{"startLine":3477}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2d2148e1c294fc4d775c8de9e43f87f7b2b3278a71c39b0c3e76bd79c55cbf4"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(jakevdp): make this Key \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/random/core.py"},"region":{"startLine":3526}}}],"partialFingerprints":{"codehealthFindingId/v1":"28dc63956ad0d2ea645e6f98081ae206d7b490f7bb8d0930c1b02c4731077674"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(jakevdp): make this Key \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/random/core.py"},"region":{"startLine":3575}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c5346d4d995d4a6263062b4ff952cc59e5c9f78a8e6e023eb589715ac1b4a7f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(jakevdp): make this Key \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/random/core.py"},"region":{"startLine":3633}}}],"partialFingerprints":{"codehealthFindingId/v1":"590663eaa13a671372d0c95527aab3334d4a4f1a468e4bdb7c9a869186652c6c"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(jakevdp): make this Key \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/random/core.py"},"region":{"startLine":3700}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ec05d73525f97a394eee25c6bea99332ccd03eff4554a609ac2aa81215c98a5"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(jakevdp): make this Key \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/random/core.py"},"region":{"startLine":3771}}}],"partialFingerprints":{"codehealthFindingId/v1":"d43ed86a508457ced7b0774f5481faa2b8bd8746b656f3fd3fd6126335adc86d"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(jakevdp): make this Key \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/random/core.py"},"region":{"startLine":3839}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8299a727660e309b47632f17bf5062548b5a4b2e4c8997f0b42e5405243ad78"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(jakevdp): make this Key \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/random/core.py"},"region":{"startLine":3886}}}],"partialFingerprints":{"codehealthFindingId/v1":"5787738a47b3018eb6da4f696fd3205028210250ef768e1ac9e47017137f19a3"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(jakevdp): make this Key \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/random/core.py"},"region":{"startLine":3942}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a50a3081b015478ad55a29dd779d0426ac1eef210af302f6cf57d4887b4a8f0"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(jakevdp): make this Key \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/random/core.py"},"region":{"startLine":3994}}}],"partialFingerprints":{"codehealthFindingId/v1":"6cb6e4bd72ee98140fccd5bb622987c9c6bda949afb950e275d5264c9fb09a74"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(jakevdp): make this Key \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/random/core.py"},"region":{"startLine":4040}}}],"partialFingerprints":{"codehealthFindingId/v1":"bee2c316c5b268d9aa1c41589409f06a93006f382a0dcb606e75c89d732723e6"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(jakevdp): make this Key \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/random/core.py"},"region":{"startLine":4117}}}],"partialFingerprints":{"codehealthFindingId/v1":"2229b56101a32c45cd2bc490ae5e36239a589077a388a1f3abafb8ae5dad6e3e"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(jakevdp): make this Key \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/random/core.py"},"region":{"startLine":4172}}}],"partialFingerprints":{"codehealthFindingId/v1":"6cf6543f3cb46731ba4d3e89b335a92cd45e535e0e22b9e696b6f29540fcebb9"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(jakevdp): make this Key \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/random/core.py"},"region":{"startLine":4226}}}],"partialFingerprints":{"codehealthFindingId/v1":"67e224aa3a56b00535de295f500bceff4a4c03f2b86694a86bf53a0a00304190"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(jakevdp): make this Key \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/random/core.py"},"region":{"startLine":4289}}}],"partialFingerprints":{"codehealthFindingId/v1":"0494c5f45c1d7a9232411a94caf3775a61af2108695c80135588881e0a41cbc2"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(jakevdp): make this Key \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/random/core.py"},"region":{"startLine":4357}}}],"partialFingerprints":{"codehealthFindingId/v1":"8de5e8676e3ac2a020e56d667249de9231174321ebda5b74ddaf340c579d925b"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(jakevdp): make this Key \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/random/core.py"},"region":{"startLine":4422}}}],"partialFingerprints":{"codehealthFindingId/v1":"edbde91f90dc2d50dccdac48581a207134e717ab967287dc166f161489f57ba5"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(jakevdp): make this Key \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/random/core.py"},"region":{"startLine":4502}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc286e58462435522a90ea0b9517418efe5c26c0e5693ee069f420c2e2f85f14"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(jakevdp): make this Key \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/random/core.py"},"region":{"startLine":4717}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b673634a2e4754fe7bc38e2342c156a87aea2d5c4cd3b46f01ead8a90b5cd00"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(jakevdp): make this Key \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/random/core.py"},"region":{"startLine":4774}}}],"partialFingerprints":{"codehealthFindingId/v1":"dfd8fd350bacdf20b8affcb2e06e609a36821a2c8166d04edf81ab1d5bcbb473"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(jakevdp): make this Key \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/random/core.py"},"region":{"startLine":4837}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a0c184665f0e7564c6c7babd78542667bc012710963715583cce4e5ee2ae347"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(jakevdp): make this Key \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/random/core.py"},"region":{"startLine":4838}}}],"partialFingerprints":{"codehealthFindingId/v1":"dfb09cbe4c80add7abd50b0162c2d8dea1d78c0fbe87aac091a346facc877f5f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(frostig): remove and use split(); we no longer need to wait \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/random/core.py"},"region":{"startLine":322}}}],"partialFingerprints":{"codehealthFindingId/v1":"d563fdd79e5b5723653b473c6bbe9c3bae719a788922f333b01dca6f92634d19"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: Use the named part of \u0060p\u0060 as well \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/random/core.py"},"region":{"startLine":1877}}}],"partialFingerprints":{"codehealthFindingId/v1":"abda01021cb84b6338de8f19fa4bee1054fe4310b025e3503cd22153e6410af7"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: use lax.cond when its batching rule is supported \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/random/core.py"},"region":{"startLine":2206}}}],"partialFingerprints":{"codehealthFindingId/v1":"65e23f08a5ffefdea3de0584b38ee7a834448b23e4c74cf9d66072f2a6d4fcd0"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(frostig): generalize underlying poisson implementation and \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/random/core.py"},"region":{"startLine":3220}}}],"partialFingerprints":{"codehealthFindingId/v1":"00affdd0bd346c346399d243ef9488f54edda5291b47d13b75c21ec11d1c7d39"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(parkers): The condition is to protect against rounding up but \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/random/core.py"},"region":{"startLine":3339}}}],"partialFingerprints":{"codehealthFindingId/v1":"42be28e5a740bd2f592b7e6039b83b76503496bce91605043a1a573ef4393304"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(jakevdp): switch to log_u = lax.log1p(u - 1) \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/random/core.py"},"region":{"startLine":4411}}}],"partialFingerprints":{"codehealthFindingId/v1":"aac09206c1f7cd67844b0fde58ad2c2716537e1d0841738702041f286adfe21f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(jakevdp): we could potentially speed this up with device-specific \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/random/philox2x32.py"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5f265bdb2ba800a52c41f4a6c38a19b2b5ee41f3e627cfd344ceb0475cf14ea"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(jakevdp): we could potentially speed this up with device-specific \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/random/philox4x32.py"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6e4d6e5ed7c9e3bdc4102d23e053e20ba68953dd017b718441c2c1af75c4825"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(jakevdp): fix circular imports and import Shard \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/random/prng.py"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"503b0b8b00f5fa00cbfa5a6ce9e41124f5fe6e05f58dd3820e4a2d4645d84c85"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(jakevdp): potentially add tolist(), tobytes(), \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/random/prng.py"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"9764876df719321dcebb37fa2958b32557b9fde4c1ca76be2915f1230f39a7ec"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(jakevdp): default to True here? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/random/prng.py"},"region":{"startLine":177}}}],"partialFingerprints":{"codehealthFindingId/v1":"3cf8702c894fd3e39c1b8685b27b93d974f511bda7475764cc13da5dbbd4fcfe"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(frostig): we may want to avoid iteration by slicing because \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/random/prng.py"},"region":{"startLine":309}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d4c2a13e79eebb435f7a800655499bfc730246d8331fccf81c3dd499db8688e"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(jakevdp): is this correct? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/random/prng.py"},"region":{"startLine":336}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e7196653e5b5a7e0118966abc5605319c736e7e997c62240e7127c12419933b"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(frostig): remove, rerouting callers directly to random_seed \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/random/prng.py"},"region":{"startLine":381}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad69a06e90efa4cd037184391f7669a21c922f1d3128214ec4a585ed8140c3cd"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(frostig,mattjj,vanderplas,lenamartens): consider this consumed from \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/random/prng.py"},"region":{"startLine":405}}}],"partialFingerprints":{"codehealthFindingId/v1":"05524e545703db2973321bace72eb4ff9be42a9a49642da30d16dbf5a463b827"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(mattjj,frostig): even though the key dtype shouldn\u0027t appear in \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/random/prng.py"},"region":{"startLine":465}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae88b9128b5ff9ecfb2eb508fbfe4ae3be14defe0ef09331d26ccc8c1e4032e8"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(mattjj,frostig): protocol really \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/random/prng.py"},"region":{"startLine":474}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab4cfb79e07bd8bee43d3cf30df53f77bc128f8af0116df284f54084d6641d12"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(frostig): Revise the following two functions? These basically \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/random/prng.py"},"region":{"startLine":528}}}],"partialFingerprints":{"codehealthFindingId/v1":"715f9ffa32cfee56098ddb72b5cd4869da0d9fd0dc71e9a5a5caeb2d2ea5ce9e"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(frostig): Consider removal once we always enable_custom_prng. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/random/prng.py"},"region":{"startLine":1002}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9848c25f7a6473d6cb1ab670271d26bf68c9de880833eb86d6e5aec793f38bf"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(jakevdp): how to validate a traced mutable array? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/random/stateful_rng.py"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"11c32db647d0c0aaef2b830ac4d5f854e1646050d2116a23ec834ee05c75e9c8"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(jakevdp): better error message. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/random/stateful_rng.py"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"53ed9bc0c4abdf6ae2983a7691185dd2f05416a46e1007acbcaee574caeb86ba"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(jakevdp): write docstring \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/random/stateful_rng.py"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"833a0ca829eb42a755f8be0655704d1be14a1346a12ca8a0f09c062722998e07"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(jakevdp): write docstring \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/random/stateful_rng.py"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad1f2330fa7e8edc33b4104400c651262b0eaae06be50b1cc62d34f56d334c15"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(jakevdp): write docstring \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/random/stateful_rng.py"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"68cdbc6cbad6e6c2788350cbc7a94741412c949ffc98ee7a3745d27a3de6bc64"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(jakevdp): write docstring \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/random/stateful_rng.py"},"region":{"startLine":157}}}],"partialFingerprints":{"codehealthFindingId/v1":"e72ba24f58013b3efd6f52fec030696334d55ba917061dae72a0877a4756c09d"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(jakevdp): in X64 mode, this can generate 64-bit computations for 32-bit \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/random/threefry2x32.py"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"84a3238235510d156b61f251fde841a11ec1b6c244b4826ab563326ddd0a2613"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(justinfu): Handle semaphores with a custom extended dtype. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/core.py"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"b75d2708b6048da3fd7cd3e383c042795858f3d2529712e4790cb49fe7d55907"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(justinfu): Handle semaphores with a custom extended dtype. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/primitives.py"},"region":{"startLine":223}}}],"partialFingerprints":{"codehealthFindingId/v1":"afc6770106bf81a4bc13fbd421212451686d0bcb24b37334e29a3450b852fe6d"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(sharadmv): implement dtype rules for AbstractSemaphoreTy \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/core.py"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"e67aec5ee4820fb83415cf22ff3dbdc8683290db5b8c2ac451497c6d47abcde4"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(b/368122763): Unify memory space types across backends \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/core.py"},"region":{"startLine":262}}}],"partialFingerprints":{"codehealthFindingId/v1":"08c83ba96d9b9c5c138c8fef5c8e5eee8e370e9c3c19c0f42f2042c6c74453b1"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(sharadmv): Add this once we have a better way to handle \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/core.py"},"region":{"startLine":682}}}],"partialFingerprints":{"codehealthFindingId/v1":"d632083e69bcff6dbced516ab7821557a358ad131d2889faa9bbc974210cd6d2"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(apaszke,sharadmv): Replace mapped dims in block_shape with a transform. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/core.py"},"region":{"startLine":924}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e78072aee5de077fa2af7cbf21f463a8be7d0a26fbd465857999e89b21f4484"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(b/353730556): allow NumPy scalars in grids \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/core.py"},"region":{"startLine":1398}}}],"partialFingerprints":{"codehealthFindingId/v1":"5180c79f09e01a2acb106961a6417224ffbf7dbf5ef6775dc92ad9445c41f364"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(sharadmv,ivyzheng): remove this once we use axis dicts primarily \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/core.py"},"region":{"startLine":1696}}}],"partialFingerprints":{"codehealthFindingId/v1":"01af8f903181fa5c32a325804756f9ba4841666b5df810c5aba336cc138c1e1c"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(rdyro): Unify this among backends. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/core.py"},"region":{"startLine":1722}}}],"partialFingerprints":{"codehealthFindingId/v1":"f34afd798328310ce146206fffeb12541ca525a3f2eb541f9b38abe51843c182"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(slebedev): fix circular imports in the following: \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/einshape.py"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a952105b1ed8f7c26e58de501e9a39c502e706b17882433b965536b9efed221"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(sharadmv): unify this with other Pallas Transforms \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/einshape.py"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f94fa1fad872b6c57b0f55b7938b8ed41b7ee0fcd7c7efe256d7531715532d7"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(justinfu): Move this to a common utility file. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/hlo_interpreter.py"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"079ce6d336d656523793c640d7e1d4ea859bb768d6d5f80dd9fe426667eb4afa"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(justinfu): Evaluate backend-specific primitives in a new pass. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/hlo_interpreter.py"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1ee9d636fdbd7935ef0a8260e30cd5c38e47fac9430fddc142842921098fd6a"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(justinfu): Replace this with a standardized physicalize pass. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/hlo_interpreter.py"},"region":{"startLine":301}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b79d0ef5a9bf67da9280233486c66512e0da1fc4850e04ad1f2e98c7360cf48"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(b/370563936): Fix correctness issue w/ io aliasing \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/hlo_interpreter.py"},"region":{"startLine":357}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ee1cdc6debf0cb253137188663858e7b7b1df953f8861823034e270211650d3"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(mattjj,yashkatariya): if we hide vmapped away mesh axes, use this: \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/mpmd.py"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc934773b6fc1faf9641ddf826f2438b58f8489791a550eddd14eaea953f463b"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(mattjj,yashkatariya): if we hide vmapped away mesh axes, use this: \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/pallas_call.py"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c7cfe94f22bf816f1fbc022067abae73127b3dc97df6217e7e6badf9544a98d"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(slebedev): Handle pinned buffers as in \u0060\u0060pallas_call\u0060\u0060. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/mpmd.py"},"region":{"startLine":173}}}],"partialFingerprints":{"codehealthFindingId/v1":"f62dad31d8f86affa59ff6d65dd6848876634f3a1d43568159c51d065f3a2997"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(slebedev): Add first class support for \u0060\u0060TransformedRef\u0060\u0060s to \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/mpmd.py"},"region":{"startLine":564}}}],"partialFingerprints":{"codehealthFindingId/v1":"225f555405d4bc4d867e4a643131bb877283770f55968eddf83a7499b451c98d"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(sharadmv): Use out_paths for debugging info. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/mpmd.py"},"region":{"startLine":1089}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b87c0aef782df0f23a8661f159ba54c528d257e26cca56f22f25f188f752e00"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(sharadmv): Use in_paths for debugging info. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/mpmd.py"},"region":{"startLine":1107}}}],"partialFingerprints":{"codehealthFindingId/v1":"882318e0f1b25bf9daefab4155b0ffc8fb455ee8c1bfdd5b95a264bc5616ea3a"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(rdyro): For MPMD with more than one mesh, come up with a better \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/mpmd.py"},"region":{"startLine":1115}}}],"partialFingerprints":{"codehealthFindingId/v1":"04e152a4994758b6c17064e8648ef392151dc0eec59e8f7ea341f413fe81b742"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(rdyro): Check if we need to have a similar check for in-kernel \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/mpmd.py"},"region":{"startLine":1117}}}],"partialFingerprints":{"codehealthFindingId/v1":"d79b4ac6b5727ef441b05de94665a9be58b796960b45c076c58568ec8b422b5f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(rdyro): Also check inputs and outputs for core type. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/mpmd.py"},"region":{"startLine":1121}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea1e83439d71d11e2c8e2f232090c162b14300b5e3196fa5b4b540d87caee9cd"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(slebedev): The named scope should not be necessary here. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/mpmd.py"},"region":{"startLine":1233}}}],"partialFingerprints":{"codehealthFindingId/v1":"6323db897e526ce0adf088d9512d04397e51d84ec2c850a66102070b6fed3409"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO consts \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/pallas_call.py"},"region":{"startLine":281}}}],"partialFingerprints":{"codehealthFindingId/v1":"08a85bff1b0474ffb3199bda6e304c79590fedde32ac70e0d4afbdedf1dfa094"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(cjfj): Change output batching axis instead? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/pallas_call.py"},"region":{"startLine":412}}}],"partialFingerprints":{"codehealthFindingId/v1":"38ff42f68e5d27f3cfa899c5c47338b2cd18083b0427da619f199bfe315a6183"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(amagni, sharadmv): Explore possibility of batching dynamic grid \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/pallas_call.py"},"region":{"startLine":617}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d2968735328b09d66bf8d0b27283ae63ad9d7d4585f9fcb82f437b16fd6b88b"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(amagni,sharadmv,apaszke): enable efficient batching over \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/pallas_call.py"},"region":{"startLine":655}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb0b24189fda3a395cd6bc983aad99faadcb14ff584ca678fd04b121a6c9535f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(sharadmv): explore inferring better output dimensions via a heuristic \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/pallas_call.py"},"region":{"startLine":683}}}],"partialFingerprints":{"codehealthFindingId/v1":"f07b69fe00c787f09a803ecc512c70efe0681facf5c0c46247c723acfba0d56d"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(sharadmv): explore a long term solution to output dim inference \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/pallas_call.py"},"region":{"startLine":684}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f87b437575ba62ae8784faf4541329bf3db4f35b31bc46d8311df47949fb07e"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO all batching rules should probably be in outer mesh ctx \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/pallas_call.py"},"region":{"startLine":778}}}],"partialFingerprints":{"codehealthFindingId/v1":"67f0c35e22ce8dd5533186f136cfb69f78ec72533e762aa567f4483dc9030434"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(sharadmv): enable origins for refs \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/pallas_call.py"},"region":{"startLine":1015}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c4c9c0c79e66ba07c17fb7c71cc7bba9535a1b7683487fc103687ce745ae13f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(necula): this canonicalization may be convenient for some usage \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/pallas_call.py"},"region":{"startLine":1251}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2e4ea003712a3eaf8d2c9d8c34ed7c97aa3502fd32becf71c8b9bf7a586b389"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(necula): check that input_output_aliases is well-formed: no duplicates, etc. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/pallas_call.py"},"region":{"startLine":1271}}}],"partialFingerprints":{"codehealthFindingId/v1":"e585e30edb728b2d2348d72dcb64324b61530dafae071cd32234ffca58c4c768"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(dougalm): figure out how put the grid_env contest on the relevant trace \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/primitives.py"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe3adc5501ab8976a2f295d2979c119ae1501e4fdd484548229f8a99236f6919"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(sharadmv): pretty print mask and other \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/primitives.py"},"region":{"startLine":172}}}],"partialFingerprints":{"codehealthFindingId/v1":"d44434eeb0147e5076011a2bcc48d5cfa8e30ec2fa3edca9e453082a67271d49"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(ayx): support strided load/store in interpret mode. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/primitives.py"},"region":{"startLine":275}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec38bc4052be12abd444dfeb770ada4d4fd10b90aa9ee82c3c701888aa690531"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(ayx): support strided load/store in interpret mode. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/primitives.py"},"region":{"startLine":398}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c45f7e25e23655f66287eb93134905737692b53b58719d9d9f8eb62ff36f1ad"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(slebedev): Consider allowing customizing nan behavior. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/triton/lowering.py"},"region":{"startLine":1440}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1e8435657a7a6c61a505c76577f45cfbb2e07928538d57fd053741d34afd88a"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(slebedev): Consider allowing customizing nan behavior. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/triton/lowering.py"},"region":{"startLine":1458}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea2442faeae6fc65a97549ce63c3e6e2a2e957f4d7e5f8a10ffbfc2f9127215b"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(slebedev): Triton promotes bfloat16 to float32 and back here. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/triton/lowering.py"},"region":{"startLine":1444}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ea371a4d2c6b08c96235fbdc19bc685a345ff7cb3e4f5e609136cf5a20bbd87"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(slebedev): Triton promotes bfloat16 to float32 and back here. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/triton/lowering.py"},"region":{"startLine":1462}}}],"partialFingerprints":{"codehealthFindingId/v1":"00c0af2ae3d11853bdc9318f94221df126ff9f0e56c1f4e0df847b6e1c637051"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(slebedev): Check the CUDA version and raise conditionally. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/triton/lowering.py"},"region":{"startLine":1679}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c2d0c8bbc5a49a362313e0f372439b315dd675b11392c444bce28359ba6b5d9"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(suvorovv): Remove this fallback once jax oss has been updated. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/triton/lowering.py"},"region":{"startLine":1837}}}],"partialFingerprints":{"codehealthFindingId/v1":"e667949e44268ae96ab0b5a8ad9ef909314b40a145cb819640801c327d35e3ac"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(suvorovv): Remove this fallback once jax oss has been updated. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/triton/lowering.py"},"region":{"startLine":2154}}}],"partialFingerprints":{"codehealthFindingId/v1":"a36796c0ab7c5b043fcd7e59ba777229540eb05134c1bd704b3251ca56e78f7d"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(suvorovv): Remove this fallback once jax oss has been updated. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/triton/lowering.py"},"region":{"startLine":2371}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd790d73eb65fcb558907ec830001bf4b5d7eea702338187dc7cd030100ace9b"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(cjfj): Add support for larger powers of 2. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/triton/lowering.py"},"region":{"startLine":1905}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a55ab0918f61b2a0b459d5c6c261013db74039694607b77624dabcf97d9507d"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(bjp): Get rid of the double negation. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/triton/lowering.py"},"region":{"startLine":2645}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e2699f5399da0103ede407edb65380fdb5a881db46006c2ad4d77e61a111af6"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(slebedev): Use \u0060pallas_utils.pattern_match_while_to_fori_loop\u0060. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/triton/lowering.py"},"region":{"startLine":2933}}}],"partialFingerprints":{"codehealthFindingId/v1":"c21b39be986d6a0d2dc597fa3976f25d99cfbcef75940ee720e7afd15f6cb903"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(bjp): Switch to scf.index_switch once exposed in triton.cc \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/triton/lowering.py"},"region":{"startLine":3010}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e61ef574899cdf733e4d121d345c622208e7c556552daf0127e7a2009116a21"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(bjp): Instead of linear nest of \u0027if\u0027s, partition into halves. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/triton/lowering.py"},"region":{"startLine":3021}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b77d182cd2c1196668241d97eacb679c93e14e7891ee6fc567f7d4fe7ac2c61"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(petebu) Handle case where src and dst types have different bitwidths \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/triton/lowering.py"},"region":{"startLine":3083}}}],"partialFingerprints":{"codehealthFindingId/v1":"797485ae3f936788755dff9b248f0efeca250a57d2f817a5993dce8b711ac2ba"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(sharadmv): Add HiType constructor support. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/mosaic_gpu/core.py"},"region":{"startLine":210}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0e3f4ce75634c62f3d7c2140c5e58aafcbb7d6e3e39df12fb96c8ae508510f5"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(slebedev): Use mesh-specific batching rules in \u0060\u0060mpmd_map\u0060\u0060 instead. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/mosaic_gpu/core.py"},"region":{"startLine":420}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c6f51be64e51233e16437368be8aba001acf85e26fb98dc65f9bd5bdb5d46db"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(slebedev): This is only here for backward compatibility. Remove. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/mosaic_gpu/core.py"},"region":{"startLine":452}}}],"partialFingerprints":{"codehealthFindingId/v1":"da18d0f2dc66a7f5b521f6a70d3e3c0962172ebef8613498ff29ba61530e54ca"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(sharadmv): upstream into pallas core \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/mosaic_gpu/core.py"},"region":{"startLine":1060}}}],"partialFingerprints":{"codehealthFindingId/v1":"bdaa2e400619bace6ba25e5379505442a29a27bed65958d7d1ec7ef5ca8dd34e"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(bchetioui): unify layout_cast_p with relayout_p \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/mosaic_gpu/core.py"},"region":{"startLine":2005}}}],"partialFingerprints":{"codehealthFindingId/v1":"261ec5251d3f24b3bb8ecb99fbd8c6571127fad18a6d5ef30d589c8187a7a4bd"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(b/435159109): Remove this once LLVM regression is addressed. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/mosaic_gpu/core.py"},"region":{"startLine":2084}}}],"partialFingerprints":{"codehealthFindingId/v1":"290e0deff20d08974a9ded23f0dafcccb0c9fff0a2ef9ef90518c92805f3b0c0"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(apaszke): Remove the layout suffix. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/mosaic_gpu/core.py"},"region":{"startLine":2170}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a3ee472c8bf75da65ec39b853076c4ca6871ca555872cdaac34264ee71a83d2"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(slebedev): The type argument should also be comparable. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/mosaic_gpu/lowering.py"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"216e7b549b5a5b32b2a0e79d853d604575628fd9e9e5e36688287e44d70982dd"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(slebedev): Optimize this. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/mosaic_gpu/lowering.py"},"region":{"startLine":175}}}],"partialFingerprints":{"codehealthFindingId/v1":"35b8a6692cb9d7d8d1f08acf7717a137ec4d2ff7d9ae09ccfdbee134bc59edc7"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(slebedev): Add support for other primitives, notably control flow. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/mosaic_gpu/lowering.py"},"region":{"startLine":249}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d91916eecad22e75386b51a754be598550193b8c62c7a5db9cb3adcb3635d60"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: In debug mode verify the values of all semaphores are again 0 \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/mosaic_gpu/lowering.py"},"region":{"startLine":544}}}],"partialFingerprints":{"codehealthFindingId/v1":"059da0b642d1b96417f16bd63631b4f05d403006d0bd4ef883ed4f0183b04d0d"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(justinfu): Compute scope_idx for general collective_axes. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/mosaic_gpu/lowering.py"},"region":{"startLine":801}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d78024bf1c43c470846bf8bca5089296b55acfdd543ea43847a1fe4530e7bdb"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(justinfu): Compute axis_size for general collective_axes. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/mosaic_gpu/lowering.py"},"region":{"startLine":921}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7b7de9906af04c2040c25030c32fcb8700888a9229e5f591c74ede0d58d2401"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(apaszke): Handle other avals (refs, etc.). \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/mosaic_gpu/lowering.py"},"region":{"startLine":1063}}}],"partialFingerprints":{"codehealthFindingId/v1":"49574a6b43e22b36c8e4b6ddc539eb37257a0875e0bb8a70b391543a3e35d750"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(apaszke): Clarify the type invariants for lane semantics? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/mosaic_gpu/lowering.py"},"region":{"startLine":1065}}}],"partialFingerprints":{"codehealthFindingId/v1":"81540e87a8190ffeaa70d5038dcc54ff8bd8131bf2c0b4d8b26eeed82cd3a672"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(justinfu): Handle transform scopes. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/mosaic_gpu/lowering.py"},"region":{"startLine":1099}}}],"partialFingerprints":{"codehealthFindingId/v1":"901400f581bcdf700ebed4fca93b78069c5638d533087c12004b260ca9fac9f4"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(justinfu): Handle transform scopes. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/mosaic/lowering.py"},"region":{"startLine":1821}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9038e704b4732111dfb4fdfcd4a09e5195236a040af312f58a7aba6eb435bab"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(bchetioui): Use a scheme resilient to hash collisions. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/mosaic_gpu/lowering.py"},"region":{"startLine":1399}}}],"partialFingerprints":{"codehealthFindingId/v1":"cdd13441e8e30c840514406c49bdc24407527f40058c14505c36eda1363eabce"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(bchetioui): Use a scheme resilient to hash collisions. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/mosaic_gpu/lowering.py"},"region":{"startLine":1439}}}],"partialFingerprints":{"codehealthFindingId/v1":"b79a54a49f165bfbb0cfe4995722a173319fb91efb3b9c0b75a559f69c87fc86"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(bchetioui): support implicit broadcast. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/mosaic_gpu/lowering.py"},"region":{"startLine":2296}}}],"partialFingerprints":{"codehealthFindingId/v1":"6824f2886080e15df6069bf1ed9e516ec8b10c103624d15a349c2af035279e92"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(bchetioui): here, we could just donate all the remaining free SMEM that \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/mosaic_gpu/lowering.py"},"region":{"startLine":3185}}}],"partialFingerprints":{"codehealthFindingId/v1":"aab05fbec0f48bac7a295b88d3dadecb45377d61e0bd7b058447736743a0732f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(apaszke): This should be unified with run_scoped. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/mosaic_gpu/lowering.py"},"region":{"startLine":3677}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ec879e39b85722e87696b051ee0d9da7fef1f22e042fd5aa7791deb6a4f1732"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(slebedev): Emit an epilogue taking care of the remaining steps. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/mosaic_gpu/lowering.py"},"region":{"startLine":3801}}}],"partialFingerprints":{"codehealthFindingId/v1":"39319e54d9824304119b05fb818684a7f3e90d87e4a9993e19c5088d0d105f66"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(cperivol): We assume all indices are signed. We should \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/mosaic_gpu/lowering.py"},"region":{"startLine":4436}}}],"partialFingerprints":{"codehealthFindingId/v1":"962ec69b9e0dfbfc72449f0999e632bbeb5f22c516cfa250885fc063409fa0ac"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(slebedev): Find a better place for this. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/mosaic_gpu/pipeline.py"},"region":{"startLine":244}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0de3cde1fbca7c9243caa0ce6c0eaf4882044ad1401df0485d3ba610b415212"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(justinfu): Factor out common code between warp-specialized and \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/mosaic_gpu/pipeline.py"},"region":{"startLine":310}}}],"partialFingerprints":{"codehealthFindingId/v1":"23b285dfe2ec8d831ba491a6ff2d070d7393fe4d1a62ba11f0f85164166f0650"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(justinfu): Factor out common code between warp-specialized and \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/mosaic_gpu/pipeline.py"},"region":{"startLine":740}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c498d5c4a4ab6e7aad5e233648e547a1ca4080d7125edb58fd49e7c27ad049b"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(slebedev): Change this to arrive only once. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/mosaic_gpu/pipeline.py"},"region":{"startLine":384}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d2136c7351e8abd1018313f65fa920d7a761ae3d22d3570055005ae16c6b0f7"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(apaszke,slebedev): This still diverges significantly from the \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/mosaic_gpu/pipeline.py"},"region":{"startLine":487}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e64ad8623ec88ecc03c27fca7b6ad49de320135f90555e7055399f49ed335e0"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(justinfu): Only store base pointer instead of all indices. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/mosaic_gpu/pipeline.py"},"region":{"startLine":536}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6f740c217659bdbce6823dc8276f7318b4f69b4bf036f9448574cec5076cfeb"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(justinfu): Only store base pointer instead of all indices. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/mosaic_gpu/pipeline.py"},"region":{"startLine":1071}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8780e8b9e658985b676b75cde8e5c57a896dfeabdfee64ab02566b243af2487"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(slebedev): Consider branching on the number of remaining steps \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/mosaic_gpu/pipeline.py"},"region":{"startLine":569}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7ce2eab1a0191cb1f103ebf9c067f9761b521b4d986ce096810d93181f0f519"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(justinfu): Indexing calculations for buffers assume the memory \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/mosaic_gpu/pipeline.py"},"region":{"startLine":789}}}],"partialFingerprints":{"codehealthFindingId/v1":"efa2836a1588ff47896bf2dfab1a86baefe3722b99d80358913e6de95f7a764a"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(justinfu,apaszke): This should probably be done by the memory WG. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/mosaic_gpu/pipeline.py"},"region":{"startLine":1042}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8072bab5d1cce87ac3246b1895566db738476ad1fe26b26ce67b4cb4dbaae2f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(apaszke,justinfu): Use a single arrive_expect_tx for all transfers. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/mosaic_gpu/pipeline.py"},"region":{"startLine":1123}}}],"partialFingerprints":{"codehealthFindingId/v1":"b84f2a36cb367c791305e770a307243918ea8d0995cc2d7c85a389a289216b25"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: apaszke - Relax this. We can just select the WG leader and \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/mosaic_gpu/primitives.py"},"region":{"startLine":1199}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c7883e0e73f48b33271e67129a14b34fc4b12b3d3980c3c4a7678af1e7b43e1"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(justinfu): The arrival counts are wrong if called outside of a \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/mosaic_gpu/primitives.py"},"region":{"startLine":1210}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5925e10f825b73d20343ed25ad7b4f050cc387a25a1cb70d3b391d404ab0eaf"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(slebedev): Remove the ignore once the minimum jaxlib is \u003E0.12.0. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/mosaic_gpu/primitives.py"},"region":{"startLine":1311}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1f599c64eac02121e9a372df91f0d6011372f0281e853fbf04411c546608860"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(justinfu): If under a core_map, the avals for acc/a \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/mosaic_gpu/primitives.py"},"region":{"startLine":2785}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0c7182f05e0c25d422cf0426538239c20e225ffc735575b99c05f0c584a4de8"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(cjfj): remove when minimum jaxlib version is 0.12. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/mosaic_gpu/primitives.py"},"region":{"startLine":3321}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5721357d64d7f2197dff885de537e911b1bb770cdea75dd97040c3765a8c36d"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(bchetioui): add primitive for commit smem to mosaic_gpu dialect. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/mosaic_gpu/primitives.py"},"region":{"startLine":3446}}}],"partialFingerprints":{"codehealthFindingId/v1":"a029a83d7c77e8cc987385f0fa49d4a8a1c060f12421d7d7db5118a4626a474a"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(apaszke): Narrow the scope from .sys to .gpu when the semaphore is local. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/mosaic_gpu/primitives.py"},"region":{"startLine":5015}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd84e50f1fc41518847d73a909d345d7d2a35cd5553d9529ec64dcc77599665e"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(b/415721295): Check whether this is slower than doing \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/mosaic_gpu/primitives.py"},"region":{"startLine":5093}}}],"partialFingerprints":{"codehealthFindingId/v1":"cdff4d27118980f6f3fa94037144d758a155579f8110947d5316e0af9fecdcd9"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(apaszke): Add support for jax.jit, which will call another function \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/mosaic_gpu/torch.py"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9c43d7c1337c2ecba4cb8da02105228d0500efef2949ee687c2a2fb4b14ade1"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(nrink): Support different DMA execution modes on GPU. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/mosaic_gpu/interpret/gpu_callbacks.py"},"region":{"startLine":183}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c9d018b876502b882d7be82ed06f540a221cc3415cad8c3c02a725bd400cdc0"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(paulbib): Support warp specialization \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/mosaic_gpu/interpret/gpu_callbacks.py"},"region":{"startLine":255}}}],"partialFingerprints":{"codehealthFindingId/v1":"2aaebd5ea834a28db4066dfae4ced051f28096793b8d93a576fec96d494f315d"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(jburnim): Include indices of out-of-bounds locations where mask \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/mosaic_gpu/interpret/gpu_callbacks.py"},"region":{"startLine":750}}}],"partialFingerprints":{"codehealthFindingId/v1":"d11e49996698d25041d2086260c8d28242c2dd5eb6a94556d0397f1ae7a83bcf"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(jburnim): Include indices of out-of-bounds locations where mask \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/mosaic/interpret/interpret_pallas_call.py"},"region":{"startLine":910}}}],"partialFingerprints":{"codehealthFindingId/v1":"73252d7fe45b9dfae65520900887e5fae7c55bfb6d48c4e2a4526419cea09119"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(paulbib): Only the write half of the swap is registered with race \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/mosaic_gpu/interpret/gpu_callbacks.py"},"region":{"startLine":759}}}],"partialFingerprints":{"codehealthFindingId/v1":"5405d453f6c94fa40b8cf35c55833ad926b422dd524b3fb1c1889f08b23c670b"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(paulbib): Add race-check validation on deallocation, i.e.: make sure \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/mosaic_gpu/interpret/gpu_callbacks.py"},"region":{"startLine":896}}}],"partialFingerprints":{"codehealthFindingId/v1":"99b60140aae9503441ae15ebdfcda6742e66fd38b2f5b849b73f31c280462f01"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(nrink): If we had a dedicated memory space for cluster barriers \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/mosaic_gpu/interpret/gpu_callbacks.py"},"region":{"startLine":910}}}],"partialFingerprints":{"codehealthFindingId/v1":"51705d7b16cc751743c52c2ae36159097aa2f2d7a51819184ed5602b9639a03c"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(paulbib):support more than just the default of \u0060OOBFillMode.ZEROS\u0060. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/mosaic_gpu/interpret/gpu_callbacks.py"},"region":{"startLine":1349}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f4bac8c086b3d9989aa978d99822b147f747682f08a639b570349a7a5bc0e36"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(paulbib): GMEM updates are only visible to the async proxy (TMA) \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/mosaic_gpu/interpret/gpu_callbacks.py"},"region":{"startLine":1380}}}],"partialFingerprints":{"codehealthFindingId/v1":"09e4fc3a0640267993d275bef9a7ce3419e75b8c209493d287282cbe491bdbf7"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(jburnim): Vector clocks. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/mosaic_gpu/interpret/gpu_callbacks.py"},"region":{"startLine":1502}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b7887c1d5378241c836aa377198cff7d1c398e6331bc0cd0456d0b6e0153778"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(jburnim): Async wgmma. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/mosaic_gpu/interpret/gpu_callbacks.py"},"region":{"startLine":1503}}}],"partialFingerprints":{"codehealthFindingId/v1":"0694f4919dfa220019a44a9604b98b543d818129c26136d51edc3b2cab1c005e"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(jburnim): wait_n for async wgmma. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/mosaic_gpu/interpret/gpu_callbacks.py"},"region":{"startLine":1565}}}],"partialFingerprints":{"codehealthFindingId/v1":"69760cd0d37882ae5b41064e9b6d57696fae4eecb0cbce94f293b0cd34c30aba"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(jburnim,paulbib): Implement commit_group. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/mosaic_gpu/interpret/gpu_callbacks.py"},"region":{"startLine":1597}}}],"partialFingerprints":{"codehealthFindingId/v1":"358e56e2f90a96a282bf1061d7df35315e2cd546097e8e74b6398b0e79bf8073"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(paulbib): Support scales and sparse metadata. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/mosaic_gpu/interpret/gpu_callbacks.py"},"region":{"startLine":1747}}}],"partialFingerprints":{"codehealthFindingId/v1":"559e60f4d3fa2c9a6cfd41ea7378021730135562d2b5b320248aae1adde15bf4"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(paulbib): for race-checking, we don\u0027t technically need to check \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/mosaic_gpu/interpret/gpu_callbacks.py"},"region":{"startLine":1831}}}],"partialFingerprints":{"codehealthFindingId/v1":"7cabbe0458a6ad79521b3248a620e4c3092001172f8e3e20d8d72ee319531dbf"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(paulbib): Support collective_axis. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/mosaic_gpu/interpret/gpu_callbacks.py"},"region":{"startLine":2072}}}],"partialFingerprints":{"codehealthFindingId/v1":"48c2eb8c5912bcfaaae1f0b1af4cfd4aad110db0b7c458073186bea7974cefce"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(nrink): This code is a simplified version to the corresponding TPU \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/mosaic_gpu/interpret/interpret_pallas_call.py"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"7278be3fa08ed1aeea2829d079cf4b298e04516babc3c69ae8ae0786a5622d24"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(nrink): This code is a simplified version to the corresponding TPU \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/mosaic_gpu/interpret/interpret_pallas_call.py"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b1bf08642b7eec33293a33c9b0b7d4788fc40a2464ac1a26916070a39983704"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(nrink): This code is a simplified version to the corresponding TPU \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/mosaic_gpu/interpret/interpret_pallas_call.py"},"region":{"startLine":201}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c596a206d99cab4dafbfdfe02dd43c14bdbe59331ac778402f25082258efe2a"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(nrink): Support allocation of semaphores. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/mosaic_gpu/interpret/interpret_pallas_call.py"},"region":{"startLine":209}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ff8afbf80fe614a9c913be71f89ab315045ca2d6c8bb948cb9e34ec04dda374"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(jburnim): For kernel args in GMEM, check that block shape equals \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/mosaic_gpu/interpret/interpret_pallas_call.py"},"region":{"startLine":213}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb3838eec95eba40f7003cc5db505ad2c84b3337d4e5dfc4bff7b0ae37bfed9e"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(nrink): A more fleshed out implementation of the GPU interpreter may \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/mosaic_gpu/interpret/interpret_pallas_call.py"},"region":{"startLine":367}}}],"partialFingerprints":{"codehealthFindingId/v1":"48c76e8972abfbf75def4a9539c658cb170d63dbe1b2ed37cd846895dd96955d"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(nrink): Support non-trivial \u0060BlockSpec\u0060s (i.e. with non-trivial \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/mosaic_gpu/interpret/interpret_pallas_call.py"},"region":{"startLine":371}}}],"partialFingerprints":{"codehealthFindingId/v1":"744c9b4d1e1c07c20f845ddbc10bb0f4d38663ba9aa5777809004709d420c9cf"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(nrink): The two assignments below have been taken from the \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/mosaic_gpu/interpret/interpret_pallas_call.py"},"region":{"startLine":446}}}],"partialFingerprints":{"codehealthFindingId/v1":"cbc77c3fab963a2398d6c56194f87f887eaa14ea54bc3f50bc246ad562285940"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(nrink): Support copying of slices/blocks only, based on the \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/mosaic_gpu/interpret/interpret_pallas_call.py"},"region":{"startLine":483}}}],"partialFingerprints":{"codehealthFindingId/v1":"8fa7c7ab87b84536d06caf95fed8d5d3ba366d4869faa28bf550e649d4dfbec6"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(nrink): Support copying of slices/blocks only, based on the \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/mosaic_gpu/interpret/interpret_pallas_call.py"},"region":{"startLine":517}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7e89ec7ae7cafa96e4f0e625f6cd714a1b0d97e2604a79fd64536b58530ab40"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(paulbib): reset relevant shared memory state here \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/mosaic_gpu/interpret/interpret_pallas_call.py"},"region":{"startLine":529}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f9e5cc294ea252a2009f46ccfed97266e71d4584563d08a3bf924856e99134a"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(nrink): Determine if any synchronization between the vector clocks is \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/mosaic_gpu/interpret/interpret_pallas_call.py"},"region":{"startLine":553}}}],"partialFingerprints":{"codehealthFindingId/v1":"5786dd81863a9fad2fd807fe36b8951918e6bc5ffc163f8ab80eccfb9ec7a7b3"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(nrink): For now we execute the grid by sequentially looping over the \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/mosaic_gpu/interpret/interpret_pallas_call.py"},"region":{"startLine":562}}}],"partialFingerprints":{"codehealthFindingId/v1":"6505ef7bebcd7097c19d662c69028eaaa5bba714c0da899c2c09ff076c66f940"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(nrink): Support more memory spaces. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/mosaic_gpu/interpret/jaxpr_interpret.py"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"401d929c513ba3a31c8fa6b4ecf11de74c01da09afbbca4bec271c7a6a9779d1"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(paulbib): When \u0060wgmma\u0060 race-checking is added, await all outstanding \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/mosaic_gpu/interpret/jaxpr_interpret.py"},"region":{"startLine":462}}}],"partialFingerprints":{"codehealthFindingId/v1":"003f8b0cff292abcfc451b08011e3a7f8ee568e184832389e50b8f943f210e53"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(nrink): Simplify the interface to \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/mosaic_gpu/interpret/jaxpr_interpret.py"},"region":{"startLine":547}}}],"partialFingerprints":{"codehealthFindingId/v1":"619a7b31274bc56aaad4640934986e4d25ccb6a5966ba68803460b87f00591a6"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(nrink): For sempahores, check that they have value zero at \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/mosaic_gpu/interpret/jaxpr_interpret.py"},"region":{"startLine":636}}}],"partialFingerprints":{"codehealthFindingId/v1":"6bc93ee2aa2b40d39c679065b8a41a6e619e9ef66e867bb01bcf4c2b6deeff24"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(paubib): this is the worst case for inline mgpu support: we don\u0027t \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/mosaic_gpu/interpret/jaxpr_interpret.py"},"region":{"startLine":953}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e63a7d2e374cf7c960b95b9c064e255c72a44d4c2cad15c880b674fc9f9c080"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(paulbib): we\u0027re missing the ability to catch races by not letting \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/mosaic_gpu/interpret/jaxpr_interpret.py"},"region":{"startLine":1380}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0f52c40e468f64a09fa4465b16be2d128716630adea8574ad30d8e5f43c4781"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(jburnim): commit_group_p \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/mosaic_gpu/interpret/jaxpr_interpret.py"},"region":{"startLine":1513}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2363203356d56dd3c549a1e5da18dffaf67a7da61438f87ad75d27fcd3bba76"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(jburnim): wgmma_wait_p \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/mosaic_gpu/interpret/jaxpr_interpret.py"},"region":{"startLine":1515}}}],"partialFingerprints":{"codehealthFindingId/v1":"0064470fa52739432f1c7ddf6bc2def405b14cafd193b1c5ca3431110f4b00b3"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(jburnim): Rename to config.pallas_interpret_mode_context_manager. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/mosaic_gpu/interpret/params.py"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"77ff66e9fa7f6b7e32888a74a32c1e5e669eee36de409b70af6e400473f77035"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(paulbib): Is there a way to assert these match the base class? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/mosaic_gpu/interpret/shared_memory.py"},"region":{"startLine":444}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf9da777b88eb283e1d5b9d54306f5a6982a01c4ec8f9e31090a52550e180ef3"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(nrink): Consider adding an option for selecting TMA thread IDs \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/mosaic_gpu/interpret/shared_memory.py"},"region":{"startLine":672}}}],"partialFingerprints":{"codehealthFindingId/v1":"b970eada153e729f08e8cd2d55908ca59e67f1bb7eeceb295cb6df4abd920041"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(nrink): Consider unifying this method with \u0060allocate_barrier\u0060. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/mosaic_gpu/interpret/shared_memory.py"},"region":{"startLine":821}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4543fa0dab7fe540bf88a57bea74400138050de45a556ceac4bf5093d11db5c"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(nrink): Consider unifying this method with \u0060deallocate_barrier\u0060. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/mosaic_gpu/interpret/shared_memory.py"},"region":{"startLine":858}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc097d756877c3ac331ab223d2fd94b1a4d11ad7855dc4bc945f8673d99b82d7"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(paulbib): since we never get rid of old tasks, this list grows \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/mosaic_gpu/interpret/shared_memory.py"},"region":{"startLine":936}}}],"partialFingerprints":{"codehealthFindingId/v1":"def9cc96c2088509040a9248ffb730ddb88ce97254c3df1f4ab1b86e4935292d"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(paulbib): add check that tmem loads and stores have completed. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/mosaic_gpu/interpret/shared_memory.py"},"region":{"startLine":1062}}}],"partialFingerprints":{"codehealthFindingId/v1":"678870657567801ff8012d3c24e2d1d259c04ebcecc7aa1dc7074377b50e6faa"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: Add support for mpmd with SparseCore meshes. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/mosaic/core.py"},"region":{"startLine":447}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c484262681c1abf12c197387963e72ea4e59bf1a7fe63d30e5145d86e5ab8e5"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(mvoz): Find a way to make this a contract we can share with the \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/mosaic/lowering.py"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"170aa1d9023a6f81c9d8848970c373b1b4650342953855307378885534ec3701"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(slebedev): Make this a TypeIs function, once we migrate to Pyrefly. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/mosaic/lowering.py"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"b830409a24a4d19461eaba69020f5f609b371b03d5d3a991594394d28c16d10f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(b/355036977): generalize this across other platforms \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/mosaic/lowering.py"},"region":{"startLine":239}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0a87a1a4009c51e3f02f32d33e90c25ef85bc6a206f898f2112e2b78ba23093"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(phawkins): this is probably from KeyScalarBundle primarily. Handle \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/mosaic/lowering.py"},"region":{"startLine":508}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b5a6965659829ed3159efcd4fc371bfb94b0985af4bdafb6e08aae7257ff6c3"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(justinfu): Remove after mosaic supports unsigned types. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/mosaic/lowering.py"},"region":{"startLine":590}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d767b28db6f8dae40c1be67ae067a8ee6363a01e435516ac7e515c3c2e10be9"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(phawkins): currently we are excluding higher-order primitives other \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/mosaic/lowering.py"},"region":{"startLine":688}}}],"partialFingerprints":{"codehealthFindingId/v1":"00f87ea1e71c4a7d5280a52c5a44feedf4502f8ab01b89e2454bc2082389ae32"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(mvoz): Generalize to not need this \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/mosaic/lowering.py"},"region":{"startLine":797}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5cbf2dbc686afcf67f8169264bcabfbc996cc8263ef38578a607752b4a7686d"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(sharadmv): implement this optimization \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/mosaic/lowering.py"},"region":{"startLine":909}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e127eb921c40025d4163ea76b817a58c31093dd71340e6a0179e32510449d69"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(necula): add tests for SMEM blocks with trivial windowing \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/mosaic/lowering.py"},"region":{"startLine":981}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae865cac0d0a6e944b96df77b800cfbbda02fc14e2b5b53e8d0c867198bc89e5"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(necula): add index_map source location info \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/mosaic/lowering.py"},"region":{"startLine":1001}}}],"partialFingerprints":{"codehealthFindingId/v1":"e740bf5fd27a355725a6aafc034ac9bf07dbf8260cb219f42612cac0348b8052"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(slebedev): Use a TypedDict here. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/mosaic/lowering.py"},"region":{"startLine":1378}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff34006e3543810d117d84f24285a6abe86c8683a5b6e258dd0ebe7457749849"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(sharadmv): Relax compiler checks to allow for no windowing. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/mosaic/lowering.py"},"region":{"startLine":1558}}}],"partialFingerprints":{"codehealthFindingId/v1":"77c043bb3567747f5acbdd7a0fcac5d8f050cff905db9cb615d2a4de12d55614"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(slebedev): Update the SparseCore compiler to allow this. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/mosaic/lowering.py"},"region":{"startLine":1571}}}],"partialFingerprints":{"codehealthFindingId/v1":"5437bf2737dcea6d3b71aea1bccac4386a67ca6239f4c90b8a3b0a11f6793c11"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(phawkins): allow KeyScalarBundle/AccRef here as well as ir.Value. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/mosaic/lowering.py"},"region":{"startLine":1857}}}],"partialFingerprints":{"codehealthFindingId/v1":"2722a8e90950b8f5a0c252db69fed421bcab59827e8eea936cb529f8f69b14a2"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(justinfu): Merge this with standard extended dtype handling. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/mosaic/lowering.py"},"region":{"startLine":2487}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec63bf3d9297a4e4402c2b9bf56b586fd496de4009c21afb4b48de443a562525"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(b/351017807): Implement this logic in Mosaic MultiDimReductionOp \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/mosaic/lowering.py"},"region":{"startLine":2865}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c81d76604946816fd8605fd33a341a54b4d6ed03378e26e204bd9164236456b"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(b/351017807): Implement this logic in Mosaic MultiDimReductionOp \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/mosaic/lowering.py"},"region":{"startLine":2878}}}],"partialFingerprints":{"codehealthFindingId/v1":"d925bac06ad46f79e175af3d0d720003e9e27d79274aa2a6d4d7f58fd97e1c17"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(apaszke,mvoz): Move the upcasts for cmpi to the Mosaic canonicalizer. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/mosaic/lowering.py"},"region":{"startLine":3308}}}],"partialFingerprints":{"codehealthFindingId/v1":"be926e07cb3fdd1b3f8a132e05cda1d02d8557adf077ce683eb286a55399099c"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(b/460843515): Support 1D inputs in Mosaic. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/mosaic/lowering.py"},"region":{"startLine":3751}}}],"partialFingerprints":{"codehealthFindingId/v1":"d97fca4e2c14a906165cd088a1c20dd8476a45e75e7390041a1005ff79808684"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(apaszke): Remove forward_compatible check and associated code after 20.08.2026 \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/mosaic/lowering.py"},"region":{"startLine":4629}}}],"partialFingerprints":{"codehealthFindingId/v1":"c315ceb7db6702608cc3f5d58f44efd24deac5cc02c08d7a57743383cbdb0783"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(apaszke): Remove forward_compatible check after 12.08.2026 \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/mosaic/lowering.py"},"region":{"startLine":4708}}}],"partialFingerprints":{"codehealthFindingId/v1":"79b5bb4554e5def967e44184946b6883408d04d0085710797a4a3fc8880bad19"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(jburnim): Lowering rules for SC and Mosaic GPU. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/mosaic/lowering.py"},"region":{"startLine":4994}}}],"partialFingerprints":{"codehealthFindingId/v1":"36ac7a7ad2b0095c25b8839d15a8fb7eacda1430c5d3a07084b8e50b566cc011"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(rdyro): Mosaic requires resolving the core axis when the \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/mosaic/lowering.py"},"region":{"startLine":5522}}}],"partialFingerprints":{"codehealthFindingId/v1":"43b551d17ecc3d48ea8527276a5ab1ee67235704c771e7595c69e9ce4d9ce292"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(rdyro): Consider removing this permissive cross-core \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/mosaic/lowering.py"},"region":{"startLine":5526}}}],"partialFingerprints":{"codehealthFindingId/v1":"dfe4aae2cb61ccca9e942e0befda51fa1c154e544e05474cd3c840976c059053"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(rdyro): Unify the \u0060core_index\u0060 argument to use core meshes instead. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/mosaic/lowering.py"},"region":{"startLine":5603}}}],"partialFingerprints":{"codehealthFindingId/v1":"85134e9861f912c703f0bbb60469c3080258760f536f5edf93ec89a7e005c139"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(b/502722198): Use IndexSwitchOp instead of nested IfOp if it\u0027s fixed. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/mosaic/lowering.py"},"region":{"startLine":5873}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9ac1a363c29f46d7d06146b0fc6770b113d826af22cbce4045e463a673298aa"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(b/581748519): Remove once the minimum jaxlib version includes \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/mosaic/lowering.py"},"region":{"startLine":5948}}}],"partialFingerprints":{"codehealthFindingId/v1":"36f34e747e6e48d2d30a799d6ea6fe3a7640b6e272ea3aef50a567bd32a347d5"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(slebedev): We can also support printing a single ref. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/mosaic/lowering.py"},"region":{"startLine":5989}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b6180dff2995fefec73bbd24dec3978f1d8ace815e98d787a30fd98ddcc2377"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(b/342054464): Support implicit dims for PRNGRandomBitsOp. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/mosaic/lowering.py"},"region":{"startLine":6088}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f65041128fbc1f92c4b49f9f925ecf9f2145e8a9a453e626ff1b763ebfe9972"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(necula): use trace_to_jaxpr_nocache instead \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/mosaic/pallas_call_registration.py"},"region":{"startLine":603}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ca34a1b428599fcda1e3de8422e0e7987fc751a2647b9c07175791439266569"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(slebedev): Check kernel type and raise if it is set. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/mosaic/pallas_call_registration.py"},"region":{"startLine":656}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac4fea135bdd7244a73c5f8641b99ba2b8cb7446129775191bad9db101a63142"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(sharadmv): Don\u0027t hard-code TC here, infer from context. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/mosaic/pipeline.py"},"region":{"startLine":539}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8ddc9a4e58d1f8575bd9722d76bb9a4cf359d042022d56e07abf09ce2a00651"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(justinfu): Don\u0027t recompute these on each iteration. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/mosaic/pipeline.py"},"region":{"startLine":1312}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a29056055b6bbb6fe49ed139f2184a56f27a644067727fb4cd29ec7408c5b5d"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(rdyro): lag by output blocks, not grid steps (like input lookahead). \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/mosaic/pipeline.py"},"region":{"startLine":1533}}}],"partialFingerprints":{"codehealthFindingId/v1":"01054f9bb3fe0ad678df69682986c5a28a3a58423424bfe642f6d3f11f33d858"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(levskaya): generalize argument tree handling here and in emit_pipeline. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/mosaic/pipeline.py"},"region":{"startLine":1631}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d16d47d3fb42694b63298b85dc9929fefcce9335c7b26629f939246d0b5df39"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(sharadmv): enable running kernel on just one core \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/mosaic/pipeline.py"},"region":{"startLine":1738}}}],"partialFingerprints":{"codehealthFindingId/v1":"71e5c951cc20a3344840e823c9f9369eb91b3a3aef52a8e3a2b4719e6ee33368"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(sharadmv): take the product of many nondivisible dimensions to \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/mosaic/pipeline.py"},"region":{"startLine":1791}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e103d41f7f534f479f1fbec725534486e25b1d1f225584c0993a76f2cdd871e"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(rdyro): Move this method to pallas_core or vendor it here. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/mosaic/pipeline.py"},"region":{"startLine":2346}}}],"partialFingerprints":{"codehealthFindingId/v1":"08e819871a708f69de50a1ca547a63356b653195d0084b2378bdb628daa71d7f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(rdyro): Either generalize or merge with another primitive. This primitive \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/mosaic/pipeline.py"},"region":{"startLine":2547}}}],"partialFingerprints":{"codehealthFindingId/v1":"37a724107d1f3b111d7f38e413fbd973b3ae455b96bc163c408e2cf534183405"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(rdyro): Both primitives require both memory pipeline and core grid \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/mosaic/pipeline.py"},"region":{"startLine":2600}}}],"partialFingerprints":{"codehealthFindingId/v1":"a058b984d0b83c92a08d2a52dfdd10c3e26ad6a0dd75f9d542b726a4b1df4919"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(rdyro): This function is a near duplicate of _jaxpr_call_lowering_rule \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/mosaic/pipeline.py"},"region":{"startLine":2633}}}],"partialFingerprints":{"codehealthFindingId/v1":"2da46c947d57ecd2aafbbcd2cd689bda931dbacb115fdf2670b35490cedc4cb7"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(rdyro): Support TransformedRefs. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/mosaic/prefetch.py"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"f25041141d8f388d453fd57a94044f9d81eda0c6ed86c648b0f9ca9d7aaab738"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(rdyro): Consider disallowing calling \u0060.wait()\u0060 on remote copies and \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/mosaic/primitives.py"},"region":{"startLine":288}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6f52e9ea4ead663dd15d7aa436b7c20374a24f9a8667c0b7287c88886f482b6"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(rdyro): Update the lowering to use \u0060is_wait_send\u0060 instead of \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/mosaic/primitives.py"},"region":{"startLine":312}}}],"partialFingerprints":{"codehealthFindingId/v1":"c391f4eb2f7c6bc14ef5ed515230b8a99d4a6b05ff8715f20459f6f1cec3bfc7"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(rdyro): We swap read vs write effects when dma_wait is bound via \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/mosaic/primitives.py"},"region":{"startLine":374}}}],"partialFingerprints":{"codehealthFindingId/v1":"b70eaf16d4b8087bd78d43822eb87a251d4fc6e3415caf86b2205f08856cf5a6"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(sharadmv): pretty print source semaphores and device id \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/mosaic/primitives.py"},"region":{"startLine":491}}}],"partialFingerprints":{"codehealthFindingId/v1":"dfd4ba2ae41fa5d007f93667fefa33b2dce3bdc95a13d8685140653d391e78ed"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(justinfu): Verify that code only works in SPMD mode. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/mosaic/primitives.py"},"region":{"startLine":546}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b19277e60aa96c91a45706e2a17ab74bc755d622a8e88a472943e828b7e5776"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(justinfu): Add a checkify for verifying there is at most one source. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/mosaic/primitives.py"},"region":{"startLine":573}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce0cf2bcedea6462b5a50486e4b5578052a78eed86d927a8a81a68fab0ea1158"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(justinfu): Handle the case where no other device is copying to \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/mosaic/primitives.py"},"region":{"startLine":574}}}],"partialFingerprints":{"codehealthFindingId/v1":"46663260f3060547ec4080b19745dec2bdec04e9296c0ea9415944433fe24005"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(justinfu): Potentially handle asymmetric copy sizes. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/mosaic/primitives.py"},"region":{"startLine":600}}}],"partialFingerprints":{"codehealthFindingId/v1":"37e19129ee9f9ac14c06109d31a2ddd9a286391e61e2f4094325f320aff90059"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(b/370563115): perform ref update in dma_wait discharge rule instead of dma_start \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/mosaic/primitives.py"},"region":{"startLine":750}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ee632761d391828967657d0e2ccc8e03294b23c2a8f2d2e603f8479e8eb1bec"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(b/581416218): Link to the documentation once it is available. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/mosaic/primitives.py"},"region":{"startLine":1013}}}],"partialFingerprints":{"codehealthFindingId/v1":"087faa3193b31d254109ddd5be19f7bcabffff1c1b7361cc533b10b7838a7224"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(naumsmogers): once we support non-expand masked loads, differentiate \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/mosaic/sc_lowering.py"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3bd5e7691ee3521bbf22e18b1450d7aa36e50daa4ac55f3619cd878bafb2fab"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(naumsmogers): once we support non-expand masked loads, differentiate \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/mosaic/sc_lowering.py"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"5cad012708951c0c5724bdfef5b9fdc8a9f6127a9b55cb5efaa65a9e6bb04287"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: b/481866110 - Remove tpu.vector_load in favor of \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/mosaic/sc_lowering.py"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"2bd06c1df28c9cf8ffb0b3d6bc88751979134b7f2a278f982c03ad973714f182"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(naumsmogers): Support non-expand masked loads. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/mosaic/sc_lowering.py"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"4206b6e2ad4ec43c040d312b5e35fc5027293e8b95f8b49bc4c7d5e27a138721"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(naumsmogers): Support non-compress masked stores. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/mosaic/sc_lowering.py"},"region":{"startLine":271}}}],"partialFingerprints":{"codehealthFindingId/v1":"287e9226c84734a1a659c56a704643fdb7bd9bc7567f408243c5d2a426a80e03"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(slebedev): We can use memref.atomic_rmw here, but the SC compiler \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/mosaic/sc_lowering.py"},"region":{"startLine":337}}}],"partialFingerprints":{"codehealthFindingId/v1":"204d6d1d4b52783468ea35af50b9a35bf4c0767ac1e65257ba5c16dd5629d405"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(naumsmogers): once we support non-compress masked stores, \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/mosaic/sc_lowering.py"},"region":{"startLine":352}}}],"partialFingerprints":{"codehealthFindingId/v1":"424f50529b2537c7a5280fe4df6042db2c3e42a1b968b869b6a5c2922e20994a"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(naumsmogers): once we support non-compress masked stores, \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/mosaic/sc_lowering.py"},"region":{"startLine":395}}}],"partialFingerprints":{"codehealthFindingId/v1":"608b9f633d9f5a24d68a2674aade8331b784bc0740615d81cd57da1b169491f1"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: b/481866110 - Remove tpu.vector_store in favor of \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/mosaic/sc_lowering.py"},"region":{"startLine":358}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f41bc2d9d3672547edd0427e78bbdb7244242870e459b07b8f43394842981a5"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(slebedev): Use the TC rule once we align the \u0060\u0060LoweringRuleContext\u0060\u0060 \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/mosaic/sc_lowering.py"},"region":{"startLine":634}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a3524446575d95960658bf098ff2b41dc3ef747d60d1304d520c653d7050496"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(slebedev): Use the TC rule once we align the \u0060\u0060LoweringRuleContext\u0060\u0060 \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/mosaic/sc_lowering.py"},"region":{"startLine":756}}}],"partialFingerprints":{"codehealthFindingId/v1":"9749792e4d0642b5106b54ee42f2312dd9f73df8eecb9ccb2ebcec01b347ef9c"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: Support regular DMA with add=True. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/mosaic/sc_lowering.py"},"region":{"startLine":663}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3a6be35d992e471f9c327463243915e8e6c1410b017b75062294c1d97916eec"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(rdyro): Stop swapping in wait_send. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/mosaic/sc_lowering.py"},"region":{"startLine":775}}}],"partialFingerprints":{"codehealthFindingId/v1":"2084ca715b4946feb3edd1249f8d99b259481d886b15062c63f3ad71ea6fc689"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(rdyro): Always pass it once that is relaxed. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/mosaic/sc_lowering.py"},"region":{"startLine":814}}}],"partialFingerprints":{"codehealthFindingId/v1":"a25bb9cd4da112a0cbba7a2a71b70c05348218b52cd9affea29f34f22b0cadd1"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(rdyro): Scatters lack a write fence; \u0060wait()\u0060 only awaits the read. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/mosaic/sc_lowering.py"},"region":{"startLine":846}}}],"partialFingerprints":{"codehealthFindingId/v1":"f01a84105a31ac1a58e7aaf4943c115587aebb604467b3ac0af2d310ebfb6981"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(b/562994815): Delete once all callers use pltpu.bitcast(dim=-1). \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/mosaic/sc_primitives.py"},"region":{"startLine":486}}}],"partialFingerprints":{"codehealthFindingId/v1":"5167441e4c4c20c49aa66fa06c53fa50030cc80d0432ac18fc40cbac22efc444"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(tlongeri): Have Mosaic handle this. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/mosaic/sc_primitives.py"},"region":{"startLine":622}}}],"partialFingerprints":{"codehealthFindingId/v1":"7673ede12592eecc45b12cafcd97d24b5df9f3017394105e38d592a86b1ba3b1"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(slebedev): Support more types. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/mosaic/sc_primitives.py"},"region":{"startLine":1079}}}],"partialFingerprints":{"codehealthFindingId/v1":"07c24e59c14a32ee2855fb422d2e6ed96d0101a638ddcce8386cacfb28996c29"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(slebedev): Support more types. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/mosaic/sc_primitives.py"},"region":{"startLine":1186}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7d957f47ac670e5bccb52f7ecd2eee8d23b62e00a52686826e35c8a317168bb"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(yashkatariya): Remove this forwarding shim. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/mosaic/tpu_info.py"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"6478286e65006b1690f8d5249d5facec34c7267968d6c7ff2fd883299c939ace"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(jburnim): Pass \u0060shared_memory\u0060 to \u0060func\u0060, so it does not have to \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/mosaic/interpret/interpret_pallas_call.py"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"27c5afe532a1e0f02cd7d1651acfffc8b8ed16fb64270e6809930304bb39e19a"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(jburnim): Do we want to support multiple instances of SharedMemory? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/mosaic/interpret/interpret_pallas_call.py"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"a89aa6cef30c0726f9088d02cf7d163426f3ba1a39c4e7e9b63b25f4e7f9c7af"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(jburnim): Do something constant time instead of linear here. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/mosaic/interpret/interpret_pallas_call.py"},"region":{"startLine":295}}}],"partialFingerprints":{"codehealthFindingId/v1":"f53ca9197e5ad2d6f236e71e9d2cd629159572cae64ee6273866501aaf5850af"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(jburnim): Make this raise an error, but in a way that doesn\u0027t \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/mosaic/interpret/interpret_pallas_call.py"},"region":{"startLine":321}}}],"partialFingerprints":{"codehealthFindingId/v1":"395a3233d67e75c1ba2516360fdad8c37ef6c1593b21ef956ea3e5c5f93bfc97"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(nrink): Replace this assertion with raising an exception early if \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/mosaic/interpret/interpret_pallas_call.py"},"region":{"startLine":338}}}],"partialFingerprints":{"codehealthFindingId/v1":"b76682fd2c126f068cdd3466c6c51fda0c9b6621bee94fe850ec479440c0194e"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(jburnim): Raise an error if buffer_id is too big for int16. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/mosaic/interpret/interpret_pallas_call.py"},"region":{"startLine":456}}}],"partialFingerprints":{"codehealthFindingId/v1":"5bcfd6f3503494035fde652650d62bc27da7c47c010a02bb05fb9e23908e9b32"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(jburnim): Raise an error if any IDs are too big for int16. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/mosaic/interpret/interpret_pallas_call.py"},"region":{"startLine":581}}}],"partialFingerprints":{"codehealthFindingId/v1":"8021032f080a65ece8b15332b59ed6873621dd62f131c912fbaf3dc94784a2a0"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(jburnim): We already know this shape in the Jaxpr where we insert a \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/mosaic/interpret/interpret_pallas_call.py"},"region":{"startLine":687}}}],"partialFingerprints":{"codehealthFindingId/v1":"dad05b7e4b7030924e2ffa0d894df9b00a819b37093afb611781f72fc9fc62d8"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(jburnim): Move to a helper function? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/mosaic/interpret/interpret_pallas_call.py"},"region":{"startLine":689}}}],"partialFingerprints":{"codehealthFindingId/v1":"397983c311441fdea8e59317075cdcd85c719a5e2011704034e9504176592a17"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(jburnim): Clean up and finish this evaluation loop.  For example: \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/mosaic/interpret/interpret_pallas_call.py"},"region":{"startLine":1364}}}],"partialFingerprints":{"codehealthFindingId/v1":"06ccd53a373fbe234731799c5b7d42e071f0fb6f44d1ece8b0d9fe4f0dd9d512"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(jburnim): Set up a proper kernel tracing environment for \u0060impl\u0060. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/mosaic/interpret/interpret_pallas_call.py"},"region":{"startLine":1382}}}],"partialFingerprints":{"codehealthFindingId/v1":"8bdf6309c3feefa0fc9c34aaefe6ae658de27e0c6bb8ee35029b5efbc1a122cb"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(jburnim): Implement this properly? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/mosaic/interpret/interpret_pallas_call.py"},"region":{"startLine":1434}}}],"partialFingerprints":{"codehealthFindingId/v1":"0745711f93e661fc8f6ad9616f4f7b0d9cab580f2176f8e3ab35522b7c8f3cf1"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(jburnim): Implement this properly? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/mosaic/interpret/interpret_pallas_call.py"},"region":{"startLine":1438}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ed85e37011d6868a433df02a7b01e821cf124c873c2488b1349c23065a748f6"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(jburnim): Implement this properly? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/mosaic/interpret/interpret_pallas_call.py"},"region":{"startLine":1447}}}],"partialFingerprints":{"codehealthFindingId/v1":"e437a9cda7fcff50e5f8a1d172079aae7df6f95774f6a4bc8e289e8d6b7f9e6e"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(jburnim): De-allocate semaphores. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/mosaic/interpret/interpret_pallas_call.py"},"region":{"startLine":1567}}}],"partialFingerprints":{"codehealthFindingId/v1":"12f12d4656674d8944fcda90cc591a014496e632b2d978d6988b905099c79d43"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(nrink): It would be more robust if the buffer id, i.e. \u0060src\u0060, \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/mosaic/interpret/interpret_pallas_call.py"},"region":{"startLine":1702}}}],"partialFingerprints":{"codehealthFindingId/v1":"90629ceef6da364dcc02ee0ea2a967c561db12ac781caeb4994ac9bd284f45ff"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(nrink): See comment for \u0060src_memory_space\u0060 above. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/mosaic/interpret/interpret_pallas_call.py"},"region":{"startLine":1711}}}],"partialFingerprints":{"codehealthFindingId/v1":"0da5d74041463143a2bbad57bd1c3ab24bf0945d237959c5b057d7a0aad4a7f8"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(rdyro): Support barrier semaphore tags in interpret mode. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/mosaic/interpret/interpret_pallas_call.py"},"region":{"startLine":1756}}}],"partialFingerprints":{"codehealthFindingId/v1":"1810cb91ad12670e385a0a90329b530ac34046c5abadd20ddba5836da9de6adf"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(sharadmv, jburnim): add support for memory space constraints \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/mosaic/interpret/interpret_pallas_call.py"},"region":{"startLine":1950}}}],"partialFingerprints":{"codehealthFindingId/v1":"2861f29dbe58bacf1189899c1c129087777624eac7208236af8cb3ed1d876800"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(sharadmv): Add metadata to HLO. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/mosaic/interpret/interpret_pallas_call.py"},"region":{"startLine":2018}}}],"partialFingerprints":{"codehealthFindingId/v1":"11a55438bd44f44a4a28d524482112e872ec7615e9aea2074c2778a2ecdee2c4"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(jburnim): As an optimization, skip allocating buffers for inputs that \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/mosaic/interpret/interpret_pallas_call.py"},"region":{"startLine":2099}}}],"partialFingerprints":{"codehealthFindingId/v1":"91dc243329b168256fdabe054306b15c3a35fe28baf8d8b6d4c89ef267fdede5"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(jburnim): For kernel args in HBM, check that block shape equals the \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/mosaic/interpret/interpret_pallas_call.py"},"region":{"startLine":2190}}}],"partialFingerprints":{"codehealthFindingId/v1":"d87b0270ab547ffb015bdd356ad922c2be37cd0bf64ecc6dccdad2cc66364c2c"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(jburnim): Are we overusing nested local functions here? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/mosaic/interpret/interpret_pallas_call.py"},"region":{"startLine":2277}}}],"partialFingerprints":{"codehealthFindingId/v1":"47f827b1371bf69fdceec27a3b5cae2f6d8db3be30df48fd534e99f4e6e8c762"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(jburnim): Just use input_args[j] when the input is not aliased? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/mosaic/interpret/interpret_pallas_call.py"},"region":{"startLine":2381}}}],"partialFingerprints":{"codehealthFindingId/v1":"128417065aa7fc85b1658cdcd242438a128c6d3135d15840e0522e5c84ed8886"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(jburnim): Pass source_info from the pallas_call, in case this \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/mosaic/interpret/interpret_pallas_call.py"},"region":{"startLine":2395}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7cdbb90a88728870ea0b74b125677dc4e67d217aa25b70c86fed55e23822e45"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(jburnim): Pass source_info from the pallas_call, in case this \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/mosaic/interpret/interpret_pallas_call.py"},"region":{"startLine":2414}}}],"partialFingerprints":{"codehealthFindingId/v1":"84005e7db1e09fa6fa489af62fd7d8a666da2a8070390ce103dbe6eb0a0c7dab"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(jburnim): Pass source_info from the pallas_call, in case this \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/mosaic/interpret/interpret_pallas_call.py"},"region":{"startLine":2465}}}],"partialFingerprints":{"codehealthFindingId/v1":"f36a76aadc9b48ec36a27d5382da6d47e62da636120352b0d5d5c8cf79fef9fa"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(jburnim): Pass source_info from the pallas_call, in case this \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/mosaic/interpret/interpret_pallas_call.py"},"region":{"startLine":2477}}}],"partialFingerprints":{"codehealthFindingId/v1":"e54d68382870a7fcdab1e1cf60eabd550360ca5960d71671ab8f33dd2d7d1967"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(jburnim): Pass source_info from the pallas_call, in case this \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/mosaic/interpret/interpret_pallas_call.py"},"region":{"startLine":2619}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e3079b0bbe7ee671d78559fb4562c3b82a49f6dde76261229902f45b4d1cbca"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(jburnim): Should we only create happens-before here from core 0 to \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/mosaic/interpret/interpret_pallas_call.py"},"region":{"startLine":2591}}}],"partialFingerprints":{"codehealthFindingId/v1":"51e1f3300dad456c8eb71ed9514aa44425d91389ea60c5d78317b6572379a911"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(jburnim): Should we only create happens-before here from the other \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/mosaic/interpret/interpret_pallas_call.py"},"region":{"startLine":2607}}}],"partialFingerprints":{"codehealthFindingId/v1":"81cbfccfb92101e261817e45ef53128e66b4bdf2c9fae7aced4cd26c07e482bd"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(jburnim): Get rid of this barrier.  And figure out how this should \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/mosaic/interpret/interpret_pallas_call.py"},"region":{"startLine":2642}}}],"partialFingerprints":{"codehealthFindingId/v1":"c118938eaf6c39a3e62c7e941e4fefcd750ac3a25a3d6ce2ccd994dfa3390f2c"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(nrink): Add an attribute for specifying the TPU device kind. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/mosaic/interpret/params.py"},"region":{"startLine":181}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d8bf5bdbc75ddb7b857b908a549a8a57753275e6df198cd3db680b88f116efb"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(jburnim): Handle non-zero steps. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/mosaic/interpret/race_detection_state.py"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"e57d1bf2af093f66c7a4885aa8dabfe16ed4bd484d16ce6f4446f0f1e7065d72"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(jburnim): When printing device IDs for reads/writes, distinguish \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/mosaic/interpret/race_detection_state.py"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"51ca4835e700ffca3f1b755b0b727b458f9a2944d800b1b2e44df199d7967e5f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(jburnim): When printing device IDs for reads/writes, distinguish \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/mosaic/interpret/race_detection_state.py"},"region":{"startLine":171}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ffeffa63ddde9421570f60dacdb2f561fd7c01045f0c7b676c5260acdf0cb72"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(jburnim): When printing device IDs for reads/writes, distinguish \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/mosaic/interpret/race_detection_state.py"},"region":{"startLine":193}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8e5b77b79fa5c8c62b0e6e59d60dbbe7b2ab601b82c593fffcb6115ab457a3e"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(jburnim): For performance, we should also probably remove any \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/mosaic/interpret/race_detection_state.py"},"region":{"startLine":157}}}],"partialFingerprints":{"codehealthFindingId/v1":"560bfa9029ac156515edc587741c0be1040f56ee7df8d8997bf0899a86ea2ec9"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(jburnim): Use one Condition variable per device.  (Which will be \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/mosaic/interpret/shared_memory.py"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"b99b735a9cdb46ef955f5b84497fc264a5878796b041ae5d2b1739cd2107b6d9"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(jburnim): Model happens-before more precisely for the case where \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/mosaic/interpret/shared_memory.py"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"282360a8dce5533f808e0a6fcda5236880c96cb370b5b03cbda2b22c33e17325"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(nrink): Update the comment below to generalize from DMAs and DMA \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/mosaic/interpret/shared_memory.py"},"region":{"startLine":159}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a45d93cd79567e750d9c39cc2373293a171b9d30aff93c51cd8cd2527aa4203"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(jburnim): \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/mosaic/interpret/shared_memory.py"},"region":{"startLine":180}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9a007db5b9a2f2f5f3cf0552e9b2b50e01553c964ae977684f0eb3c27890009"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(jburnim): The top-level exception (that the user sees) will not \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/mosaic/interpret/shared_memory.py"},"region":{"startLine":495}}}],"partialFingerprints":{"codehealthFindingId/v1":"f87065302c4fa5f123e5b825e4dfc4b18319210648a87b6047e97fececa46f64"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(paulbib): delete buffer from race detection state as well \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/mosaic/interpret/shared_memory.py"},"region":{"startLine":551}}}],"partialFingerprints":{"codehealthFindingId/v1":"90e575cddbe20a27d6b80c9b14b4aa0f4d68e8f892f8e284267b78d5360ccf13"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(jburnim): Catch this statically. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/mosaic/interpret/shared_memory.py"},"region":{"startLine":666}}}],"partialFingerprints":{"codehealthFindingId/v1":"0719c3fefbcf308da171df2890ebbc119ed463c8c4f81e9ae374c2b74ad18c34"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(jburnim): Catch this statically. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/mosaic/interpret/shared_memory.py"},"region":{"startLine":730}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6c8fc7b99212c7a36681e14ddfd67bb9b119ff5e52911ef665ccbe8c82486fb"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(jburnim): Better error message if this raises? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/mosaic/interpret/shared_memory.py"},"region":{"startLine":731}}}],"partialFingerprints":{"codehealthFindingId/v1":"25399d9788ace32a611feba49446af7d09835f1966590dc5e1f6c43cc1199fa1"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(nrink): For now we make it the responsibility of the client to \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/mosaic/interpret/shared_memory.py"},"region":{"startLine":896}}}],"partialFingerprints":{"codehealthFindingId/v1":"78e9b1ec9daea459d2d309d975f2d502f9b95297f75c62fe0b7bd2bd365e16f5"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(jburnim): Convert all JAX values in \u0060consts\u0060 and \u0060invals\u0060 to NumPy \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/mosaic/interpret/thread_map.py"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6f91ee3db13fa80cb7f676242467d6a50c77ad99397e148cdb26c5446e52fd8"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(jburnim): Improve exception propagation here.  That is: \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/mosaic/interpret/thread_map.py"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"cac57bcdf6e853fc8b5da5f9e7072135c1a7d8ca04877b37300dc4e025959aa0"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(jburnim): Would it be worth trying to lower/compile the jaxpr at \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/mosaic/interpret/thread_map.py"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0e771e13b32a09749d82fd9f0bdd8cbea2887cb9d91c47ccad814c4276380ee"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(sharadmv): De-dup this w/ the impl in primitives.py. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/mosaic/interpret/utils.py"},"region":{"startLine":155}}}],"partialFingerprints":{"codehealthFindingId/v1":"cabf3be73d1723ec700771519cfcef3a7e3e5da2f77587ca5edab965d7cf845b"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(sharadmv): Enable type checking. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/fuser/block_spec.py"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"4fa1eb9feb16b80beb3dafd118d46314df4ecb6c9b05d708f29e73eb06c684ba"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(sharadmv): maybe simplify this by only identifying scalar prefetch \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/fuser/block_spec.py"},"region":{"startLine":233}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a269ebf94d270f8af0a3faa69d7b849ee821e836cad8371b9cbab9102aabc63"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(sharadmv,justinfu): preserve source mapping \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/fuser/block_spec.py"},"region":{"startLine":919}}}],"partialFingerprints":{"codehealthFindingId/v1":"3fcb027155794a34e59db8f01cd591ab5668eefe1c26acd90c5e8591c09048b2"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(jburnim): Raise an error if an input fusion is modifying a Ref? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/fuser/block_spec.py"},"region":{"startLine":1115}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f373eb2fb967bb24d1db68ae0345233aa2c1e440c39ea1c30b7581a574eea5e"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(wdvi): This is a hack needed since lowering rules require block shape \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/fuser/block_spec.py"},"region":{"startLine":1259}}}],"partialFingerprints":{"codehealthFindingId/v1":"fce50f404716fa85531865aabac223e3c12200a7366afd23e82d4e7aa9554d27"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(rdyro): Constant fold the static indices to skip scalar prefetch. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/fuser/block_spec.py"},"region":{"startLine":1552}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0b9b299b8ff3582a9628bd2664a0f4a416dfa804abc3d83128dda1f6355ed5d"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(rdyro): Dynamic update slice supports a tile-aligned overwrite only. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/fuser/block_spec.py"},"region":{"startLine":1674}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc05a9578bd921ffcec34662e5bd87fbdbe6ed66366ca280426ed59548380700"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(jburnim): Error if jaxpr gives different usage than pallas_jaxpr? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/fuser/custom_fusion_lib.py"},"region":{"startLine":283}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec5bacad561effc9fb1b2951549f1d6764a2aa7fb881107449d03234fe028e0f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: Use trace_to_jaxpr_nocache instead. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/fuser/fusible_dtype.py"},"region":{"startLine":252}}}],"partialFingerprints":{"codehealthFindingId/v1":"10a694ca9aadbcb70acf77d59679280821934c65afedc0941e73b32363857fe7"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: Merge into JAX core. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/fuser/fusible_dtype.py"},"region":{"startLine":277}}}],"partialFingerprints":{"codehealthFindingId/v1":"f54272636d5b01af630b066a48a07533267c0320b920182a84d0528328682444"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(sharadmv): We use partial_eval to query downstream dependencies which \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/fuser/jaxpr_fusion.py"},"region":{"startLine":183}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0ed39fe18130ba2e23cfd44493b4d0f4c239867f49c160f11e676b3381cc3a7"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(phawkins): re-enable jit after fixing excessive recompilation for \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/ops/scatter.py"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"54ff9e6781b4da71e55185ecc04e486fb6673026edefa61efe0b713b25433fd3"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(phawkins): re-enable jit after fixing excessive recompilation for \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/numpy/indexing.py"},"region":{"startLine":1287}}}],"partialFingerprints":{"codehealthFindingId/v1":"bed183429df018fa0e911ac42c4f1e95b5c6bd0349ab48d1f79b1b97a1ee10e6"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(jakevdp): change this to an error after the deprecation period. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/ops/scatter.py"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"46240617d74c5dc40f94f90cbdae52eed4289520e136ae2d1d0c82ef6050a72b"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(phawkins): this jit was found to change numerics in a test. Debug this. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/ops/special.py"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"35cec7c3da667eeb4507fde06cd9c1909291a6976f3aecb10f4ff41c12c93920"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(phawkins): this jit was found to change numerics in a test. Debug this. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/nn/functions.py"},"region":{"startLine":471}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c636b74c8d8d92f40718b515b15960c21ce909c32f949cfa4f217f18c4ada08"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(mattjj): replace softmax with _softmax when deprecation flag is removed \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/ops/special.py"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ade568af605b99714ae6e8ea6c11c4ed09661af3dba2a713e17fb84b16f4295"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(jakevdp): falling back to numpy here fails to overflow for lists \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/numpy/array_constructors.py"},"region":{"startLine":297}}}],"partialFingerprints":{"codehealthFindingId/v1":"90d8db5c79c7e2866af195220998f78feeb5f37fabfea6ab95b739c235362f0d"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(jakevdp): update this once we support NumPy 2.0 semantics for the copy arg. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/numpy/array_constructors.py"},"region":{"startLine":321}}}],"partialFingerprints":{"codehealthFindingId/v1":"e78be11a35ea98b2680b429551d49438705336b6e1a66d327a00ee5631881a3d"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(jakevdp): make _accepted_binop_types match the ArrayLike union. Currently \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/numpy/array_methods.py"},"region":{"startLine":656}}}],"partialFingerprints":{"codehealthFindingId/v1":"156d87d0082f63c89fc05936ed87f0936a1251685e56cf1c0ecfd652890f7890"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(jakevdp): raise for *all* non-array types. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/numpy/array_methods.py"},"region":{"startLine":679}}}],"partialFingerprints":{"codehealthFindingId/v1":"c006f931974d316297ed3d77f6119eea5aacfcc9e78ec1ee8c713e25431c3959"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(jakevdp): raise for *all* non-array types. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/numpy/array_methods.py"},"region":{"startLine":693}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8ea5624c9aeed124e78014d7762e206d5215378cb6030556b33d411853dd08c"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(jakevdp): this TypeError is for backward compatibility. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/numpy/indexing.py"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"71e0302485df59e9915c3a0c35f2e1f6eef5eb31d8a7d888245876fa910f1ab3"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(mattjj): improve this error by tracking _why_ the indices are not concrete \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/numpy/indexing.py"},"region":{"startLine":295}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b7766260b81a27702767e610f719bf45fca8fcc4386e04f74356ddd417d25dd"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(yashkatariya): fix slice with sharding \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/numpy/indexing.py"},"region":{"startLine":415}}}],"partialFingerprints":{"codehealthFindingId/v1":"3981f47919b6b694e19ed4ec45d5612c669f77d05b1bf417e7318a6d0fdc118b"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(yashkatariya): fix slice with sharding \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/numpy/indexing.py"},"region":{"startLine":506}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf01f0f4d56b958e53946bfe25915c1b487a790abcfd2e037ad88f17990a54c1"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(phawkins): we have no way to report out of bounds errors yet. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/numpy/indexing.py"},"region":{"startLine":750}}}],"partialFingerprints":{"codehealthFindingId/v1":"245c6a12c4c57cc0a410aabbf6900407b52fde0905e1b23f8d1a306c466e771a"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(jakevdp) remove cast when jit type annotations improve \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/numpy/lax_numpy.py"},"region":{"startLine":268}}}],"partialFingerprints":{"codehealthFindingId/v1":"448a2fef42670bded7ccf11db8fabe5f5defc79f9d456080a33adbd21e4d6fec"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(jakevdp) remove cast when jit type annotations improve \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/numpy/lax_numpy.py"},"region":{"startLine":320}}}],"partialFingerprints":{"codehealthFindingId/v1":"6eaf7f0bd6b6151d0bb8820aaf5b2aa669cb594506b0c25fa7847420afcb785b"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: Consider warning here since shape is supposed to be a sequence, so \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/numpy/lax_numpy.py"},"region":{"startLine":2243}}}],"partialFingerprints":{"codehealthFindingId/v1":"e314249de4ed3c1d109abd9fc3ba86f97de14cb43033b847f724f5ddc60376aa"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(phawkins): the strategy of rescaling the value isn\u0027t necessarily a \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/numpy/lax_numpy.py"},"region":{"startLine":3548}}}],"partialFingerprints":{"codehealthFindingId/v1":"116c0723088e94c1150638ab7f3cb7dec1a1061865913bd18d6d5939f0c2f3e3"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(vfdev-5): optimize putting the array directly on the device specified \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/numpy/lax_numpy.py"},"region":{"startLine":5854}}}],"partialFingerprints":{"codehealthFindingId/v1":"35815e5bd42067e8104712bad1e0390b97871bfb080bb62b04e9b5a5108ed262"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(phawkins): remove this annotation after fixing jnp types. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/numpy/lax_numpy.py"},"region":{"startLine":6605}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d649ad2c80a3dc24ed1cf0b8a829aa84897c038a3f398866a7f330530599b81"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(mvoz): Add support for offsets. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/numpy/lax_numpy.py"},"region":{"startLine":7414}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a1611db0bc8e3d7d5f4348c9808a8a8a98201fe3423b2db62fb75e1686c8a14"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(jakevdp): add support for N-dimensional inputs as in NumPy v2.2 \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/numpy/lax_numpy.py"},"region":{"startLine":7553}}}],"partialFingerprints":{"codehealthFindingId/v1":"38b8a439009f827eb3af022007e701f4adf1aeb5125744e06d3446f8215f2946"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(jakevdp): in theory this could be done dynamically if obj has no duplicates, \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/numpy/lax_numpy.py"},"region":{"startLine":7816}}}],"partialFingerprints":{"codehealthFindingId/v1":"15d8890812ae4bd3c65e08d111d4f5452addca44b1b798ed9f423b651f47b99b"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(phawkins): use an int64 index if the dimension is large enough. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/numpy/lax_numpy.py"},"region":{"startLine":8375}}}],"partialFingerprints":{"codehealthFindingId/v1":"83906edc9ce29ced90f59d9d2f6310bbc5c3e0b813e8ea28dd3e7f80d5abea93"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(phawkins): use an int64 index if the dimension is large enough. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/numpy/lax_numpy.py"},"region":{"startLine":8436}}}],"partialFingerprints":{"codehealthFindingId/v1":"8339cd8626c67cb95df0b09a77b0c36c97baae277f3039cadaa11c958ab1d179"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(phawkins): this could be simplified in the Hermitian case if we \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/numpy/linalg.py"},"region":{"startLine":1127}}}],"partialFingerprints":{"codehealthFindingId/v1":"97afa8e570c5fb448e4f5834714d47d89dc987ddf0f82d767465425ca2ce46f2"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: add lstsq to lax_linalg and implement this function via those wrappers. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/numpy/linalg.py"},"region":{"startLine":1493}}}],"partialFingerprints":{"codehealthFindingId/v1":"11e3e250a1b483158ba5ea402aaf57deb55dba4087780abb77ca4fb518bc7501"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: add custom jvp rule for more robust lstsq differentiation \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/numpy/linalg.py"},"region":{"startLine":1494}}}],"partialFingerprints":{"codehealthFindingId/v1":"ccc8733438a01c37aedf733eb6afd1d7fde5cfd0d592560bed02499a1e9dfab0"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(phawkins): dtype isn\u0027t used here. That seems like a bug! \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/numpy/reductions.py"},"region":{"startLine":912}}}],"partialFingerprints":{"codehealthFindingId/v1":"2788af46ace4703908a6797ebc85db4f60c492b7f58de9bcd58aab45af2c6182"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: Investigate if it\u0027s possible that we could save some work in \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/numpy/setops.py"},"region":{"startLine":849}}}],"partialFingerprints":{"codehealthFindingId/v1":"39da21b58d43ec853effc106241325aee0399e69e934d2692a3cb347fd30d3aa"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(jakevdp): handle NaN values like numpy. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/numpy/sorting.py"},"region":{"startLine":262}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8416de36a2c1eadd5b274176bfda0745dc0d7ea962573972248fd5fce9ab6f0"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(jakevdp): handle NaN values like numpy. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/numpy/sorting.py"},"region":{"startLine":330}}}],"partialFingerprints":{"codehealthFindingId/v1":"a96c16a779e6ccffb3ff3d45da98ea35cf7e087a6e1f30ce924d14a76836f0f4"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: handle without transpose? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/numpy/ufunc_api.py"},"region":{"startLine":292}}}],"partialFingerprints":{"codehealthFindingId/v1":"7cefb11f70fe471ec3d578f2b685d91d77b0a46164a30427764f39b54dc07ec4"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(mattjj): investigate why subtracting a scalar was causing promotion \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/numpy/ufuncs.py"},"region":{"startLine":2605}}}],"partialFingerprints":{"codehealthFindingId/v1":"6206780afb85ba3499fc98469f5b4d049edf923bc367e2578487effb2a3bf520"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(phawkins): add integer pow support to XLA. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/numpy/ufuncs.py"},"region":{"startLine":2790}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1588d45a66a862e7c11ab5e2eb9553648395c7bcdbd600a07f74cb21f15e24b"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(micky774): Promote to ValueError when deprecation is complete \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/numpy/ufuncs.py"},"region":{"startLine":3999}}}],"partialFingerprints":{"codehealthFindingId/v1":"ccfda293a443b897b1c46a75cdf805366962599bf8bd1948280f86e32481479e"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(phawkins): Remove once XLA:CPU callbacks restore floating-point control \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/numpy/util.py"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"14c71a91f3615a8e972b77651756e2bc2a393a0c9f25387523f3dece938d237a"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(dougalm,mattjj): This is a performance bottleneck. Consider memoizing. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/numpy/util.py"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"000b6e7b1c256ad03921321aaf1957147327a2409d4da908c8398db10a7edc30"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(mattjj): this code needs updating for dynamic shapes (hence ignore) \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/numpy/vectorize.py"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"016d03083ec60d93638cf7c330e896eddf72687cacdaadf905d327eec992c0e3"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(slebedev): Change the type of \u0060x\u0060 to \u0060ArrayLike\u0060. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/nn/functions.py"},"region":{"startLine":681}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a2a26e21241b22f0120fed846ecd4f94ab142f39cf35ad04f050a2eca72db88"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(slebedev): Change the type of \u0060x\u0060 to \u0060ArrayLike\u0060. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/nn/functions.py"},"region":{"startLine":722}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4279a4777c4e6cc3f6d9eef8e83e616f8656b00d826e140d56d9c44cd03e2f6"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(sbodenstein): Implement this fix for all dtypes. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/nn/functions.py"},"region":{"startLine":922}}}],"partialFingerprints":{"codehealthFindingId/v1":"36cf84b61307851bd88c791d15e0040903062a8ce55acde45b7cf5292c04420b"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(kaixih@nvidia) Automatically select the best backend (defaults to XLA for now). \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/nn/functions.py"},"region":{"startLine":1238}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e31a78a8ebdb196189de2b6c805af3812d288496108b64e10e3a1a0fbc9ec37"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(phawkins): remove this helper and restore \u0060random.normal(...) * stddev\u0060 \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/nn/initializers.py"},"region":{"startLine":148}}}],"partialFingerprints":{"codehealthFindingId/v1":"28f60c2bd41cace4a48d763ed044f720c0cbfcd100f1719b87ccd31fa3717c44"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(phawkins): Simplify fallback and remove ifrt_version once the minimum \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/lib/__init__.py"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2b2f74c1bb760e4fd57ab1b5b07a56467b1d913bd156015700f2c921ec2bdc7"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(rocm): check if we need the same for rocm. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/lib/__init__.py"},"region":{"startLine":166}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0083524e6503125289ceebea47ef73ebb86e2911f866c3d74a159aa69d36afe"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(fchern): Some optimization ideas \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/lax/ann.py"},"region":{"startLine":414}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0174398a74760120dd6da38add6f07d7e3209e7f2a0b753adf880778a7bbbd5"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(yashkatariya): conv_general_dilated should take \u0060out_sharding\u0060 argument \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/lax/convolution.py"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e4feda180ad9341727b469702bae57edb40502a5ed9d73f8bfdf62664d1d79f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(https://github.com/openxla/stablehlo/issues/1268)"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/lax/convolution.py"},"region":{"startLine":845}}}],"partialFingerprints":{"codehealthFindingId/v1":"adbc865462eb3080e2f51af78c0c28a18ea919824e0ba6c7e0d8821a92021d31"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(b/161124619, b/161126248): XLA does not support complex convolution on \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/lax/convolution.py"},"region":{"startLine":889}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0af67a0364ddb8377bbfbaa54cb0e24adff5c692c983bf2dbe076f21a975794"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(phawkins): Remove once minimum libtpu version is at least 0.0.51. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/lax/digamma.py"},"region":{"startLine":397}}}],"partialFingerprints":{"codehealthFindingId/v1":"0da2abd06572742b75d1a9896649a11dcce578cc64e2660df51b8600f75aa6f7"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(mattjj): this is a copy of xla_metadata.py\u0027s _transpose_jaxpr, dedupe! \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/lax/eval_jaxpr.py"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"987bd45edbf8037bd8c3a54976316e008d5153b071a96026e17201bb3c478468"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: https://github.com/openxla/stablehlo/issues/1366"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/lax/fft.py"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"c670c5ab5fa530476e4c62e357ae4cbca4e7f4a7b9055915608a5c2ec83f1c93"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(magaonka-amd): gate this on the ROCm version once the rocFFT fix ships. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/lax/fft.py"},"region":{"startLine":223}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e70f9442bcb2b0be1690236af8d1b0ba32c7ce2ac51bf2d357e31eb920d8fd8"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(mattjj): remove input_dtype, not needed anymore \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/lax/lax.py"},"region":{"startLine":923}}}],"partialFingerprints":{"codehealthFindingId/v1":"77d7a04f579110b75123bee8851ad2f17fb360d4d1a8540c2f5cdd96aa1c12f0"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(phawkins): remove this block so we raise on inf/nan to int \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/lax/lax.py"},"region":{"startLine":1913}}}],"partialFingerprints":{"codehealthFindingId/v1":"026bc803ec5ab382616bd17b0f4e2ffecaf2637c87a2fb716ea80f7467fe1814"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(phawkins): remove the try-except block here, which would be \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/lax/lax.py"},"region":{"startLine":1920}}}],"partialFingerprints":{"codehealthFindingId/v1":"e176211d5cb062c345f79251bc2c2a54ec239c96b84f3b65e4935e64e30990aa"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(jakevdp): consider deprecating jax.lax.dot_general. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/lax/lax.py"},"region":{"startLine":2741}}}],"partialFingerprints":{"codehealthFindingId/v1":"35fc5b61ccc11a93b5452a49b4da5e6856b885cc10b65dd404c6cd716aae436e"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(yashkatariya): Add \u0060out_layout\u0060 to \u0060broadcast\u0060. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/lax/lax.py"},"region":{"startLine":3893}}}],"partialFingerprints":{"codehealthFindingId/v1":"adff24588fe40ee3dde1202d1eae77cf5614293e82fa6db69c4f5ed13a47a4fa"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(phawkins): Avoid overflow/underflow in x^2 \u002B y^2 for complex inputs \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/lax/lax.py"},"region":{"startLine":5318}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c08d9dbb65a83c7e32b002aca71e72b520c0eb7d05d7ecc2237e3e9ef60a18d"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(mattjj): allow constant-folding CPU-backed JAX arrays \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/lax/lax.py"},"region":{"startLine":6405}}}],"partialFingerprints":{"codehealthFindingId/v1":"a43809489ef01dc1d94d27db94921a02cef9e2184c1114cb1d7e5a6658b4944a"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(dougalm): I\u0027m overriding bind_with_trace here because that\u0027s the closest thing to \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/lax/lax.py"},"region":{"startLine":6444}}}],"partialFingerprints":{"codehealthFindingId/v1":"63fc748dcb3f78bfc723dc1392571e18d826e4d0ca531efe5d65e696cb7b82a4"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(rdyro): Support \u0060convert_element_type\u0060 with a resharding \u0060sharding\u0060. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/lax/lax.py"},"region":{"startLine":6493}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d58f6110544e591e3e123fa421ac4b2bdecaa15df508fdd123bcae738ebada1"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(yashkatariya): Propagate reduced and make checks like nary_reduced_rule \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/lax/lax.py"},"region":{"startLine":6937}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad5f2f757bd8d3dfae8c4c6aa897de9fd0bf0eb870933e2381e62b3764450d5b"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(b/...): JAX\u0027s dot_general primitive accepts the same input dtype \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/lax/lax.py"},"region":{"startLine":7480}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc1cbe487189b24dba49a83ed9b496467a731944725c5a9bef12115a458cdd6d"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(pravnar): Permit other broadcastable shapes. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/lax/lax.py"},"region":{"startLine":7776}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5cd311876b8b2182566144c1db8632e96caa39e6cbe2601ff9f32e91b9cc77c"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(pravnar): Permit other broadcastable shapes. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/lax/lax.py"},"region":{"startLine":8106}}}],"partialFingerprints":{"codehealthFindingId/v1":"0af44203cfa090a876a0691933b5fd6dbab1b6bd9bd5a15852f90306276be5d1"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(yashkatariya): Once JAX supports uneven sharding at the top level, \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/lax/lax.py"},"region":{"startLine":9085}}}],"partialFingerprints":{"codehealthFindingId/v1":"3851823824ab45cc3e73df80111500541078a7e5cd74d9e8a358ffb3edc180f3"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(yashkatariya): Once JAX supports uneven sharding at the top level, \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/lax/lax.py"},"region":{"startLine":9156}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b4fbab975d91f6bd79b10f0fce6ff0b488f26d0854fa349d19102241b43966a"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(yashkatariya): Once JAX supports uneven sharding at the top level, \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/lax/slicing.py"},"region":{"startLine":1438}}}],"partialFingerprints":{"codehealthFindingId/v1":"805cce01fe276ffbd190ec5c5d642daa3fd019da0129583f0c54afed7f915c36"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(necula): re-enable this check \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/lax/lax.py"},"region":{"startLine":9345}}}],"partialFingerprints":{"codehealthFindingId/v1":"1caf96dee982dd78a2f7e97ee0e9017540e868b070c239dd45b8d2261320a532"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(yashkatariya): Maybe add out_layout to reshape. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/lax/lax.py"},"region":{"startLine":9709}}}],"partialFingerprints":{"codehealthFindingId/v1":"3271afd8752420acbf08605d867f64ee37cd8282d0eca3fb103340ce4b9864f8"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(yashkatariya): Will lead to data movement. Maybe just error out and \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/lax/lax.py"},"region":{"startLine":9833}}}],"partialFingerprints":{"codehealthFindingId/v1":"e759d0123943b47e1baa4c637172c8a61f49311fbf37bfe8304ccbd0b4c9dfcb"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(mattjj,frostig): use batch_jaxpr, delete computation (assumes poly??) \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/lax/lax.py"},"region":{"startLine":10175}}}],"partialFingerprints":{"codehealthFindingId/v1":"7154d40a3a147f63f244b92d1ab0bcb1988cd57f418eac4e1918bfd6c72ce264"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(mattjj): an alternative is to use variadic reduce to compute the chosen \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/lax/lax.py"},"region":{"startLine":10474}}}],"partialFingerprints":{"codehealthFindingId/v1":"53fe614edef82338a84d02e9ad76210815787effef298522ad671f1e2b806183"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(rdyro): Support general \u0060out_sharding\u0060 reshards on kept dims. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/lax/lax.py"},"region":{"startLine":10738}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5911a67e4b2eae8beb7d7a14f593eac6e6d3c836d291e1fa904a4d0e728c496"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(https://github.com/jax-ml/jax/issues/13552): Look into making this a"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/lax/lax.py"},"region":{"startLine":11479}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3339cfc35aa2c47ca847d60559499570aa21fd91dc9678a69c91c11970145ce"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(mattjj) Generalize shape_like checking to permit dynamic shapes \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/lax/lax.py"},"region":{"startLine":11579}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f882caf5936693ec4c337aa468d659b3d7114e2bbcbd213b5ff4429b65e56f2"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(mattjj,frostig): do some checking, friend \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/lax/lax.py"},"region":{"startLine":11788}}}],"partialFingerprints":{"codehealthFindingId/v1":"2401ef243b12bd312c9742f6fa455e84b6adeda96da174d99e646bddebf033ec"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(yashkatariya): Delete \u0060empty2\u0060 and replace scan\u0027s usage with \u0060empty\u0060 once \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/lax/lax.py"},"region":{"startLine":12030}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9e94a82f4eda7518584e561febbb2c240d295ef72a4da6b7a760f969011af4b"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: Add \u0060max_qdwh_iterations\u0060 to the function signature for TPU SVD. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/lax/linalg.py"},"region":{"startLine":546}}}],"partialFingerprints":{"codehealthFindingId/v1":"a679e339b9669470b6bcfdaa701b5d6c9c3eab68e7bc995badd55d9c09a26fd7"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: implement full matrices case, documented here: https://people.maths.ox.ac.uk/gilesm/files/NA-08-01.pdf"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/lax/linalg.py"},"region":{"startLine":2377}}}],"partialFingerprints":{"codehealthFindingId/v1":"080579c0f610694915e9e3d04127314b24c549446b48db77c001d87d7a508396"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(danfm): It should be possible to skip instantiating these arrays \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/lax/linalg.py"},"region":{"startLine":2555}}}],"partialFingerprints":{"codehealthFindingId/v1":"9593978e73ff972a090175392edf873ee7fba6cedfe874f4105a54d0a8beb5b6"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: Consider swapping XLA for LAPACK in batched case \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/lax/linalg.py"},"region":{"startLine":2861}}}],"partialFingerprints":{"codehealthFindingId/v1":"d02c1b21a5e60e422efae3b581ae5703d3fa776358baee54beb50ef4d1d0e1f8"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(danfm): Add support for shape polymorphism and batch partitioning. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/lax/linalg.py"},"region":{"startLine":3270}}}],"partialFingerprints":{"codehealthFindingId/v1":"df7b01ac3223874079f693d70cec5a897cfd57dc6e4733b93d30f8431e2a782c"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(mattjj): add a pargmin_p, or add named axis support to lax.argmin_p \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/lax/parallel.py"},"region":{"startLine":319}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ac68ce250a9b7ff554f4d82720643f713981691b94ffeb49f70e6c9b257c3a4"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(mattjj): add a pargmax_p, or add named axis support to lax.argmax_p \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/lax/parallel.py"},"region":{"startLine":325}}}],"partialFingerprints":{"codehealthFindingId/v1":"de9bb122ef154fdb26afbf5b225f2d5d2f6bacb46f3f2c6e90233fcaaf59c067"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(yashkatariya): Replace this with _psum_invariant_abstract_eval \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/lax/parallel.py"},"region":{"startLine":1046}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb6dc0f4a6d9b13827dd0624327e092b3e3a6ce18d0f4d695971749c8e4eb9d6"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(mwhittaker): This optimization doesn\u0027t play well with async \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/lax/parallel.py"},"region":{"startLine":1662}}}],"partialFingerprints":{"codehealthFindingId/v1":"da0633265efa4e1f4c495fc233925be0b8fcf6ae50b3ec5cc0118c5573bc1abd"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(sharadmv,apaszke): Remove this broadcast that comes from \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/lax/parallel.py"},"region":{"startLine":1753}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8cbb30630cf5d5ab650e18951ae01d3f40e02ee86c41ae4e456af7dcbddfaf8"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: can we implement this without a placeholder? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/lax/slicing.py"},"region":{"startLine":832}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0bf3ee509b7719c9fbd2087c79c0d393110bd89ad91cc7e8ab7d8fa5cb99a11"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: implement this via its own primitive so we can define appropriate autodiff rules. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/lax/slicing.py"},"region":{"startLine":841}}}],"partialFingerprints":{"codehealthFindingId/v1":"cffbbee60b238e54b423fda96eccb65398eb035d742319349b9edd775716410c"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(yashkatariya): Returning operand.sharding as is may or may not move \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/lax/slicing.py"},"region":{"startLine":1423}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c39948b1111649a9fe7fedd6af745e31b2fcaf2f3e7d0a3d463aa2aa1207a21"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(phawkins): consider removing dynamic_slice entirely and using gather \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/lax/slicing.py"},"region":{"startLine":1661}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4e666134b3ed0553c7fe75e4c1b693b0287ea7fac8938ceb59cec90f645befb"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(mattjj): Alternately, we could add jnp.unstack and an unstack_p, \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/lax/slicing.py"},"region":{"startLine":1663}}}],"partialFingerprints":{"codehealthFindingId/v1":"18d6952477b845033ff86f3d4f75807e323ae97405d0c83c69e98814c9018057"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(phawkins): consider removing dynamic_update_slice, use scatter always \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/lax/slicing.py"},"region":{"startLine":1839}}}],"partialFingerprints":{"codehealthFindingId/v1":"c19ea80b853284b875c32016aac2b71fc0b263ca5bde293a4c55b5df5469ade5"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(burmako): Fix overly conservative type inference of DynamicGatherOp. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/lax/slicing.py"},"region":{"startLine":2568}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f49cb76e63d27eb64b665735a82ddbe2491902a7e8c9afa0f35f2ad270e1206"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(mattjj): this function sucks, delete it \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/lax/special.py"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b03e0eba119d294cf29c540a2f9cee13920220bb949dc6a23f8cfa06a789f2e"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: Make this a vmap. Might be tricky with the imports. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/lax/special.py"},"region":{"startLine":402}}}],"partialFingerprints":{"codehealthFindingId/v1":"13883d5bb84c945416a47a653bd4b9bd8931b8910420d4bfdfe21e0977547754"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(phawkins): Make this unconditional after jax 0.12.1 is released. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/lax/special.py"},"region":{"startLine":730}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c9637f4d9be6c25e315b2f35f52b63d049058550c09b6262a894fc910cff2e5"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(phawkins): Make this unconditional after jax 0.12.1 is released. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/lax/special.py"},"region":{"startLine":797}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad5c816262dc125f0006949f795e97540901a239e23a11e5b32fe85cf9a28396"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(phawkins): Switch CPU to \u0060erfc_default_impl\u0060 (\u0060use_exp2=True\u0060) once \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/lax/special.py"},"region":{"startLine":907}}}],"partialFingerprints":{"codehealthFindingId/v1":"4aa63d39a2d3f38bd70dea8800c594d8e6b6225e9804cd1f6f928df0886e8cbf"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(yashkatariya): Handle partial manual unreduced/reduced. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/lax/utils.py"},"region":{"startLine":361}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0e739d775d7b7ee5d99f6e3d446b67c1b6fe06154c78228eb85038763cd337f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(b/161704903): workaround for XLA/CPU crash. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/lax/windowed_reductions.py"},"region":{"startLine":886}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec70a7728cee2fd4bec801f34b9a52ffab98f547bacdda0740c18d20daafa576"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(b/182390722): workaround for XLA/GPU crash. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/lax/windowed_reductions.py"},"region":{"startLine":890}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f640aa7d9af9f4173d42d966d44eee7d79807578f3204d6aa202b9198a7cae1"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(sharadmv): lift them into a more common place \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/lax/control_flow/__init__.py"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"df86133fc300cce7a6adcf3d1b811dd2be8a28dc21864887df8230882035d233"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(mattjj): fix dependent library which expects optimization_barrier_p here \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/lax/control_flow/__init__.py"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4a09d0aa61cd67470329d4420d150e1aa95766b091ec378c9ad484255fa36a3"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(dougalm): this seems way too complicated. Why not allow different consts for each \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/lax/control_flow/common.py"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"5cdfe117f4c1e1389981c554dab59287dd24b278d74a201a507d367f8f995c91"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(rdyro): extend this to also cover reduced and unreduced. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/lax/control_flow/conditionals.py"},"region":{"startLine":387}}}],"partialFingerprints":{"codehealthFindingId/v1":"429e5a81d4fa66ab404cc0c7a72d0fe093fce01897a44245080bd90b3f78bdf5"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(rdyro): extend this to also cover reduced and unreduced. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/lax/control_flow/loops.py"},"region":{"startLine":586}}}],"partialFingerprints":{"codehealthFindingId/v1":"1197da20db66dda872393226b7e76e70045656d78f864890c6ff1b542016aded"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(sharadmv): clean this up by adding a specific blocklist \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/lax/control_flow/conditionals.py"},"region":{"startLine":475}}}],"partialFingerprints":{"codehealthFindingId/v1":"6155b525a89218388564d9780e36022d8e25e0d72450f0d70bb9fad7966d1485"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(mattjj,frostig): assumes branches are side-effect-free, revise! \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/lax/control_flow/conditionals.py"},"region":{"startLine":497}}}],"partialFingerprints":{"codehealthFindingId/v1":"bbebe62ed246caf4ad72a7a99b17af6a1aef25d8ecec28064ea31762da70bf91"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(mattjj): remove this path when old remat is removed \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/lax/control_flow/conditionals.py"},"region":{"startLine":632}}}],"partialFingerprints":{"codehealthFindingId/v1":"0882102016f686fcb2ff87981f102d3e9cb16e9396e02c6b923de650a53fbce7"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(mattjj): de-duplicate with _cond_partial_eval \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/lax/control_flow/conditionals.py"},"region":{"startLine":689}}}],"partialFingerprints":{"codehealthFindingId/v1":"c91925a7cac052ce49836b32320a00e64162bc30e6997b10b804c7bb79877ddf"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(mattjj): allow forwarding (requires per-branch wiring to survive \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/lax/control_flow/conditionals.py"},"region":{"startLine":1062}}}],"partialFingerprints":{"codehealthFindingId/v1":"99c3b55ea55815e30909c61d46d4e0e2570edc3cd83a72375684c8a3ae3e7e99"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(dougalm): validity checks \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/lax/control_flow/loops.py"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"be38cca0c7d9a54964d3ce9fb7ab51083e0c14079cd8ac5077579513bc96ba78"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: don\u0027t ignore \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/lax/control_flow/loops.py"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"ffb709a38176a10c10286dda2329b4ce119f2e69754897b1e79ea48dcd99692a"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: don\u0027t ignore \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/lax/control_flow/loops.py"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a45ebf083df2658311f0d129d1f022717f04f4b4ad601e4112f98eb912a7f0a"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(dougalm): use empty_ref instead of new_ref \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/lax/control_flow/loops.py"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"7702ab937411944dddd4c6651947e93ac377e6bb425480a44847d1af2ec6b9a8"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: generalize to hijax slices \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/lax/control_flow/loops.py"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce0c8d7cc4f166b2db6eb1a9fc1f25b55b2e5a9688a1884ef8004dc64dda45bf"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(dougalm): handle disable_jit \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/lax/control_flow/loops.py"},"region":{"startLine":173}}}],"partialFingerprints":{"codehealthFindingId/v1":"060043017f8c6239e7df14321db572fee57991433a4af421371bd101264de4c0"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(dougalm): promote away all weak types \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/lax/control_flow/loops.py"},"region":{"startLine":178}}}],"partialFingerprints":{"codehealthFindingId/v1":"e73509eebdbc260fa1c40f453a41b6991e7ef9ba6a9169c481ee662751d0a4fa"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(dougalm): handle traceable-level forwarding \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/lax/control_flow/loops.py"},"region":{"startLine":201}}}],"partialFingerprints":{"codehealthFindingId/v1":"dee011262e6acabb87f82ced9489a2b322c365a58ab69a7b72428eeccf5cd230"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: better error \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/lax/control_flow/loops.py"},"region":{"startLine":226}}}],"partialFingerprints":{"codehealthFindingId/v1":"4caeaeebbc81c4c72b2212941ed5502a43854c6dc1030d768a9e49954bd09e9f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(dougalm): this two-pass stuff is expensive (exponential in scan nesting \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/lax/control_flow/loops.py"},"region":{"startLine":390}}}],"partialFingerprints":{"codehealthFindingId/v1":"c29a267e1b943ffd287353bbb03fa5880f6fa9a2c1150571a7691711ca62fb1c"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(dougalm): put this in some sort of \u0060scannable\u0060 typeclass \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/lax/control_flow/loops.py"},"region":{"startLine":477}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf8290b0185d4389debe38d377d3482d04fc908e72350dc4b7c14694ccdd43de"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(mattjj): re-land #19819 version? simpler, but caused ~1 perf regression."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/lax/control_flow/loops.py"},"region":{"startLine":617}}}],"partialFingerprints":{"codehealthFindingId/v1":"9031b3720ce0e00fde532b4e28af16b466b33414bd9962abec84eb6a6bc6f7e4"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(yashkatariya): Replace \u0060lax.empty2\u0060 with \u0060lax.empty\u0060 once \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/lax/control_flow/loops.py"},"region":{"startLine":706}}}],"partialFingerprints":{"codehealthFindingId/v1":"582bbf43a8fc55af758ef71d26f1e0b876bdb9513aef4d34bf5d1d9952c223ac"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(mattjj): fixpoint \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/lax/control_flow/loops.py"},"region":{"startLine":1148}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8b83842acd3fdc56dd92e2a20bb45484c7eb6e3cf49f913da01c414a0046f26"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(mattjj,sharadmv): don\u0027t assume effects are never DCE\u0027d? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/lax/control_flow/loops.py"},"region":{"startLine":1329}}}],"partialFingerprints":{"codehealthFindingId/v1":"d02b937e2582bebdc5b1bdcaddce7c7e4348d783e0bb3d57759bf841c16f0a15"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(mattjj): de-duplicate code with _scan_partial_eval \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/lax/control_flow/loops.py"},"region":{"startLine":1342}}}],"partialFingerprints":{"codehealthFindingId/v1":"be46b9a1e6cfc1f63a433a4fca0615fc7c57d32aaacbe7fd8ba45c877f5d1b29"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(mattjj): make jaxpr_staged only take instantiated inputs \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/lax/control_flow/loops.py"},"region":{"startLine":1367}}}],"partialFingerprints":{"codehealthFindingId/v1":"0adfd6f4ec34acab32a115dbae3bf092aa226611bfb3c1dc5c9c7a23aa733317"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(mattjj): allow forwarding for ys outputs; carry outputs can\u0027t be \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/lax/control_flow/loops.py"},"region":{"startLine":1577}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f1d5ef40083619880581ae822582542bde3625d1cdb4984c0fdd1398406e235"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(mattjj): check body carry type \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/lax/control_flow/loops.py"},"region":{"startLine":1898}}}],"partialFingerprints":{"codehealthFindingId/v1":"64ed85f2c0adee979b62700aa699e2963309df3d6b60a58f1369791fd1a69f83"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(mattjj): make these typecompat checks work with bints \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/lax/control_flow/loops.py"},"region":{"startLine":1899}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f2757c7e9624b57003122d5a8b9a3a764f53ba8824aaeb2c939475eb43d00f4"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(mattjj): use pe.dce_jaxpr to drop res computations and not just outputs \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/lax/control_flow/loops.py"},"region":{"startLine":2102}}}],"partialFingerprints":{"codehealthFindingId/v1":"953cebf443ec1fca66f41a221cff119aa3a49f7553e954e6a7afa1fed53a57e1"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(mattjj): de-duplicate code with _while_partial_eval \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/lax/control_flow/loops.py"},"region":{"startLine":2116}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb8b6f356bdbf497244621ef2b5180c611d1a15f70d603ffa8c7c7788e3e5b68"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(frostig,mattjj): check cond_jaxpr, body_jaxpr types \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/lax/control_flow/loops.py"},"region":{"startLine":2423}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec26de351ef47eb5a2aa446b59db8a69ff8e2b9215d36b06b184cf406a6afc7a"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(phawkins): perhaps do more type checking here, better error messages. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/lax/control_flow/loops.py"},"region":{"startLine":2760}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae1c90d9c33b215ee3150c0097552c4b72f5a37f63f50199fa907bda8a7190ae"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(csigg): Register lowering for cumprod etc as well. Although those don\u0027t \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/lax/control_flow/loops.py"},"region":{"startLine":3291}}}],"partialFingerprints":{"codehealthFindingId/v1":"ddf1446de732fddde358c8434f2e78f40476a611fc7253f6710f6d2060276308"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(mattjj): why? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/lax/control_flow/solves.py"},"region":{"startLine":486}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4a5e4a001f0a36173bb394e2d564161b1e871912ca1297ce3146164a7293a62"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO non-residual consts..., check tracers! \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/interpreters/ad.py"},"region":{"startLine":191}}}],"partialFingerprints":{"codehealthFindingId/v1":"20d96d5d132e146cbf2d2a3eaff981070974761cae6ee55343799fa76b610734"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(mattjj): shorten the lifetime of the reference accumulators \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/interpreters/ad.py"},"region":{"startLine":319}}}],"partialFingerprints":{"codehealthFindingId/v1":"d79c4266c629fdd4d8d40b26b810ac3201d1702bce424f9ed97789db960ce5fe"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(mattjj): this is for for backward (get it?) compatibility. Remove, maybe. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/interpreters/ad.py"},"region":{"startLine":518}}}],"partialFingerprints":{"codehealthFindingId/v1":"42153e71b9e29e73c67f7c0669e1be642cff375be202985b2ff0f72a6882053b"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(mattjj,dougalm) \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/interpreters/ad.py"},"region":{"startLine":663}}}],"partialFingerprints":{"codehealthFindingId/v1":"fda1cc0b18bbd0412688a2f9f362a45ae232a1d147660ead9565f2ed29472a45"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(mattjj,yashkatariya): remove next line if downstream doesnt need it \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/interpreters/ad.py"},"region":{"startLine":1011}}}],"partialFingerprints":{"codehealthFindingId/v1":"df66b9978cd398380045ee28f42d8830e1a3f8f27535f042a2974dc0e65c39c0"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(dougalm, yashkatariya): Delete this context manager once we figure \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/interpreters/ad.py"},"region":{"startLine":1054}}}],"partialFingerprints":{"codehealthFindingId/v1":"23b67b83955264338c84bf2eca6e627256c002c0717a4430e64363362aaeb6ac"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(dougalm, yashkatariya): Delete this context manager once we figure \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/interpreters/batching.py"},"region":{"startLine":752}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c444dc25856e847444eb370cbf49d5116c5d34c81fd53be8ec3cedaa4fd9ce6"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(mattjj): track source provenance on AD tracers, improve error \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/interpreters/ad.py"},"region":{"startLine":1229}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab6874fc42553946b91722e63aa4388e5833273b2c3655050c5314ec1314ffac"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(mattjj): remove this vestigial dict \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/interpreters/ad.py"},"region":{"startLine":1238}}}],"partialFingerprints":{"codehealthFindingId/v1":"cded7c13b376cdd8c4ca7eeeca324f2c7b80ac13a604be3da148fea0dab05b12"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(mattjj): revise this laziness \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/interpreters/batching.py"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"73c798f8537256cdb391b8dec37add88f8c4b765076a842c501bc2934fd2a38b"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO check possible errors \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/interpreters/batching.py"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7ee4f8d2def11c318831fd98f115fa8584d87076da31b1406c795dc74a6b5d6"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(yashkatariya): Instead of \u0060add_explicit_mesh_axis_names\u0060, we should \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/interpreters/batching.py"},"region":{"startLine":345}}}],"partialFingerprints":{"codehealthFindingId/v1":"67855bbd3cd9c3268be1808e89c0bf2b5fc7d0080117c96ff1f9a51364e9fc5c"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(yashkatariya): Instead of \u0060add_explicit_mesh_axis_names\u0060, we should \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/interpreters/batching.py"},"region":{"startLine":460}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea09fc9ac74dab91731931c4e20b6f5e2f04c495b2ebd2ffefbb469739494397"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(mattjj): dedup with matchaxis \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/interpreters/batching.py"},"region":{"startLine":614}}}],"partialFingerprints":{"codehealthFindingId/v1":"5cc6e662d4cb747ea7b33ed527b496480cb10d7ef8eeb7aabeab6b98002f6072"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # backwards compat shim. TODO: delete \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/interpreters/batching.py"},"region":{"startLine":637}}}],"partialFingerprints":{"codehealthFindingId/v1":"553432e24552f0ccf202722b14f6498c2d53c3b16877aeb513c73578f52a1b2a"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # backwards compat shim. TODO: delete \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/interpreters/batching.py"},"region":{"startLine":645}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2340d3a4eb5858c98f08b105dbce171c088f1bd79e4ea3addb7c12a92c748e2"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(slebedev): Fix all callers and uncomment this. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/interpreters/mlir.py"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea5099304d2b1165de35210763a31cf22f4887998a40002e648e7bb4fec9fea1"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO Support different-size underlying dtypes to take advantage of the \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/interpreters/mlir.py"},"region":{"startLine":186}}}],"partialFingerprints":{"codehealthFindingId/v1":"603dc7d1cc83d857c6f93d93c042107ddd79f5a83a974b2fd77c083e16b65946"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(phawkins): clean up users who add their own dialects to JAX\u0027s contexts \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/interpreters/mlir.py"},"region":{"startLine":667}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc2076abff17bfffef7230baa3ab7379be260bf012e05da598715475cdb8f7d7"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: for multi-platform lowering we prepend to the regular dimension \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/interpreters/mlir.py"},"region":{"startLine":697}}}],"partialFingerprints":{"codehealthFindingId/v1":"a00e197ecc9febcb1ad1250820c67039d29e8daa369c2cc6592cb569656f805d"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(necula): perhaps we can use \u0060for_export\u0060 instead of this additional \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/interpreters/mlir.py"},"region":{"startLine":745}}}],"partialFingerprints":{"codehealthFindingId/v1":"37a807a375b044253c579eb37c5043ecbdd43240748d431820f7258c9c5840c4"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(phawkins): this feature is problematic, because you almost certainly \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/interpreters/mlir.py"},"region":{"startLine":998}}}],"partialFingerprints":{"codehealthFindingId/v1":"787db5d7a19589be36ed04fc297120339a0c1d5555b092222526b1a196a4890c"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(rdyro): Support platform-specific shard_map_collective_rules. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/interpreters/mlir.py"},"region":{"startLine":1133}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0d3f146aee1f1041f529201c4bf62e20510008369adc79f8f72636f4b0fd2dc"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(phawkins): fix up users to specify either \u0022cuda\u0022 or \u0022rocm\u0022 and remove \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/interpreters/mlir.py"},"region":{"startLine":1146}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1ac59fdeea0391063fc129a472e6467998fcb4b9b32a6b14d034bdc85cc0db0"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: replace usage of eval_dynamic_shape_as_vals with eval_dynamic_shape_as_ivals \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/interpreters/mlir.py"},"region":{"startLine":1241}}}],"partialFingerprints":{"codehealthFindingId/v1":"034aa120b43786922b70474e672fa73f7f8cb4728ba17f3311ccab7a0b54df3c"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(phawkins): it is my firm belief that: \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/interpreters/mlir.py"},"region":{"startLine":1429}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e0f9ecbbe13f424b78849f751f83d722890e2b6da3e410d196a7b341ef5bc5b"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(yashkatariya): Simplify the donation logic. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/interpreters/mlir.py"},"region":{"startLine":1485}}}],"partialFingerprints":{"codehealthFindingId/v1":"852c950faab934304ca7abfbe5671c07ad50e57dcb15f497b2b29381a293ab66"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(yashkatariya): Note that this logic should be in C\u002B\u002B where we make \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/interpreters/mlir.py"},"region":{"startLine":1621}}}],"partialFingerprints":{"codehealthFindingId/v1":"41f753a7d69fa1ccb68903e544f355e7741c52c261249a9f0434350c962fc25e"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(necula) maybe only pass the dim_vars if they are needed? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/interpreters/mlir.py"},"region":{"startLine":2511}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ddd5a5ef09db53261a9b412e6438b34c967e7fdc63d74f4b37fea94a6ae7c54"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(frostig,mattjj): check ctx.avals_out against jaxpr avals out? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/interpreters/mlir.py"},"region":{"startLine":2862}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3acaeaa1beb8a4fe0b61147ab17ae851800dfb45f1a981e772fa2faa2d1eba7"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(yashkatariya): Delete this after legacy compute_on is deleted. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/interpreters/mlir.py"},"region":{"startLine":3024}}}],"partialFingerprints":{"codehealthFindingId/v1":"752c916066d7c60164080c16a3064123e8a544f2ae7dd9b15c246d82eacf6ecc"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(necula): handle dynamic shapes \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/interpreters/mlir.py"},"region":{"startLine":3202}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c5159c07caedf4d0cc29a3d85e1cf7be25b9ba53b104593d2ed762badb71331"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(yashkatariya): If all the axes in pspec are AUTO or Manual, \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/interpreters/mlir.py"},"region":{"startLine":3333}}}],"partialFingerprints":{"codehealthFindingId/v1":"27da9d5f0b5e3285cb1fa9f2b63abe67c8d606c073ac1e9dcc9f581c131674ca"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(necula): it seems that the CustomCallOp constructor requires that \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/interpreters/mlir.py"},"region":{"startLine":3529}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd2f40de0d99c69dcd43236f8fe4f6e3b8c7345fb7c083bfccb79b69c7a85c30"}},{"ruleId":"D17","level":"warning","message":{"text":"XxxComment: # XXX: Think twice before changing this constant argument pruning! \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/interpreters/partial_eval.py"},"region":{"startLine":152}}}],"partialFingerprints":{"codehealthFindingId/v1":"171f4651df388cfa677e20cdcc66ce39918ff51b2098fed56098fca750ae8405"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO broadcast_in_dim can create a new tracer... \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/interpreters/partial_eval.py"},"region":{"startLine":362}}}],"partialFingerprints":{"codehealthFindingId/v1":"049317f50b7a4b6a65ab29eb3869a4de07d632f70bd8136366dc98017c244fd3"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(mattjj): superfluous wrapper...? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/interpreters/partial_eval.py"},"region":{"startLine":402}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9c417739452227dda49be94e164819a9e92996aebbbae0d7aa1a11a9f0b409c"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(mattjj): update all callers to use this version, delete other version. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/interpreters/partial_eval.py"},"region":{"startLine":487}}}],"partialFingerprints":{"codehealthFindingId/v1":"10db2c9535b48f1e2ac42053f4600d487909951b53adcc85bc4c6e41c83cde49"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO broadcast_in_dim can create a new tracer, not present in parents \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/interpreters/partial_eval.py"},"region":{"startLine":630}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb6bc89a30d2bb567c89f549043e1e586c8d89675e1cbeb4ce2be3816520ef29"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(slebedev): This is a legit error which requires a BUILD fix. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/interpreters/partial_eval.py"},"region":{"startLine":922}}}],"partialFingerprints":{"codehealthFindingId/v1":"287a88d5493e522dab3cf636c4061700e380ce44fd8b55c7deffd4a85828f856"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(mattjj,necula): debug info should be updated here \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/interpreters/partial_eval.py"},"region":{"startLine":974}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1a2db2a303c7912c704e080faf17b64883c905c8dc3e79fbb41c14fa2a8ad3c"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(mattjj,necula): debug info should be updated here \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/interpreters/partial_eval.py"},"region":{"startLine":986}}}],"partialFingerprints":{"codehealthFindingId/v1":"00b8cdaceebc6077a31179e519c7f76960398a5592508e55ca9f59c2742180bb"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(mattjj): unify with ParamsUpdater (this one takes an extra int) \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/interpreters/partial_eval.py"},"region":{"startLine":1086}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b3c2ba9647ed36bee746e79beb15004a13ae3bd796a568052002e27ef83ab33"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(sharadmv,mattjj): dedup this rule with call_partial_eval_custom_rule. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/interpreters/partial_eval.py"},"region":{"startLine":1096}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8ee7a0a36921b9f12c4d5b6de502145b8a59c64366aab4c7623e784dd90ea80"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(mattjj): this is just for pjit... but let\u0027s delete all this code \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/interpreters/partial_eval.py"},"region":{"startLine":1098}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc7ac6181d864a4c26736f24bddd40729776519750b0ce066ab083c0b32468ec"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(mattjj): free_ref doesn\u0027t read its Ref, but returning True here marks \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/interpreters/partial_eval.py"},"region":{"startLine":1303}}}],"partialFingerprints":{"codehealthFindingId/v1":"db11f5426f20b30aa7cea0be626dda309437eded4805bc14e50286265c3491f3"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(mattjj): de-duplicate with above rule? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/interpreters/partial_eval.py"},"region":{"startLine":1395}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd1db48497ca2316f4b5a290a1edec446c62c21efe962f079ca15c207d295941"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(dougalm): Remove aval. It\u0027s redundant now that we have val. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/interpreters/partial_eval.py"},"region":{"startLine":1454}}}],"partialFingerprints":{"codehealthFindingId/v1":"499366e286f2b7030196a7abf9f489abdbbaa5bbe4724935ac2d4b2fd825ec65"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(mattjj): figure out when not (invar_pos \u003C len(arg_info)) \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/interpreters/partial_eval.py"},"region":{"startLine":1491}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e72e5f18b92995d89015574298e1e4fcb77dfb1e61ffade05f05ceefcb73ab5"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(mattjj): ask for forgiveness \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/interpreters/partial_eval.py"},"region":{"startLine":1537}}}],"partialFingerprints":{"codehealthFindingId/v1":"be26aed59102493d7f3b8e75495b135ecdef2c362d858ba02865110093591d5e"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # rules need to work with both. TODO(dougalm): remove this once we fix \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/interpreters/partial_eval.py"},"region":{"startLine":1696}}}],"partialFingerprints":{"codehealthFindingId/v1":"7540be822f7f914531747007ed4f4e82aa1e128399aee89f9410e50cb23c75ae"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(mattjj): exposed existing tracer leaks; fix them and re-enable! \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/interpreters/partial_eval.py"},"region":{"startLine":1721}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1ae660ca1d2b3d18d67f2f31aafab9b9fce6b7f5d6d81c2af2b35a748ad2b5c"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(dougalm): we might be able to remove these given refcounting dce \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/interpreters/partial_eval.py"},"region":{"startLine":1728}}}],"partialFingerprints":{"codehealthFindingId/v1":"17581412597bad942578f60339f7f207063a4a50b914bcde76d6f8c6f8d46c2b"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(mattjj): for ints, or hashable consts, don\u0027t rely on id \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/interpreters/partial_eval.py"},"region":{"startLine":1774}}}],"partialFingerprints":{"codehealthFindingId/v1":"f19acb20ad4a25928e4829b5cd2c8de98a0d45477cd138200aba747a266461a2"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(mattjj): make custom_lin have hashable params. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/interpreters/partial_eval.py"},"region":{"startLine":1832}}}],"partialFingerprints":{"codehealthFindingId/v1":"450c88248dde101ad67bd73043c12d3955c8be6766e0c5ec9cb505d402c7aa74"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(dougalm): add an attribute to primitives to mark primitives with \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/interpreters/partial_eval.py"},"region":{"startLine":1833}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba2c377fe034d1127db6366a63b3fc4c5753de9e14a78cab2354e0f78af62a35"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(phawkins): remove this 3 months after the release of JAX v0.7. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/interpreters/partial_eval.py"},"region":{"startLine":1843}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8a8c6e7ad8f6ac203d6f4eb3e05afafd37ba551b6df53953cd9643e4b89d509"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: consider renaming to \u0022lazy_thunk\u0022 \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/interpreters/partial_eval.py"},"region":{"startLine":1980}}}],"partialFingerprints":{"codehealthFindingId/v1":"3cff9d296cc06cf6edd14085389a65c6faec1ce240bf285795841d1517d23cd5"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: let\u0027s just make a \u0060trace_to_jaxpr_ft\u0060 function for this \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/interpreters/partial_eval.py"},"region":{"startLine":2152}}}],"partialFingerprints":{"codehealthFindingId/v1":"cae47c02019b5feffb96c382bd55ab9b40d9a09df046b76035f04b2664507eca"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: handle kwargs \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/interpreters/partial_eval.py"},"region":{"startLine":2187}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5e5beef6a8bad4cc41f42ff1261a276dcc7460ea3a126a0c714dbc1d4a5a678"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(dougalm): make result paths optional \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/interpreters/partial_eval.py"},"region":{"startLine":2195}}}],"partialFingerprints":{"codehealthFindingId/v1":"193a8c3a98a8907e0685a0dd529d2c88ce0bf1d18b232f6a82aa8519fb0db826"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(dougalm): remove in favor of \u0060trace_to_jaxpr\u0060 \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/interpreters/partial_eval.py"},"region":{"startLine":2231}}}],"partialFingerprints":{"codehealthFindingId/v1":"d52f2ced05ed1987e4f4441928a9a7b6c7e215f5342e4c69591337cab76d58de"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(mattjj): fix in callee \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/interpreters/partial_eval.py"},"region":{"startLine":2285}}}],"partialFingerprints":{"codehealthFindingId/v1":"5575e335a8e4ffff459093d2dfb0a918fd876f7c5dc24133b0590e8b7dcc0418"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(dougalm): something more efficient \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/interpreters/partial_eval.py"},"region":{"startLine":2290}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7dac1d1ca576fa440a6ee25581179f2c4c8cb7094d54faf2e799bef881ab7a1"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(yashkatariya): Remove this once we have XLA DCE opaque opt-barrier. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/interpreters/partial_eval.py"},"region":{"startLine":2374}}}],"partialFingerprints":{"codehealthFindingId/v1":"07622406171e6524f0eb2d591f74f16c5c55983cb3cdb16bcb858689451cc34a"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(yashkatariya): Replace this with normal \u0060==\u0060 check once CPU supports \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/interpreters/pxla.py"},"region":{"startLine":159}}}],"partialFingerprints":{"codehealthFindingId/v1":"ffc443980a4b3815beed252c4a863b499729ef31a4c0da72799a6f74d37b0930"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(parkers): handle string dtypes. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/interpreters/pxla.py"},"region":{"startLine":201}}}],"partialFingerprints":{"codehealthFindingId/v1":"e108249d4d3f01add8a1127b7be83c8311019a429d5a85997e8bff2894d582a5"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(mattjj): remove float0 \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/interpreters/pxla.py"},"region":{"startLine":440}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b9568494a8c06bd5f259bf6cd5b510ef2a319dcbcc91493268cbc0d176771b8"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(mattjj): debug_info must be updated... \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/interpreters/pxla.py"},"region":{"startLine":651}}}],"partialFingerprints":{"codehealthFindingId/v1":"9fa277b36a1a43607d4de7d5122d36db6f2fc29dec91e5297513c30fe4fcb460"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(slebedev): Inline this function. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/interpreters/pxla.py"},"region":{"startLine":659}}}],"partialFingerprints":{"codehealthFindingId/v1":"da8203b6948cb1d631ba8331a582dcc93f15295bae6f78af0e0651e64d48c4bf"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(parkers): One _raw_platform has been unified with platform, \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/interpreters/pxla.py"},"region":{"startLine":1058}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ee7316de56a77f046813e9eddcc483d5058e6280242a96b53d72727778c6833"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(b/245667823): Remove this when XLA fixes this. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/interpreters/pxla.py"},"region":{"startLine":1310}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0a6898af4194750b9468ccff6ea7c588dc86fe65da444ba7b29d47c0bcc6c32"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(yashkatariya): Remove this condition and ask users to drop into \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/interpreters/pxla.py"},"region":{"startLine":1385}}}],"partialFingerprints":{"codehealthFindingId/v1":"552798761259f6773aa95fd8d27106dd2db0338e99ba4ab251dbb06f4d9cceec"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: we ought to ensure that out_avals are polymorphic if need be. We \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/internal_test_util/export_back_compat_test_util.py"},"region":{"startLine":346}}}],"partialFingerprints":{"codehealthFindingId/v1":"3fbf1a50a448db21e26436eff83188272e7c1d07b00cd512b544b8bec8c8e782"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(b/155331781): atanh has only ~float precision \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/internal_test_util/lax_test_util.py"},"region":{"startLine":297}}}],"partialFingerprints":{"codehealthFindingId/v1":"d27d58322dfbbdeb9fe000fa3d810116980fa4987d6da2b6ce96aae27121956b"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(b/142976030): the approximation of erfinf used by XLA is only \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/internal_test_util/lax_test_util.py"},"region":{"startLine":354}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c4deb229a2ac8cf1a322db48063464116239c5339d0e664b639f62eaff66314"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(bchetioui): JAX behaves weirdly when old_dtype corresponds to floating \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/internal_test_util/test_harnesses.py"},"region":{"startLine":525}}}],"partialFingerprints":{"codehealthFindingId/v1":"8bf9328d837a077ee9791ba58944cc44292f83c8fd24ae49628d826b6f76f065"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(necula): this results in RuntimeWarning np.abs overflow. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/internal_test_util/test_harnesses.py"},"region":{"startLine":554}}}],"partialFingerprints":{"codehealthFindingId/v1":"93ceb360cce37f68ee0b48d41c9bf23807b5146594129f9af06ec0d9ba74e71f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(bchetioui): the below documents a limitation of argmin and argmax when a \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/internal_test_util/test_harnesses.py"},"region":{"startLine":864}}}],"partialFingerprints":{"codehealthFindingId/v1":"4217602584b3bd9a2bad531224ca5eb9bb2e6ac03fa9089b0e7947fe3ac7b455"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: this fails on CPU, different result \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/internal_test_util/test_harnesses.py"},"region":{"startLine":944}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ad0c7727b0eb7fc0a9f37bf4ef449fc77f6de42a51edfa7e0937c0be72b05f9"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: add a test case for n=300. First attempt resulted in significant \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/internal_test_util/test_harnesses.py"},"region":{"startLine":1932}}}],"partialFingerprints":{"codehealthFindingId/v1":"42bc4be8d917c26b6ce0de7e2ebaa4d3aa545e2fffd9343a77b62e0b321d9b2b"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(bchetioui): commented out the test based on \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/internal_test_util/test_harnesses.py"},"region":{"startLine":2399}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d5fc0ad82f49eede3718239cb143efaa9d664cddd39fb519038825c7f2d14d6"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(b/416027995): Change this key back to 42. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/internal_test_util/test_harnesses.py"},"region":{"startLine":2762}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb9bbde7c48a92ac142bb43c8c37a1b7f8125bd123e3b990fbc63d853231ecae"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(b/206898375): this computation produces the wrong result on \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/image/scale.py"},"region":{"startLine":404}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5964b8e295c5b79abbc63eaec39c4a4fc70b639c595ed0875f123ced731912b"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: move to \u0060lower\u0060 \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/export/_export.py"},"region":{"startLine":612}}}],"partialFingerprints":{"codehealthFindingId/v1":"a00103fed606f6809cc5c9069083ed9d92fa7de902b00c3ec210297491a71bb8"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: better detection if orig_main.arg_attrs does not exist \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/export/_export.py"},"region":{"startLine":1003}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6c98e0472151447773422245bcdcb2c888e3bb4455027d2039262d9b6eb8d07"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(necula): handle module_kept_var_idx in presence of shape \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/export/_export.py"},"region":{"startLine":1033}}}],"partialFingerprints":{"codehealthFindingId/v1":"84e0fb360bcb1962215d209e1c6759cac1ef98798a5fa4b74c588a4616fafbd8"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(burmako): maintain backwards compatibility for these, until they \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/export/_export.py"},"region":{"startLine":1190}}}],"partialFingerprints":{"codehealthFindingId/v1":"432eb17c8e477b0b8ca6cefec257f51228c6ec48799c33224e84e071b346db05"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(necula): for now we require that the mesh uses the same axis_names \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/export/_export.py"},"region":{"startLine":1279}}}],"partialFingerprints":{"codehealthFindingId/v1":"86ddbdd326e5a11d11e407f4dbb95e283cdeeb941e7b57529849aa1666988027"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: keep as residuals only the arguments that are needed \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/export/_export.py"},"region":{"startLine":1349}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e81ddf6bdf3d1c94a2da9cff6163843382d9c22b06c866e3377b016a9c9c5e4"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(b/422690222): remove this pass once we don\u0027t need to support 6m \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/export/_export.py"},"region":{"startLine":1530}}}],"partialFingerprints":{"codehealthFindingId/v1":"034a037deaa9fde76691c231719ca39d43028f99ff5f6720e600ecb4c4662dee"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: maybe cache multiple calls \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/export/_export.py"},"region":{"startLine":1583}}}],"partialFingerprints":{"codehealthFindingId/v1":"85dd02543a2b646d47a3a21bda944a20a612cbb8dc5d3e33fadba90fddcd638d"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(necula): stop serializing in_avals 1 month after 4/4/26. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/export/serialization.py"},"region":{"startLine":177}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3026397e49f1382cc010fcc4176fb3491913767f18926846c09339e3bcf7e71"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(necula): stop serializing out_avals 1 month after 4/4/26 \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/export/serialization.py"},"region":{"startLine":181}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2d318db6396ff96b3c091294a513112763cf5a5bf23da3c799fa7daef1a26c2"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(necula): stop serializing in_shardings 1 month after 4/4/26 \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/export/serialization.py"},"region":{"startLine":183}}}],"partialFingerprints":{"codehealthFindingId/v1":"1aaefe73beb752be16e3018856343225ab70fff7b0d814db2ab9ba50ec42f661"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(necula): stop serializing out_shardings 1 month after 4/4/26 \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/export/serialization.py"},"region":{"startLine":187}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d05bb4d55e5719bc101efb715c9a31daf1e46c842d24fcc06322f5b2cb4c89f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: add test \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/export/serialization.py"},"region":{"startLine":211}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f692f39830d7449bd1ab04641a529c471321cc02af2d20eee8a96f04dd161ae"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: add test \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/export/serialization.py"},"region":{"startLine":901}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7e778e01b038088a9bfdf2021b09275025e3eca64554aa40c3b6306dd327413"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(b/539419341): check the minimum serialization version. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/export/serialization.py"},"region":{"startLine":293}}}],"partialFingerprints":{"codehealthFindingId/v1":"bbd25438fa797ab03814399354d383d914d303665533b02be83e1dcb49f7d585"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(necula): serialize the constraints \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/export/serialization.py"},"region":{"startLine":298}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8475301312e3a947ad41ec6583077c1e4c9bb01ed099755bd0bfcc3bea4a670"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(necula): remove this once we bump the minimum supported version. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/export/serialization.py"},"region":{"startLine":325}}}],"partialFingerprints":{"codehealthFindingId/v1":"b68cc7612046a9ff0f0df9ae3c41bf5f68f686c75739292f4d6ebdaeb095e1ec"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(necula): remove 6 months after 4/4/26 \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/export/serialization.py"},"region":{"startLine":340}}}],"partialFingerprints":{"codehealthFindingId/v1":"be05ca6b24330ad70e6ae6d835117f68014799feb9559e85d33aa9a7e3ec135b"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(necula): remove 6 months after 4/4/26 \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/export/serialization.py"},"region":{"startLine":354}}}],"partialFingerprints":{"codehealthFindingId/v1":"56e87a051c1b9c89682dff904d3b391f362a8b18bba7f2d76a23caa100a55802"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(necula): remove 6 months after 4/4/26 \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/export/serialization.py"},"region":{"startLine":373}}}],"partialFingerprints":{"codehealthFindingId/v1":"30d308ca6abeea5e40cd0a70c4ed44b0ec91100be878546bf2968cdf647689a6"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(necula): remove 6 months after 4/4/26 \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/export/serialization.py"},"region":{"startLine":385}}}],"partialFingerprints":{"codehealthFindingId/v1":"03cf2ee7f757c938d5630b9c0a91e436db6751496c73d9f14fe1f2cf9dd9b91c"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: is there a more direct way to construct a PyTreeDef without having to \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/export/serialization.py"},"region":{"startLine":520}}}],"partialFingerprints":{"codehealthFindingId/v1":"02cd5a7304ad11be2a181fbd16e4b7e552f3c3aeb6a777eddfee0df4968e4395"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(necula): remove 6 months after 5/15/2026 \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/export/serialization.py"},"region":{"startLine":643}}}],"partialFingerprints":{"codehealthFindingId/v1":"657436c3b884d987c39e192f84e35aaa851d0e4cd4d87c820f849186646c0449"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(necula): 1 month after 4/4/26 we can stop serializing the full \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/export/serialization.py"},"region":{"startLine":770}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5a8b3703b8d942e89b22dead251aba33ea0312b040fa5cc320bb231a51386d3"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(necula): 6 months after 4/4/26 we can stop deserializing the full \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/export/serialization.py"},"region":{"startLine":791}}}],"partialFingerprints":{"codehealthFindingId/v1":"31fba705c9cdd63e865535534de728ccdf322630f18338711db2f786fad2dca6"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(necula): We must keep reading the NamedSharding for 6 months after 4/4/26 \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/export/serialization.py"},"region":{"startLine":859}}}],"partialFingerprints":{"codehealthFindingId/v1":"a15daa3c32006ca1651dbebc8df4c589c8a063656cffe099da6cfb2e568f309d"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: Move all the _DimFactor string constants here and use this enum \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/export/shape_poly.py"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"8054cfe4d09a915f303237f0586b8e24fff0935ba10ae39f4765c61a8a0c2d70"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: check the case when we need to apply multiple normalizations \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/export/shape_poly.py"},"region":{"startLine":557}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd059bd60d624fd42411c79cd8d477f017508d27117670c7eba44c4326d54188"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: remove this trampoline when we refactor the sources \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/export/shape_poly.py"},"region":{"startLine":1196}}}],"partialFingerprints":{"codehealthFindingId/v1":"256bc1a69fece46fb8a496d2b1feac4b81f77d14bb0903752cfc34b968a7e62c"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: Remove backward-compatibility workaround \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/export/shape_poly.py"},"region":{"startLine":1534}}}],"partialFingerprints":{"codehealthFindingId/v1":"4cfccd6a935164e6424c872fa722ee2ea9f400a1c3caf2dfdb048f941d668865"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: maybe a generator is useful here instead of materializing the list \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/export/shape_poly_decision.py"},"region":{"startLine":200}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e6f73e7bec9bc1568fa0a7a7ad0472dd5b4870a872877bfd850dcaedb7f991c"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: optimize this dict() \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/export/shape_poly_decision.py"},"region":{"startLine":219}}}],"partialFingerprints":{"codehealthFindingId/v1":"41925c9f919e13897831122461efc85d2b0ba8a1ff45d8395672450d89b74ad7"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(b/380898464): Check the compute capability, e.g., require GPU device, \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/cudnn/fused_attention_stablehlo.py"},"region":{"startLine":2126}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9596e36db09b9954b8919946991fbdf3d98be6ac7170e485ce2f9641a605844"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO handle integers? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/autodidax.py"},"region":{"startLine":2028}}}],"partialFingerprints":{"codehealthFindingId/v1":"af63483bac0a232edd76298c78dda58a166c4e6f8f1d4a8091cbc58522c7947a"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(phawkins,jakevdp): revert to stable scipy docs when it is up again. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/conf.py"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"999e6242274fd2cbde13fae3fdc575bd17db9526604a8bd6e5e5b64173b2e585"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(jakevdp): remove this suppression once issue is fixed. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/conf.py"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"629ca03a21dce068ff6608fef6a29435cfa763d991984891210dba344ed52462"}},{"ruleId":"D26","level":"note","message":{"text":"Projects may be oversized for their cohesion: 1 of 7 project(s) overshoot their size bounds, lowering Project Cohesion to 7.1/10. The most over is \u0060(repository root)\u0060 (295849 LoC, 1392 module-visible types across 64 directories). Review these for cohesion \u2014 draw the boundary inside the module first (group each responsibility into its own package or directory and keep the cross-boundary members non-public), since splitting a published package moves types between packages and breaks consumers."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"d5a94650dc74886a0f1f08eb9fb6775f1fc395279ef7e901c970c9d26f767a72"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"c944f16efa9dc933cdd60eeb0499773fb8658339fef716bac59e5e65b128ef45"},"properties":{"commitSha":"b84f1c273baf59dec02cdc2bff76427ffa457daf"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"cdb33b57ded5ecc6ca51f26e36580bdca58582c3458903ec6af10a35c8d6e1a2"},"properties":{"commitSha":"a5151c71f1af406f6df0e73ce10308297a745db9"}},{"ruleId":"D28","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"3cdfd7beb31b791ae18dcb425e21eb157c842e7bbcd522cc330573c1a6538db1"}},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"9ddac1ceddb0078bc99ff50e4e4d0ef50030d99ad4d5a92d3f39edc52181573d"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"ca0e1df3c9b64ac124eca186898b202a5297667304b4d6565eb886d08d861cd0"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"3e7a78dafc77e761fe9fcb86ce7ee48a5019fe5044af85b3afcf45a0111a71f2"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"783bfb8e22bcf9386643b4e456c788771ae4d54a6d17253120ab597eb9e7a6fa"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"298126d1615e22c1cc15d3ba26e0ee52d0cb114054e4d49baf6da1438b4bcc2d"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"465c13dade2dfddf2033a986356eca5328ccc930a8cebbe9bd467fdbe05dd9a7"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"79e8d4cf1754b0ebe98808eaa69aed2c75c59d1d3d1afce7cb79e208f112ce41"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"aee640e59b9154eeeafd8df7371ca9c24cee6e17678a43eb0a1faaef0df8be48"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"8534a2f39ff3550710c9d874af22b3f997ef83275eb17ca19472caac8ec1b30a"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"a430b0f9ce2f3752a215e0934e219f1f3e39bbed10c95effb8e2354e7e33c23d"},"taxa":[{"id":"CWE-494","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A08:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"62dec3011a9a801de3ca94812a18f3cb70432661cf9f8f5fe368a1d39de396e7"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"2dbef7cb02ebe086164b6982d50a8041d0461fd750a1b63abac5d25a4826a952"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"e7e24c2107c967f6ee5e3d2bc5de9c2e6bf41fa67783aebd6eaa9e71db6205be"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"65d6e91b2bff8691a50ab61099287d57818e7aff9887b2667704230181367fe6"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"7474890e0db0c0c455f4ab5a1f55c57eb49eaf1a9a99882c532e3990d610475a"},"taxa":[{"id":"CWE-494","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A08:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"0a70f43d51570c4d61cdeb083de0abbf38299ba587fc5ec8956e1854a7934ad0"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"46a31d5859b29b99dd04da5a28cbeb3548d1c931062cdee5a9cf1f526e6e8545"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"641d41e9d4bbf78a54440bc50c029deda8870cc9088a00cc2d8dc84c33614511"},"taxa":[{"id":"CWE-95","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"6284d4d98140806f9f34dc87c749aa566d4fd09446971c9b474eae1dca9454b5"},"taxa":[{"id":"CWE-732","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A01:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"cde8fd9e2e96d789095ad7c064ff9056e6065572c66b0d25057d2d3d9ebc7025"},"taxa":[{"id":"CWE-732","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A01:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"8da95d82e98c1fb1306977c5a6e265d63410a4209876b31fc1f09cc8cf0f93f3"},"taxa":[{"id":"CWE-327","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A04:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"61227becb513a6ae6384cb81e0df76295261a137317a7ed6c846882754b98193"},"taxa":[{"id":"CWE-327","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A04:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"fcbc43ee2c2ef7d13cbba94201f53d5bda0f37f08dc783388997beb5d8d36ffd"},"taxa":[{"id":"CWE-502","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A08:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"688e9a53ce1c278cefdd19d99333a577c617354d5109a640acac2fc02ba62482"},"taxa":[{"id":"CWE-502","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A08:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"b6b1096f6f531d48425f0d436a839df1c358743d77fdb080e68c0b65736ea62e"},"taxa":[{"id":"CWE-939","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"ab85bb48a8e3a1a2eea35b74ff7de919d2641d547420471167523c1fcb390389"},"taxa":[{"id":"CWE-319","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A04:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"bc7e68c5724bcfc26599e335c756001a04f79399ac023699c8995a9465e4622e"},"taxa":[{"id":"CWE-319","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A04:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D31","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"47e5e71b03ebcf133d8bf797d1c5a6f9eac30fd088b2398499528f94817607c2"}},{"ruleId":"D31","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"8dd6c2b431196ff06f258274b72c1ff7e8463a659c6fbc1eb6ad151ed2d87076"}},{"ruleId":"D31","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"1d85795d43394c93c3bba5e7c2ddadb4d00828070009eb26e976a5cc993b6660"}},{"ruleId":"D31","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"21e71eb31a56564ecca4e01c197684fffb720b8e15f791cf09d1710d16290f23"}},{"ruleId":"D31","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"15aaae8323bf829960cdf022b45a5f6b723e993afa090ed1f0758dc6cba34396"}},{"ruleId":"D31","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"face87c71825f6c2ec27a26eb07cb71a3992fb0b3741a96167bfc44b3a429b59"}},{"ruleId":"D31","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"8b1941f55ef0b9e3d0db9d4b6446ef63129ab1ed775d7426c0ad8958f00d0f51"}},{"ruleId":"D31","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"7817e6f37a18a9ef916d6fcb33ec232407a402b49efc7e3c152901d04b5506b0"}},{"ruleId":"D31","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"259accfd31c573be4ca9229b4d36b42a56fecf43e465be36e8e0b438ee36721d"}},{"ruleId":"D31","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"eb7416870d378ef78c5797fe26581a7f3a85e757ac10d161f45006372d1c13dd"}},{"ruleId":"D31","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"45b40c964381426934cdef4dbe7afc443339b84a5becfc03ca72c2cd44fa7254"}},{"ruleId":"D31","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"c92cc6e46efb12c90cb392535912c1944e7c33e6e7cd90216b32c4f9906468e5"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D31","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"c610beecccb17a2627f0f2909f54a6e808d1abb49e8cfec6b0b7f6cf62361002"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},{"id":"CICD-SEC-3","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D31","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"5b5984350dfc42030c6333221c39034d4e350ca33f64d3dca789346ec9b9e8ce"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},{"id":"CICD-SEC-3","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D31","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"46fe856c15a72ea18cbddbffa535023845d50ecdbc6341839334228e694aee80"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},{"id":"CICD-SEC-3","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D31","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"059fd192dd8dbb4fd4028a62e4348f9f86f3d2ec31864ca8d470f8d03073a48c"}},{"ruleId":"D31","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"4b851eff236e3fa8bd88e458b1abf12d339729b451f01bbe47a46853d6095bc5"}},{"ruleId":"D31","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"04451fc3c5d6e35f9064dd516b848c4903cdef4b83f010c21fa2cd07f43c3a2b"}},{"ruleId":"D31","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"d881b500511583ebfc414c0ee82aea7eef1d7cc044f57a437106444bf0c800b4"},"taxa":[{"id":"CWE-426","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-693","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A08:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D31","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"d1833a1ad0a12a9b64a93e3beffe99131cb02f1505837cdd983e7dbca21c622b"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D31","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"d1700b79561519ee0543e1c55ea26f37dbe54e8df7b7f46043750de7e61f7c07"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},{"id":"CICD-SEC-3","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D31","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"f56e24b188649e086ba2e5ccf6bd9bb7acc766d3679fbcf81815bcb80d737f58"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},{"id":"CICD-SEC-3","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D31","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"f500eba00080688a3075dbfec2d4ce5cbfbd4e417352ad5540eee8c112c4bbca"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D31","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"bc35b203cca16af88d95a5a3b6dfb27fe97384a199c3ea309350d25bb658dbbf"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},{"id":"CICD-SEC-3","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D31","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"912c6a885fb196fa6beccda2d1b5920be23d7f92a39dba03c63b756eb38f7c7f"}},{"ruleId":"D31","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"a7ab37006b634538948ff185d287bc45809f0bc98930039d3f35f8b9bf080674"}},{"ruleId":"D31","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"4d767988ebe88e1ef29e70b2757fec32483e0b94d54eef95d1d4260deaf9fe5a"}},{"ruleId":"D31","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"612990ce1c0e348a296757daeb1d59b95d373bad9febee1b6babb3429a1bfde5"}},{"ruleId":"D31","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"bc31467473052079024f404444c9a48587d6896157156c22d79366f7f81674f4"}},{"ruleId":"D31","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"c856e513e7c31d3722af6b1413801b9a6e9e298fcf8be1726cde18fa171109c0"}},{"ruleId":"D31","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"f796f0442b5d1ae47e377c15edcdf37ba2215f5e8eab55fd80e2c968f3efd4b3"}},{"ruleId":"D31","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"e9cf13dce8ef8caf9b383f7662171bf034fe6bb9fd1b38bfb53ef8889c9bbc81"}},{"ruleId":"D31","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"f6aeae7149f9fad9925453145aa752d4a1bcac8c473d286e5b10fb640bdef9f5"}},{"ruleId":"D31","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"74dc5c21008bd70fd1335ad13bcacc05119f4591ac46a638c1da9e4d45f11815"}},{"ruleId":"D31","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"b985740705abcb9352759ee5f31526d65959799226d0dd67d9d142acb9786ee5"}},{"ruleId":"D31","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"3f74f28a90a62c98328026e9fd300395ab1fe195f028402cf881aedb05be503a"}},{"ruleId":"D31","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"83ca96d1a1f46937f880b58e940d91c6ae0993e7ab9fb66a54cf07f4b7c62364"}},{"ruleId":"D31","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"0be91cac544b0a6fa30f2ca4fd3ac58bfab73b4424498d4f62b24bbb382e53ca"}},{"ruleId":"D31","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"5d73eb5fcbdcbe355ffc5f0ab1459bf2ed9c30a41059237a3fd521ba2f21ecea"}},{"ruleId":"D31","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"4e2b00c02769cf5b22d8ff155c3b7e2a7dad3e350da07758d16c29f51572ea67"}},{"ruleId":"D31","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"db1d51c418d81ff14d1eee367f891a76037a5daea38c36fee96abd970e6ba0b5"}},{"ruleId":"D31","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"589e55dc48dc4329aff3dfcab1f204c6924da4b8474c57b1fcc371593bb7deab"}},{"ruleId":"D31","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"397bad80d40afe9f23e6e083bfa7248a456ef49961c94e8debe8c4a07456104f"}},{"ruleId":"D31","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"de734be732107fa51d36ba75c91d49283584d0b72ac2e4b26b937379f28e3df2"}},{"ruleId":"D31","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"32ce13212ab8b42ec6fd26517575ee3739da04d11cb8d75905497f79f43abfde"}},{"ruleId":"D31","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"acc4b31acb99269de255a303f05255ae0de93628e7418931183a74eea2ffa54a"}},{"ruleId":"D31","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"7062f12a32ae717aa42733abaed6040f1c64fc95043747630c620de22f20f4c5"}},{"ruleId":"D31","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"0571b71c55e110f8852b76079f8f8b8fb697bbe28207e2fdc321d28a87e7cda8"}},{"ruleId":"D31","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"cb5d35187bc865bb0d44db9115a78db1e7e3857ee4d82b614c5bd690e5f7179a"}},{"ruleId":"D31","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"801f023f9eca91e8a0574fdb88085ed78b5d650138098ead541bf38481a4c887"}},{"ruleId":"D34","level":"error","message":{"text":"Orphaned knowledge: No living knowledge remains for this large file \u2014 its last meaningful change has decayed away; if it breaks, no one currently understands it. Schedule a read-through / add characterisation tests before it bites."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/internal_test_util/export_back_compat_test_data/rocm_eigh_hipsolver_syev.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3af3126dea5db89e9da1f1bd1701170c057de1f213e52f2aa9ea6d55e83f50f7"}},{"ruleId":"D34","level":"error","message":{"text":"Orphaned knowledge: No living knowledge remains for this large file \u2014 its last meaningful change has decayed away; if it breaks, no one currently understands it. Schedule a read-through / add characterisation tests before it bites."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/internal_test_util/export_back_compat_test_data/cpu_lu_lapack_getrf.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"24482d6de25ceee640cd4015ae3a725f885aa2b6055c80b5f98fff3da311a876"}},{"ruleId":"D34","level":"error","message":{"text":"Orphaned knowledge: No living knowledge remains for this large file \u2014 its last meaningful change has decayed away; if it breaks, no one currently understands it. Schedule a read-through / add characterisation tests before it bites."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/internal_test_util/export_back_compat_test_data/cuda_svd_cusolver_gesvd.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2011321a35e17d7172e684a4ee67379e07e4e93209431846efd834afe999a46d"}},{"ruleId":"D34","level":"error","message":{"text":"Orphaned knowledge: No living knowledge remains for this large file \u2014 its last meaningful change has decayed away; if it breaks, no one currently understands it. Schedule a read-through / add characterisation tests before it bites."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/internal_test_util/export_back_compat_test_data/cpu_tridiagonal_lapack_sytrd_hetrd.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a782255f1d15145e7b12921d3413622bd566f102e70c84a661b6086fbada4cc"}},{"ruleId":"D34","level":"error","message":{"text":"Orphaned knowledge: No living knowledge remains for this large file \u2014 its last meaningful change has decayed away; if it breaks, no one currently understands it. Schedule a read-through / add characterisation tests before it bites."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/internal_test_util/export_back_compat_test_data/cpu_eigh_lapack_syev.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"16976bf8f5ff07fd699ad0f40ea84df215ac08fa32b6e3352f08bb647d6232b9"}},{"ruleId":"D34","level":"error","message":{"text":"Orphaned knowledge: No living knowledge remains for this large file \u2014 its last meaningful change has decayed away; if it breaks, no one currently understands it. Schedule a read-through / add characterisation tests before it bites."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/internal_test_util/export_back_compat_test_data/cpu_cholesky_lapack_potrf.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"da4d92a895b909d55e3a0524cab75e143736ad7a2ae6927ec9d77f555659ffa0"}},{"ruleId":"D34","level":"error","message":{"text":"Orphaned knowledge: No living knowledge remains for this large file \u2014 its last meaningful change has decayed away; if it breaks, no one currently understands it. Schedule a read-through / add characterisation tests before it bites."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/internal_test_util/export_back_compat_test_data/cpu_svd_lapack_gesdd.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3cc39e3bbedc2a7d10c6ead5444cd89e47f3b608850fde63d6993ff20d36570"}},{"ruleId":"D34","level":"error","message":{"text":"Orphaned knowledge: No living knowledge remains for this large file \u2014 its last meaningful change has decayed away; if it breaks, no one currently understands it. Schedule a read-through / add characterisation tests before it bites."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/internal_test_util/export_back_compat_test_data/cuda_eigh_cusolver_syev.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad02348d6311b71ceeecd42630cbb09fee6c66d2e4dad112a638e255ed42b0bf"}},{"ruleId":"D34","level":"error","message":{"text":"Orphaned knowledge: No living knowledge remains for this large file \u2014 its last meaningful change has decayed away; if it breaks, no one currently understands it. Schedule a read-through / add characterisation tests before it bites."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/internal_test_util/export_back_compat_test_data/cuda_tridiagonal_cusolver_sytrd.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa2ae0db9a58aba49c422cbdf5cb2aec5948bcbfef7f67406831f8e95d3c1f30"}},{"ruleId":"D34","level":"error","message":{"text":"Orphaned knowledge: No living knowledge remains for this large file \u2014 its last meaningful change has decayed away; if it breaks, no one currently understands it. Schedule a read-through / add characterisation tests before it bites."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/internal_test_util/export_back_compat_test_data/cpu_hessenberg_lapack_gehrd.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d92afe9740d360ea239686fc6e48b6d64b6365a69dde4424d42232b3aa930bbe"}},{"ruleId":"D34","level":"error","message":{"text":"Orphaned knowledge: No living knowledge remains for this large file \u2014 its last meaningful change has decayed away; if it breaks, no one currently understands it. Schedule a read-through / add characterisation tests before it bites."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/internal_test_util/export_back_compat_test_data/cpu_eig_lapack_geev.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"73e75c3acbd74030e2594c31561587d6569f7642d1aeef3b4e3c47dd81c30cad"}},{"ruleId":"D34","level":"error","message":{"text":"Orphaned knowledge: No living knowledge remains for this large file \u2014 its last meaningful change has decayed away; if it breaks, no one currently understands it. Schedule a read-through / add characterisation tests before it bites."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/internal_test_util/export_back_compat_test_data/cpu_tridiagonal_solve_lapack_gtsv.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff3f747d4096e84a0b5d37e8da614624844b9bbf6472ad3b3c3ab8bb3d20585e"}},{"ruleId":"D34","level":"error","message":{"text":"Orphaned knowledge: No living knowledge remains for this large file \u2014 its last meaningful change has decayed away; if it breaks, no one currently understands it. Schedule a read-through / add characterisation tests before it bites."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/internal_test_util/export_back_compat_test_data/cuda_qr_cusolver_geqrf.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"edc84730d49bc35ec73195773737e5b96ccb11c5214355c7954afe642d9e7ae0"}},{"ruleId":"D34","level":"error","message":{"text":"Orphaned knowledge: No living knowledge remains for this large file \u2014 its last meaningful change has decayed away; if it breaks, no one currently understands it. Schedule a read-through / add characterisation tests before it bites."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/internal_test_util/export_back_compat_test_data/cuda_lu_cusolver_getrf.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f440fcc12c8b3f733a47c149f7f6d7a6e8e5e3c34b92c39e39171c03077b69a"}},{"ruleId":"D34","level":"error","message":{"text":"Orphaned knowledge: No living knowledge remains for this large file \u2014 its last meaningful change has decayed away; if it breaks, no one currently understands it. Schedule a read-through / add characterisation tests before it bites."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/internal_test_util/export_back_compat_test_data/cpu_qr_lapack_geqrf.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"fabb061b3fa8ef82eb6afed54d46724b487956483b09f49f32d94194f26f3baa"}},{"ruleId":"D34","level":"error","message":{"text":"Orphaned knowledge: No living knowledge remains for this large file \u2014 its last meaningful change has decayed away; if it breaks, no one currently understands it. Schedule a read-through / add characterisation tests before it bites."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/internal_test_util/export_back_compat_test_data/cpu_schur_lapack_gees.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7fdcac35a14b6f249ac31c89b48f7b62db127c66d23dc5757197e991af237814"}},{"ruleId":"D34","level":"error","message":{"text":"Orphaned knowledge: No living knowledge remains for this large file \u2014 its last meaningful change has decayed away; if it breaks, no one currently understands it. Schedule a read-through / add characterisation tests before it bites."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/example_libraries/optimizers.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9cbd97c147c90b840336c8243deec8164c0ff3497ca6f4836961b79c3588cfb"}},{"ruleId":"D34","level":"note","message":{"text":"Further orphaned files (smaller): 16 smaller file(s) also have no living knowledge \u2014 folded into the freshness score and metrics rather than raised one row each \u2014 most significant first: jax/_src/internal_test_util/export_back_compat_test_data/tpu_Sharding.py, jax/_src/scipy/stats/gumbel_r.py, jax/_src/scipy/stats/gumbel_l.py, jax/_src/internal_test_util/export_back_compat_test_data/shardy_sharding_ops_with_different_meshes.py, jax/_src/sourcemap.py, jaxlib/gpu_rnn.py, jax/collect_profile.py, jaxlib/tools/build_mosaic_wheel.py (and 8 more) (33 orphaned of 458 analysed files in total, counted over production source files of roughly 2,400 bytes or more, excluding vendored, generated, example/demo and scaffolding-template trees and test files identified by path convention, largest first; 458 of the 682 production source files in this repository met that bar). Attach the read to the next change that touches one of them: have a second person review that change, and leave behind a short comment or test recording what the file is for, so the knowledge comes back at the cost of a change you were making anyway."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"ce861fd78f6935114d3a342cb90ad25870f984e1042954fcbbe27c0e23be3658"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/internal_test_util/export_back_compat_test_data/tpu_Sharding.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5735ef8893de5d2771cef6e0819146233900bcd73be7d20a6d727e512003532"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/scipy/stats/gumbel_r.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c8b0c3c2a49a45a92062f887cf50985d90acf691ade763afc7e139310365000"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/scipy/stats/gumbel_l.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2764d8b7d7efa8601bb83feb44516f1ab5546e5bd860df63d85ab494d5a69c2c"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/internal_test_util/export_back_compat_test_data/shardy_sharding_ops_with_different_meshes.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"78096ca8114f3536588481e4800d69c6e037027815e67ef7a973b8e899da9c3f"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/sourcemap.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d73aa71af606d45b492fc9b78840c7c9d32a13f9876e8fed9d50815af89b2fa2"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jaxlib/gpu_rnn.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee23855725ca7dd8c8d89a330aa0cfd3711c979a346abe39f0e4b43b337eea4c"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/collect_profile.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7821e04c8946e1650c3884c7bd0ae08b9e6d39a4ec1c19c12f81fede74dac324"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jaxlib/tools/build_mosaic_wheel.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"343c826140423fe398313f68d90bf813a93c63f7b2ab1e6c8bc67909f518f659"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/internal_test_util/export_back_compat_test_data/cuda_lu_pivots_to_permutation.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"24c29d889e3316481e26a171fdffe1e0f362ffaacd651798eb5197a1594a53e7"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jaxlib/mosaic/gpu/wheel/setup.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8269bad2ff87298553ebe35bb63057edcce32c36deaaea3aacb994b48893bc9e"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/tools/pgo_nsys_converter.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6141987d67adb296dcab4a16292beaeac3a829d98dbab19b908112b46f35435c"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/pallas/ops/tpu/megablox/ops.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f75fe4103412b862a8342ed00bab305bb156f5c31ac9485fb7d643fde1b527ba"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/clusters/mpi4py_cluster.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"635e1e6203014598c9d65aca4e1c902db0b51743a99117bde0ef0f9cff2eeb8e"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ci/utilities/convert_msys_paths_to_win_paths.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7dc0dff2bdc6d56c5e02cea0d4675a7cc31af7dbb8ebadc47dd40ed8b5ed83c7"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/pallas/ops/tpu/paged_attention/quantization_utils.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3ebf670160f9b0dce5fd1bae367c056123ecca2a0c3ce2c155ac95d0625981c"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/source_mapper/common.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"48ff3005a9a080bd2148edefc0a5a34ea9c49b2ca6d50ebb9413911ad51e9189"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling clique: serialization.py, export_with_memory_space.py, export_with_specified_sharding.py, export_with_unspecified_sharding.py: 4 files \u2014 \u0060jax/_src/export/serialization.py\u0060, \u0060jax/_src/internal_test_util/export_back_compat_test_data/export_with_memory_space.py\u0060, \u0060jax/_src/internal_test_util/export_back_compat_test_data/export_with_specified_sharding.py\u0060, \u0060jax/_src/internal_test_util/export_back_compat_test_data/export_with_unspecified_sharding.py\u0060 \u2014 all change together with no explicit dependency: a fully-connected co-change clique, not 6 separate couplings. They share one concern (thin parallel siblings over a common abstraction), so extract the shared part into ONE unit and the whole clique\u0027s coupling clears at once \u2014 you do not need to break each pair individually."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/export/serialization.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e3053354f318a513a6b5f7e4b6b5926c4da22d96352fe5856d328ccd020f6f1"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: sc_core.py \u2194 tpu_sc.py: \u0060jax/_src/pallas/mosaic/sc_core.py\u0060 and \u0060jax/experimental/pallas/tpu_sc.py\u0060 change together 69% of the time (11 of the 16 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well, and counted over this repository\u0027s 10,000 most recent commits rather than its whole history \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency \u2014 the edge is real but nothing declares it. Read the pair before acting: if one registers itself into the other through a hook or an initialiser, the missing dependency is DELIBERATE \u2014 the registration is the link, and it is meant not to be an import \u2014 and the thing to add is a comment on each side naming the other, not a merge; if they simply belong together, co-locate them; if neither holds, the coupling is hidden and worth breaking. You can check this without leaving the row: of the 11 shared commits counted here, the most recent 3 are \u00606ee8c036\u0060 [Pallas SC] Add slice_subcore_vmem_from_shared.; \u006023e25acb\u0060 [pallas:sc] Allow specifying sem=None and wait_write() for streams on\u2026; \u006022b253fa\u0060 [pallas:sc] Removed unused \u0060plsc.MemoryRef\u0060 \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/mosaic/sc_core.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"210df6a3705e64680fd51c83b3dee20051081e037d48ec48f0c4e94d7ac33674"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: jet.py \u2194 transform.py: \u0060jax/experimental/jet.py\u0060 and \u0060jax/experimental/sparse/transform.py\u0060 change together 61% of the time (11 of the 18 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well, and counted over this repository\u0027s 10,000 most recent commits rather than its whole history \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency \u2014 the edge is real but nothing declares it. Read the pair before acting: if one registers itself into the other through a hook or an initialiser, the missing dependency is DELIBERATE \u2014 the registration is the link, and it is meant not to be an import \u2014 and the thing to add is a comment on each side naming the other, not a merge; if they simply belong together, co-locate them; if neither holds, the coupling is hidden and worth breaking. You can check this without leaving the row: of the 11 shared commits counted here, the most recent 3 are \u00601bd05a49\u0060 Add jax.lax.exp2m1 and log2p1.; \u0060a194ad53\u0060 Add jax.lax.asinpi, acospi, atanpi, and atan2pi.; \u0060a024fff0\u0060 Add jax.lax.sinpi, cospi, and tanpi. \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/jet.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b9ea9f262ead58ee189568fbebbef656e3eef76d7856f18bce3e8f207694513"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: conditionals.py \u2194 fuser_utils.py: \u0060jax/_src/lax/control_flow/conditionals.py\u0060 and \u0060jax/_src/pallas/fuser/fuser_utils.py\u0060 change together 57% of the time (8 of the 14 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well, and counted over this repository\u0027s 10,000 most recent commits rather than its whole history \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency \u2014 the edge is real but nothing declares it. Read the pair before acting: if one registers itself into the other through a hook or an initialiser, the missing dependency is DELIBERATE \u2014 the registration is the link, and it is meant not to be an import \u2014 and the thing to add is a comment on each side naming the other, not a merge; if they simply belong together, co-locate them; if neither holds, the coupling is hidden and worth breaking. You can check this without leaving the row: of the 8 shared commits counted here, the most recent 3 are \u0060fefdef27\u0060 Explicitly propagate and specify strip_memory_space in state discharg\u2026; \u0060ed98c34b\u0060 Remove Jaxpr._num_consts; \u006010ae8c8b\u0060 rollback of rollback of ClosedJaxpr/Jaxpr merge \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/lax/control_flow/conditionals.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5fba919ceb49a76b7544ca787458b9c8533a2f0e291c65965944671ec9383e8f"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: lowering.py \u2194 torch.py: \u0060jax/_src/pallas/mosaic_gpu/lowering.py\u0060 and \u0060jax/_src/pallas/mosaic_gpu/torch.py\u0060 change together 55% of the time (6 of the 11 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well, and counted over this repository\u0027s 10,000 most recent commits rather than its whole history \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency between them. They sit in the same directory, but in this ecosystem each file is its own module \u2014 a sibling reference still needs an import \u2014 so the missing import edge is real: the coupling runs through shared behaviour, not a declared dependency. If they duplicate structure, extract the common part into one unit; otherwise the coupling is hidden and worth breaking. You can check this without leaving the row: of the 6 shared commits counted here, the most recent 3 are \u0060efd5e0f5\u0060 Removed the now-obsolete workarounds for pytype; \u00600e99acff\u0060 Removed more leftover pytype suppressions; \u0060dd118091\u0060 Even more Pyrefly fixes \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/mosaic_gpu/lowering.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9fbc6f1c96f342209875f702bb97f96629239ff7aea3cf7cdf0e6e4c26cd97ba"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: abstract_arrays.py \u2194 mlir.py: \u0060jax/_src/abstract_arrays.py\u0060 and \u0060jax/_src/interpreters/mlir.py\u0060 change together 52% of the time (11 of the 21 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well, and counted over this repository\u0027s 10,000 most recent commits rather than its whole history \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency \u2014 the edge is real but nothing declares it. Read the pair before acting: if one registers itself into the other through a hook or an initialiser, the missing dependency is DELIBERATE \u2014 the registration is the link, and it is meant not to be an import \u2014 and the thing to add is a comment on each side naming the other, not a merge; if they simply belong together, co-locate them; if neither holds, the coupling is hidden and worth breaking. You can check this without leaving the row: of the 11 shared commits counted here, the most recent 3 are \u0060b48ff81c\u0060 Add complex32 and bcomplex32 dtypes to JAX.; \u0060bf18f5e1\u0060 Add avals to TypedNdArray and TypedInt/TypedFloat/TypedComplex.; \u0060e78a6714\u0060 Remove stale version guards following JAX 0.9.2 release. \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/abstract_arrays.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a28f5a3a7cf5c22182c208441db4420806663216b10fa3cbb6c6271311742549"}},{"ruleId":"D36","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"1b213f6eedd4b140d0bc37bdf1496f72811a643f34064f12518b32e9e83bcfc7"},"taxa":[{"id":"CICD-SEC-9","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D36","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"0e17f71490e4d120a48b2b2881ab866c93b272bef2febb673a3e8e42b2c288ab"},"taxa":[{"id":"CICD-SEC-9","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D36","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"eb00976a698a5d68999b7ee6d27206fd374e916853e7ff1ead5eed42386f043f"},"taxa":[{"id":"CICD-SEC-9","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D36","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"a0b41738f427048f0205c1d6ef607738167024e8eba1a33901e2b416424d8390"}},{"ruleId":"D36","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"dc9585052203aedc57f881e87ee5308f7e94807a2f66681493e050bb15843d65"}},{"ruleId":"D36","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"d657599f6f99da1927d3377533dfc0888b34c4d84aa7d5579841fd72d0e39bce"},"taxa":[{"id":"CICD-SEC-6","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D40","level":"note","message":{"text":"No network policy: No Kubernetes NetworkPolicy (or Cilium policy) found. Without one, every pod can talk to every other pod and reach out to the internet by default. Add a default-deny policy and open only the flows you need."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"295828650a2aaa1b03ae9b32ae6843a0c38011e5a70b1926442c4fa7187de5f0"}},{"ruleId":"D41","level":"note","message":{"text":"No seccomp profile: The workload runs a container with no seccomp profile in force (neither RuntimeDefault nor a Localhost profile, on the container or the pod), so Kubernetes runs it Unconfined. Seccomp blocks the syscalls a container never needs, shrinking the kernel attack surface a container escape would use."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ci/k8s/indexed-job.yaml"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"2fc489f2420a84561a6b3e719c5a710364219bbf1f88e6dfa2435449ceda79f7"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u0060.p0_to_pserver\u0060 moves (\u0060animation-name: p0_to_pserver_keyframes\u0060) and nothing reads prefers-reduced-motion for it \u2014 no @media (prefers-reduced-motion) rule for this element, no reset this project loads \u2014 so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/_static/fault_tolerance/fault_tolerance.css"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa6b022670df683fbbf0e1458bfb92a28fe9aa46a5fb2b660f4a1a21aa69b79e"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u0060.p1_to_pserver\u0060 moves (\u0060animation-name: p1_to_pserver_keyframes\u0060) and nothing reads prefers-reduced-motion for it \u2014 no @media (prefers-reduced-motion) rule for this element, no reset this project loads \u2014 so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/_static/fault_tolerance/fault_tolerance.css"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"e71f0312dc8ac6174b2c6b7cb4f08cbb1c763c90e6ee26467f25e0814362938f"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u0060.p2_to_pserver\u0060 moves (\u0060animation-name: p2_to_pserver_keyframes\u0060) and nothing reads prefers-reduced-motion for it \u2014 no @media (prefers-reduced-motion) rule for this element, no reset this project loads \u2014 so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/_static/fault_tolerance/fault_tolerance.css"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"978508856decd958245828685773abd31618e6f975fc034cf93c2603e4af034e"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u0060.pserver_to_p0\u0060 moves (\u0060animation-name: pserver_to_p0_keyframes\u0060) and nothing reads prefers-reduced-motion for it \u2014 no @media (prefers-reduced-motion) rule for this element, no reset this project loads \u2014 so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/_static/fault_tolerance/fault_tolerance.css"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e186f668d422603d9bfb16d99b482ebc0db9dce616f31090fd75eef37ba4336"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u0060.pserver_to_p1\u0060 moves (\u0060animation-name: pserver_to_p1_keyframes\u0060) and nothing reads prefers-reduced-motion for it \u2014 no @media (prefers-reduced-motion) rule for this element, no reset this project loads \u2014 so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/_static/fault_tolerance/fault_tolerance.css"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ae5983f0125d4ccd4717a982e9037f123cd1558db30db0c717341ea67afb375"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u0060.pserver_to_p2\u0060 moves (\u0060animation-name: pserver_to_p2_keyframes\u0060) and nothing reads prefers-reduced-motion for it \u2014 no @media (prefers-reduced-motion) rule for this element, no reset this project loads \u2014 so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/_static/fault_tolerance/fault_tolerance.css"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d2ac2eb400d70489bd7943e4ff8ba888a4529a61f54e5417c52cb28b66bf284"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u0060.p0_to_pserver_tall\u0060 moves (\u0060animation-name: p0_to_pserver_keyframes_tall\u0060) and nothing reads prefers-reduced-motion for it \u2014 no @media (prefers-reduced-motion) rule for this element, no reset this project loads \u2014 so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/_static/fault_tolerance/fault_tolerance.css"},"region":{"startLine":167}}}],"partialFingerprints":{"codehealthFindingId/v1":"6537ab48ad4d425b230c0399f3f3588be20bd81ae938016cba4f76fcdffd7689"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u0060.p1_to_pserver_tall\u0060 moves (\u0060animation-name: p1_to_pserver_keyframes_tall\u0060) and nothing reads prefers-reduced-motion for it \u2014 no @media (prefers-reduced-motion) rule for this element, no reset this project loads \u2014 so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/_static/fault_tolerance/fault_tolerance.css"},"region":{"startLine":172}}}],"partialFingerprints":{"codehealthFindingId/v1":"09757de4aab23998a50cd6c55da649646f31c1668106e527518e850d6d053b0e"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u0060.p2_to_pserver_tall\u0060 moves (\u0060animation-name: p2_to_pserver_keyframes_tall\u0060) and nothing reads prefers-reduced-motion for it \u2014 no @media (prefers-reduced-motion) rule for this element, no reset this project loads \u2014 so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/_static/fault_tolerance/fault_tolerance.css"},"region":{"startLine":177}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6e274ac4054ae2f3ff48ccaaad32364ec178c854c0f4f1be5d8ec6a5afdcad3"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u0060.pserver_to_p0_tall\u0060 moves (\u0060animation-name: pserver_to_p0_keyframes_tall\u0060) and nothing reads prefers-reduced-motion for it \u2014 no @media (prefers-reduced-motion) rule for this element, no reset this project loads \u2014 so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/_static/fault_tolerance/fault_tolerance.css"},"region":{"startLine":182}}}],"partialFingerprints":{"codehealthFindingId/v1":"86cf0fc5204c08703d63878250917c956513f361cf1bcde4a4b09058c168aad8"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u0060.pserver_to_p1_tall\u0060 moves (\u0060animation-name: pserver_to_p1_keyframes_tall\u0060) and nothing reads prefers-reduced-motion for it \u2014 no @media (prefers-reduced-motion) rule for this element, no reset this project loads \u2014 so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/_static/fault_tolerance/fault_tolerance.css"},"region":{"startLine":187}}}],"partialFingerprints":{"codehealthFindingId/v1":"63796ed89ab93aa3b8bcbd6deac388c9080e2070e4ecadfe5f040c6dfb6576f1"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u0060.pserver_to_p2_tall\u0060 moves (\u0060animation-name: pserver_to_p2_keyframes_tall\u0060) and nothing reads prefers-reduced-motion for it \u2014 no @media (prefers-reduced-motion) rule for this element, no reset this project loads \u2014 so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/_static/fault_tolerance/fault_tolerance.css"},"region":{"startLine":192}}}],"partialFingerprints":{"codehealthFindingId/v1":"80d35b2a416ed581bd05eae15b4aa5f6245f6fbd44655f8b48691a34bf81c01a"}},{"ruleId":"C2","level":"note","message":{"text":"No named authorization policies: Authorization IS enforced here (by route guards, auth middleware or checks that refuse a caller) \u2014 this is NOT a claim that endpoints are unprotected. What\u0027s missing is a NAMED rule set: who may do what is encoded inline where it is checked, so the rules can\u0027t be listed, reviewed or tested apart from the code that applies them. Recommendation, not a defect."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"b048fdf3fa524ac68c7874fdfcdb4c49d5f010013f2cb22a0bd84cb12ceb951f"}},{"ruleId":"M3","level":"note","message":{"text":"No src/ separation: Most of the production code is in directories of its own, but 1 application file(s) sit at the repository root beside the build and tooling files (\u0060build_wheel.py\u0060)."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"fdf7f5b24e313364d10170a5c2542959902fe0d26ed70edef3eaa10ec5bcdb1d"}},{"ruleId":"P3","level":"note","message":{"text":"No SAST: No static application security testing detected. For this repository\u0027s stack, add bandit, \u0060semgrep --config=p/python\u0060, or CodeQL\u0027s python pack as a CI step. What was searched, so you can tell an absence from a miss: the 35 CI workflow file(s) in this repository, and the scanner and linter configuration checked in beside them. A scan that runs outside CI, one configured in your forge\u0027s web UI rather than in a committed file, or a tool whose name is none of those this check carries, is not seen \u2014 if that is your case the row is wrong, and saying so is more useful than adding a second scanner."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".github/workflows/asan.yaml"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e54424179c892f03ef2fd003130ac4bd43f39bbf3b1ca0a0143e25acb80ec87"}},{"ruleId":"P4","level":"note","message":{"text":"No rollback/health safety: Deployment automation exists but no readiness/liveness probes, rolling-update strategy, lifecycle hooks or migration job were evidenced \u2014 a bad release is harder to detect and reverse."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"db6bab8a28a2145f47e5a4e6683cda39d2ba0296c723238e8057da979ae1c706"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060\u0022exceeds available shared memory\u0022 in e.args[0] or \u0022Accumulator layout mismatch:\u0022 in e.args[0]\u0060 appears character-identically in 2 files \u2014 jax/experimental/pallas/ops/gpu/blackwell_matmul_mgpu.py, jax/experimental/pallas/ops/gpu/blackwell_ragged_dot_mgpu.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/pallas/ops/gpu/blackwell_matmul_mgpu.py"},"region":{"startLine":316}}}],"partialFingerprints":{"codehealthFindingId/v1":"0985ef01e0f279bd2570be6758e8f77b02645095c591954a4ac4b2e960e32996"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060( shape[-2] % BLOCK_SIZE[-2] != 0) or (shape[-1] % BLOCK_SIZE[-1] != 0)\u0060 appears character-identically in 2 files \u2014 jax/experimental/pallas/ops/tpu/random/philox.py, jax/experimental/pallas/ops/tpu/random/threefry.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/pallas/ops/tpu/random/philox.py"},"region":{"startLine":167}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f724203c2d172bb906da73ca164e4d13a85af4a5d70e49fccc87b9d37ec3c10"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060(output_idx \u003E= 0) and (output_idx \u003C grid_mapping.num_outputs)\u0060 appears character-identically in 2 files \u2014 jax/_src/pallas/mosaic/interpret/interpret_pallas_call.py, jax/_src/pallas/mosaic_gpu/interpret/interpret_pallas_call.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/mosaic/interpret/interpret_pallas_call.py"},"region":{"startLine":2170}}}],"partialFingerprints":{"codehealthFindingId/v1":"9714b9f3fad65cf1a9fe8a96729ba0650f08509e40bdd0ac6c2e0887ab0df7c3"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060(shape[-2] % block_size[-2] != 0) or (shape[-1] % block_size[-1] != 0)\u0060 appears character-identically in 2 files \u2014 jax/experimental/pallas/ops/tpu/random/philox.py, jax/experimental/pallas/ops/tpu/random/threefry.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/pallas/ops/tpu/random/philox.py"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7d631b659bc7ba25e09951197d677a308cf72ffdebd53d49d2db7303d79d057"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060TYPE_CHECKING or jaxlib_extension_version \u003E= 509\u0060 appears character-identically in 3 files \u2014 jax/_src/config.py, jax/_src/layout.py, jax/_src/mesh.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/config.py"},"region":{"startLine":272}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ad3cf4522d950005ec8f18df6762ab8845f589abc9f5bf04c3e44042ed97740"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060a is not core.abstract_token and dtypes.issubdtype(a.dtype, dtypes.extended)\u0060 appears character-identically in 2 files \u2014 jax/_src/interpreters/pxla.py, jax/_src/pjit.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/interpreters/pxla.py"},"region":{"startLine":1971}}}],"partialFingerprints":{"codehealthFindingId/v1":"b59d7f21087b1683ad1f328af17d5a7b32ae25d99679c18cf7ad52e7be9445b6"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060a.ndim \u003C 2 or a.shape[-1] != a.shape[-2]\u0060 appears character-identically in 2 files \u2014 jax/_src/numpy/linalg.py, jax/_src/scipy/linalg.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/numpy/linalg.py"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"88f18a5d28356e5ed05c390eedaca6dd56c2b509716e010b42700667a8994dc8"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060ad.is_undefined_primal(indices) or ad.is_undefined_primal(indptr)\u0060 appears character-identically in 2 files \u2014 jax/experimental/sparse/bcsr.py, jax/experimental/sparse/csr.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/sparse/bcsr.py"},"region":{"startLine":369}}}],"partialFingerprints":{"codehealthFindingId/v1":"3785d65191f7a5b10ff14950044e74b02d6f093b63b3f72c11d3990fb723a1d9"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060args.enable_cuda and not args.nvidia_wheel_versions_data\u0060 appears character-identically in 2 files \u2014 jaxlib/tools/build_gpu_kernels_wheel.py, jaxlib/tools/build_gpu_plugin_wheel.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jaxlib/tools/build_gpu_kernels_wheel.py"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"b36ceddca6553ecc6aee908fa88d0922986ed83e4a3e6f6680446ce11498247d"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060assumption.no_hazard or assumption.no_hazard_no_deps\u0060 appears character-identically in 2 files \u2014 jax/_src/pallas/mosaic/lowering.py, jax/_src/pallas/mosaic/primitives.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/mosaic/lowering.py"},"region":{"startLine":2379}}}],"partialFingerprints":{"codehealthFindingId/v1":"2761e6a19156eda135b5830f4c3415fd827693a8c16bb51c8823cda41125fd97"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060config.enable_checks.value and core.check_jaxpr(jaxpr)\u0060 appears character-identically in 3 files \u2014 jax/_src/interpreters/ad.py, jax/_src/interpreters/partial_eval.py, jax/_src/lax/control_flow/common.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/interpreters/ad.py"},"region":{"startLine":271}}}],"partialFingerprints":{"codehealthFindingId/v1":"07c416e8a7ca5df1e6c749efeb4531ee9b05772c570a1bb0d34c10fdba4c3c4f"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060config.enable_checks.value and core.check_jaxpr(new_jaxpr)\u0060 appears character-identically in 2 files \u2014 jax/_src/ad_checkpoint.py, jax/_src/interpreters/partial_eval.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/ad_checkpoint.py"},"region":{"startLine":697}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e1a0b1e13d73a42355e761b4b20a4c80c8413297bf90b604d1ac2017f79e520"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060config.enable_pgle.value and config.pgle_profiling_runs.value \u003E 0\u0060 appears character-identically in 2 files \u2014 jax/_src/compiler.py, jax/_src/pjit.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/compiler.py"},"region":{"startLine":560}}}],"partialFingerprints":{"codehealthFindingId/v1":"b31ebe5e8a0946965f946e7ea5ff0d02679583703d5444a5123558f095d88f40"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060config.pallas_tpu_interpret_mode_context_manager.value or interpret\u0060 appears character-identically in 4 files \u2014 jax/_src/pallas/core.py, jax/_src/pallas/helpers.py, jax/_src/pallas/mpmd.py, jax/_src/pallas/pallas_call.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/core.py"},"region":{"startLine":1675}}}],"partialFingerprints":{"codehealthFindingId/v1":"781a9772e5b8396ac7b61da9190f1a54b1d76b4ed2af1e45e95bb41131228f62"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060core.is_concrete(x) and aval.shape == ()\u0060 appears character-identically in 2 files \u2014 jax/_src/lax/lax.py, jax/_src/lax/windowed_reductions.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/lax/lax.py"},"region":{"startLine":3509}}}],"partialFingerprints":{"codehealthFindingId/v1":"a16024743fa208e09c1e74e625af6c5f46d2bc114c2f334f4eb98e8a67886baf"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060ctx.platforms or ctx.module_context.platforms\u0060 appears character-identically in 2 files \u2014 jax/_src/lax/fft.py, jax/_src/pallas/triton/pallas_call_registration.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/lax/fft.py"},"region":{"startLine":225}}}],"partialFingerprints":{"codehealthFindingId/v1":"f359c2db283520d20fe48b96da26bb6c2aec58627bbaaa58f5f39abbb286a395"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060dced_jaxpr is eqn.params[\u0027jaxpr\u0027] and all(used_inputs) and all(used_outputs)\u0060 appears character-identically in 3 files \u2014 jax/_src/compute_on.py, jax/_src/pjit.py, jax/_src/xla_metadata.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/compute_on.py"},"region":{"startLine":414}}}],"partialFingerprints":{"codehealthFindingId/v1":"9274b3b223be95409873d94e0a0898fc7200bf96e532aa03fcf50558b965b372"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060device is not None and out_sharding is None\u0060 appears character-identically in 2 files \u2014 jax/_src/numpy/array_creation.py, jax/_src/numpy/util.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/numpy/array_creation.py"},"region":{"startLine":192}}}],"partialFingerprints":{"codehealthFindingId/v1":"6fc152e9009ecee01ae4f7d2faac30e597157440c0ce470cf804e9b821d65ea5"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060full_matrices and subset_by_index != (0, rank)\u0060 appears character-identically in 2 files \u2014 jax/_src/lax/linalg.py, jax/_src/tpu/linalg/svd.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/lax/linalg.py"},"region":{"startLine":2341}}}],"partialFingerprints":{"codehealthFindingId/v1":"85dd4126efafb5342281f509ef138662922aaedd5a48bbf6497ebac5256fc4f5"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060idx.is_dynamic_start or idx.is_dynamic_size\u0060 appears character-identically in 2 files \u2014 jax/_src/pallas/mosaic_gpu/interpret/gpu_callbacks.py, jax/_src/state/discharge.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/mosaic_gpu/interpret/gpu_callbacks.py"},"region":{"startLine":587}}}],"partialFingerprints":{"codehealthFindingId/v1":"96b4f88f30006e103a0582ad8a22fbd62abfc1b2cb6be710d3b6ce2a9cf2cc18"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060isinstance(a, core.ShapedArray) and isinstance(a_, core.ShapedArray)\u0060 appears character-identically in 2 files \u2014 jax/_src/api.py, jax/_src/custom_derivatives.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/api.py"},"region":{"startLine":1636}}}],"partialFingerprints":{"codehealthFindingId/v1":"b49b6eef0eaca729730de7ecb53d4971ab8be033b178eae74b26041e7d343ae1"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060isinstance(aval, jax_core.ShapedArray) and not isinstance(aval.memory_space, jax_core.MemorySpace)\u0060 appears character-identically in 2 files \u2014 jax/_src/pallas/mosaic/pallas_call_registration.py, jax/_src/pallas/mpmd.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/mosaic/pallas_call_registration.py"},"region":{"startLine":166}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b38a6efe5a1122c20433536fe79f1939a929c880da140bae0d1eef95d1a8847"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060isinstance(axis_ctx, sharding_impls.SPMDAxisContext) and axis_ctx.manual_axes\u0060 appears character-identically in 2 files \u2014 jax/_src/interpreters/mlir.py, jax/_src/pjit.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/interpreters/mlir.py"},"region":{"startLine":1332}}}],"partialFingerprints":{"codehealthFindingId/v1":"d75d2ac38aa9020036a5be5d44127a62947a8d5ee5b13edb14cb894ef3fb6541"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060isinstance(c, pe.DynamicJaxprTracer) and getattr(c._trace, \u0027tag\u0027, None) is tag\u0060 appears character-identically in 2 files \u2014 jax/_src/interpreters/ad.py, jax/_src/interpreters/remat.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/interpreters/ad.py"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"97159966aa17b9f4696767e6fbdf5516f1d3d40bf2647c923da5fc6fd21c0cab"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060isinstance(indices, ad.Zero) or isinstance(indptr, ad.Zero)\u0060 appears character-identically in 2 files \u2014 jax/experimental/sparse/bcsr.py, jax/experimental/sparse/csr.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/sparse/bcsr.py"},"region":{"startLine":293}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f51c7a930cdbe4a87fd63730417f0394f54d89e96d3856908e2703feeb32b28"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060isinstance(s, NamedSharding) and isinstance(s.mesh, AbstractMesh)\u0060 appears character-identically in 2 files \u2014 jax/_src/dispatch.py, jax/_src/pjit.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/dispatch.py"},"region":{"startLine":293}}}],"partialFingerprints":{"codehealthFindingId/v1":"a22180b83cd27359803845802286d8d14e5915f387268157d07c8aa2e887cbcd"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060isinstance(s, NamedSharding) and s.spec.unreduced\u0060 appears character-identically in 2 files \u2014 jax/_src/dispatch.py, jax/_src/pjit.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/dispatch.py"},"region":{"startLine":497}}}],"partialFingerprints":{"codehealthFindingId/v1":"58c1e442a5b894785f0454a765d90684d6cb42e6a41566cabd0f01a8f2dc2c87"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060isinstance(sharding, NamedSharding) and isinstance(sharding.mesh, AbstractMesh)\u0060 appears character-identically in 2 files \u2014 jax/_src/interpreters/pxla.py, jax/_src/pjit.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/interpreters/pxla.py"},"region":{"startLine":1644}}}],"partialFingerprints":{"codehealthFindingId/v1":"32232b46c8ec3eecfa473e3a87e711ca9f3194463c3138c5627d15cab690332e"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060isinstance(v.type, ir.MemRefType) and utils.is_tmem_ref(v)\u0060 appears character-identically in 2 files \u2014 jax/experimental/mosaic/gpu/inference_utils.py, jax/experimental/mosaic/gpu/layout_inference.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/mosaic/gpu/inference_utils.py"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"23eb3a78d5546d734401a458d66958b5cd9f68ca4a394c4dc9fce71a53d684e4"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060jnp.iscomplexobj(x) or jnp.iscomplexobj(y)\u0060 appears character-identically in 2 files \u2014 jax/_src/scipy/signal.py, jax/_src/scipy/sparse/linalg.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/scipy/signal.py"},"region":{"startLine":784}}}],"partialFingerprints":{"codehealthFindingId/v1":"21d80a43ee74c9546cca7ab4a9920c9c29747e29fdc1af6dfd4c7f6786dc5623"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060key.shape == (2,) and key.dtype == np.uint32\u0060 appears character-identically in 2 files \u2014 jax/_src/random/philox4x32.py, jax/_src/random/threefry2x32.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/random/philox4x32.py"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"89d462ba82ef80cf099a964a7300b40ca6def23acc3a5f724b0b1ad5493ac679"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060logs is not None and type(logs) is not dict\u0060 appears character-identically in 2 files \u2014 jax/_src/custom_derivatives.py, jax/_src/hijax.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/custom_derivatives.py"},"region":{"startLine":1056}}}],"partialFingerprints":{"codehealthFindingId/v1":"71f3f1f0070cde02aff9daed69f71fa5ceba0337d52388940648178244dc9213"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060not any(used_inputs) and not any(used_outputs) and not dced_jaxpr.effects\u0060 appears character-identically in 3 files \u2014 jax/_src/compute_on.py, jax/_src/pjit.py, jax/_src/xla_metadata.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/compute_on.py"},"region":{"startLine":412}}}],"partialFingerprints":{"codehealthFindingId/v1":"b542bf044331520048626f651f9b868e62d4b41ce8314f44b5460c7f884922df"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060not any(used_outputs) and not pe.has_effects(eqn, live_ins)\u0060 appears character-identically in 7 files \u2014 jax/_src/ad_checkpoint.py, jax/_src/compute_on.py, jax/_src/lax/control_flow/conditionals.py, jax/_src/lax/control_flow/loops.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/ad_checkpoint.py"},"region":{"startLine":793}}}],"partialFingerprints":{"codehealthFindingId/v1":"23ff7e65b92ff78daf43e3ca273673f401a4c31d7d0ef9ab7917fc57cb14a99b"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060not any(used_outs) and not pe.has_effects(eqn, live_ins)\u0060 appears character-identically in 2 files \u2014 jax/_src/custom_derivatives.py, jax/_src/hijax.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/custom_derivatives.py"},"region":{"startLine":473}}}],"partialFingerprints":{"codehealthFindingId/v1":"4957d1c97f2e159bfa9f639fe95255cf0716c481fc10906bd6a499f581cc0cd6"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060not bwd.transforms and isinstance(bwd.f, ad.CustomBwdWithAccums)\u0060 appears character-identically in 2 files \u2014 jax/_src/custom_derivatives.py, jax/_src/interpreters/batching.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/custom_derivatives.py"},"region":{"startLine":1222}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a11d480d8dffb01c38ca7a5efa4f0c4de83a7d0a76f4bc60777b1b111bb9cf1"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060not config._check_vma.value or not config.auto_pcast.value\u0060 appears character-identically in 2 files \u2014 jax/_src/api.py, jax/_src/random/core.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/api.py"},"region":{"startLine":928}}}],"partialFingerprints":{"codehealthFindingId/v1":"8138bb7faac51a07babbb76d1f6dcc83d756f41eb951f1237dbdb74daed0e501"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060not isinstance(pair_out, (list, tuple)) or len(pair_out) != 2\u0060 appears character-identically in 2 files \u2014 jax/_src/custom_derivatives.py, jax/_src/hijax.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/custom_derivatives.py"},"region":{"startLine":308}}}],"partialFingerprints":{"codehealthFindingId/v1":"12c0e8c5707124096e18aa63c1c0cf131def60368810a1f4901fc44d756a4333"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060not isinstance(s, Slice) and not s.shape\u0060 appears character-identically in 2 files \u2014 jax/_src/pallas/primitives.py, jax/_src/pallas/triton/primitives.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/primitives.py"},"region":{"startLine":280}}}],"partialFingerprints":{"codehealthFindingId/v1":"d24bf8cb9ec1a2530da2b49e53447b68d4f34adfeea99eec8429abfc253f339d"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060not transforms or not isinstance(transforms[-1], indexing.NDIndexer)\u0060 appears character-identically in 3 files \u2014 jax/_src/pallas/mosaic/sc_lowering.py, jax/_src/pallas/mosaic_gpu/primitives.py, jax/_src/pallas/primitives.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/mosaic/sc_lowering.py"},"region":{"startLine":176}}}],"partialFingerprints":{"codehealthFindingId/v1":"f067873df97b10baa1e2ac514a7ecdaf05ab7b699fe606b2f3e1db9cf986b477"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060np.issubdtype(dtype, np.floating) or np.issubdtype(dtype, np.complexfloating)\u0060 appears character-identically in 2 files \u2014 jax/experimental/sparse/coo.py, jax/experimental/sparse/csr.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/sparse/coo.py"},"region":{"startLine":223}}}],"partialFingerprints":{"codehealthFindingId/v1":"a53d04ee842eb90084e461d668047984f076025d842fba4ade74b0a44d9a1bc3"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060out_sharding is not None and not isinstance(out_sharding, NamedSharding)\u0060 appears character-identically in 2 files \u2014 jax/_src/lax/lax.py, jax/_src/numpy/einsum.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/lax/lax.py"},"region":{"startLine":6749}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3331adf0fbb0c04ead1c99fd581ca99d7f079adcedfaf0d93f016d69e57352a"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060out_sharding is not None and not out_sharding.is_fully_replicated\u0060 appears character-identically in 3 files \u2014 jax/_src/random/prng.py, jax/_src/random/rbg.py, jax/_src/random/threefry2x32.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/random/prng.py"},"region":{"startLine":612}}}],"partialFingerprints":{"codehealthFindingId/v1":"c83d240ce0e43ff0ac0b4d0e14abbe391fcacf3e0cef32678827d6a13074418c"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060out_sharding is not None and out_sharding.spec.reduced\u0060 appears character-identically in 2 files \u2014 jax/_src/lax/lax.py, jax/_src/lax/slicing.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/lax/lax.py"},"region":{"startLine":10359}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f7ac6ff37d6b26f844a7360c050a5379ee63d793748798aafa8d51308e806da"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060out_sharding is not None and out_sharding.spec.unreduced\u0060 appears character-identically in 2 files \u2014 jax/_src/lax/lax.py, jax/_src/lax/slicing.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/lax/lax.py"},"region":{"startLine":6909}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd4dc65eccc7dafb6a83b596b97a8c352909c5f568caed2c55a2724aa11384a9"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060out_sharding.spec.unreduced or out_sharding.spec.reduced\u0060 appears character-identically in 2 files \u2014 jax/_src/nn/functions.py, jax/_src/numpy/einsum.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/nn/functions.py"},"region":{"startLine":708}}}],"partialFingerprints":{"codehealthFindingId/v1":"f41e27acc27f68cbb9d1f36b189ec52f3bbb73bc9257974669c015d0b6e8aa30"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060s is not None and s is not PartitionSpec.UNCONSTRAINED\u0060 appears character-identically in 2 files \u2014 jax/_src/interpreters/mlir.py, jax/_src/named_sharding.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/interpreters/mlir.py"},"region":{"startLine":1306}}}],"partialFingerprints":{"codehealthFindingId/v1":"d532297e61872df219677d5772a66b856c741155f51ce8e6829e18c5a5495b07"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060self.enable_logging and logging_info is not None\u0060 appears character-identically in 2 files \u2014 jax/_src/pallas/mosaic/interpret/shared_memory.py, jax/_src/pallas/mosaic_gpu/interpret/shared_memory.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/mosaic/interpret/shared_memory.py"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b0d7c6f64036c9c7f17f04eb189487280f3f953f76bb8ccefc127cccaabcc33"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060sharding is not None and sharding.spec.unreduced\u0060 appears character-identically in 2 files \u2014 jax/_src/lax/lax.py, jax/_src/ops/scatter.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/lax/lax.py"},"region":{"startLine":9559}}}],"partialFingerprints":{"codehealthFindingId/v1":"1363d9360d0a57c3045f04f976e7c56248232bd9ec97d1f39ea1f4c48fbd2547"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060source_info or source_info_util.new_source_info()\u0060 appears character-identically in 2 files \u2014 jax/_src/core.py, jax/_src/interpreters/partial_eval.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/core.py"},"region":{"startLine":467}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd42d470e0218ee8c1d5463f494fd8bc1b26dcf86fafa59bca05acb92cb8089f"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060subset_by_index is None or subset_by_index == (0, n)\u0060 appears character-identically in 2 files \u2014 jax/_src/lax/linalg.py, jax/_src/tpu/linalg/eigh.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/lax/linalg.py"},"region":{"startLine":1310}}}],"partialFingerprints":{"codehealthFindingId/v1":"1141e0b5e933e5e0dab10b7b63077af15b7d6ccd7bcd2fa09fa83a391daecd02"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060swizzle is None or swizzle == mgpu_dialect.SwizzlingMode.kNoSwizzle\u0060 appears character-identically in 2 files \u2014 jax/experimental/mosaic/gpu/launch_context.py, jax/experimental/mosaic/gpu/mma_utils.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/mosaic/gpu/launch_context.py"},"region":{"startLine":2067}}}],"partialFingerprints":{"codehealthFindingId/v1":"36d689a800829a6f74c6630326a328f47775e32a497dfff716df39479611b1be"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060type(msg) is str and msg.startswith(\u0022UNIMPLEMENTED\u0022)\u0060 appears character-identically in 2 files \u2014 jax/_src/array.py, jax/_src/stages.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/array.py"},"region":{"startLine":577}}}],"partialFingerprints":{"codehealthFindingId/v1":"7db9268edd7902eb4daeb92350f4a88406967f107eb845e0ec25bb87c2a8bfa0"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060utils.is_smem_ref(v) or utils.is_cluster_smem_ref(v)\u0060 appears character-identically in 2 files \u2014 jax/experimental/mosaic/gpu/inference_utils.py, jax/experimental/mosaic/gpu/layout_inference.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/mosaic/gpu/inference_utils.py"},"region":{"startLine":217}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1ee29b9d431aaf45959ebc7466b3e58dab05b327348c2ba16e4235c3258e98f"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060apply_transform\u0060 is public and takes \u0060ref_or_view: Any\u0060 from its caller, and it calls itself at line 316 (\u0060apply_transform\u0060) with a piece of \u0060ref_or_view\u0060 \u2014 and nowhere in \u0060apply_transform\u0060 is there a depth parameter, a descent counter, or any other cap. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. Python\u0027s parsers accept far more nesting than its stack allows: \u0060json.loads\u0060 turns 3,000 bytes of brackets into 1,500 levels and \u0060xml.etree.ElementTree\u0060 parses tens of thousands, while a walk like this one raises \u0060RecursionError\u0060 once it passes the interpreter\u0027s default limit of 1,000 frames. Wherever that exception lands, the work fails: a request errors, and outside any \u0060try\u0060 the worker or the program exits with it. Raising \u0060sys.setrecursionlimit\u0060 only moves the number the document has to beat. Thread a depth argument through \u0060apply_transform\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/state/types.py"},"region":{"startLine":316}}}],"partialFingerprints":{"codehealthFindingId/v1":"bdc3c3fa5cdbf5b1e524806131efd6204b6d03e9d0546320fbb431deb4988835"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060array\u0060 is public and takes \u0060object: Any\u0060 from its caller, and it calls itself at line 307 (\u0060array\u0060) with a piece of \u0060object\u0060 \u2014 and nowhere in \u0060array\u0060 is there a depth parameter, a descent counter, or any other cap. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. Python\u0027s parsers accept far more nesting than its stack allows: \u0060json.loads\u0060 turns 3,000 bytes of brackets into 1,500 levels and \u0060xml.etree.ElementTree\u0060 parses tens of thousands, while a walk like this one raises \u0060RecursionError\u0060 once it passes the interpreter\u0027s default limit of 1,000 frames. Wherever that exception lands, the work fails: a request errors, and outside any \u0060try\u0060 the worker or the program exits with it. Raising \u0060sys.setrecursionlimit\u0060 only moves the number the document has to beat. Thread a depth argument through \u0060array\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/numpy/array_constructors.py"},"region":{"startLine":307}}}],"partialFingerprints":{"codehealthFindingId/v1":"0da3794612d583c9319a58de230222fddbf5eac3393e38a3de5bbcc1b5b38597"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060dot_general\u0060 is public, takes a document from its caller (line 42) and hands it to \u0060_eval_dot\u0060, which calls itself at line 133 (\u0060_eval_dot\u0060) with a piece of \u0060out_s\u0060 \u2014 and nowhere in \u0060_eval_dot\u0060 is there a depth parameter, a descent counter, or any other cap. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. Python\u0027s parsers accept far more nesting than its stack allows: \u0060json.loads\u0060 turns 3,000 bytes of brackets into 1,500 levels and \u0060xml.etree.ElementTree\u0060 parses tens of thousands, while a walk like this one raises \u0060RecursionError\u0060 once it passes the interpreter\u0027s default limit of 1,000 frames. Wherever that exception lands, the work fails: a request errors, and outside any \u0060try\u0060 the worker or the program exits with it. Raising \u0060sys.setrecursionlimit\u0060 only moves the number the document has to beat. Thread a depth argument through \u0060_eval_dot\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/lax/_reduction_order.py"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"80bd3bdf6a986c71ce205bbc7e197deea685507e87056fe15fa82418069b94d1"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060ragged_dot_general\u0060 is public, takes a document from its caller (line 375) and hands it to \u0060_eval_ragged_dot\u0060, which calls itself at line 424 (\u0060_eval_ragged_dot\u0060) with a piece of \u0060out_s\u0060 \u2014 and nowhere in \u0060_eval_ragged_dot\u0060 is there a depth parameter, a descent counter, or any other cap. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. Python\u0027s parsers accept far more nesting than its stack allows: \u0060json.loads\u0060 turns 3,000 bytes of brackets into 1,500 levels and \u0060xml.etree.ElementTree\u0060 parses tens of thousands, while a walk like this one raises \u0060RecursionError\u0060 once it passes the interpreter\u0027s default limit of 1,000 frames. Wherever that exception lands, the work fails: a request errors, and outside any \u0060try\u0060 the worker or the program exits with it. Raising \u0060sys.setrecursionlimit\u0060 only moves the number the document has to beat. Thread a depth argument through \u0060_eval_ragged_dot\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/lax/_reduction_order.py"},"region":{"startLine":424}}}],"partialFingerprints":{"codehealthFindingId/v1":"1446dca9e61587cdf6cd3090fd8b2c52a945efd224bcb1e79a534c9377bcf629"}},{"ruleId":"X23","level":"note","message":{"text":"Diagnostic log message is built whether or not it is wanted: \u0060debug\u0060 at line 89 is called with an argument built by \u0060\u0022\u2026\u0022.join(e.__name__ for e in cls._cluster_types)\u0060 (line 90), whose cost grows with the collection it walks. Python evaluates a call\u0027s arguments BEFORE entering the method, so that join/projection runs in full every time this line is reached \u2014 and then the level check inside the logger discards the string it produced, because debug is a level a shipped configuration normally leaves off. Nothing here decides beforehand whether the message is wanted: no \u0060isEnabledFor(logging.DEBUG)\u0060 test, no debug flag, no \u0060lambda\u0060 the logger calls only when the level is on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/clusters/cluster.py"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8bf9bd4859d7eddf3ea777a476a173345b535b7965bc4bcd45d70e5ac9df5ed"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060except\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/version.py"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"299fbd0f931da151608ddcf3c9553284482509d51f5c351e0e8d573c36220163"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060except Exception\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/tools/evaluate_sampler_bias.py"},"region":{"startLine":251}}}],"partialFingerprints":{"codehealthFindingId/v1":"de0d1db504887a7cfd75e2bfea6d859d865dfc5238a500724331c954b96cb1c3"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060except Exception\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/tools/evaluate_sampler_bias.py"},"region":{"startLine":272}}}],"partialFingerprints":{"codehealthFindingId/v1":"eef3181b1aa014d3ae5a3ce9004f44bcd7441222b5fce6be0b15d8c88cae7881"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060except\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/sparse/_base.py"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ed13a2ee85ecb9303be72fa30e2acee4f69b11f1550a284cb3fea9ab121ae00"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060except\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/sparse/bcoo.py"},"region":{"startLine":2539}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c13136d553be721c63bfa2646d2ca57725109c880d38e8f8f6f57293df76ff7"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060except Exception\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/sparse/bcsr.py"},"region":{"startLine":892}}}],"partialFingerprints":{"codehealthFindingId/v1":"9da665ba59283741e6e3c8df349f880cea14ec9e5f516985a61e2b45fc476c76"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060except\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/mosaic/gpu/core.py"},"region":{"startLine":1096}}}],"partialFingerprints":{"codehealthFindingId/v1":"60833496acf7a39514777c98c33506f8f86eceeab98037cca628260770a9854c"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/mosaic/gpu/layout_inference.py"},"region":{"startLine":2637}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0b626a0adbc150840d21d91da7d9d170789e1e4922d2ce9ed330824a209a8a8"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060except\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/experimental/jax2tf/jax2tf.py"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"46058ad7a50a3c5a1a571f4d4e15d66154480b4b2a7c488a8678fe78f1a52d7a"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060except\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/api.py"},"region":{"startLine":1966}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e3b3c50cdc206ee398f4f755f884a4a52ecd540d68c2114aae677511191a665"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/api.py"},"region":{"startLine":2920}}}],"partialFingerprints":{"codehealthFindingId/v1":"b978f146856da8d8e3ab8581aed33820101c6874b34c74f31a42e4a1496e58a2"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060except\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/api_util.py"},"region":{"startLine":713}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c7d9837f09b1965bf6df57280e27d9203a00e5e2120049c09c56c6074cbe644"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060except Exception\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/compiler.py"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"47504b4607d6cd92016f2892f9e4336b7f9e4628345ec51f415c5e6c410a7f58"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060except\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/core.py"},"region":{"startLine":3200}}}],"partialFingerprints":{"codehealthFindingId/v1":"4627457c14522c3e682cc665b2cb084da7255b0380234bc00ec5af6bae884460"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060except\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/core.py"},"region":{"startLine":3331}}}],"partialFingerprints":{"codehealthFindingId/v1":"9cf31f986c4bd9c1f1343f1d9f1cb7be8de78265b1cb4007c708716384f15598"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/core.py"},"region":{"startLine":3673}}}],"partialFingerprints":{"codehealthFindingId/v1":"84da5785b0da17c7380c033f90fc4149153d3626708f4e1744bd93b699623051"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/dtypes.py"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"325b468e5926995731dfc517e53b1e99c1321628bb79dd5173acd27cd136ec88"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060except Exception\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/environment_info.py"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"472215bab7e1b27fb66ef722cb027f30283e6c04cdc814ef34052493639c5ea2"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060except\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/mesh_utils.py"},"region":{"startLine":810}}}],"partialFingerprints":{"codehealthFindingId/v1":"b25ff4243e893fa5e97ea5470d5adb3648d1c5f1c596d0c765a1afb2b8fe8ad9"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060except\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/tree_util.py"},"region":{"startLine":823}}}],"partialFingerprints":{"codehealthFindingId/v1":"677ed53714fd4ef7ae40e2f6be22ef490c4c498977cd781ad502311723fd0bae"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060except\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/tree_util.py"},"region":{"startLine":1385}}}],"partialFingerprints":{"codehealthFindingId/v1":"adade8fb9309c817db34e5b141400f01d5bf55f6d310f048d15c206937cff5dc"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/util.py"},"region":{"startLine":515}}}],"partialFingerprints":{"codehealthFindingId/v1":"9405d6ed6a4a44e4d7fe191fe671abb5c681923bb903dafa1ef3b8fc8df31809"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060except\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/util.py"},"region":{"startLine":658}}}],"partialFingerprints":{"codehealthFindingId/v1":"20aed0f03eab5f26bec3fa91e6b05a05097a59c0b1a9bfa7b61684896fb36d61"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/mosaic/interpret/interpret_pallas_call.py"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"23b7408e366ef6fa35958aa9163f78210e3137b68ac236c98843d5ec0d464ed9"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/pallas/mosaic/interpret/interpret_pallas_call.py"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"237f705d5bd343c10e2d2b0b04692af1ef65452103f4a485cd59d86a32e424dd"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060except\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/lax/control_flow/loops.py"},"region":{"startLine":546}}}],"partialFingerprints":{"codehealthFindingId/v1":"904535d33ffc5d6d5979961af047502f473d01198a59ddeb698b6b669b5fe042"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060except\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/interpreters/pxla.py"},"region":{"startLine":1283}}}],"partialFingerprints":{"codehealthFindingId/v1":"39299cbbc60d69fcf3fa6f4718aff43697a9e29452e9900e7db928be7e460b86"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060except\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/export/shape_poly.py"},"region":{"startLine":1245}}}],"partialFingerprints":{"codehealthFindingId/v1":"a47939423b446a3e5d9ff5e668dd3e21d3aa47b0e5002b5fbf74633beff13ac7"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/export/shape_poly.py"},"region":{"startLine":1769}}}],"partialFingerprints":{"codehealthFindingId/v1":"bea642af75936774e03d717392942c728175e84b34de69698f595c2e3b1ddde4"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/export/shape_poly.py"},"region":{"startLine":1774}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e8af481d94e925988664b9faba7f5677069f3278a20ecbf66ed585dd226b83a"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/export/shape_poly.py"},"region":{"startLine":1782}}}],"partialFingerprints":{"codehealthFindingId/v1":"099bf0f5080e316557f7ddca52e71d0e7170cac50622a9d13c836f656f9a92dd"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/export/shape_poly.py"},"region":{"startLine":1787}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d718a911854532a0c12c20ea00e074aa086ed993a45df96ab90ac0bae9285ac"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warning\u0060 at line 284 is handed an f-string as its message, so the logger receives one finished string \u2014 the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: \u0060logger.warning(\u0022order %s moved to %s\u0022, order_id, status)\u0060 with the standard library\u0027s \u0060logging\u0060, which keeps the message and its arguments apart on the record, or \u0060log.warning(\u0022order moved\u0022, order_id=order_id, status=status)\u0060 with structlog."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax_plugins/cuda/__init__.py"},"region":{"startLine":284}}}],"partialFingerprints":{"codehealthFindingId/v1":"9912db874734551dfcc3897436452f33c9a23a1e5fc0069796c59d91e62781bd"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug\u0060 at line 359 is handed an f-string as its message, so the logger receives one finished string \u2014 the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: \u0060logger.debug(\u0022order %s moved to %s\u0022, order_id, status)\u0060 with the standard library\u0027s \u0060logging\u0060, which keeps the message and its arguments apart on the record, or \u0060log.debug(\u0022order moved\u0022, order_id=order_id, status=status)\u0060 with structlog."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax_plugins/cuda/__init__.py"},"region":{"startLine":359}}}],"partialFingerprints":{"codehealthFindingId/v1":"dbfe2e136922ba9dcf81cb0ea4fd6fd49f478af0999e9bc98f2eae80737b7098"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info\u0060 at line 593 is handed an f-string as its message, so the logger receives one finished string \u2014 the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: \u0060logger.info(\u0022order %s moved to %s\u0022, order_id, status)\u0060 with the standard library\u0027s \u0060logging\u0060, which keeps the message and its arguments apart on the record, or \u0060log.info(\u0022order moved\u0022, order_id=order_id, status=status)\u0060 with structlog."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/compiler.py"},"region":{"startLine":593}}}],"partialFingerprints":{"codehealthFindingId/v1":"7615cc3fa0495d1c6c27e696923cbb1824995e1e0037b7dcbc1b106e81685f74"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug\u0060 at line 105 is handed an f-string as its message, so the logger receives one finished string \u2014 the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: \u0060logger.debug(\u0022order %s moved to %s\u0022, order_id, status)\u0060 with the standard library\u0027s \u0060logging\u0060, which keeps the message and its arguments apart on the record, or \u0060log.debug(\u0022order moved\u0022, order_id=order_id, status=status)\u0060 with structlog."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/lru_cache.py"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f0b35e4f092121a90d49f87a7144f3b6b911bbf093f3f0a668cb8b04e77ad33"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug\u0060 at line 108 is handed an f-string as its message, so the logger receives one finished string \u2014 the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: \u0060logger.debug(\u0022order %s moved to %s\u0022, order_id, status)\u0060 with the standard library\u0027s \u0060logging\u0060, which keeps the message and its arguments apart on the record, or \u0060log.debug(\u0022order moved\u0022, order_id=order_id, status=status)\u0060 with structlog."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/lru_cache.py"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"bde8c6453b5a824d1e7c354116df047375d238a80119564f6e183782cf676467"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warning\u0060 at line 788 is handed an f-string as its message, so the logger receives one finished string \u2014 the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: \u0060logger.warning(\u0022order %s moved to %s\u0022, order_id, status)\u0060 with the standard library\u0027s \u0060logging\u0060, which keeps the message and its arguments apart on the record, or \u0060log.warning(\u0022order moved\u0022, order_id=order_id, status=status)\u0060 with structlog."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/tpu_custom_call.py"},"region":{"startLine":788}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6fe5b7524232e78d57d9bf23584203a6f4dd3c561d420d6e1f9831d9aa94d5f"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warning\u0060 at line 903 is handed an f-string as its message, so the logger receives one finished string \u2014 the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: \u0060logger.warning(\u0022order %s moved to %s\u0022, order_id, status)\u0060 with the standard library\u0027s \u0060logging\u0060, which keeps the message and its arguments apart on the record, or \u0060log.warning(\u0022order moved\u0022, order_id=order_id, status=status)\u0060 with structlog."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/xla_bridge.py"},"region":{"startLine":903}}}],"partialFingerprints":{"codehealthFindingId/v1":"be06a0ae8eefbeac5c840886313f0e92d4f0badcd5efd98ee63e6b7f236cce1d"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warning\u0060 at line 907 is handed an f-string as its message, so the logger receives one finished string \u2014 the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: \u0060logger.warning(\u0022order %s moved to %s\u0022, order_id, status)\u0060 with the standard library\u0027s \u0060logging\u0060, which keeps the message and its arguments apart on the record, or \u0060log.warning(\u0022order moved\u0022, order_id=order_id, status=status)\u0060 with structlog."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/xla_bridge.py"},"region":{"startLine":907}}}],"partialFingerprints":{"codehealthFindingId/v1":"e84c9eed8faca596fb3b7b75a18e2d8139523a7896954761f1dbe95f65ea045d"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warning\u0060 at line 932 is handed an f-string as its message, so the logger receives one finished string \u2014 the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: \u0060logger.warning(\u0022order %s moved to %s\u0022, order_id, status)\u0060 with the standard library\u0027s \u0060logging\u0060, which keeps the message and its arguments apart on the record, or \u0060log.warning(\u0022order moved\u0022, order_id=order_id, status=status)\u0060 with structlog."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/xla_bridge.py"},"region":{"startLine":932}}}],"partialFingerprints":{"codehealthFindingId/v1":"29ec77a52e10cd445d14f080fc47c4d12b52697fadd566e1875461c1c21103af"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error\u0060 at line 59 is handed an f-string as its message, so the logger receives one finished string \u2014 the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: \u0060logger.error(\u0022order %s moved to %s\u0022, order_id, status)\u0060 with the standard library\u0027s \u0060logging\u0060, which keeps the message and its arguments apart on the record, or \u0060log.error(\u0022order moved\u0022, order_id=order_id, status=status)\u0060 with structlog."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/clusters/cluster.py"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a0bb6bd08e06c53318f135a07c5c355c4c67f3d562141f86b74716c52b73dfd"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error\u0060 at line 62 is handed an f-string as its message, so the logger receives one finished string \u2014 the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: \u0060logger.error(\u0022order %s moved to %s\u0022, order_id, status)\u0060 with the standard library\u0027s \u0060logging\u0060, which keeps the message and its arguments apart on the record, or \u0060log.error(\u0022order moved\u0022, order_id=order_id, status=status)\u0060 with structlog."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/clusters/cluster.py"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9d8c6142e61faae98d4e5202403f91475602c13ce29c1e9a67f347545dd433b"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug\u0060 at line 43 is handed an f-string as its message, so the logger receives one finished string \u2014 the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: \u0060logger.debug(\u0022order %s moved to %s\u0022, order_id, status)\u0060 with the standard library\u0027s \u0060logging\u0060, which keeps the message and its arguments apart on the record, or \u0060log.debug(\u0022order moved\u0022, order_id=order_id, status=status)\u0060 with structlog."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/clusters/k8s_cluster.py"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"3456947aeebef0d4a9f990cd3fa776427b8639c424ec5f307da6661b08b4241c"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug\u0060 at line 53 is handed an f-string as its message, so the logger receives one finished string \u2014 the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: \u0060logger.debug(\u0022order %s moved to %s\u0022, order_id, status)\u0060 with the standard library\u0027s \u0060logging\u0060, which keeps the message and its arguments apart on the record, or \u0060log.debug(\u0022order moved\u0022, order_id=order_id, status=status)\u0060 with structlog."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/clusters/k8s_cluster.py"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"594a29d1cc919ad4d8cd869999d03851bc4233c51f20e715f40f2dd050fb3d01"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug\u0060 at line 272 is handed an f-string as its message, so the logger receives one finished string \u2014 the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: \u0060logger.debug(\u0022order %s moved to %s\u0022, order_id, status)\u0060 with the standard library\u0027s \u0060logging\u0060, which keeps the message and its arguments apart on the record, or \u0060log.debug(\u0022order moved\u0022, order_id=order_id, status=status)\u0060 with structlog."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"build/tools/utils.py"},"region":{"startLine":272}}}],"partialFingerprints":{"codehealthFindingId/v1":"c21c0f74d9f5e86b17fdf8979b9fd370d5498257c90f7ab8abe20e84e3f0e18e"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error\u0060 at line 241 is handed an f-string as its message, so the logger receives one finished string \u2014 the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: \u0060logger.error(\u0022order %s moved to %s\u0022, order_id, status)\u0060 with the standard library\u0027s \u0060logging\u0060, which keeps the message and its arguments apart on the record, or \u0060log.error(\u0022order moved\u0022, order_id=order_id, status=status)\u0060 with structlog."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"build/rocm/tools/build_wheels.py"},"region":{"startLine":241}}}],"partialFingerprints":{"codehealthFindingId/v1":"fdb2005a5695a98dcbc9d6b33b8fb46d7656a3398d3dc07c9d6158b1c4d1d3df"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error\u0060 at line 244 is handed an f-string as its message, so the logger receives one finished string \u2014 the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: \u0060logger.error(\u0022order %s moved to %s\u0022, order_id, status)\u0060 with the standard library\u0027s \u0060logging\u0060, which keeps the message and its arguments apart on the record, or \u0060log.error(\u0022order moved\u0022, order_id=order_id, status=status)\u0060 with structlog."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"build/rocm/tools/build_wheels.py"},"region":{"startLine":244}}}],"partialFingerprints":{"codehealthFindingId/v1":"4497a20e264a408f2283247a4a8daed0027f3c8694f8aa02250147d8cf6f5445"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060fun_sourceinfo\u0060 swallows every exception into \u0060return \u0027\u003Cunknown\u003E\u0027\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jax/_src/api_util.py"},"region":{"startLine":713}}}],"partialFingerprints":{"codehealthFindingId/v1":"085cacc6ccd557a9ff527d08fa5814160cac2072ad7919a7e0bd747207a25438"}}],"taxonomies":[{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d","organization":"MITRE","informationUri":"https://cwe.mitre.org/","isComprehensive":false,"shortDescription":{"text":"The MITRE Common Weakness Enumeration (CWE)."},"taxa":[{"id":"CWE-1032","guid":"5f21e517-68aa-a650-9a25-5771ef024637","name":"OWASP Top Ten \u2014 Security Misconfiguration category","shortDescription":{"text":"OWASP Top Ten \u2014 Security Misconfiguration category"},"helpUri":"https://cwe.mitre.org/data/definitions/1032.html"},{"id":"CWE-1357","guid":"e4d2e772-757e-0a5c-bd7d-77052949d866","name":"Reliance on Insufficiently Trustworthy Component","shortDescription":{"text":"Reliance on Insufficiently Trustworthy Component"},"helpUri":"https://cwe.mitre.org/data/definitions/1357.html"},{"id":"CWE-1395","guid":"800e09e7-c11a-8654-9fa6-86f398995fed","name":"Dependency on Vulnerable Third-Party Component","shortDescription":{"text":"Dependency on Vulnerable Third-Party Component"},"helpUri":"https://cwe.mitre.org/data/definitions/1395.html"},{"id":"CWE-16","guid":"659db3ea-affc-8453-8add-c1218fbfcb92","name":"Configuration","shortDescription":{"text":"Configuration"},"helpUri":"https://cwe.mitre.org/data/definitions/16.html"},{"id":"CWE-259","guid":"ae9ad959-fbb6-9d5e-892d-3dca66da0b69","name":"Use of Hard-coded Password","shortDescription":{"text":"Use of Hard-coded Password"},"helpUri":"https://cwe.mitre.org/data/definitions/259.html"},{"id":"CWE-319","guid":"7af97476-9f0d-4458-9163-3d2043918a1a","name":"Cleartext Transmission of Sensitive Information","shortDescription":{"text":"Cleartext Transmission of Sensitive Information"},"helpUri":"https://cwe.mitre.org/data/definitions/319.html"},{"id":"CWE-327","guid":"e51910ff-67b5-3c51-aa3d-92837d9eab90","name":"Use of a Broken or Risky Cryptographic Algorithm","shortDescription":{"text":"Use of a Broken or Risky Cryptographic Algorithm"},"helpUri":"https://cwe.mitre.org/data/definitions/327.html"},{"id":"CWE-353","guid":"09d7e902-d4ee-f05d-ae6c-0a1554d0c18f","name":"Missing Support for Integrity Check","shortDescription":{"text":"Missing Support for Integrity Check"},"helpUri":"https://cwe.mitre.org/data/definitions/353.html"},{"id":"CWE-426","guid":"7b39d500-c310-9a5d-9a3d-4c2bf49492a3","name":"Untrusted Search Path","shortDescription":{"text":"Untrusted Search Path"},"helpUri":"https://cwe.mitre.org/data/definitions/426.html"},{"id":"CWE-494","guid":"b8a65e0d-e459-4a55-a931-fc1136482375","name":"Download of Code Without Integrity Check","shortDescription":{"text":"Download of Code Without Integrity Check"},"helpUri":"https://cwe.mitre.org/data/definitions/494.html"},{"id":"CWE-502","guid":"f7d3b296-aac0-5c5a-b706-e07faba26c36","name":"Deserialization of Untrusted Data","shortDescription":{"text":"Deserialization of Untrusted Data"},"helpUri":"https://cwe.mitre.org/data/definitions/502.html"},{"id":"CWE-506","guid":"401d6455-56e3-0552-9a39-f77461673e3f","name":"Embedded Malicious Code","shortDescription":{"text":"Embedded Malicious Code"},"helpUri":"https://cwe.mitre.org/data/definitions/506.html"},{"id":"CWE-693","guid":"b9b141dc-018a-9c59-8953-1e3c4e020745","name":"Protection Mechanism Failure","shortDescription":{"text":"Protection Mechanism Failure"},"helpUri":"https://cwe.mitre.org/data/definitions/693.html"},{"id":"CWE-732","guid":"1da27e8f-b330-7650-ab63-bd61953eae5d","name":"Incorrect Permission Assignment for Critical Resource","shortDescription":{"text":"Incorrect Permission Assignment for Critical Resource"},"helpUri":"https://cwe.mitre.org/data/definitions/732.html"},{"id":"CWE-77","guid":"332c8ade-6612-9f56-a06b-d8d90b1a8750","name":"Improper Neutralization of Special Elements used in a Command (\u0027Command Injection\u0027)","shortDescription":{"text":"Improper Neutralization of Special Elements used in a Command (\u0027Command Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/77.html"},{"id":"CWE-78","guid":"2e31ceaf-c7ae-2e5e-9661-cfb1362789cf","name":"Improper Neutralization of Special Elements used in an OS Command (\u0027OS Command Injection\u0027)","shortDescription":{"text":"Improper Neutralization of Special Elements used in an OS Command (\u0027OS Command Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/78.html"},{"id":"CWE-79","guid":"fd45580b-e8c4-fc5e-8c2f-aa8fab0b4dbf","name":"Improper Neutralization of Input During Web Page Generation (\u0027Cross-site Scripting\u0027)","shortDescription":{"text":"Improper Neutralization of Input During Web Page Generation (\u0027Cross-site Scripting\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/79.html"},{"id":"CWE-798","guid":"5e8f057d-fee3-995a-a0cb-9fc5b0d174d1","name":"Use of Hard-coded Credentials","shortDescription":{"text":"Use of Hard-coded Credentials"},"helpUri":"https://cwe.mitre.org/data/definitions/798.html"},{"id":"CWE-89","guid":"6d08fdad-37eb-c150-bbf0-d7d946863407","name":"Improper Neutralization of Special Elements used in an SQL Command (\u0027SQL Injection\u0027)","shortDescription":{"text":"Improper Neutralization of Special Elements used in an SQL Command (\u0027SQL Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/89.html"},{"id":"CWE-937","guid":"16f316ae-415c-b354-a59b-1f7905f756e9","name":"Using Components with Known Vulnerabilities","shortDescription":{"text":"Using Components with Known Vulnerabilities"},"helpUri":"https://cwe.mitre.org/data/definitions/937.html"},{"id":"CWE-939","guid":"12397742-f2c4-8254-8012-482c3356c551","name":"CWE-939","shortDescription":{"text":"CWE-939"},"helpUri":"https://cwe.mitre.org/data/definitions/939.html"},{"id":"CWE-94","guid":"75e7f50c-6c2f-dd52-bf40-bf6c52b861fd","name":"Improper Control of Generation of Code (\u0027Code Injection\u0027)","shortDescription":{"text":"Improper Control of Generation of Code (\u0027Code Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/94.html"},{"id":"CWE-95","guid":"400bba4e-483c-5c50-a695-114fa9168003","name":"Improper Neutralization of Directives in Dynamically Evaluated Code (\u0027Eval Injection\u0027)","shortDescription":{"text":"Improper Neutralization of Directives in Dynamically Evaluated Code (\u0027Eval Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/95.html"}]},{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61","version":"2025","organization":"OWASP Foundation","informationUri":"https://top10.owasp.org/2025/","isComprehensive":false,"shortDescription":{"text":"The OWASP Top 10:2025 web application security risks."},"taxa":[{"id":"A01:2025","guid":"df693558-c822-0452-8f7b-4d53cb6bcc59","name":"Broken Access Control","shortDescription":{"text":"Broken Access Control"},"helpUri":"https://top10.owasp.org/2025/A01_2025-Broken_Access_Control/"},{"id":"A02:2025","guid":"668dee9e-41bc-6354-97d0-fdf8f40c50c1","name":"Security Misconfiguration","shortDescription":{"text":"Security Misconfiguration"},"helpUri":"https://top10.owasp.org/2025/A02_2025-Security_Misconfiguration/"},{"id":"A03:2025","guid":"168e227c-7735-2e57-bc6e-997affe644c5","name":"Software Supply Chain Failures","shortDescription":{"text":"Software Supply Chain Failures"},"helpUri":"https://top10.owasp.org/2025/A03_2025-Software_Supply_Chain_Failures/"},{"id":"A04:2025","guid":"6a9f5bfd-1a56-6453-beec-a7eff0ba3007","name":"Cryptographic Failures","shortDescription":{"text":"Cryptographic Failures"},"helpUri":"https://top10.owasp.org/2025/A04_2025-Cryptographic_Failures/"},{"id":"A05:2025","guid":"87e86033-3231-8458-8e4a-5cb82743553a","name":"Injection","shortDescription":{"text":"Injection"},"helpUri":"https://top10.owasp.org/2025/A05_2025-Injection/"},{"id":"A07:2025","guid":"334ddd78-539d-d35c-83dd-253647eb7eaf","name":"Authentication Failures","shortDescription":{"text":"Authentication Failures"},"helpUri":"https://top10.owasp.org/2025/A07_2025-Authentication_Failures/"},{"id":"A08:2025","guid":"84b0c297-710e-9a5f-9335-936ecb260c36","name":"Software or Data Integrity Failures","shortDescription":{"text":"Software or Data Integrity Failures"},"helpUri":"https://top10.owasp.org/2025/A08_2025-Software_or_Data_Integrity_Failures/"}]},{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35","organization":"OWASP Foundation","informationUri":"https://owasp.org/www-project-top-10-ci-cd-security-risks/","isComprehensive":false,"shortDescription":{"text":"The OWASP Top 10 CI/CD Security Risks."},"taxa":[{"id":"CICD-SEC-3","guid":"458c83a6-ebf7-cf55-8cc3-b4d949bbf271","name":"Dependency Chain Abuse","shortDescription":{"text":"Dependency Chain Abuse"},"helpUri":"https://owasp.github.io/www-project-top-10-ci-cd-security-risks/CICD-SEC-03-Dependency-Chain-Abuse"},{"id":"CICD-SEC-6","guid":"f2ee2486-b260-2952-a41f-6b67fa713940","name":"Insufficient Credential Hygiene","shortDescription":{"text":"Insufficient Credential Hygiene"},"helpUri":"https://owasp.github.io/www-project-top-10-ci-cd-security-risks/CICD-SEC-06-Insufficient-Credential-Hygiene"},{"id":"CICD-SEC-9","guid":"b3d36727-0395-5b51-94c4-5e173d62eab3","name":"Improper Artifact Integrity Validation","shortDescription":{"text":"Improper Artifact Integrity Validation"},"helpUri":"https://owasp.github.io/www-project-top-10-ci-cd-security-risks/CICD-SEC-09-Improper-Artifact-Integrity-Validation"}]}],"properties":{"codehealthPublication":{"public":true,"notice":"This is the PUBLIC form of this artifact. Findings are listed in full, but the details of SECURITY findings \u2014 which rule fired, in which file, on which line, and how to fix it \u2014 are deliberately withheld, and any secret-scanner results are excluded entirely. Where detail is absent here it was REMOVED FOR PUBLICATION; it is not missing from the analysis. The complete artifact is available from the repository owner.","securityFindingsRedacted":86,"secretScannerRunsExcluded":0}},"redactionTokens":["A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."]}]}