{"$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":"D6","name":"Cohesion (LCOM4)","shortDescription":{"text":"Cohesion (LCOM4)"},"helpUri":"https://codehealth.canine.dev/dimensions/D6"},{"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":"D37","name":"Vulnerability-disclosure Policy","shortDescription":{"text":"Vulnerability-disclosure Policy"},"helpUri":"https://codehealth.canine.dev/dimensions/D37","relationships":[{"target":{"id":"CWE-1059","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-1059"],"owasp":"A02:2025"}},{"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":"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":"AXB2","name":"Runtime readiness","shortDescription":{"text":"Runtime readiness"},"helpUri":"https://codehealth.canine.dev/dimensions/AXB2"},{"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":"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":"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":"auto_ep_config.validate_autoep_config (cyclomatic 73): auto_ep_config.validate_autoep_config has cyclomatic complexity 73 (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":"deepspeed/module_inject/auto_ep_config.py"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4eeb607c250d2028e55b37433a6cf0e13b619af019ce1e33a68e5023afa84c3"}},{"ruleId":"D1","level":"warning","message":{"text":"DeepSpeedZeroOptimizer.__init__ (cyclomatic 71): DeepSpeedZeroOptimizer.__init__ 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":"deepspeed/runtime/zero/stage_1_and_2.py"},"region":{"startLine":170}}}],"partialFingerprints":{"codehealthFindingId/v1":"43ffc8f4171f47bd3e8380618315af1dcb717f7a4fcde7f8b9386a2ababf4315"}},{"ruleId":"D1","level":"warning","message":{"text":"list_schedule.fast_free_schedule (cyclomatic 64): list_schedule.fast_free_schedule has cyclomatic complexity 64 (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":"deepspeed/compile/list_schedule.py"},"region":{"startLine":578}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9d99bd507abcee9a1a6aea0c22e67b88ec283e1836c412923166dc44594a8e9"}},{"ruleId":"D1","level":"warning","message":{"text":"DeepSpeedEngine._save_moe_checkpoint (cyclomatic 63): DeepSpeedEngine._save_moe_checkpoint has cyclomatic complexity 63 (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":"deepspeed/runtime/engine.py"},"region":{"startLine":5146}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4992f074a792b76d8d6b1a05f23198892a35071cd921a9a39b0d99e1500338c"}},{"ruleId":"D1","level":"warning","message":{"text":"real_accelerator.get_accelerator (cyclomatic 59): real_accelerator.get_accelerator has cyclomatic complexity 59 (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":"accelerator/real_accelerator.py"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"143815e4617d40791c88fa475455d0ea1f280e90dc6ac148012ead2b4fec71cd"}},{"ruleId":"D1","level":"warning","message":{"text":"runner.main (cyclomatic 57): runner.main has cyclomatic complexity 57 (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":"deepspeed/launcher/runner.py"},"region":{"startLine":439}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc48c557b3934158d3bed552b4769092b8c4d8b7589b6adcdd914fdc40e73f55"}},{"ruleId":"D1","level":"warning","message":{"text":"affine_transfer_executor.execute_transfers (cyclomatic 56): affine_transfer_executor.execute_transfers has cyclomatic complexity 56 (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":"deepspeed/checkpoint/affine_transfer_executor.py"},"region":{"startLine":305}}}],"partialFingerprints":{"codehealthFindingId/v1":"05b16ce0b94c31c7f6823b61864c34d1560a54418c2f18c3a894097bc8b5526f"}},{"ruleId":"D1","level":"warning","message":{"text":"HybridEngineRollout._generate_continuous (cyclomatic 51): HybridEngineRollout._generate_continuous has cyclomatic complexity 51 (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":"deepspeed/runtime/rollout/hybrid_engine_rollout.py"},"region":{"startLine":333}}}],"partialFingerprints":{"codehealthFindingId/v1":"90c5b509c961a72b1e7389965e53ac2e518f49fafb3860e9f3c698feb059b50b"}},{"ruleId":"D1","level":"warning","message":{"text":"DeepSpeedEngine._load_checkpoint (cyclomatic 42): DeepSpeedEngine._load_checkpoint has cyclomatic complexity 42 (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":"deepspeed/runtime/engine.py"},"region":{"startLine":4656}}}],"partialFingerprints":{"codehealthFindingId/v1":"4bfe68614c01e8bf5bb464955ee0f7aa9fa82c531d99ee89ef2ffa3fdcba2158"}},{"ruleId":"D1","level":"warning","message":{"text":"ZenFlowZeroOptimizer._process_selected_fp32_groups_grad (cyclomatic 42): ZenFlowZeroOptimizer._process_selected_fp32_groups_grad has cyclomatic complexity 42 (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":"deepspeed/runtime/zenflow/zenflow_stage_1_and_2.py"},"region":{"startLine":277}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e1d1ae54484969fb59f86bab96b8f855b3b133fe34787afb0b2c2f1660b69c9"}},{"ruleId":"D1","level":"warning","message":{"text":"offload_adam_states.offload_opt_states_inc (cyclomatic 41): offload_adam_states.offload_opt_states_inc 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":"deepspeed/compile/passes/offload_adam_states.py"},"region":{"startLine":354}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6ef769fe2763d963eabd97949662119ea27fa0f94e357d665f36742f4978186"}},{"ruleId":"D1","level":"warning","message":{"text":"AutoEP.ep_parser (cyclomatic 39): AutoEP.ep_parser has cyclomatic complexity 39 (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":"deepspeed/module_inject/auto_ep.py"},"region":{"startLine":417}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c58f9d9db6a62e3ec2120c30c3b9ccd7845a52a5e3d9b745034ef118bb1500e"}},{"ruleId":"D1","level":"warning","message":{"text":"PartitionedParameterCoordinator._fetch_sub_module_impl (cyclomatic 39): PartitionedParameterCoordinator._fetch_sub_module_impl has cyclomatic complexity 39 (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":"deepspeed/runtime/zero/partitioned_param_coordinator.py"},"region":{"startLine":356}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5a13caf3784cd5d564f0b149162d76cf0bb6eaf308d25a238fc9977f1f28fbc"}},{"ruleId":"D1","level":"warning","message":{"text":"layers._infer_subparam_logical_shapes (cyclomatic 38): layers._infer_subparam_logical_shapes has cyclomatic complexity 38 (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":"deepspeed/module_inject/layers.py"},"region":{"startLine":1930}}}],"partialFingerprints":{"codehealthFindingId/v1":"70500c0e03bd77b0835e6281b0165d1fe5d41fd7a278922707afacc6837e125b"}},{"ruleId":"D1","level":"warning","message":{"text":"DeepSpeedZeroOptimizer_Stage3.__init__ (cyclomatic 35): DeepSpeedZeroOptimizer_Stage3.__init__ has cyclomatic complexity 35 (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":"deepspeed/runtime/zero/stage3.py"},"region":{"startLine":159}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f49422e2cbebee467700ff2c4267a98be7b998cb4bd85036a31cac6796c8b5d"}},{"ruleId":"D1","level":"warning","message":{"text":"autoep_universal.consolidate_autoep_zero12_expert_states (cyclomatic 34): autoep_universal.consolidate_autoep_zero12_expert_states has cyclomatic complexity 34 (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":"deepspeed/checkpoint/autoep_universal.py"},"region":{"startLine":288}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa9b9bb357d34a1114ace21dd76f1934aeebe2c068ea051f38c164d1a46cad22"}},{"ruleId":"D1","level":"warning","message":{"text":"replace_module.replace_transformer_layer (cyclomatic 33): replace_module.replace_transformer_layer 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":"deepspeed/module_inject/replace_module.py"},"region":{"startLine":181}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ffcc016fa1af46b34c14c26335cb811e31dcecef747f32ebd144e435395ac7a"}},{"ruleId":"D1","level":"warning","message":{"text":"DeepSpeedEngine._configure_distributed_model (cyclomatic 33): DeepSpeedEngine._configure_distributed_model 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":"deepspeed/runtime/engine.py"},"region":{"startLine":2146}}}],"partialFingerprints":{"codehealthFindingId/v1":"3511ff858e999ecf4eaa0881915eac066fd5be79ea25653341df40630fbc4159"}},{"ruleId":"D1","level":"warning","message":{"text":"InferenceEngine.__init__ (cyclomatic 32): InferenceEngine.__init__ 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":"deepspeed/inference/engine.py"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"312fd967aed047f9bf0faf1af11b4fa25025ee85a257e9513a2bc559efffb02b"}},{"ruleId":"D1","level":"warning","message":{"text":"Init.__init__ (cyclomatic 32): Init.__init__ 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":"deepspeed/runtime/zero/partition_parameters.py"},"region":{"startLine":955}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ce8f7334f82a4d1ec5575f6c9c9d25ef0d3c39f5fd14fb48919bbb8364fc398"}},{"ruleId":"D1","level":"warning","message":{"text":"ds_to_universal._consolidate_zero3_autoep_expert_states (cyclomatic 31): ds_to_universal._consolidate_zero3_autoep_expert_states has cyclomatic complexity 31 (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":"deepspeed/checkpoint/ds_to_universal.py"},"region":{"startLine":808}}}],"partialFingerprints":{"codehealthFindingId/v1":"fef7c0ddb91d5b34ee076eeed6d0bb3a9f67f89ef2038d4e2b50783a3964064f"}},{"ruleId":"D1","level":"warning","message":{"text":"ds_to_universal.main (cyclomatic 31): ds_to_universal.main has cyclomatic complexity 31 (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":"deepspeed/checkpoint/ds_to_universal.py"},"region":{"startLine":1140}}}],"partialFingerprints":{"codehealthFindingId/v1":"366aa3be8f9902b1a76d08e1cda4f21929acaae492da6a789be6c68ca5d3ec46"}},{"ruleId":"D1","level":"warning","message":{"text":"autoep_universal.get_autoep_zero12_expert_param_info (cyclomatic 30): autoep_universal.get_autoep_zero12_expert_param_info 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":"deepspeed/checkpoint/autoep_universal.py"},"region":{"startLine":159}}}],"partialFingerprints":{"codehealthFindingId/v1":"72c678b87e13f0bad8f9a331493c67d4c9a7db4fcb5922cf1617d27034d8866d"}},{"ruleId":"D1","level":"warning","message":{"text":"DeepSpeedEngine._apply_autotp_partitioning (cyclomatic 30): DeepSpeedEngine._apply_autotp_partitioning 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":"deepspeed/runtime/engine.py"},"region":{"startLine":1026}}}],"partialFingerprints":{"codehealthFindingId/v1":"cbb9f853f569481aacba6a562a80ef87aeb04e9a69d0c0d01ad6dfa74e5bf4ed"}},{"ruleId":"D1","level":"warning","message":{"text":"FP16_Optimizer.step (cyclomatic 30): FP16_Optimizer.step 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":"deepspeed/runtime/fp16/fused_optimizer.py"},"region":{"startLine":256}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f04677242eb3ce68bd6a260a359d13244e29e7660d80042ccdb271a57c1e522"}},{"ruleId":"D1","level":"warning","message":{"text":"DeepSpeedZeroOptimizer.average_tensor (cyclomatic 30): DeepSpeedZeroOptimizer.average_tensor 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":"deepspeed/runtime/zero/stage_1_and_2.py"},"region":{"startLine":1697}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d63740736867e980a5be29454db0e1ca9121bee0e2fb47e8ec908d608a33213"}},{"ruleId":"D1","level":"warning","message":{"text":"AutoEPMoELayer.__init__ (cyclomatic 29): AutoEPMoELayer.__init__ has cyclomatic complexity 29 (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":"deepspeed/module_inject/auto_ep_layer.py"},"region":{"startLine":517}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ad5777e4c174e995e80dcc85245225dae88e17271986947968e0cd6181aea28"}},{"ruleId":"D1","level":"warning","message":{"text":"DeepSpeedEngine.__init__ (cyclomatic 29): DeepSpeedEngine.__init__ has cyclomatic complexity 29 (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":"deepspeed/runtime/engine.py"},"region":{"startLine":519}}}],"partialFingerprints":{"codehealthFindingId/v1":"ebde97fe57f692b37dd76702739546d4e56747b20e12b2ee5ea35f053c07d22d"}},{"ruleId":"D1","level":"warning","message":{"text":"prefetch.schedule_prefetch (cyclomatic 28): prefetch.schedule_prefetch 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":"deepspeed/compile/passes/prefetch.py"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"85de1c4a523f863b5c65eed1150c39835802414d61150b26626fcad38616cc19"}},{"ruleId":"D1","level":"warning","message":{"text":"selective_gather.selective_gather (cyclomatic 28): selective_gather.selective_gather 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":"deepspeed/compile/passes/selective_gather.py"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ce49231cfc41eadc9f152ab36bb94d0d7c1e4c7c59e6720dd3216eaa6891b8f"}},{"ruleId":"D1","level":"warning","message":{"text":"AutoTP._replace_module (cyclomatic 28): AutoTP._replace_module 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":"deepspeed/module_inject/auto_tp.py"},"region":{"startLine":1057}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0f8145aa8d1bab6d2067099d1984a3746cbbb955a246ed410286c5c26501c02"}},{"ruleId":"D1","level":"warning","message":{"text":"DeepSpeedEngine.step (cyclomatic 28): DeepSpeedEngine.step 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":"deepspeed/runtime/engine.py"},"region":{"startLine":3650}}}],"partialFingerprints":{"codehealthFindingId/v1":"0bbf16e0ed818fec57f2a9e1b2b545b44f1fe04c85ebd41f997e5257141207b3"}},{"ruleId":"D1","level":"warning","message":{"text":"DeepSpeedEngine.load_moe_state_dict (cyclomatic 28): DeepSpeedEngine.load_moe_state_dict 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":"deepspeed/runtime/engine.py"},"region":{"startLine":4216}}}],"partialFingerprints":{"codehealthFindingId/v1":"185ee2b7d1f05e422d6eba4e8015e94e1545762516b5f912fb7d073c9346eaa2"}},{"ruleId":"D1","level":"warning","message":{"text":"HybridEngineRollout.generate (cyclomatic 28): HybridEngineRollout.generate 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":"deepspeed/runtime/rollout/hybrid_engine_rollout.py"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"a12d0bc1a0c05a2d6166b7ab3693cf88dfb538988b345ba9b60cb6a4e6119f45"}},{"ruleId":"D1","level":"warning","message":{"text":"utils.clip_grad_norm_ (cyclomatic 28): utils.clip_grad_norm_ 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":"deepspeed/runtime/utils.py"},"region":{"startLine":358}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e960cb70f38f48315a4467a325369ae20e29191033aa2d9268d6e541f6348f1"}},{"ruleId":"D1","level":"warning","message":{"text":"init_z3.init_z3 (cyclomatic 27): init_z3.init_z3 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":"deepspeed/compile/init_z3.py"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"daf1aee93468454ee5f16d4e38b2e8f442b2bd130941d7cd1dd6ee3795e14dd2"}},{"ruleId":"D1","level":"warning","message":{"text":"AutoTP.tp_parser (cyclomatic 27): AutoTP.tp_parser 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":"deepspeed/module_inject/auto_tp.py"},"region":{"startLine":343}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e8bb0b5b020f637f3d80dae87bb553803b830e886a1a2e1f8f80d9516d4e9c4"}},{"ruleId":"D1","level":"warning","message":{"text":"AutoTP._replace (cyclomatic 27): AutoTP._replace 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":"deepspeed/module_inject/auto_tp.py"},"region":{"startLine":414}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b1c5da393a20153555f1af4304f7088bd62d32dcce3d8b63d4e98c6a23bade1"}},{"ruleId":"D1","level":"warning","message":{"text":"numa.get_numactl_cmd (cyclomatic 27): numa.get_numactl_cmd 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":"deepspeed/utils/numa.py"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"a45835f53c2a6c0e7fc0c516851bae437fd7939acf0753e60b61ceccfd7b4ddc"}},{"ruleId":"D1","level":"warning","message":{"text":"DeepSpeedEngine.compile (cyclomatic 26): DeepSpeedEngine.compile 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":"deepspeed/runtime/engine.py"},"region":{"startLine":5950}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec10a1c4c6f4fe3b8ec26c8ba95bb68f54cc1ff5b723b7d8603a10a8f744d803"}},{"ruleId":"D1","level":"warning","message":{"text":"DeepSpeedHybridEngine.generate (cyclomatic 26): DeepSpeedHybridEngine.generate 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":"deepspeed/runtime/hybrid_engine.py"},"region":{"startLine":237}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0059de1f87cca0f0cf4b9d1043291c9fa0fbdc6ca9dca438f52af21caaa9541"}},{"ruleId":"D1","level":"warning","message":{"text":"HybridEngineRollout._generate_continuous_graph (cyclomatic 26): HybridEngineRollout._generate_continuous_graph 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":"deepspeed/runtime/rollout/hybrid_engine_rollout.py"},"region":{"startLine":592}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c43ccc9e8bb7a2866910cfe1c95f650c25907c7c1d6763b2edf48b3883dc531"}},{"ruleId":"D1","level":"warning","message":{"text":"init_utils.merge_tp_model_init_into_config (cyclomatic 26): init_utils.merge_tp_model_init_into_config has cyclomatic complexity 26 (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":"deepspeed/runtime/tensor_parallel/init_utils.py"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"a919b451a653a5ae156d3aa6536b923ba2eaf39ebd6dc616741e2a6874169323"}},{"ruleId":"D1","level":"warning","message":{"text":"DeepSpeedZeroOptimizer_Stage3.offload_states (cyclomatic 26): DeepSpeedZeroOptimizer_Stage3.offload_states 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":"deepspeed/runtime/zero/stage3.py"},"region":{"startLine":4106}}}],"partialFingerprints":{"codehealthFindingId/v1":"7fc333c2edd84e27b3ceec91f6a755ee41391666a742948e71ace48433472db5"}},{"ruleId":"D1","level":"warning","message":{"text":"DeepSpeedZeroOptimizer.step (cyclomatic 26): DeepSpeedZeroOptimizer.step 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":"deepspeed/runtime/zero/stage_1_and_2.py"},"region":{"startLine":3116}}}],"partialFingerprints":{"codehealthFindingId/v1":"3dd8dbd35be2ec62e3cf6512ac89b7931c5f6368ff1bf5b3c1f88f805a4eacf0"}},{"ruleId":"D1","level":"warning","message":{"text":"DeepSpeedZeroOptimizer.offload_states (cyclomatic 26): DeepSpeedZeroOptimizer.offload_states 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":"deepspeed/runtime/zero/stage_1_and_2.py"},"region":{"startLine":3957}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4d314d855320882b2dcd34dcc5377630b3401d3487270a41d499a244fe78dee"}},{"ruleId":"D1","level":"warning","message":{"text":"Autotuner.tune (cyclomatic 25): Autotuner.tune 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":"deepspeed/autotuning/autotuner.py"},"region":{"startLine":404}}}],"partialFingerprints":{"codehealthFindingId/v1":"b91f5eae7a70aff9eadbbd7336eaa601daa7d27baf9a151df11a7e175bd0f9f1"}},{"ruleId":"D1","level":"warning","message":{"text":"affine_transfer.plan_transfers (cyclomatic 25): affine_transfer.plan_transfers 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":"deepspeed/checkpoint/affine_transfer.py"},"region":{"startLine":530}}}],"partialFingerprints":{"codehealthFindingId/v1":"15ec708da94b740d7506af93219940c691b1f62218e94917b98db193a0907329"}},{"ruleId":"D1","level":"warning","message":{"text":"affine_transfer._resolve (cyclomatic 25): affine_transfer._resolve 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":"deepspeed/checkpoint/affine_transfer.py"},"region":{"startLine":659}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc7bde6b70a816006d7ca9fc132cb6f95e475f383dc157d7ac61482e7b95cfa9"}},{"ruleId":"D1","level":"warning","message":{"text":"universal_checkpoint.load_hp_checkpoint_state (cyclomatic 25): universal_checkpoint.load_hp_checkpoint_state 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":"deepspeed/checkpoint/universal_checkpoint.py"},"region":{"startLine":236}}}],"partialFingerprints":{"codehealthFindingId/v1":"a24e86db8099c74ec9e1810c2867b2cbbe2a8246f49ab80dd7363e61b43c03a4"}},{"ruleId":"D1","level":"warning","message":{"text":"zero_affine.autotp_storage_affine_maps (cyclomatic 25): zero_affine.autotp_storage_affine_maps 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":"deepspeed/checkpoint/zero_affine.py"},"region":{"startLine":261}}}],"partialFingerprints":{"codehealthFindingId/v1":"755745edf84df468ba4720a8ce4ee08ebd070756cda5cb2c6d0143c4b1602e75"}},{"ruleId":"D1","level":"warning","message":{"text":"launch.main (cyclomatic 25): launch.main 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":"deepspeed/launcher/launch.py"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"11415dc483749493980f5d442040b68e93b01a1782167bb37f0433a75e691dec"}},{"ruleId":"D1","level":"warning","message":{"text":"layers.collect_autotp_universal_checkpoint_info (cyclomatic 25): layers.collect_autotp_universal_checkpoint_info 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":"deepspeed/module_inject/layers.py"},"region":{"startLine":695}}}],"partialFingerprints":{"codehealthFindingId/v1":"6087f91c0b6d1c2731a462cdaa52501a74e2202f73f8c0c16be617c636d3322e"}},{"ruleId":"D1","level":"warning","message":{"text":"ZenFlowZeroOptimizer.average_tensor (cyclomatic 25): ZenFlowZeroOptimizer.average_tensor 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":"deepspeed/runtime/zenflow/zenflow_stage_1_and_2.py"},"region":{"startLine":446}}}],"partialFingerprints":{"codehealthFindingId/v1":"49cbc03af3ffcd8f1848512be228bc7e54e6d4204eb476bb3a4118870dfe3fd6"}},{"ruleId":"D1","level":"warning","message":{"text":"DeepSpeedZeroOptimizer._load_legacy_checkpoint (cyclomatic 25): DeepSpeedZeroOptimizer._load_legacy_checkpoint 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":"deepspeed/runtime/zero/stage_1_and_2.py"},"region":{"startLine":3799}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d1ed077f65f8b541a7731b5f37d9aa0fff68c4cfd403862af65e0e94c0e70ad"}},{"ruleId":"D1","level":"warning","message":{"text":"FusedLamb.step (cyclomatic 24): FusedLamb.step 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":"deepspeed/ops/lamb/fused_lamb.py"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2932292c1598a53614c98c579bcb02b37bd314da90f1f84b1af9eb26401bf80"}},{"ruleId":"D1","level":"warning","message":{"text":"utils.compare_tensors_in_structures (cyclomatic 24): utils.compare_tensors_in_structures 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":"deepspeed/runtime/utils.py"},"region":{"startLine":1275}}}],"partialFingerprints":{"codehealthFindingId/v1":"824f429a3b66d6bdf6ac43ccb6e7e35a4a36046d52ef7a3a5e46141b150a6693"}},{"ruleId":"D1","level":"warning","message":{"text":"MuonWithAuxAdam.step (cyclomatic 24): MuonWithAuxAdam.step 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":"deepspeed/runtime/zero/muon/muon_optimizer.py"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"86c6bfc9149e4e5cac192e47f5b7882a99c3947c644427ac8650cf5db82eb3ab"}},{"ruleId":"D1","level":"warning","message":{"text":"DeepSpeedZeroOptimizer_Stage3._muon_update_sub_group (cyclomatic 24): DeepSpeedZeroOptimizer_Stage3._muon_update_sub_group 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":"deepspeed/runtime/zero/stage3.py"},"region":{"startLine":1793}}}],"partialFingerprints":{"codehealthFindingId/v1":"585ea2c2fd7e80f220cb81667266aa0022a4e3ac905cf8c713187a857d0682e7"}},{"ruleId":"D1","level":"warning","message":{"text":"CUDAOpBuilder.compute_capability_args (cyclomatic 24): CUDAOpBuilder.compute_capability_args 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":"op_builder/builder.py"},"region":{"startLine":706}}}],"partialFingerprints":{"codehealthFindingId/v1":"606d45ae6c245a1d761022a5db527b5b4025b72c83df85f24ac9f0105877da08"}},{"ruleId":"D1","level":"warning","message":{"text":"ds_to_universal.merge_tp_slices (cyclomatic 23): ds_to_universal.merge_tp_slices 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":"deepspeed/checkpoint/ds_to_universal.py"},"region":{"startLine":291}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a9693ea7bc558563cc2b64be6ca3db75bea25c998f5770ac4b1c09012b2f74f"}},{"ruleId":"D1","level":"warning","message":{"text":"runner.parse_resource_filter (cyclomatic 23): runner.parse_resource_filter 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":"deepspeed/launcher/runner.py"},"region":{"startLine":292}}}],"partialFingerprints":{"codehealthFindingId/v1":"c20affd8de6bacbd271822e20fa2f35b2820344a238441a6463242ea605df8d3"}},{"ruleId":"D1","level":"warning","message":{"text":"DeepSpeedTransformerInference.forward (cyclomatic 23): DeepSpeedTransformerInference.forward 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":"deepspeed/model_implementations/transformers/ds_transformer.py"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce1d6e33825aebf6fe5c9f5d4994301a77320b6998ce11b840d3b6ea384eaadd"}},{"ruleId":"D1","level":"warning","message":{"text":"AutoTP._configure_gathered_column_tie_fallbacks (cyclomatic 23): AutoTP._configure_gathered_column_tie_fallbacks 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":"deepspeed/module_inject/auto_tp.py"},"region":{"startLine":817}}}],"partialFingerprints":{"codehealthFindingId/v1":"4979958e95c678230975af346d05309404c93da1867bda9a3a9dcdaa45aac56d"}},{"ruleId":"D1","level":"warning","message":{"text":"fused_rotary_pos_emb.assert_supported (cyclomatic 23): fused_rotary_pos_emb.assert_supported 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":"deepspeed/ops/triton_ops/fused_rotary_pos_emb.py"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"e94fe0078945b4f68878ce4ae22f75ec66da25e776dcffe2edc96860733db03f"}},{"ruleId":"D1","level":"warning","message":{"text":"lr_schedules.override_1cycle_params (cyclomatic 23): lr_schedules.override_1cycle_params has cyclomatic complexity 23 (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":"deepspeed/runtime/lr_schedules.py"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc8e3a080e4d642fe807dcee3fbca37d059c892ba0836642e79461e4f2810307"}},{"ruleId":"D1","level":"warning","message":{"text":"TiledFusedLogitsLoss.forward (cyclomatic 23): TiledFusedLogitsLoss.forward 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":"deepspeed/runtime/sequence_parallel/ulysses_sp.py"},"region":{"startLine":1121}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f26bebc9f2c41ebc60d865734286de99ec01ac5d185bd56e993808f60893ead"}},{"ruleId":"D1","level":"warning","message":{"text":"Init._allgather_params_coalesced (cyclomatic 23): Init._allgather_params_coalesced 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":"deepspeed/runtime/zero/partition_parameters.py"},"region":{"startLine":1998}}}],"partialFingerprints":{"codehealthFindingId/v1":"adfde2e243588effff4e7f551af71ca092da5c44751da4990e738488d87aba79"}},{"ruleId":"D1","level":"warning","message":{"text":"DeepSpeedZeroOptimizer_Stage3._create_fp16_partitions_with_defragmentation (cyclomatic 23): DeepSpeedZeroOptimizer_Stage3._create_fp16_partitions_with_defragmentation 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":"deepspeed/runtime/zero/stage3.py"},"region":{"startLine":947}}}],"partialFingerprints":{"codehealthFindingId/v1":"28747e359e47d9d7700795cf53b7de9da16aa3a42feaae547b84b46804b96a86"}},{"ruleId":"D1","level":"warning","message":{"text":"DeepSpeedZeroOptimizer_Stage3._apply_muon_updates_cpu_offload (cyclomatic 23): DeepSpeedZeroOptimizer_Stage3._apply_muon_updates_cpu_offload 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":"deepspeed/runtime/zero/stage3.py"},"region":{"startLine":2689}}}],"partialFingerprints":{"codehealthFindingId/v1":"8757b89dfca286ca85faf62883f7020ba59368d6b3cf79208bcc41ab0aa1646a"}},{"ruleId":"D1","level":"warning","message":{"text":"ProfilingInterpreter.run_node (cyclomatic 22): ProfilingInterpreter.run_node 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":"deepspeed/compile/profilers/graph_profile.py"},"region":{"startLine":256}}}],"partialFingerprints":{"codehealthFindingId/v1":"16d7b8a1a4a77a30a6a6af336c002dbada5c8fbd1ae66c63fd2d91f5ab536a38"}},{"ruleId":"D1","level":"warning","message":{"text":"auto_ep_folding.validate_folding_global (cyclomatic 22): auto_ep_folding.validate_folding_global 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":"deepspeed/module_inject/auto_ep_folding.py"},"region":{"startLine":184}}}],"partialFingerprints":{"codehealthFindingId/v1":"47b2aad703ebf199f61f0b2ae3e015b5235b39ad2a6b787da1faafbf3357c67e"}},{"ruleId":"D1","level":"warning","message":{"text":"utils.split_params_into_different_moe_groups_for_optimizer (cyclomatic 22): utils.split_params_into_different_moe_groups_for_optimizer 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":"deepspeed/moe/utils.py"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"03bfe9d4c65ea18f68feb407db0a9a8a69b3451578f79ad8dc06eab092467882"}},{"ruleId":"D1","level":"warning","message":{"text":"ZenFlowSelectiveAdamW_stage3.group_step (cyclomatic 22): ZenFlowSelectiveAdamW_stage3.group_step 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":"deepspeed/ops/adam/zenflow_torch_adam.py"},"region":{"startLine":540}}}],"partialFingerprints":{"codehealthFindingId/v1":"2be04c1dff0fb13f6d3ddc85bf0df9238e7424af0778a67d9262905213094bc6"}},{"ruleId":"D1","level":"warning","message":{"text":"DeepSpeedZeroOptimizer_Stage3._create_fp32_partitions (cyclomatic 22): DeepSpeedZeroOptimizer_Stage3._create_fp32_partitions 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":"deepspeed/runtime/zero/stage3.py"},"region":{"startLine":1122}}}],"partialFingerprints":{"codehealthFindingId/v1":"093555db889c29ee7c86cd0e38b0efce839773e1d89f8bac6c1023e2fa5f1916"}},{"ruleId":"D1","level":"warning","message":{"text":"DeepSpeedZeroOptimizer.reduce_ipg_grads (cyclomatic 22): DeepSpeedZeroOptimizer.reduce_ipg_grads 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":"deepspeed/runtime/zero/stage_1_and_2.py"},"region":{"startLine":2282}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e5dff98a8123e11702f2c5854887fdabd0678ff5500cb30552cf46aecbfb650"}},{"ruleId":"D1","level":"warning","message":{"text":"torch_latest.load_aws_config (cyclomatic 21): torch_latest.load_aws_config 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":"ci/torch_latest.py"},"region":{"startLine":815}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e8227e8aa864fb9b3fe9c657015c54a87ee48e7bb205e3e14e3d97b1c225cf6"}},{"ruleId":"D1","level":"warning","message":{"text":"Autotuner.tune_space (cyclomatic 21): Autotuner.tune_space 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":"deepspeed/autotuning/autotuner.py"},"region":{"startLine":523}}}],"partialFingerprints":{"codehealthFindingId/v1":"14ab1196413ba60a859abaaf57752aeb25fe105ff334b9dffb868b099961bd2a"}},{"ruleId":"D1","level":"warning","message":{"text":"Autotuner.get_min_max_micro_batch_size (cyclomatic 21): Autotuner.get_min_max_micro_batch_size 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":"deepspeed/autotuning/autotuner.py"},"region":{"startLine":855}}}],"partialFingerprints":{"codehealthFindingId/v1":"426cd50ecca5dfbbd4ebe903c9c4ec58873d1711d1e3a699a25dccd10f218cb9"}},{"ruleId":"D1","level":"warning","message":{"text":"universal_checkpoint._resolve_autoep_partition (cyclomatic 21): universal_checkpoint._resolve_autoep_partition 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":"deepspeed/checkpoint/universal_checkpoint.py"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"73048d89cf637ecdcf6bcc69cd0b654ff5f132611d6e585a2adec75e4f789988"}},{"ruleId":"D1","level":"warning","message":{"text":"offload_activation._eligible_activations (cyclomatic 21): offload_activation._eligible_activations 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":"deepspeed/compile/passes/offload_activation.py"},"region":{"startLine":396}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c170b7a34231f621b8ab197952fec144208e7c170a56703e5cd32a448dff0f7"}},{"ruleId":"D1","level":"warning","message":{"text":"CheckpointFunction.forward (cyclomatic 21): CheckpointFunction.forward 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":"deepspeed/runtime/activation_checkpointing/checkpointing.py"},"region":{"startLine":579}}}],"partialFingerprints":{"codehealthFindingId/v1":"383fac4f7b91c12c9f6476c44b701dfa8ed4ee11f922e31ca37aa96fa4f7105f"}},{"ruleId":"D1","level":"warning","message":{"text":"CheckpointFunction.backward (cyclomatic 21): CheckpointFunction.backward 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":"deepspeed/runtime/activation_checkpointing/checkpointing.py"},"region":{"startLine":666}}}],"partialFingerprints":{"codehealthFindingId/v1":"27a3e4f33c74970a121a04656c4ff2336b32add4c97f16dbd6270ff2b6b9cd73"}},{"ruleId":"D1","level":"warning","message":{"text":"checkpointing.non_reentrant_checkpoint (cyclomatic 21): checkpointing.non_reentrant_checkpoint 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":"deepspeed/runtime/activation_checkpointing/checkpointing.py"},"region":{"startLine":787}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c7d411cc793c799c5116fe817cf1c745cce3990cf5e4d0859ecec6032b1ccde"}},{"ruleId":"D1","level":"warning","message":{"text":"DeepSpeedEngine._take_model_step (cyclomatic 21): DeepSpeedEngine._take_model_step 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":"deepspeed/runtime/engine.py"},"region":{"startLine":3588}}}],"partialFingerprints":{"codehealthFindingId/v1":"39cf50faee1cf8daefdaf51df2303b5a28bb6eab5616f095cf23485f152f2c6e"}},{"ruleId":"D1","level":"warning","message":{"text":"DeepSpeedEngine.load_checkpoint (cyclomatic 21): DeepSpeedEngine.load_checkpoint 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":"deepspeed/runtime/engine.py"},"region":{"startLine":4477}}}],"partialFingerprints":{"codehealthFindingId/v1":"db7cbeb3e7a48dc1bf91c1921e5ed729ac816804cf5fbaac697012003b3e1052"}},{"ruleId":"D1","level":"warning","message":{"text":"PipelineEngine.__init__ (cyclomatic 21): PipelineEngine.__init__ 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":"deepspeed/runtime/pipe/engine.py"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"4893fe673c2f9ea487d1e3435d5fc99d1e75eea8c3e9644bf15bc3be254cfc14"}},{"ruleId":"D1","level":"warning","message":{"text":"PipelineEngine._exec_forward_pass (cyclomatic 21): PipelineEngine._exec_forward_pass 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":"deepspeed/runtime/pipe/engine.py"},"region":{"startLine":698}}}],"partialFingerprints":{"codehealthFindingId/v1":"c690168e0d1f93792cb70e28c4c1883101e8c76f0db2d157a9ed9c1ade01f629"}},{"ruleId":"D1","level":"warning","message":{"text":"engine_stage3._process_selected_fp32_groups_grad (cyclomatic 21): engine_stage3._process_selected_fp32_groups_grad 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":"deepspeed/runtime/zenflow/engine_stage3.py"},"region":{"startLine":254}}}],"partialFingerprints":{"codehealthFindingId/v1":"d31ebf42d4b5b9bb6288d950e98fa2a3acbc2e62ff44a566528679ec7f007f1f"}},{"ruleId":"D1","level":"warning","message":{"text":"CommsLogger.log_all (cyclomatic 21): CommsLogger.log_all 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":"deepspeed/utils/comms_logging.py"},"region":{"startLine":210}}}],"partialFingerprints":{"codehealthFindingId/v1":"257e97ce75fa62c035e006eb2b2e1e048acf0f4531f6cbc9a9e0216534afee9d"}},{"ruleId":"D1","level":"warning","message":{"text":"EvoformerAttnBuilder.is_compatible (cyclomatic 21): EvoformerAttnBuilder.is_compatible 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":"op_builder/evoformer_attn.py"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"11f7c73f57f036c0f5c62ea6c63a435e6f58bb290021317be6b3cf3edac06e3d"}},{"ruleId":"D1","level":"warning","message":{"text":"torch_latest._poll_ssm_cloudwatch_output (cyclomatic 20): torch_latest._poll_ssm_cloudwatch_output 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":"ci/torch_latest.py"},"region":{"startLine":1392}}}],"partialFingerprints":{"codehealthFindingId/v1":"4877c54e8a17d757ca32eae585fb2995bce12744e7338723a012d2f1d4fb5236"}},{"ruleId":"D1","level":"warning","message":{"text":"ParamAffineMap._validate_destinations (cyclomatic 20): ParamAffineMap._validate_destinations 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":"deepspeed/checkpoint/affine.py"},"region":{"startLine":269}}}],"partialFingerprints":{"codehealthFindingId/v1":"6160efcbd995e7f0438202571efb3c80225c4fc1c8938bc9ba631d8b62276515"}},{"ruleId":"D1","level":"warning","message":{"text":"auto_ep_config.validate_autoep_post_detection (cyclomatic 20): auto_ep_config.validate_autoep_post_detection 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":"deepspeed/module_inject/auto_ep_config.py"},"region":{"startLine":350}}}],"partialFingerprints":{"codehealthFindingId/v1":"29dc0f63b7a51e19a15feaee4923d05a604951e21c74332fa8456e264f88a229"}},{"ruleId":"D1","level":"warning","message":{"text":"AutoEPMoELayer._forward (cyclomatic 20): AutoEPMoELayer._forward 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":"deepspeed/module_inject/auto_ep_layer.py"},"region":{"startLine":1089}}}],"partialFingerprints":{"codehealthFindingId/v1":"97993edfdc87cf0e26aa229fd926228ea827b1b84112533e4e226c29b6713c1d"}},{"ruleId":"D1","level":"warning","message":{"text":"DeepSpeedDataSampler.get_new_cluster (cyclomatic 20): DeepSpeedDataSampler.get_new_cluster 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":"deepspeed/runtime/data_pipeline/data_sampling/data_sampler.py"},"region":{"startLine":171}}}],"partialFingerprints":{"codehealthFindingId/v1":"0de842015cbc7ed9c13630283c43e94c987528ea5f8aa49e0f9686e7dcaf5619"}},{"ruleId":"D1","level":"warning","message":{"text":"DeepSpeedEngine._configure_zero_optimizer (cyclomatic 20): DeepSpeedEngine._configure_zero_optimizer 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":"deepspeed/runtime/engine.py"},"region":{"startLine":2705}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f4cb95d49b16e53acfc9c74b508ee09d5135eedb72418a1ffc7681c692009bc"}},{"ruleId":"D1","level":"warning","message":{"text":"TrainSchedule.steps (cyclomatic 20): TrainSchedule.steps 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":"deepspeed/runtime/pipe/schedule.py"},"region":{"startLine":197}}}],"partialFingerprints":{"codehealthFindingId/v1":"cefb2c982845fd88ffc823be23b11d83e97da828346de1e1d87212970a6b6ce6"}},{"ruleId":"D1","level":"warning","message":{"text":"ZenFlowZeroOptimizer.update_selected_channels (cyclomatic 20): ZenFlowZeroOptimizer.update_selected_channels 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":"deepspeed/runtime/zenflow/zenflow_stage_1_and_2.py"},"region":{"startLine":178}}}],"partialFingerprints":{"codehealthFindingId/v1":"d63ade54186f172dbbd9e4975ac8e297a1ff4d2576d5b44423e19015e613b963"}},{"ruleId":"D1","level":"warning","message":{"text":"DeepSpeedZeroOptimizer_Stage3._unpin_offload_buffers (cyclomatic 20): DeepSpeedZeroOptimizer_Stage3._unpin_offload_buffers has cyclomatic complexity 20 (threshold 15). 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":"deepspeed/runtime/zero/stage3.py"},"region":{"startLine":566}}}],"partialFingerprints":{"codehealthFindingId/v1":"754bee8a21dad2d120ce4132dfa284cb9b38f870f28706d0f45a9865aef7afa0"}},{"ruleId":"D1","level":"warning","message":{"text":"DeepSpeedZeroOptimizer._muon_all_gather_partitions (cyclomatic 20): DeepSpeedZeroOptimizer._muon_all_gather_partitions has cyclomatic complexity 20 (threshold 15). 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":"deepspeed/runtime/zero/stage_1_and_2.py"},"region":{"startLine":2039}}}],"partialFingerprints":{"codehealthFindingId/v1":"5be7725457e17b1a769bff1db64239882f619a6df1931d9f0aa44cca7d6cbc30"}},{"ruleId":"D1","level":"warning","message":{"text":"cross_entropy.vocab_parallel_cross_entropy (cyclomatic 20): cross_entropy.vocab_parallel_cross_entropy 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":"deepspeed/sequence/cross_entropy.py"},"region":{"startLine":198}}}],"partialFingerprints":{"codehealthFindingId/v1":"dbb80f7b338b5f5e025e4f57c3a1c4ef4a15d3432a3afc3f84a07179580ccc6c"}},{"ruleId":"D1","level":"warning","message":{"text":"affine_transfer._frame_of (cyclomatic 19): affine_transfer._frame_of 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":"deepspeed/checkpoint/affine_transfer.py"},"region":{"startLine":230}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b28accd768fb0a242e15b0987314ec80684ca2d022ef336a6957a856cdb1332"}},{"ruleId":"D1","level":"warning","message":{"text":"autoep_zero3_metadata.validate_autoep_zero3_partitioned_metadata (cyclomatic 19): autoep_zero3_metadata.validate_autoep_zero3_partitioned_metadata 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":"deepspeed/checkpoint/autoep_zero3_metadata.py"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"e546b7c27249baae3a38948682902364fb14f2affb5f5c072dcc2affdad54fe8"}},{"ruleId":"D1","level":"warning","message":{"text":"comm.init_distributed (cyclomatic 19): comm.init_distributed 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":"deepspeed/comm/comm.py"},"region":{"startLine":831}}}],"partialFingerprints":{"codehealthFindingId/v1":"342036015f3b5bfe243ab9341a624417ef0c7c742cef791d340179567a488512"}},{"ruleId":"D1","level":"warning","message":{"text":"LayerMetaclass.__new__ (cyclomatic 19): LayerMetaclass.__new__ 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":"deepspeed/inference/v2/model_implementations/layer_container_base.py"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"982c4a99a7dd15fd8c8fa75131d35cc5245460a428ade520689c893239ddda38"}},{"ruleId":"D1","level":"warning","message":{"text":"ZenFlowSelectiveAdamW_stage3._step_without_offload (cyclomatic 19): ZenFlowSelectiveAdamW_stage3._step_without_offload 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":"deepspeed/ops/adam/zenflow_torch_adam.py"},"region":{"startLine":332}}}],"partialFingerprints":{"codehealthFindingId/v1":"dadb48d68184f3f27ddccca554dfaa87cea5a806f5804abe1eec1a2b1f49f7f5"}},{"ruleId":"D1","level":"warning","message":{"text":"DeepSpeedTransformerFunction.forward (cyclomatic 19): DeepSpeedTransformerFunction.forward 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":"deepspeed/ops/transformer/transformer.py"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"f41d334240c83c972e4bf5fd77e3d4fde3dad9703ddfa23f068fcf042d219e73"}},{"ruleId":"D1","level":"warning","message":{"text":"FlopsProfiler.print_model_profile (cyclomatic 19): FlopsProfiler.print_model_profile 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":"deepspeed/profiling/flops_profiler/profiler.py"},"region":{"startLine":286}}}],"partialFingerprints":{"codehealthFindingId/v1":"59473ef29c7db9905e8a27fe92783c6462d5970050a2e5fc77d08cb005384d5e"}},{"ruleId":"D1","level":"warning","message":{"text":"DataAnalyzer.merge_map_results (cyclomatic 19): DataAnalyzer.merge_map_results has cyclomatic complexity 19 (threshold 15). 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":"deepspeed/runtime/data_pipeline/data_sampling/data_analyzer.py"},"region":{"startLine":281}}}],"partialFingerprints":{"codehealthFindingId/v1":"faa03a7ab22244b24788b67d0570ead3718e176ac99e6f15f5c3196ecaf2de2e"}},{"ruleId":"D1","level":"warning","message":{"text":"DistributedDataAnalyzer.run_map_helper (cyclomatic 19): DistributedDataAnalyzer.run_map_helper 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":"deepspeed/runtime/data_pipeline/data_sampling/data_analyzer.py"},"region":{"startLine":502}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6ee9ed5ece8a1d01a748e4ae330b6a68652a9ca40517ed9771362b7968a3316"}},{"ruleId":"D1","level":"warning","message":{"text":"DeepSpeedEngine._configure_basic_optimizer (cyclomatic 19): DeepSpeedEngine._configure_basic_optimizer 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":"deepspeed/runtime/engine.py"},"region":{"startLine":2549}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e41b98bea18452ec3e8f29e879c8b0642c50bcaa27c17410aae0164ee98f433"}},{"ruleId":"D1","level":"warning","message":{"text":"Init._partition_param (cyclomatic 19): Init._partition_param 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":"deepspeed/runtime/zero/partition_parameters.py"},"region":{"startLine":1786}}}],"partialFingerprints":{"codehealthFindingId/v1":"190ec7443ee672c8262617ddb4a668e7a0411e5ff838b99c6b4daa36faad6272"}},{"ruleId":"D1","level":"warning","message":{"text":"torch_latest.load_test_selection (cyclomatic 18): torch_latest.load_test_selection 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":"ci/torch_latest.py"},"region":{"startLine":350}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d76ba6839aa535bf3b2699a809f49c1ef6374a3c11c709a939f6d289437a40d"}},{"ruleId":"D1","level":"warning","message":{"text":"auto_ep._infer_hidden_and_ffn_size (cyclomatic 18): auto_ep._infer_hidden_and_ffn_size 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":"deepspeed/module_inject/auto_ep.py"},"region":{"startLine":294}}}],"partialFingerprints":{"codehealthFindingId/v1":"0abf6abfc3e3f7bb203e0c0d3879b82b033e267467ec16b469e31a6682b1d68f"}},{"ruleId":"D1","level":"warning","message":{"text":"MOELayer.forward (cyclomatic 18): MOELayer.forward 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":"deepspeed/moe/sharded_moe.py"},"region":{"startLine":649}}}],"partialFingerprints":{"codehealthFindingId/v1":"2802d0119cab7374dab1015a845d33e548104851016c857beaed57f6bba0ee13"}},{"ruleId":"D1","level":"warning","message":{"text":"zenflow_torch_adam._multi_tensor_adamw (cyclomatic 18): zenflow_torch_adam._multi_tensor_adamw 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":"deepspeed/ops/adam/zenflow_torch_adam.py"},"region":{"startLine":801}}}],"partialFingerprints":{"codehealthFindingId/v1":"17710b593525cf838b9ef2dcbdfdc167142eba364ba6c7b776cb166212c99ad1"}},{"ruleId":"D1","level":"warning","message":{"text":"zenflow_torch_adam.adamw (cyclomatic 18): zenflow_torch_adam.adamw 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":"deepspeed/ops/adam/zenflow_torch_adam.py"},"region":{"startLine":1057}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c2d5181ab9e9c3fd65697a6bba29324bab2928f4bc8c1c2db3c4146b1381d0a"}},{"ruleId":"D1","level":"warning","message":{"text":"DistributedDataAnalyzer.run_map_reduce (cyclomatic 18): DistributedDataAnalyzer.run_map_reduce 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":"deepspeed/runtime/data_pipeline/data_sampling/data_analyzer.py"},"region":{"startLine":563}}}],"partialFingerprints":{"codehealthFindingId/v1":"73ce71ade1be06a1400e0bff3498f191bed8b2a416f70a36e223603319eb5976"}},{"ruleId":"D1","level":"warning","message":{"text":"DeepSpeedEngine._cast_module_mixed_precision (cyclomatic 18): DeepSpeedEngine._cast_module_mixed_precision 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":"deepspeed/runtime/engine.py"},"region":{"startLine":1885}}}],"partialFingerprints":{"codehealthFindingId/v1":"45b46773bf8594eff2f82d955b0fbc67090a573be2a66e03c93f8f0dccd93ecf"}},{"ruleId":"D1","level":"warning","message":{"text":"DeepSpeedEngine.load_module_state_dict (cyclomatic 18): DeepSpeedEngine.load_module_state_dict 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":"deepspeed/runtime/engine.py"},"region":{"startLine":4350}}}],"partialFingerprints":{"codehealthFindingId/v1":"16c1ec6b8da97b53f95fd3f150b3e0f83baea59ca3bc21848ec0e76de5667a92"}},{"ruleId":"D1","level":"warning","message":{"text":"PipelineParallelGrid.__init__ (cyclomatic 18): PipelineParallelGrid.__init__ 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":"deepspeed/runtime/pipe/topology.py"},"region":{"startLine":274}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ebd88d3130a63401ab194179eb63cdb60eff24ced90a78e0dd240039f9405e7"}},{"ruleId":"D1","level":"warning","message":{"text":"UlyssesSPAttentionHF.register_with_transformers (cyclomatic 18): UlyssesSPAttentionHF.register_with_transformers 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":"deepspeed/runtime/sequence_parallel/ulysses_sp.py"},"region":{"startLine":391}}}],"partialFingerprints":{"codehealthFindingId/v1":"06dd9781b68f1adf9a97b57c3c67724178ea43fdf8ebf81568f9661facad9b08"}},{"ruleId":"D1","level":"warning","message":{"text":"DeepSpeedZeroOptimizer_Stage3._partitioned_buffers_all_gather (cyclomatic 18): DeepSpeedZeroOptimizer_Stage3._partitioned_buffers_all_gather has cyclomatic complexity 18 (threshold 15). 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":"deepspeed/runtime/zero/stage3.py"},"region":{"startLine":2156}}}],"partialFingerprints":{"codehealthFindingId/v1":"872cb6dfca500d51ca93c082c47571a753e40ce709003265a7763dc944b1157b"}},{"ruleId":"D1","level":"warning","message":{"text":"DeepSpeedZeroOptimizer.reload_states (cyclomatic 18): DeepSpeedZeroOptimizer.reload_states 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":"deepspeed/runtime/zero/stage_1_and_2.py"},"region":{"startLine":4052}}}],"partialFingerprints":{"codehealthFindingId/v1":"09864f727fbac5ab52262c332232b89c880916961865878250a0715415390a83"}},{"ruleId":"D1","level":"warning","message":{"text":"_FPDTGPUOffloadingAttentionImpl_.backward (cyclomatic 18): _FPDTGPUOffloadingAttentionImpl_.backward 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":"deepspeed/sequence/fpdt_layer.py"},"region":{"startLine":839}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa0d42e7adbd008349f0939ff97513178869458c58f3b70c24b2167f882ba251"}},{"ruleId":"D1","level":"warning","message":{"text":"linear_cross_entropy.vocab_parallel_linear_cross_entropy (cyclomatic 18): linear_cross_entropy.vocab_parallel_linear_cross_entropy 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":"deepspeed/sequence/linear_cross_entropy.py"},"region":{"startLine":215}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a1bcfe69ee8c505a1f09da53bf846e38fa127d648db8f28f4d511fde22d2873"}},{"ruleId":"D1","level":"warning","message":{"text":"z3_leaf_module.apply_zero_leaf_module_config (cyclomatic 18): z3_leaf_module.apply_zero_leaf_module_config 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":"deepspeed/utils/z3_leaf_module.py"},"region":{"startLine":182}}}],"partialFingerprints":{"codehealthFindingId/v1":"77fa0d5d272a8cb9e769871d7450daae794b9fe2e9c14ebee2256744f1081945"}},{"ruleId":"D1","level":"warning","message":{"text":"torch_latest.wait_for_ssm_command (cyclomatic 17): torch_latest.wait_for_ssm_command 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":"ci/torch_latest.py"},"region":{"startLine":1476}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d96866eae4b7765ee027d5e19046ddd9db52e32dd26def26eb3cb9d19f97bba"}},{"ruleId":"D1","level":"warning","message":{"text":"torch_latest.run_aws_controller (cyclomatic 17): torch_latest.run_aws_controller 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":"ci/torch_latest.py"},"region":{"startLine":1795}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c3932aaaec2071fee25fc3dab0a59b7bcca2e4df322143d0d0a5cb2783d1925"}},{"ruleId":"D1","level":"warning","message":{"text":"deepspeed.initialize (cyclomatic 17): deepspeed.initialize 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":"deepspeed/__init__.py"},"region":{"startLine":433}}}],"partialFingerprints":{"codehealthFindingId/v1":"254af39b0b1aa793b1a14ba1a0bfa96707ef05bd49a188703e954330b3abee06"}},{"ruleId":"D1","level":"warning","message":{"text":"Autotuner.run_tuning_micro_batch_sizes (cyclomatic 17): Autotuner.run_tuning_micro_batch_sizes 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":"deepspeed/autotuning/autotuner.py"},"region":{"startLine":745}}}],"partialFingerprints":{"codehealthFindingId/v1":"da3b483c80ee88509360b11d9474a8104313aad5462e35681dd5371eac8309a1"}},{"ruleId":"D1","level":"warning","message":{"text":"autoep_universal.consolidate_autoep_expert_files (cyclomatic 17): autoep_universal.consolidate_autoep_expert_files 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":"deepspeed/checkpoint/autoep_universal.py"},"region":{"startLine":413}}}],"partialFingerprints":{"codehealthFindingId/v1":"edde33028291de43ed04d9dc98141c39db83670a1d56d150bd0362fd93dc127e"}},{"ruleId":"D1","level":"warning","message":{"text":"backend.set_example_values_to_symints (cyclomatic 17): backend.set_example_values_to_symints 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":"deepspeed/compile/backend.py"},"region":{"startLine":181}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa158d6c5115f16e901a83836998c9fa4a26634090a642b322b845a7bc26a352"}},{"ruleId":"D1","level":"warning","message":{"text":"offload_activation._reload_activation_bwd (cyclomatic 17): offload_activation._reload_activation_bwd 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":"deepspeed/compile/passes/offload_activation.py"},"region":{"startLine":723}}}],"partialFingerprints":{"codehealthFindingId/v1":"2eed0985bd7e5fe50f25b59cf6cc9d9919261db9f7daa184b7d6f25a2e829d65"}},{"ruleId":"D1","level":"warning","message":{"text":"ds_aio_args.validate_args (cyclomatic 17): ds_aio_args.validate_args 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":"deepspeed/nvme/ds_aio_args.py"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9513129602d706d678e689a2cc7ea36ae3ad9a0746ee9bb6e4fff6fcd5d12b3"}},{"ruleId":"D1","level":"warning","message":{"text":"FusedAdam.step (cyclomatic 17): FusedAdam.step 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":"deepspeed/ops/adam/fused_adam.py"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d5efbd9e265223bd807fb9aa50412f6abbd50c32682578c5f31d5a1ec162240"}},{"ruleId":"D1","level":"warning","message":{"text":"zenflow_torch_adam._single_tensor_adamw (cyclomatic 17): zenflow_torch_adam._single_tensor_adamw 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":"deepspeed/ops/adam/zenflow_torch_adam.py"},"region":{"startLine":687}}}],"partialFingerprints":{"codehealthFindingId/v1":"5876d7f91d68a8baf7dcc39d47d2e1126e3583a246f07e7d2e82275a9dd77e7a"}},{"ruleId":"D1","level":"warning","message":{"text":"profiler.get_model_profile (cyclomatic 17): profiler.get_model_profile 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":"deepspeed/profiling/flops_profiler/profiler.py"},"region":{"startLine":1196}}}],"partialFingerprints":{"codehealthFindingId/v1":"177559f1ced79c2e70620af0371809f7a92a4a327eaa2ce7df277a5ac49af91d"}},{"ruleId":"D1","level":"warning","message":{"text":"compiler.compile_autoep_non_moe_regions (cyclomatic 17): compiler.compile_autoep_non_moe_regions 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":"deepspeed/runtime/compiler.py"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8bf3a50f9cd16ca110201ee3efbd9570b814c1e82c7dbf0f09f0f14b2cc71a1"}},{"ruleId":"D1","level":"warning","message":{"text":"DeepSpeedEngine._muon_param_groups (cyclomatic 17): DeepSpeedEngine._muon_param_groups 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":"deepspeed/runtime/engine.py"},"region":{"startLine":2498}}}],"partialFingerprints":{"codehealthFindingId/v1":"32ea3e1a62d3ea41ebe1916a5803effa5c2a722998096c7f924e1d832e872b14"}},{"ruleId":"D1","level":"warning","message":{"text":"PipelineEngine._exec_backward_pass (cyclomatic 17): PipelineEngine._exec_backward_pass 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":"deepspeed/runtime/pipe/engine.py"},"region":{"startLine":791}}}],"partialFingerprints":{"codehealthFindingId/v1":"42a6ddd993737bf75e7f6eee426b564eede4985cb575ec0eb93d479ec510f7a2"}},{"ruleId":"D1","level":"warning","message":{"text":"DeepSpeedZeroOptimizer_Stage3.load_hp_checkpoint_state_from_checkpoint_dir_stage3 (cyclomatic 17): DeepSpeedZeroOptimizer_Stage3.load_hp_checkpoint_state_from_checkpoint_dir_stage3 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":"deepspeed/runtime/zero/stage3.py"},"region":{"startLine":3873}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5f59c779d7866285326a7b899ce23c9921d69275182621d71f590ea35a2141a"}},{"ruleId":"D1","level":"warning","message":{"text":"DeepSpeedZeroOptimizer.reduce_independent_p_g_buckets_and_remove_grads (cyclomatic 17): DeepSpeedZeroOptimizer.reduce_independent_p_g_buckets_and_remove_grads 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":"deepspeed/runtime/zero/stage_1_and_2.py"},"region":{"startLine":1521}}}],"partialFingerprints":{"codehealthFindingId/v1":"709fceeeb0bc108a8cc4bf650392068c9601650d9fbdaa96b1f1541186357abe"}},{"ruleId":"D1","level":"warning","message":{"text":"autoep_affine.validate_autoep_placement_descriptor (cyclomatic 16): autoep_affine.validate_autoep_placement_descriptor 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":"deepspeed/checkpoint/autoep_affine.py"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb8c1ca547992aceb65c869be8b9e0e8bfb1fb12dbaaab081e62903f6041c371"}},{"ruleId":"D1","level":"warning","message":{"text":"ds_to_universal._aggregate_autoep_zero12_metadata (cyclomatic 16): ds_to_universal._aggregate_autoep_zero12_metadata 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":"deepspeed/checkpoint/ds_to_universal.py"},"region":{"startLine":1091}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4d55dbe3779b5f2a56d0e323346819a92c751a2a86ffab7d05cac097b12be30"}},{"ruleId":"D1","level":"warning","message":{"text":"universal_checkpoint._resolve_autotp_partition (cyclomatic 16): universal_checkpoint._resolve_autotp_partition 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":"deepspeed/checkpoint/universal_checkpoint.py"},"region":{"startLine":148}}}],"partialFingerprints":{"codehealthFindingId/v1":"7689f2e406da385459f72fbaf61b3d2e841e1f2f0164ba70d69fb9387a88b2a0"}},{"ruleId":"D1","level":"warning","message":{"text":"init_z1_and_2.init_z1_and_2 (cyclomatic 16): init_z1_and_2.init_z1_and_2 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":"deepspeed/compile/init_z1_and_2.py"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"50883ddab83d62bd2cc14ca224ee2a1d0dd2bf56c48f750d426d95cdd6f93926"}},{"ruleId":"D1","level":"warning","message":{"text":"sp_compile.pass_propagate_shapes (cyclomatic 16): sp_compile.pass_propagate_shapes 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":"deepspeed/compile/passes/sp_compile.py"},"region":{"startLine":285}}}],"partialFingerprints":{"codehealthFindingId/v1":"be66e8fa9a8f18161cefd84ee3ee714664d2427e3bf72a109eeed71bb26ad95e"}},{"ruleId":"D1","level":"warning","message":{"text":"zero3_compile.add_gather_and_release (cyclomatic 16): zero3_compile.add_gather_and_release 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":"deepspeed/compile/passes/zero3_compile.py"},"region":{"startLine":335}}}],"partialFingerprints":{"codehealthFindingId/v1":"e77e6d4441a6782238b87146d970c6457da03bf53f7a98a53d0f261271d8926d"}},{"ruleId":"D1","level":"warning","message":{"text":"qkv.shard_qkv_param (cyclomatic 16): qkv.shard_qkv_param 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":"deepspeed/inference/v2/model_implementations/sharding/qkv.py"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"818464b833cf8bc44351b83db029b7edd159956b4247f993c9bb037a850a8fab"}},{"ruleId":"D1","level":"warning","message":{"text":"TPLayerSpec._validate_shape_format (cyclomatic 16): TPLayerSpec._validate_shape_format 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":"deepspeed/module_inject/autotp_config.py"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"da864cfb17ee27b4034ad1ce4d87912de3bb80f45e0647f5599ed3a4d4593d77"}},{"ruleId":"D1","level":"warning","message":{"text":"ZenFlowSelectiveAdamW.group_step (cyclomatic 16): ZenFlowSelectiveAdamW.group_step 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":"deepspeed/ops/adam/zenflow_torch_adam.py"},"region":{"startLine":203}}}],"partialFingerprints":{"codehealthFindingId/v1":"822cef27984b4a1da988d51072406ff8cb3c55b8399fbb57bdfa8257dacac1d1"}},{"ruleId":"D1","level":"warning","message":{"text":"FusedLion.step (cyclomatic 16): FusedLion.step 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":"deepspeed/ops/lion/fused_lion.py"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"b771ac7888d90ff2a89c3ef98505f83b9e3f24964e5ea261e8ffef8622327adc"}},{"ruleId":"D1","level":"warning","message":{"text":"DeepSpeedMoEInference.forward (cyclomatic 16): DeepSpeedMoEInference.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":"deepspeed/ops/transformer/inference/moe_inference.py"},"region":{"startLine":271}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ba4aacaef3ffa857bc1f2969a5dbbfd6d004939cb6cafe65f5e9ad2f7ff2c61"}},{"ruleId":"D1","level":"warning","message":{"text":"DeepSpeedTransformerFunction.backward (cyclomatic 16): DeepSpeedTransformerFunction.backward 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":"deepspeed/ops/transformer/transformer.py"},"region":{"startLine":243}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f77c0d9a345bf16f92c122486ebeacef45ce07b895e5399d6a7e2c5dfd2468d"}},{"ruleId":"D1","level":"warning","message":{"text":"PipelineEngine._exec_recv_grads (cyclomatic 16): PipelineEngine._exec_recv_grads 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":"deepspeed/runtime/pipe/engine.py"},"region":{"startLine":1150}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed2cc68738894e82a911093c806d04c7cbf9c9e563b42f5051f59edeb43615a9"}},{"ruleId":"D1","level":"warning","message":{"text":"InferenceSchedule.steps (cyclomatic 16): InferenceSchedule.steps 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":"deepspeed/runtime/pipe/schedule.py"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ded08179f9b166271a5041b40d2524cf7e49306ac6da5f457afe1488ea29ed2"}},{"ruleId":"D1","level":"warning","message":{"text":"opsd.generalized_jsd_loss (cyclomatic 16): opsd.generalized_jsd_loss 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":"deepspeed/runtime/rollout/opsd.py"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"86d445c5d49c64993b10b31bbc882625e1b67a52cd1c9e1e543fe7bafb18cdb9"}},{"ruleId":"D1","level":"warning","message":{"text":"MegatronSDLoader.merge_state_dict (cyclomatic 16): MegatronSDLoader.merge_state_dict 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":"deepspeed/runtime/state_dict_factory.py"},"region":{"startLine":299}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e759951a7af9424c65c490979c600909e954e63308748b1f4e9c308d105c3a4"}},{"ruleId":"D1","level":"warning","message":{"text":"engine_stage3.update_selected_channels (cyclomatic 16): engine_stage3.update_selected_channels 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":"deepspeed/runtime/zenflow/engine_stage3.py"},"region":{"startLine":152}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6ebe4d497b854375697ecdf3a293fa5edefac96102d6358b6b2ee459d5999f5"}},{"ruleId":"D1","level":"warning","message":{"text":"DeepSpeedZeroOptimizer_Stage3.initialize_optimizer_states (cyclomatic 16): DeepSpeedZeroOptimizer_Stage3.initialize_optimizer_states 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":"deepspeed/runtime/zero/stage3.py"},"region":{"startLine":1369}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b181ae260bac4a646e5f9a2d0313e30a1fda70e017f5472e657a00e6c2ae06a"}},{"ruleId":"D1","level":"warning","message":{"text":"DeepSpeedZeroOptimizer_Stage3.step (cyclomatic 16): DeepSpeedZeroOptimizer_Stage3.step 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":"deepspeed/runtime/zero/stage3.py"},"region":{"startLine":3051}}}],"partialFingerprints":{"codehealthFindingId/v1":"94913677ef263cbfb94bf89a345bfa399333964a7e483be22919e05fa945e0dd"}},{"ruleId":"D1","level":"warning","message":{"text":"DeepSpeedZeroOptimizer_Stage3.reload_states (cyclomatic 16): DeepSpeedZeroOptimizer_Stage3.reload_states 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":"deepspeed/runtime/zero/stage3.py"},"region":{"startLine":4208}}}],"partialFingerprints":{"codehealthFindingId/v1":"c307c26170442a0fcd71c0a2e8ab82c5b440ec1defd34d6e30d81e89ef7b76ae"}},{"ruleId":"D1","level":"warning","message":{"text":"_FPDTGPUOffloadingAttentionImpl_.forward (cyclomatic 16): _FPDTGPUOffloadingAttentionImpl_.forward 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":"deepspeed/sequence/fpdt_layer.py"},"region":{"startLine":608}}}],"partialFingerprints":{"codehealthFindingId/v1":"9398899120403143abaa4d6b5870ba959573bda3e3adfa2d15dada79a1c4f5bc"}},{"ruleId":"D1","level":"warning","message":{"text":"zero_to_fp32._zero2_merge_trainable_params (cyclomatic 16): zero_to_fp32._zero2_merge_trainable_params 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":"deepspeed/utils/zero_to_fp32.py"},"region":{"startLine":307}}}],"partialFingerprints":{"codehealthFindingId/v1":"aed8813e83e114499ca65acb2fae0c014083a7fe93381e1f5cdde69683badf20"}},{"ruleId":"D1","level":"warning","message":{"text":"OpBuilder.simd_width (cyclomatic 16): OpBuilder.simd_width 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":"op_builder/builder.py"},"region":{"startLine":529}}}],"partialFingerprints":{"codehealthFindingId/v1":"995848036b708f3cbd1b03f92fb4de275886900fcf205a67c3395f7a42ef8871"}},{"ruleId":"D2","level":"warning","message":{"text":"list_schedule.fast_free_schedule (cognitive 164): list_schedule.fast_free_schedule has cognitive complexity 164 (threshold 15). Drivers by points: if/else 38 (107 pts), loops 22 (48 pts), ternaries 3 (6 pts), boolean chains 3 (nesting depth added 98). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"deepspeed/compile/list_schedule.py"},"region":{"startLine":578}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ed96eac9d4fcc808a618cf84d70cb3a088801792e0d5a7d7ae884697f38095e"}},{"ruleId":"D2","level":"warning","message":{"text":"DeepSpeedEngine._save_moe_checkpoint (cognitive 147): DeepSpeedEngine._save_moe_checkpoint has cognitive complexity 147 (threshold 15). Drivers by points: if/else 34 (95 pts), loops 7 (22 pts), ternaries 7 (17 pts), boolean chains 12, error handling 1 (nesting depth added 86). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"deepspeed/runtime/engine.py"},"region":{"startLine":5146}}}],"partialFingerprints":{"codehealthFindingId/v1":"fda81c337c8bbb3c91864faddf8a60b30b8c0d1da992b1b6223170567ffb4795"}},{"ruleId":"D2","level":"warning","message":{"text":"DeepSpeedZeroOptimizer.__init__ (cognitive 115): DeepSpeedZeroOptimizer.__init__ has cognitive complexity 115 (threshold 15). Drivers by points: if/else 44 (64 pts), loops 14 (26 pts), ternaries 9 (13 pts), boolean chains 12 (nesting depth added 36). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"deepspeed/runtime/zero/stage_1_and_2.py"},"region":{"startLine":170}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f14a3ca431694120942c44b03cce1f8846384d96a9b8ff0775dac4668a92430"}},{"ruleId":"D2","level":"warning","message":{"text":"autoep_universal.consolidate_autoep_zero12_expert_states (cognitive 113): autoep_universal.consolidate_autoep_zero12_expert_states has cognitive complexity 113 (threshold 15). Drivers by points: if/else 24 (84 pts), ternaries 3 (14 pts), loops 5 (12 pts), boolean chains 3 (nesting depth added 78). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"deepspeed/checkpoint/autoep_universal.py"},"region":{"startLine":288}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0d7d463d5f199a3abecbfdea614bcbc2bf1e7040c064439f40c8c02b1dcecb6"}},{"ruleId":"D2","level":"warning","message":{"text":"HybridEngineRollout._generate_continuous (cognitive 113): HybridEngineRollout._generate_continuous has cognitive complexity 113 (threshold 15). Drivers by points: if/else 38 (89 pts), loops 5 (10 pts), ternaries 8 (10 pts), boolean chains 4 (nesting depth added 58). 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":"deepspeed/runtime/rollout/hybrid_engine_rollout.py"},"region":{"startLine":333}}}],"partialFingerprints":{"codehealthFindingId/v1":"3711a6b42fea86051faa0bd43a9a2c7896969604388db6ad847775d20090bd72"}},{"ruleId":"D2","level":"warning","message":{"text":"AutoEP.ep_parser (cognitive 107): AutoEP.ep_parser has cognitive complexity 107 (threshold 15). Drivers by points: if/else 30 (91 pts), boolean chains 7, error handling 1 (3 pts), loops 2 (3 pts), ternaries 1 (3 pts) (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":"deepspeed/module_inject/auto_ep.py"},"region":{"startLine":417}}}],"partialFingerprints":{"codehealthFindingId/v1":"d259c0c0abb075cfbdd4d5650c53c3492b4ab16166fbc364087e9e44471da331"}},{"ruleId":"D2","level":"warning","message":{"text":"ZenFlowZeroOptimizer._process_selected_fp32_groups_grad (cognitive 103): ZenFlowZeroOptimizer._process_selected_fp32_groups_grad has cognitive complexity 103 (threshold 15). Drivers by points: if/else 30 (67 pts), ternaries 7 (21 pts), loops 7 (12 pts), boolean chains 3 (nesting depth added 56). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"deepspeed/runtime/zenflow/zenflow_stage_1_and_2.py"},"region":{"startLine":277}}}],"partialFingerprints":{"codehealthFindingId/v1":"108e0e40cd8bb66afb9017aee8637a1241f3730a84869d96f76ceb28c37ce5b1"}},{"ruleId":"D2","level":"warning","message":{"text":"offload_adam_states.offload_opt_states_inc (cognitive 99): offload_adam_states.offload_opt_states_inc has cognitive complexity 99 (threshold 15). Drivers by points: if/else 21 (55 pts), loops 14 (37 pts), boolean chains 5, ternaries 2 (nesting depth added 57). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"deepspeed/compile/passes/offload_adam_states.py"},"region":{"startLine":354}}}],"partialFingerprints":{"codehealthFindingId/v1":"f24eb05587f865becd3fa2b6ac8b7587ee36a673ac96ea431df613dbce0d5bd7"}},{"ruleId":"D2","level":"warning","message":{"text":"affine_transfer_executor.execute_transfers (cognitive 97): affine_transfer_executor.execute_transfers has cognitive complexity 97 (threshold 15). Drivers by points: if/else 27 (53 pts), loops 13 (26 pts), ternaries 5 (9 pts), boolean chains 8, error handling 1 (nesting depth added 43). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"deepspeed/checkpoint/affine_transfer_executor.py"},"region":{"startLine":305}}}],"partialFingerprints":{"codehealthFindingId/v1":"7de7e4a8e350b03b7274e5b4fc8980155ecd7b53a6ed31a009691df0e6105498"}},{"ruleId":"D2","level":"warning","message":{"text":"ds_to_universal._consolidate_zero3_autoep_expert_states (cognitive 95): ds_to_universal._consolidate_zero3_autoep_expert_states has cognitive complexity 95 (threshold 15). Drivers by points: if/else 18 (64 pts), loops 7 (15 pts), ternaries 2 (8 pts), error handling 1 (6 pts), boolean chains 2 (nesting depth added 65). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"deepspeed/checkpoint/ds_to_universal.py"},"region":{"startLine":808}}}],"partialFingerprints":{"codehealthFindingId/v1":"62a25ae2cb96774d537aade4fe279d1d29dd8b5588580895a35a4cc52e610582"}},{"ruleId":"D2","level":"warning","message":{"text":"real_accelerator.get_accelerator (cognitive 92): real_accelerator.get_accelerator has cognitive complexity 92 (threshold 15). Drivers by points: error handling 17 (50 pts), if/else 20 (39 pts), boolean chains 3 (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":"accelerator/real_accelerator.py"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"969ee659c3f27b00082bf94798aef282a48147171d0408234a41e9eb9cfecba3"}},{"ruleId":"D2","level":"warning","message":{"text":"runner.main (cognitive 92): runner.main has cognitive complexity 92 (threshold 15). Drivers by points: if/else 40 (67 pts), loops 4 (10 pts), boolean chains 9, error handling 2 (4 pts), ternaries 1 (2 pts) (nesting depth added 36). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"deepspeed/launcher/runner.py"},"region":{"startLine":439}}}],"partialFingerprints":{"codehealthFindingId/v1":"4daccd409b1923c687349a739fab8642183c4deb88e20c874a379818fc9f3f51"}},{"ruleId":"D2","level":"warning","message":{"text":"DeepSpeedEngine.load_moe_state_dict (cognitive 81): DeepSpeedEngine.load_moe_state_dict has cognitive complexity 81 (threshold 15). Drivers by points: loops 8 (29 pts), if/else 9 (27 pts), ternaries 5 (21 pts), boolean chains 3, error handling 1 (nesting depth added 55). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"deepspeed/runtime/engine.py"},"region":{"startLine":4216}}}],"partialFingerprints":{"codehealthFindingId/v1":"354a0ea31cb888d610427626f0e431c8a59b3f3f8622dee1a419ea18d99898d3"}},{"ruleId":"D2","level":"warning","message":{"text":"auto_ep_config.validate_autoep_config (cognitive 80): auto_ep_config.validate_autoep_config has cognitive complexity 80 (threshold 15). Drivers by points: if/else 52 (60 pts), boolean chains 19, ternaries 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"deepspeed/module_inject/auto_ep_config.py"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"67c71ea3079d7fc9111683b051755bab98302646657e96e2dddd1d41dcc99c57"}},{"ruleId":"D2","level":"warning","message":{"text":"DeepSpeedEngine._load_checkpoint (cognitive 80): DeepSpeedEngine._load_checkpoint has cognitive complexity 80 (threshold 15). Drivers by points: if/else 28 (49 pts), ternaries 6 (15 pts), boolean chains 9, loops 1 (4 pts), error handling 1 (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":"deepspeed/runtime/engine.py"},"region":{"startLine":4656}}}],"partialFingerprints":{"codehealthFindingId/v1":"25687c6b2050e6616a6f90088d76107b257c53c736b241f8d093693a880279da"}},{"ruleId":"D2","level":"warning","message":{"text":"PartitionedParameterCoordinator._fetch_sub_module_impl (cognitive 80): PartitionedParameterCoordinator._fetch_sub_module_impl has cognitive complexity 80 (threshold 15). Drivers by points: if/else 21 (48 pts), loops 6 (17 pts), boolean chains 8, ternaries 3 (7 pts) (nesting depth added 42). 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":"deepspeed/runtime/zero/partitioned_param_coordinator.py"},"region":{"startLine":356}}}],"partialFingerprints":{"codehealthFindingId/v1":"24b59782c62636795f74e268f351db2ad39f14a7bed9b31835f068051bda3bc1"}},{"ruleId":"D2","level":"warning","message":{"text":"replace_module.replace_transformer_layer (cognitive 72): replace_module.replace_transformer_layer has cognitive complexity 72 (threshold 15). Drivers by points: if/else 17 (32 pts), loops 6 (16 pts), ternaries 6 (16 pts), boolean chains 5, error handling 1 (3 pts) (nesting depth added 37). 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":"deepspeed/module_inject/replace_module.py"},"region":{"startLine":181}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2af58a4e2ce05d3df883ab37eced1363f6db50c53a9fb0ae318b1566e4e8269"}},{"ruleId":"D2","level":"warning","message":{"text":"ds_to_universal.main (cognitive 70): ds_to_universal.main has cognitive complexity 70 (threshold 15). Drivers by points: if/else 26 (55 pts), loops 4 (9 pts), boolean chains 4, ternaries 1 (2 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":"deepspeed/checkpoint/ds_to_universal.py"},"region":{"startLine":1140}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7bf367d8106dfa431ac5b83a3035375f502329e8ce1ce75f5775c892d5cebeb"}},{"ruleId":"D2","level":"warning","message":{"text":"DeepSpeedHybridEngine.generate (cognitive 69): DeepSpeedHybridEngine.generate has cognitive complexity 69 (threshold 15). Drivers by points: if/else 17 (36 pts), loops 5 (17 pts), ternaries 5 (14 pts), boolean chains 2 (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":"deepspeed/runtime/hybrid_engine.py"},"region":{"startLine":237}}}],"partialFingerprints":{"codehealthFindingId/v1":"55bfad835f43fd1c6bbcf3d50fe642e24514efc00e2526914cee9c62be25d70f"}},{"ruleId":"D2","level":"warning","message":{"text":"autoep_universal.get_autoep_zero12_expert_param_info (cognitive 64): autoep_universal.get_autoep_zero12_expert_param_info has cognitive complexity 64 (threshold 15). Drivers by points: if/else 16 (42 pts), error handling 2 (7 pts), boolean chains 5, loops 3 (5 pts), ternaries 2 (5 pts) (nesting depth added 36). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"deepspeed/checkpoint/autoep_universal.py"},"region":{"startLine":159}}}],"partialFingerprints":{"codehealthFindingId/v1":"494359ed1ee4cc8c708111f5f83205bc2c2769fbdfed6c4e72f40590972b11b5"}},{"ruleId":"D2","level":"warning","message":{"text":"ZenFlowSelectiveAdamW_stage3.group_step (cognitive 63): ZenFlowSelectiveAdamW_stage3.group_step has cognitive complexity 63 (threshold 15). Drivers by points: if/else 15 (46 pts), loops 5 (8 pts), ternaries 2 (8 pts), boolean chains 1 (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":"deepspeed/ops/adam/zenflow_torch_adam.py"},"region":{"startLine":540}}}],"partialFingerprints":{"codehealthFindingId/v1":"13d1bcff2056a631f35a7075dbc837b6e4beaf0301c46acca0ad52cb71118319"}},{"ruleId":"D2","level":"warning","message":{"text":"MuonWithAuxAdam.step (cognitive 63): MuonWithAuxAdam.step has cognitive complexity 63 (threshold 15). Drivers by points: if/else 18 (47 pts), loops 6 (14 pts), boolean chains 2 (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":"deepspeed/runtime/zero/muon/muon_optimizer.py"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca6e5fc7bf354a8816c45472f4d820c939ac943ff88ec894a681dfeddc50f978"}},{"ruleId":"D2","level":"warning","message":{"text":"DeepSpeedZeroOptimizer.offload_states (cognitive 63): DeepSpeedZeroOptimizer.offload_states has cognitive complexity 63 (threshold 15). Drivers by points: if/else 17 (34 pts), loops 10 (28 pts), boolean chains 1 (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":"deepspeed/runtime/zero/stage_1_and_2.py"},"region":{"startLine":3957}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a0205d6bd26dc966f6fc33c2631283c9905bc632c6fb8f033948e7f10d92f30"}},{"ruleId":"D2","level":"warning","message":{"text":"AutoTP._replace_module (cognitive 55): AutoTP._replace_module has cognitive complexity 55 (threshold 15). Drivers by points: if/else 16 (38 pts), ternaries 3 (8 pts), boolean chains 5, loops 2 (4 pts) (nesting depth added 29). 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":"deepspeed/module_inject/auto_tp.py"},"region":{"startLine":1057}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce9e908b96472327f106a49cffd932efc8ff0188424c48b918a89448ffe64afc"}},{"ruleId":"D2","level":"warning","message":{"text":"DeepSpeedEngine._apply_autotp_partitioning (cognitive 55): DeepSpeedEngine._apply_autotp_partitioning has cognitive complexity 55 (threshold 15). Drivers by points: if/else 21 (43 pts), boolean chains 7, error handling 1 (4 pts), loops 1 (nesting depth added 25). 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":"deepspeed/runtime/engine.py"},"region":{"startLine":1026}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8d31914661e211554a30a426f6dae40a2f4006fbb3bb8b823e1db51b24de336"}},{"ruleId":"D2","level":"warning","message":{"text":"ZenFlowSelectiveAdamW_stage3._step_without_offload (cognitive 54): ZenFlowSelectiveAdamW_stage3._step_without_offload has cognitive complexity 54 (threshold 15). Drivers by points: if/else 11 (37 pts), ternaries 2 (8 pts), loops 4 (7 pts), boolean chains 2 (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":"deepspeed/ops/adam/zenflow_torch_adam.py"},"region":{"startLine":332}}}],"partialFingerprints":{"codehealthFindingId/v1":"44de3daa4df8e44fc3f75c363c2bbb31480bdad93c8325e5ef8fa72bf0954a7b"}},{"ruleId":"D2","level":"warning","message":{"text":"DataAnalyzer.merge_map_results (cognitive 54): DataAnalyzer.merge_map_results has cognitive complexity 54 (threshold 15). Drivers by points: loops 15 (46 pts), if/else 3 (8 pts) (nesting depth added 36). 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":"deepspeed/runtime/data_pipeline/data_sampling/data_analyzer.py"},"region":{"startLine":281}}}],"partialFingerprints":{"codehealthFindingId/v1":"e55c9d87667899b0c1e6ed6b50cc1ee5649aea494c2a726da11d9f46ee2ce060"}},{"ruleId":"D2","level":"warning","message":{"text":"DeepSpeedZeroOptimizer.average_tensor (cognitive 54): DeepSpeedZeroOptimizer.average_tensor has cognitive complexity 54 (threshold 15). Drivers by points: if/else 18 (29 pts), loops 7 (12 pts), ternaries 3 (7 pts), boolean chains 6 (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":"deepspeed/runtime/zero/stage_1_and_2.py"},"region":{"startLine":1697}}}],"partialFingerprints":{"codehealthFindingId/v1":"77af01d4e2ff172fda86843a3d54130964d843fc8a0710f57b73106541d14a93"}},{"ruleId":"D2","level":"warning","message":{"text":"torch_latest._poll_ssm_cloudwatch_output (cognitive 53): torch_latest._poll_ssm_cloudwatch_output has cognitive complexity 53 (threshold 15). Drivers by points: if/else 8 (25 pts), loops 4 (10 pts), ternaries 3 (10 pts), error handling 2 (6 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":"ci/torch_latest.py"},"region":{"startLine":1392}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2e01cd61151bf1d0b5caa801fdfca77762fde1c8981933658d6ffc79584b20d"}},{"ruleId":"D2","level":"warning","message":{"text":"layers.collect_autotp_universal_checkpoint_info (cognitive 52): layers.collect_autotp_universal_checkpoint_info has cognitive complexity 52 (threshold 15). Drivers by points: if/else 16 (40 pts), loops 3 (5 pts), boolean chains 4, ternaries 1 (3 pts) (nesting depth added 28). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"deepspeed/module_inject/layers.py"},"region":{"startLine":695}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f698c9252bb48901149526dd633497ce8010bf3f92e39dcfcf79019f25f8ed0"}},{"ruleId":"D2","level":"warning","message":{"text":"utils.split_params_into_different_moe_groups_for_optimizer (cognitive 52): utils.split_params_into_different_moe_groups_for_optimizer has cognitive complexity 52 (threshold 15). Drivers by points: loops 12 (27 pts), if/else 9 (20 pts), ternaries 1 (5 pts) (nesting depth added 30). 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":"deepspeed/moe/utils.py"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"391683c7d91603a7c5376508d077c5b2a706898ff8bc6ad19949cadda3667858"}},{"ruleId":"D2","level":"warning","message":{"text":"CUDAOpBuilder.compute_capability_args (cognitive 52): CUDAOpBuilder.compute_capability_args has cognitive complexity 52 (threshold 15). Drivers by points: if/else 18 (42 pts), loops 4 (7 pts), boolean chains 2, ternaries 1 (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":"op_builder/builder.py"},"region":{"startLine":706}}}],"partialFingerprints":{"codehealthFindingId/v1":"884faff4acd568e15ce6094f31d2182eb1904bcd0cbbfe7f09d688ec878dbd95"}},{"ruleId":"D2","level":"warning","message":{"text":"layers._infer_subparam_logical_shapes (cognitive 51): layers._infer_subparam_logical_shapes has cognitive complexity 51 (threshold 15). Drivers by points: if/else 29 (42 pts), boolean chains 4, loops 2 (3 pts), ternaries 2 (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":"deepspeed/module_inject/layers.py"},"region":{"startLine":1930}}}],"partialFingerprints":{"codehealthFindingId/v1":"feead623a467c3d24c163b63e80bd37b256ae43be2f23f560862d92e829b067e"}},{"ruleId":"D2","level":"warning","message":{"text":"DistributedDataAnalyzer.run_map_reduce (cognitive 51): DistributedDataAnalyzer.run_map_reduce has cognitive complexity 51 (threshold 15). Drivers by points: if/else 12 (37 pts), loops 6 (14 pts) (nesting depth added 33). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"deepspeed/runtime/data_pipeline/data_sampling/data_analyzer.py"},"region":{"startLine":563}}}],"partialFingerprints":{"codehealthFindingId/v1":"5983ee16382e4e3398485074f574acd4b668286d35b8911ace93c5cff96c217b"}},{"ruleId":"D2","level":"warning","message":{"text":"DeepSpeedZeroOptimizer_Stage3._create_fp16_partitions_with_defragmentation (cognitive 51): DeepSpeedZeroOptimizer_Stage3._create_fp16_partitions_with_defragmentation has cognitive complexity 51 (threshold 15). Drivers by points: if/else 13 (28 pts), loops 8 (18 pts), ternaries 1 (3 pts), boolean chains 2 (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":"deepspeed/runtime/zero/stage3.py"},"region":{"startLine":947}}}],"partialFingerprints":{"codehealthFindingId/v1":"47ad403399f1d7aded035e7d63e4b8e965f56d4e6d554f1c0cb6df5de909eb5b"}},{"ruleId":"D2","level":"warning","message":{"text":"numa.get_numactl_cmd (cognitive 51): numa.get_numactl_cmd has cognitive complexity 51 (threshold 15). Drivers by points: if/else 19 (38 pts), loops 6 (12 pts), boolean chains 1 (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":"deepspeed/utils/numa.py"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef4c692d9a96deedf80f0d14a6aa04879e754fb46f6be64f18443cf4572c6aa8"}},{"ruleId":"D2","level":"warning","message":{"text":"backend.set_example_values_to_symints (cognitive 50): backend.set_example_values_to_symints has cognitive complexity 50 (threshold 15). Drivers by points: if/else 12 (33 pts), loops 4 (14 pts), boolean chains 3 (nesting depth added 31). 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":"deepspeed/compile/backend.py"},"region":{"startLine":181}}}],"partialFingerprints":{"codehealthFindingId/v1":"3eba0d9606462bad49573264dad4fbc3d103cd7a2cc6c64c2dc0cee8f5d52d6b"}},{"ruleId":"D2","level":"warning","message":{"text":"utils.clip_grad_norm_ (cognitive 50): utils.clip_grad_norm_ has cognitive complexity 50 (threshold 15). Drivers by points: if/else 19 (33 pts), loops 5 (9 pts), boolean chains 5, ternaries 2 (3 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":"deepspeed/runtime/utils.py"},"region":{"startLine":358}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed1d0f7d23a8fc9a0ddefece34a3f520441cee7b5d8e2087aed2547507bbaec3"}},{"ruleId":"D2","level":"warning","message":{"text":"auto_ep._infer_hidden_and_ffn_size (cognitive 49): auto_ep._infer_hidden_and_ffn_size has cognitive complexity 49 (threshold 15). Drivers by points: if/else 12 (37 pts), ternaries 1 (6 pts), loops 1 (4 pts), boolean chains 2 (nesting depth added 33). 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":"deepspeed/module_inject/auto_ep.py"},"region":{"startLine":294}}}],"partialFingerprints":{"codehealthFindingId/v1":"d38621813ba4b7e43cc0df54840a879087e06db3d13718c4f51bfe73c09e1ba8"}},{"ruleId":"D2","level":"warning","message":{"text":"ZenFlowZeroOptimizer.average_tensor (cognitive 49): ZenFlowZeroOptimizer.average_tensor has cognitive complexity 49 (threshold 15). Drivers by points: if/else 18 (29 pts), ternaries 4 (11 pts), loops 5 (7 pts), boolean chains 2 (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":"deepspeed/runtime/zenflow/zenflow_stage_1_and_2.py"},"region":{"startLine":446}}}],"partialFingerprints":{"codehealthFindingId/v1":"1761fba6ad1c815b02d654531cd1bf5d7fc40380282b660610cbeec690c51e15"}},{"ruleId":"D2","level":"warning","message":{"text":"_FPDTGPUOffloadingAttentionImpl_.backward (cognitive 49): _FPDTGPUOffloadingAttentionImpl_.backward has cognitive complexity 49 (threshold 15). Drivers by points: if/else 16 (44 pts), loops 2 (3 pts), boolean chains 2 (nesting depth added 29). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"deepspeed/sequence/fpdt_layer.py"},"region":{"startLine":839}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c8e5fe2237f7811302bc5bbb76f5f61b42bcccb16039a23de30d874e39d1929"}},{"ruleId":"D2","level":"warning","message":{"text":"ds_to_universal.merge_tp_slices (cognitive 48): ds_to_universal.merge_tp_slices has cognitive complexity 48 (threshold 15). Drivers by points: if/else 13 (27 pts), loops 5 (14 pts), ternaries 2 (6 pts), boolean chains 1 (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":"deepspeed/checkpoint/ds_to_universal.py"},"region":{"startLine":291}}}],"partialFingerprints":{"codehealthFindingId/v1":"8247c304daeb41851dfd821fd09ff4256f23a3b01158f11f327a8528a39a7c4e"}},{"ruleId":"D2","level":"warning","message":{"text":"DeepSpeedZeroOptimizer_Stage3._apply_muon_updates_cpu_offload (cognitive 48): DeepSpeedZeroOptimizer_Stage3._apply_muon_updates_cpu_offload has cognitive complexity 48 (threshold 15). Drivers by points: if/else 16 (34 pts), loops 4 (8 pts), boolean chains 3, ternaries 1 (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":"deepspeed/runtime/zero/stage3.py"},"region":{"startLine":2689}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d4599b546780d2f6b305f77b038bfa4186c5935b25a6ff757b25a58dc1a68e9"}},{"ruleId":"D2","level":"warning","message":{"text":"Autotuner.tune (cognitive 47): Autotuner.tune has cognitive complexity 47 (threshold 15). Drivers by points: if/else 24 (42 pts), boolean chains 4, ternaries 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":"deepspeed/autotuning/autotuner.py"},"region":{"startLine":404}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2d3421d276f9b5e8495f2223fa3ba182e8cfc9a42a0ef3ce43c1f3092fa321b"}},{"ruleId":"D2","level":"warning","message":{"text":"Autotuner.get_min_max_micro_batch_size (cognitive 47): Autotuner.get_min_max_micro_batch_size has cognitive complexity 47 (threshold 15). Drivers by points: if/else 24 (42 pts), boolean chains 2, loops 2, ternaries 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":"deepspeed/autotuning/autotuner.py"},"region":{"startLine":855}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a6f8690c51fce8667a9312ac9639a5e7c60fad04a4af5ccad3c92e8207fae2c"}},{"ruleId":"D2","level":"warning","message":{"text":"prefetch.schedule_prefetch (cognitive 47): prefetch.schedule_prefetch has cognitive complexity 47 (threshold 15). Drivers by points: if/else 13 (27 pts), loops 5 (9 pts), boolean chains 6, ternaries 5 (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":"deepspeed/compile/passes/prefetch.py"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"df782038e78ffc35ce46ae00fb74fbb5ba7d9c0f597bdf5b7b07ccbe12b73c32"}},{"ruleId":"D2","level":"warning","message":{"text":"DeepSpeedEngine._configure_distributed_model (cognitive 47): DeepSpeedEngine._configure_distributed_model has cognitive complexity 47 (threshold 15). Drivers by points: if/else 19 (33 pts), boolean chains 6, loops 3 (4 pts), error handling 2, ternaries 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":"deepspeed/runtime/engine.py"},"region":{"startLine":2146}}}],"partialFingerprints":{"codehealthFindingId/v1":"0bcde6f2dd9bff8dcd230c68ffdca801bb2075f47389773aa66aafcf3f96ecd8"}},{"ruleId":"D2","level":"warning","message":{"text":"DeepSpeedZeroOptimizer.step (cognitive 47): DeepSpeedZeroOptimizer.step has cognitive complexity 47 (threshold 15). Drivers by points: if/else 20 (34 pts), loops 5 (10 pts), boolean chains 3 (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":"deepspeed/runtime/zero/stage_1_and_2.py"},"region":{"startLine":3116}}}],"partialFingerprints":{"codehealthFindingId/v1":"313879d3f4bfe75b1bcdc0e09ceb0a2edaa568c9be04f44914c1ebf4cf33a666"}},{"ruleId":"D2","level":"warning","message":{"text":"universal_checkpoint.load_hp_checkpoint_state (cognitive 46): universal_checkpoint.load_hp_checkpoint_state has cognitive complexity 46 (threshold 15). Drivers by points: if/else 16 (30 pts), loops 3 (6 pts), ternaries 2 (6 pts), boolean chains 4 (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":"deepspeed/checkpoint/universal_checkpoint.py"},"region":{"startLine":236}}}],"partialFingerprints":{"codehealthFindingId/v1":"f911e6136e01654a21ed6d4a021b0fbedcb79ee512aded533ab365d39e678387"}},{"ruleId":"D2","level":"warning","message":{"text":"init_z1_and_2.init_z1_and_2 (cognitive 46): init_z1_and_2.init_z1_and_2 has cognitive complexity 46 (threshold 15). Drivers by points: if/else 12 (23 pts), loops 6 (13 pts), ternaries 2 (10 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":"deepspeed/compile/init_z1_and_2.py"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ab4c9d9f9ac988c62110d685d71263f3cc2442b016bb5e7d926ff134ac5ce1b"}},{"ruleId":"D2","level":"warning","message":{"text":"DeepSpeedEngine.step (cognitive 46): DeepSpeedEngine.step has cognitive complexity 46 (threshold 15). Drivers by points: if/else 20 (35 pts), ternaries 2 (6 pts), boolean chains 5 (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":"deepspeed/runtime/engine.py"},"region":{"startLine":3650}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4fae3d73edefe7da81d161419e8e6e1b9ea3311d9c1987b8d30da0d5a67604f"}},{"ruleId":"D2","level":"warning","message":{"text":"PipelineModule._index_tied_modules (cognitive 46): PipelineModule._index_tied_modules has cognitive complexity 46 (threshold 15). Drivers by points: if/else 8 (26 pts), loops 6 (19 pts), boolean chains 1 (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":"deepspeed/runtime/pipe/module.py"},"region":{"startLine":480}}}],"partialFingerprints":{"codehealthFindingId/v1":"45a0543ac38319f467b3d20cf376a3220ce590e642301492ba0af047be85beea"}},{"ruleId":"D2","level":"warning","message":{"text":"DeepSpeedZeroOptimizer_Stage3.offload_states (cognitive 46): DeepSpeedZeroOptimizer_Stage3.offload_states has cognitive complexity 46 (threshold 15). Drivers by points: if/else 18 (30 pts), loops 4 (10 pts), boolean chains 6 (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":"deepspeed/runtime/zero/stage3.py"},"region":{"startLine":4106}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c8482267461821b4524a5a8daade306bf63a1d886358ed74255f9927898dec2"}},{"ruleId":"D2","level":"warning","message":{"text":"ZenFlowSelectiveAdamW.group_step (cognitive 45): ZenFlowSelectiveAdamW.group_step has cognitive complexity 45 (threshold 15). Drivers by points: if/else 10 (33 pts), loops 4 (7 pts), ternaries 1 (4 pts), boolean chains 1 (nesting depth added 29). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"deepspeed/ops/adam/zenflow_torch_adam.py"},"region":{"startLine":203}}}],"partialFingerprints":{"codehealthFindingId/v1":"857d1600f74dd52f9b25bc7e091fe03dc87f5ccd2101fb3f177b112008d35583"}},{"ruleId":"D2","level":"warning","message":{"text":"engine_stage3._process_selected_fp32_groups_grad (cognitive 45): engine_stage3._process_selected_fp32_groups_grad has cognitive complexity 45 (threshold 15). Drivers by points: if/else 16 (33 pts), ternaries 3 (8 pts), loops 2 (3 pts), boolean chains 1 (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":"deepspeed/runtime/zenflow/engine_stage3.py"},"region":{"startLine":254}}}],"partialFingerprints":{"codehealthFindingId/v1":"fcb673880bb1c5f7ec1a8f39b5313b2ab68c35c5b32a948034f271ebe1b1c47c"}},{"ruleId":"D2","level":"warning","message":{"text":"selective_gather.selective_gather (cognitive 44): selective_gather.selective_gather has cognitive complexity 44 (threshold 15). Drivers by points: if/else 16 (26 pts), loops 11 (17 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":"deepspeed/compile/passes/selective_gather.py"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"65738457a5699b9f591045c5dea44f4c8ce4bc70d92e4a1c5b00954521f2819c"}},{"ruleId":"D2","level":"warning","message":{"text":"DeepSpeedDataSampler.get_new_cluster (cognitive 44): DeepSpeedDataSampler.get_new_cluster has cognitive complexity 44 (threshold 15). Drivers by points: if/else 11 (27 pts), loops 5 (12 pts), ternaries 1 (4 pts), boolean chains 1 (nesting depth added 26). 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":"deepspeed/runtime/data_pipeline/data_sampling/data_sampler.py"},"region":{"startLine":171}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1b2becdd0e1d652625c147992d798920f3fcb1eaea6c1a59fb48f4c2f25074e"}},{"ruleId":"D2","level":"warning","message":{"text":"utils.compare_tensors_in_structures (cognitive 44): utils.compare_tensors_in_structures has cognitive complexity 44 (threshold 15). Drivers by points: if/else 12 (34 pts), boolean chains 6, loops 2 (4 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":"deepspeed/runtime/utils.py"},"region":{"startLine":1275}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7a90d4686fa4002325b0c64157c46bcc43078cea766f15d10a6ea241816b475"}},{"ruleId":"D2","level":"warning","message":{"text":"ZenFlowZeroOptimizer.update_selected_channels (cognitive 44): ZenFlowZeroOptimizer.update_selected_channels has cognitive complexity 44 (threshold 15). Drivers by points: if/else 11 (24 pts), ternaries 4 (10 pts), loops 6 (9 pts), boolean chains 1 (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":"deepspeed/runtime/zenflow/zenflow_stage_1_and_2.py"},"region":{"startLine":178}}}],"partialFingerprints":{"codehealthFindingId/v1":"20291c76431473914a540aeafbf6062d73c3da0b5f326d7ab8eaba006498897b"}},{"ruleId":"D2","level":"warning","message":{"text":"InferenceSchedule.steps (cognitive 43): InferenceSchedule.steps has cognitive complexity 43 (threshold 15). Drivers by points: if/else 15 (41 pts), boolean chains 1, loops 1 (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":"deepspeed/runtime/pipe/schedule.py"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"105d96b70c77d264b1ef579e9fb9af4fe759ace083c9aaa7215947cb5cf49c5f"}},{"ruleId":"D2","level":"warning","message":{"text":"DeepSpeedZeroOptimizer_Stage3.__init__ (cognitive 43): DeepSpeedZeroOptimizer_Stage3.__init__ has cognitive complexity 43 (threshold 15). Drivers by points: if/else 21 (25 pts), boolean chains 8, loops 4 (7 pts), ternaries 3 (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":"deepspeed/runtime/zero/stage3.py"},"region":{"startLine":159}}}],"partialFingerprints":{"codehealthFindingId/v1":"c26d5c22c01ea917caff06dd305bfaaceb35dff64afe3a5123cd34ffa7e96c43"}},{"ruleId":"D2","level":"warning","message":{"text":"EvoformerAttnBuilder.is_compatible (cognitive 43): EvoformerAttnBuilder.is_compatible has cognitive complexity 43 (threshold 15). Drivers by points: if/else 14 (35 pts), boolean chains 5, error handling 2 (3 pts) (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":"op_builder/evoformer_attn.py"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2d53d965a1879072e06656e394104e420b1ea334e0dddfdd68d3b3044a51c8a"}},{"ruleId":"D2","level":"warning","message":{"text":"InferenceEngine.__init__ (cognitive 42): InferenceEngine.__init__ has cognitive complexity 42 (threshold 15). Drivers by points: if/else 22 (30 pts), loops 3 (7 pts), boolean chains 5 (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":"deepspeed/inference/engine.py"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ccf134088db939e3f1987361c04acc0f6032697d6f64f1221a26e07304960af"}},{"ruleId":"D2","level":"warning","message":{"text":"LayerMetaclass.__new__ (cognitive 42): LayerMetaclass.__new__ has cognitive complexity 42 (threshold 15). Drivers by points: if/else 12 (34 pts), loops 4 (8 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":"deepspeed/inference/v2/model_implementations/layer_container_base.py"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"2483f40f977bff712c37fc3ad892bb758e45d072873679fae3121b7541310622"}},{"ruleId":"D2","level":"warning","message":{"text":"auto_ep_config.validate_autoep_post_detection (cognitive 42): auto_ep_config.validate_autoep_post_detection has cognitive complexity 42 (threshold 15). Drivers by points: if/else 13 (32 pts), ternaries 3 (7 pts), boolean chains 2, loops 1 (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":"deepspeed/module_inject/auto_ep_config.py"},"region":{"startLine":350}}}],"partialFingerprints":{"codehealthFindingId/v1":"a68ac60b780af1d806f55e80c211e5b23216082b9f993ece4c76162ec8fced1f"}},{"ruleId":"D2","level":"warning","message":{"text":"ZenFlowSelectiveAdamW._step_without_offload (cognitive 42): ZenFlowSelectiveAdamW._step_without_offload has cognitive complexity 42 (threshold 15). Drivers by points: if/else 8 (30 pts), loops 4 (7 pts), ternaries 1 (4 pts), boolean chains 1 (nesting depth added 28). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"deepspeed/ops/adam/zenflow_torch_adam.py"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e16486d701ea00c7ab746cebf353b0dff2c7f607f031e819a56767a682ccec9"}},{"ruleId":"D2","level":"warning","message":{"text":"CommsLogger.log_all (cognitive 42): CommsLogger.log_all has cognitive complexity 42 (threshold 15). Drivers by points: if/else 12 (30 pts), loops 4 (8 pts), ternaries 4 (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":"deepspeed/utils/comms_logging.py"},"region":{"startLine":210}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff51c04b8e84e2a2b39f06dabda00768f031d46230e9ffab3cb1af734811affc"}},{"ruleId":"D2","level":"warning","message":{"text":"Autotuner.run_tuning_micro_batch_sizes (cognitive 41): Autotuner.run_tuning_micro_batch_sizes has cognitive complexity 41 (threshold 15). Drivers by points: if/else 14 (28 pts), loops 5 (12 pts), ternaries 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":"deepspeed/autotuning/autotuner.py"},"region":{"startLine":745}}}],"partialFingerprints":{"codehealthFindingId/v1":"479e1f05bea2b85bf2a81ff5c0a5d60a251a2bafeacd1f49935d9dfc868ef89a"}},{"ruleId":"D2","level":"warning","message":{"text":"HybridEngineRollout._generate_continuous_graph (cognitive 41): HybridEngineRollout._generate_continuous_graph has cognitive complexity 41 (threshold 15). Drivers by points: if/else 13 (21 pts), loops 7 (13 pts), ternaries 5 (6 pts), boolean chains 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":"deepspeed/runtime/rollout/hybrid_engine_rollout.py"},"region":{"startLine":592}}}],"partialFingerprints":{"codehealthFindingId/v1":"55d83551a289dece5433aeee06e214074799918d7b1e772a6b4f7ff5560392f4"}},{"ruleId":"D2","level":"warning","message":{"text":"DeepSpeedZeroOptimizer._muon_all_gather_partitions (cognitive 41): DeepSpeedZeroOptimizer._muon_all_gather_partitions has cognitive complexity 41 (threshold 15). Drivers by points: loops 11 (25 pts), if/else 6 (12 pts), ternaries 2 (3 pts), boolean chains 1 (nesting depth added 21). 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":"deepspeed/runtime/zero/stage_1_and_2.py"},"region":{"startLine":2039}}}],"partialFingerprints":{"codehealthFindingId/v1":"f86ea044817a0c184b9603729816c92e09d35f0a70bbb48fea1891297c58ace5"}},{"ruleId":"D2","level":"warning","message":{"text":"DeepSpeedZeroOptimizer.reduce_ipg_grads (cognitive 41): DeepSpeedZeroOptimizer.reduce_ipg_grads has cognitive complexity 41 (threshold 15). Drivers by points: if/else 12 (25 pts), ternaries 2 (8 pts), boolean chains 4, loops 3 (4 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":"deepspeed/runtime/zero/stage_1_and_2.py"},"region":{"startLine":2282}}}],"partialFingerprints":{"codehealthFindingId/v1":"5cccf79d7b1655b44140ca6603c94ed1f1bb39aeba702e5d1804bb832347e794"}},{"ruleId":"D2","level":"warning","message":{"text":"runner.parse_resource_filter (cognitive 40): runner.parse_resource_filter has cognitive complexity 40 (threshold 15). Drivers by points: if/else 13 (27 pts), loops 6 (11 pts), boolean chains 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":"deepspeed/launcher/runner.py"},"region":{"startLine":292}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8a206770c43f8f455d6a3665e284fd93f9fc701c088c42cc660301584b760f9"}},{"ruleId":"D2","level":"warning","message":{"text":"FusedLamb.step (cognitive 40): FusedLamb.step has cognitive complexity 40 (threshold 15). Drivers by points: if/else 15 (31 pts), ternaries 2 (5 pts), loops 2 (3 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":"deepspeed/ops/lamb/fused_lamb.py"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab8620e7605dcd946f93fb7b407958aa2672dd996a982009b54e568d14894a76"}},{"ruleId":"D2","level":"warning","message":{"text":"DeepSpeedEngine.compile (cognitive 40): DeepSpeedEngine.compile has cognitive complexity 40 (threshold 15). Drivers by points: if/else 19 (32 pts), boolean chains 4, loops 1 (2 pts), error handling 1, ternaries 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":"deepspeed/runtime/engine.py"},"region":{"startLine":5950}}}],"partialFingerprints":{"codehealthFindingId/v1":"86984569b121964561695365ebc8f777ca5c416e56ea8b94898b6269f52fb2fb"}},{"ruleId":"D2","level":"warning","message":{"text":"FP16_Optimizer.step (cognitive 40): FP16_Optimizer.step has cognitive complexity 40 (threshold 15). Drivers by points: if/else 22 (29 pts), loops 6 (8 pts), ternaries 1 (2 pts), boolean chains 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":"deepspeed/runtime/fp16/fused_optimizer.py"},"region":{"startLine":256}}}],"partialFingerprints":{"codehealthFindingId/v1":"18de3e46d794d3aff2ca05a60acb54466e3910d9705bc6b15dfc1a64f7653974"}},{"ruleId":"D2","level":"warning","message":{"text":"Init._allgather_params_coalesced (cognitive 40): Init._allgather_params_coalesced has cognitive complexity 40 (threshold 15). Drivers by points: if/else 14 (24 pts), loops 9 (16 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":"deepspeed/runtime/zero/partition_parameters.py"},"region":{"startLine":1998}}}],"partialFingerprints":{"codehealthFindingId/v1":"88d05ee861ecfdfe5e80dcbca3c9eaccd42945292d6acbc0c3006209d864a848"}},{"ruleId":"D2","level":"warning","message":{"text":"DeepSpeedZeroOptimizer_Stage3._create_fp32_partitions (cognitive 40): DeepSpeedZeroOptimizer_Stage3._create_fp32_partitions has cognitive complexity 40 (threshold 15). Drivers by points: if/else 16 (31 pts), boolean chains 5, loops 3 (4 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":"deepspeed/runtime/zero/stage3.py"},"region":{"startLine":1122}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d90e3e8ecffa05cc8a25d5f7c0bcecdbe35204adcf9ce282ad8df81842e803e"}},{"ruleId":"D2","level":"warning","message":{"text":"DeepSpeedZeroOptimizer_Stage3._muon_update_sub_group (cognitive 40): DeepSpeedZeroOptimizer_Stage3._muon_update_sub_group has cognitive complexity 40 (threshold 15). Drivers by points: if/else 16 (25 pts), loops 6 (11 pts), boolean chains 4 (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":"deepspeed/runtime/zero/stage3.py"},"region":{"startLine":1793}}}],"partialFingerprints":{"codehealthFindingId/v1":"c481743a3c26c42a079db166e1c173236c6b0bcf273c4690b6fc460fbda8f1e6"}},{"ruleId":"D2","level":"warning","message":{"text":"autoep_universal.consolidate_autoep_expert_files (cognitive 39): autoep_universal.consolidate_autoep_expert_files has cognitive complexity 39 (threshold 15). Drivers by points: if/else 9 (25 pts), loops 3 (6 pts), ternaries 2 (6 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":"deepspeed/checkpoint/autoep_universal.py"},"region":{"startLine":413}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd53ada29c65b5a59f8414e858774942e44ca83e4089f02e365e29bf75b2a58b"}},{"ruleId":"D2","level":"warning","message":{"text":"launch.main (cognitive 39): launch.main has cognitive complexity 39 (threshold 15). Drivers by points: if/else 16 (27 pts), loops 7 (9 pts), error handling 1 (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":"deepspeed/launcher/launch.py"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"6471a5ece9112ab4fa23bc19d80a3c1384b972599d8f17f6ef8975027a356388"}},{"ruleId":"D2","level":"warning","message":{"text":"TrainSchedule.steps (cognitive 39): TrainSchedule.steps has cognitive complexity 39 (threshold 15). Drivers by points: if/else 14 (32 pts), boolean chains 6, 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":"deepspeed/runtime/pipe/schedule.py"},"region":{"startLine":197}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba8385f22425e0dbcc806c70de53a5878c5d4a0e15f596b4ad0a578ca17c20a7"}},{"ruleId":"D2","level":"warning","message":{"text":"DeepSpeedZeroOptimizer.reload_states (cognitive 39): DeepSpeedZeroOptimizer.reload_states has cognitive complexity 39 (threshold 15). Drivers by points: if/else 11 (23 pts), loops 6 (15 pts), boolean chains 1 (nesting depth added 21). 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":"deepspeed/runtime/zero/stage_1_and_2.py"},"region":{"startLine":4052}}}],"partialFingerprints":{"codehealthFindingId/v1":"5fd9bffe3c00a053164023a82350b0a083606c9f91ba6bea7eac5bc956a0269c"}},{"ruleId":"D2","level":"warning","message":{"text":"affine_transfer._resolve (cognitive 38): affine_transfer._resolve has cognitive complexity 38 (threshold 15). Drivers by points: if/else 14 (24 pts), boolean chains 5, loops 3 (4 pts), ternaries 1 (3 pts), 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":"deepspeed/checkpoint/affine_transfer.py"},"region":{"startLine":659}}}],"partialFingerprints":{"codehealthFindingId/v1":"44298f38dc440347738e5daf6141b985ef5b834262b0ba99203444cfd70d6b29"}},{"ruleId":"D2","level":"warning","message":{"text":"zero3_compile.add_gather_and_release (cognitive 38): zero3_compile.add_gather_and_release has cognitive complexity 38 (threshold 15). Drivers by points: if/else 10 (27 pts), loops 4 (9 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":"deepspeed/compile/passes/zero3_compile.py"},"region":{"startLine":335}}}],"partialFingerprints":{"codehealthFindingId/v1":"f966c29e4e564cd9efbc0176831df335361805b668aa64a4ad2406c8e97f270f"}},{"ruleId":"D2","level":"warning","message":{"text":"DynamicLossScaler.update_scale (cognitive 38): DynamicLossScaler.update_scale has cognitive complexity 38 (threshold 15). Drivers by points: if/else 14 (35 pts), boolean chains 3 (nesting depth added 21). 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":"deepspeed/runtime/fp16/loss_scaler.py"},"region":{"startLine":260}}}],"partialFingerprints":{"codehealthFindingId/v1":"733841c4ffa67588b31d0bc80507a0f58c39d65da21baf3a63676c3ec4c760cb"}},{"ruleId":"D2","level":"warning","message":{"text":"DeepSpeedZeroOptimizer._apply_muon_updates_cpu_offload (cognitive 38): DeepSpeedZeroOptimizer._apply_muon_updates_cpu_offload has cognitive complexity 38 (threshold 15). Drivers by points: if/else 9 (22 pts), loops 4 (10 pts), ternaries 1 (5 pts), boolean chains 1 (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":"deepspeed/runtime/zero/stage_1_and_2.py"},"region":{"startLine":2142}}}],"partialFingerprints":{"codehealthFindingId/v1":"56cd459be71aaa99a1fc35bd759d32f092ce7d6d1dd830d3730506765be26e23"}},{"ruleId":"D2","level":"warning","message":{"text":"zero_affine.autotp_storage_affine_maps (cognitive 37): zero_affine.autotp_storage_affine_maps has cognitive complexity 37 (threshold 15). Drivers by points: if/else 16 (24 pts), loops 7 (8 pts), boolean chains 2, ternaries 1 (2 pts), error handling 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":"deepspeed/checkpoint/zero_affine.py"},"region":{"startLine":261}}}],"partialFingerprints":{"codehealthFindingId/v1":"de7c884d06efb09c42b5575d602b7aae804be25c3990687dc979d005af54185d"}},{"ruleId":"D2","level":"warning","message":{"text":"AutoEPMoELayer.__init__ (cognitive 37): AutoEPMoELayer.__init__ has cognitive complexity 37 (threshold 15). Drivers by points: if/else 14 (17 pts), loops 6 (8 pts), boolean chains 6, ternaries 5 (6 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":"deepspeed/module_inject/auto_ep_layer.py"},"region":{"startLine":517}}}],"partialFingerprints":{"codehealthFindingId/v1":"e444fbe453d9f8b14a641c01e598158ff755b893ac7b112fd0812edce9dbedf6"}},{"ruleId":"D2","level":"warning","message":{"text":"DistributedDataAnalyzer.run_map_helper (cognitive 37): DistributedDataAnalyzer.run_map_helper has cognitive complexity 37 (threshold 15). Drivers by points: if/else 7 (19 pts), loops 5 (9 pts), ternaries 2 (5 pts), boolean chains 2, error handling 1 (2 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":"deepspeed/runtime/data_pipeline/data_sampling/data_analyzer.py"},"region":{"startLine":502}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2462584c3943fbd51870dd7594a5dd546cef4815620a857c2d9b658cd07e13a"}},{"ruleId":"D2","level":"warning","message":{"text":"PipelineEngine._exec_forward_pass (cognitive 37): PipelineEngine._exec_forward_pass has cognitive complexity 37 (threshold 15). Drivers by points: if/else 16 (24 pts), ternaries 2 (6 pts), boolean chains 4, loops 1 (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":"deepspeed/runtime/pipe/engine.py"},"region":{"startLine":698}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7686dd3e7266efc4c2e723159ef1650e694c8657e98f77593304dfa263bd50d"}},{"ruleId":"D2","level":"warning","message":{"text":"HybridEngineRollout.generate (cognitive 37): HybridEngineRollout.generate has cognitive complexity 37 (threshold 15). Drivers by points: if/else 19 (24 pts), ternaries 3 (6 pts), boolean chains 4, 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":"deepspeed/runtime/rollout/hybrid_engine_rollout.py"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a65d70ae82b90716081c3f63d555a1041ce0c56d9bda9407b767b9424ed8818"}},{"ruleId":"D2","level":"warning","message":{"text":"Init._partition_param (cognitive 37): Init._partition_param has cognitive complexity 37 (threshold 15). Drivers by points: if/else 13 (32 pts), boolean chains 5 (nesting depth added 19). 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":"deepspeed/runtime/zero/partition_parameters.py"},"region":{"startLine":1786}}}],"partialFingerprints":{"codehealthFindingId/v1":"990b415b0aaf69318fb9ce37215fa3db76d64c0dfa203048802a71be3f84b2e9"}},{"ruleId":"D2","level":"warning","message":{"text":"TiledFusedLogitsLoss.forward (cognitive 36): TiledFusedLogitsLoss.forward has cognitive complexity 36 (threshold 15). Drivers by points: if/else 19 (26 pts), loops 3 (9 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":"deepspeed/runtime/sequence_parallel/ulysses_sp.py"},"region":{"startLine":1121}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d12839f8dad1d60176a099a37f852701790194575e78f56f1c7ab1675450101"}},{"ruleId":"D2","level":"warning","message":{"text":"autoep_zero3_metadata.validate_autoep_zero3_partitioned_metadata (cognitive 35): autoep_zero3_metadata.validate_autoep_zero3_partitioned_metadata has cognitive complexity 35 (threshold 15). Drivers by points: if/else 15 (32 pts), boolean chains 2, 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":"deepspeed/checkpoint/autoep_zero3_metadata.py"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"e152b5bd49cc6923eb34e5536a1bc3a73615506cb42aa4888f75fedfbf64d6cd"}},{"ruleId":"D2","level":"warning","message":{"text":"ds_to_universal._aggregate_autoep_zero12_metadata (cognitive 35): ds_to_universal._aggregate_autoep_zero12_metadata has cognitive complexity 35 (threshold 15). Drivers by points: if/else 10 (28 pts), loops 2 (4 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":"deepspeed/checkpoint/ds_to_universal.py"},"region":{"startLine":1091}}}],"partialFingerprints":{"codehealthFindingId/v1":"eecb645bf02e2c85aa838d31cd2b0dd4e126a57e0f4d9ad33a7df33368540754"}},{"ruleId":"D2","level":"warning","message":{"text":"BF16_Optimizer.get_grads_for_norm (cognitive 35): BF16_Optimizer.get_grads_for_norm has cognitive complexity 35 (threshold 15). Drivers by points: if/else 10 (29 pts), boolean chains 3, loops 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":"deepspeed/runtime/bf16_optimizer.py"},"region":{"startLine":551}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d3b05fc9cb2d07c9d9703fc359265c01aa1b757a138841a0f9dbff5e59a2f61"}},{"ruleId":"D2","level":"warning","message":{"text":"PipelineParallelGrid.__init__ (cognitive 35): PipelineParallelGrid.__init__ has cognitive complexity 35 (threshold 15). Drivers by points: if/else 14 (26 pts), loops 6 (9 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":"deepspeed/runtime/pipe/topology.py"},"region":{"startLine":274}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0ff8c28a755bc475dcd4d639f5634f41ce07f6983152707e339c8c045a28f94"}},{"ruleId":"D2","level":"warning","message":{"text":"Init.__init__ (cognitive 35): Init.__init__ has cognitive complexity 35 (threshold 15). Drivers by points: if/else 22 (24 pts), boolean chains 6, ternaries 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":"deepspeed/runtime/zero/partition_parameters.py"},"region":{"startLine":955}}}],"partialFingerprints":{"codehealthFindingId/v1":"36c47d117b442b9bb4f77488a479e4bb653a3665caf2c2f570a648ce6b82fae7"}},{"ruleId":"D2","level":"warning","message":{"text":"DeepSpeedZeroOptimizer_Stage3._unpin_offload_buffers (cognitive 35): DeepSpeedZeroOptimizer_Stage3._unpin_offload_buffers has cognitive complexity 35 (threshold 15). Drivers by points: loops 10 (17 pts), if/else 7 (16 pts), boolean chains 2 (nesting depth added 16). 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":"deepspeed/runtime/zero/stage3.py"},"region":{"startLine":566}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f7dcd30836f6020ec19c0159f033c445fcb0869d78f166627e1cf85d45339db"}},{"ruleId":"D2","level":"warning","message":{"text":"affine_transfer.plan_transfers (cognitive 34): affine_transfer.plan_transfers has cognitive complexity 34 (threshold 15). Drivers by points: if/else 9 (15 pts), loops 7 (9 pts), boolean chains 6, ternaries 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":"deepspeed/checkpoint/affine_transfer.py"},"region":{"startLine":530}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2a5dca35cdc0e2cbfad71632799ce9ba6a128a118a2b19805390c99964b2b19"}},{"ruleId":"D2","level":"warning","message":{"text":"AutoTP._configure_gathered_column_tie_fallbacks (cognitive 34): AutoTP._configure_gathered_column_tie_fallbacks has cognitive complexity 34 (threshold 15). Drivers by points: if/else 15 (26 pts), boolean chains 7, 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":"deepspeed/module_inject/auto_tp.py"},"region":{"startLine":817}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7f1be508f5f89a99376118516bc528ae1d4b1ad66de3db2280570080b3a52db"}},{"ruleId":"D2","level":"warning","message":{"text":"zenflow_torch_adam._single_tensor_adamw (cognitive 34): zenflow_torch_adam._single_tensor_adamw has cognitive complexity 34 (threshold 15). Drivers by points: if/else 13 (26 pts), boolean chains 5, 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":"deepspeed/ops/adam/zenflow_torch_adam.py"},"region":{"startLine":687}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7a70f5e7bc631c89f1b3a7043d8b39323da75952c0bbb08bf3e3e6a4bbfdcec"}},{"ruleId":"D2","level":"warning","message":{"text":"DeepSpeedEngine._configure_zero_optimizer (cognitive 34): DeepSpeedEngine._configure_zero_optimizer has cognitive complexity 34 (threshold 15). Drivers by points: if/else 13 (22 pts), ternaries 5 (10 pts), boolean chains 2 (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":"deepspeed/runtime/engine.py"},"region":{"startLine":2705}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5a0f73fb4cfdd1550aedc5174f1979f1940ebe692653161cc66b7b25c3da041"}},{"ruleId":"D2","level":"warning","message":{"text":"zenflow_torch_adam._multi_tensor_adamw (cognitive 33): zenflow_torch_adam._multi_tensor_adamw has cognitive complexity 33 (threshold 15). Drivers by points: if/else 16 (27 pts), boolean chains 5, 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":"deepspeed/ops/adam/zenflow_torch_adam.py"},"region":{"startLine":801}}}],"partialFingerprints":{"codehealthFindingId/v1":"4dc91bcc0949c6520138df358c7e4699630eea61b428dd232c3c25bd34c7d056"}},{"ruleId":"D2","level":"warning","message":{"text":"MuonWithAuxAdam.step (cognitive 33): MuonWithAuxAdam.step has cognitive complexity 33 (threshold 15). Drivers by points: if/else 8 (26 pts), loops 3 (7 pts) (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":"deepspeed/runtime/zero/muon/original_muon.py"},"region":{"startLine":400}}}],"partialFingerprints":{"codehealthFindingId/v1":"f75dddbb68b0a372337e14a30e65880c0633fdb9101cdbf57d6ce2c20eccbeb2"}},{"ruleId":"D2","level":"warning","message":{"text":"torch_latest.wait_for_ssm_command (cognitive 32): torch_latest.wait_for_ssm_command has cognitive complexity 32 (threshold 15). Drivers by points: if/else 10 (24 pts), boolean chains 3, error handling 1 (2 pts), ternaries 1 (2 pts), 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":"ci/torch_latest.py"},"region":{"startLine":1476}}}],"partialFingerprints":{"codehealthFindingId/v1":"001e07a3d5cf9d468d8861deb77be8fdfbf78aff81a162efc3d6fb671a5946ae"}},{"ruleId":"D2","level":"warning","message":{"text":"ParamAffineMap._validate_destinations (cognitive 32): ParamAffineMap._validate_destinations has cognitive complexity 32 (threshold 15). Drivers by points: if/else 10 (22 pts), loops 5 (6 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":"deepspeed/checkpoint/affine.py"},"region":{"startLine":269}}}],"partialFingerprints":{"codehealthFindingId/v1":"2846b9fe9463b367985bb17fa5248c9adbf35376fe17d664850b4a02d2d15e26"}},{"ruleId":"D2","level":"warning","message":{"text":"comm.init_distributed (cognitive 32): comm.init_distributed has cognitive complexity 32 (threshold 15). Drivers by points: if/else 14 (26 pts), boolean chains 6 (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":"deepspeed/comm/comm.py"},"region":{"startLine":831}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca2d6cbaa1e31097f185b43ada298253d96ba51a44856d655ec39d7bb79b6a68"}},{"ruleId":"D2","level":"warning","message":{"text":"init_z3.init_z3 (cognitive 32): init_z3.init_z3 has cognitive complexity 32 (threshold 15). Drivers by points: if/else 15 (20 pts), boolean chains 7, loops 3 (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":"deepspeed/compile/init_z3.py"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"089ec64629b2a6ab177b1cc6f0b9bc4014ee89fd358e1c18b8828e26f3a89a98"}},{"ruleId":"D2","level":"warning","message":{"text":"TPLayerSpec._validate_shape_format (cognitive 32): TPLayerSpec._validate_shape_format has cognitive complexity 32 (threshold 15). Drivers by points: if/else 10 (25 pts), loops 2 (4 pts), boolean chains 3 (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":"deepspeed/module_inject/autotp_config.py"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"03a97036a5dde07c9ad2b8f7f7d5c2a5a3ff389754686e3d7e56f8d0f8e18a80"}},{"ruleId":"D2","level":"warning","message":{"text":"profiler.get_model_profile (cognitive 32): profiler.get_model_profile has cognitive complexity 32 (threshold 15). Drivers by points: if/else 15 (28 pts), error handling 1 (2 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":"deepspeed/profiling/flops_profiler/profiler.py"},"region":{"startLine":1196}}}],"partialFingerprints":{"codehealthFindingId/v1":"9de9559c0d4879d294622380def6e60bec19e0c068fa709ab1409400f3dc237c"}},{"ruleId":"D2","level":"warning","message":{"text":"DeepSpeedZeroOptimizer_Stage3.load_hp_checkpoint_state_from_checkpoint_dir_stage3 (cognitive 32): DeepSpeedZeroOptimizer_Stage3.load_hp_checkpoint_state_from_checkpoint_dir_stage3 has cognitive complexity 32 (threshold 15). Drivers by points: if/else 8 (16 pts), loops 10 (16 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":"deepspeed/runtime/zero/stage3.py"},"region":{"startLine":3873}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2dc45c00641c21ce0b9714bf1bf8ee723af5ed0de8bb11eec79f14aea6c79b5"}},{"ruleId":"D2","level":"warning","message":{"text":"_FPDTGPUOffloadingAttentionImpl_.forward (cognitive 32): _FPDTGPUOffloadingAttentionImpl_.forward has cognitive complexity 32 (threshold 15). Drivers by points: if/else 12 (27 pts), loops 2 (3 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":"deepspeed/sequence/fpdt_layer.py"},"region":{"startLine":608}}}],"partialFingerprints":{"codehealthFindingId/v1":"db71923c4dd2e5d440e9b0a4f84e5a5316d293382058ff640301c602c825d74d"}},{"ruleId":"D2","level":"warning","message":{"text":"ZeROOptimizer.load_hp_checkpoint_state_from_checkpoint_dir (cognitive 31): ZeROOptimizer.load_hp_checkpoint_state_from_checkpoint_dir has cognitive complexity 31 (threshold 15). Drivers by points: if/else 7 (15 pts), loops 6 (14 pts), ternaries 1 (2 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":"deepspeed/runtime/base_optimizer.py"},"region":{"startLine":346}}}],"partialFingerprints":{"codehealthFindingId/v1":"1130f430fc84327bc2fee82a33fa9cd56b26f8d92b6d909b862cf20cb44b39e5"}},{"ruleId":"D2","level":"warning","message":{"text":"DeepSpeedEngine.load_module_state_dict (cognitive 31): DeepSpeedEngine.load_module_state_dict has cognitive complexity 31 (threshold 15). Drivers by points: if/else 13 (24 pts), boolean chains 5, 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":"deepspeed/runtime/engine.py"},"region":{"startLine":4350}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ec163ce580072c579da16c346052166419d22bb7a9819b3321ccb8848cb3b35"}},{"ruleId":"D2","level":"warning","message":{"text":"PipelineEngine._exec_recv_grads (cognitive 31): PipelineEngine._exec_recv_grads has cognitive complexity 31 (threshold 15). Drivers by points: if/else 14 (26 pts), boolean chains 3, loops 1 (2 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":"deepspeed/runtime/pipe/engine.py"},"region":{"startLine":1150}}}],"partialFingerprints":{"codehealthFindingId/v1":"96932d9866416632de5e89e69806282b7b56319d5f7ef102cac5c259033bd2e8"}},{"ruleId":"D2","level":"warning","message":{"text":"engine_stage3.update_selected_channels (cognitive 31): engine_stage3.update_selected_channels has cognitive complexity 31 (threshold 15). Drivers by points: if/else 7 (17 pts), loops 5 (7 pts), ternaries 3 (7 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":"deepspeed/runtime/zenflow/engine_stage3.py"},"region":{"startLine":152}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c6c399028519e890f0f6407168ff3d08dc337f3a539a920a601e42bf2d46d3f"}},{"ruleId":"D2","level":"warning","message":{"text":"Init._all_gather (cognitive 31): Init._all_gather has cognitive complexity 31 (threshold 15). Drivers by points: if/else 8 (17 pts), loops 5 (11 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":"deepspeed/runtime/zero/partition_parameters.py"},"region":{"startLine":1734}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8fb5ce1b5438a386a26e6c052e893a4e128f079e92c4c5e63db6e66cce2e663"}},{"ruleId":"D2","level":"warning","message":{"text":"DeepSpeedZeroOptimizer.independent_gradient_partition_epilogue (cognitive 31): DeepSpeedZeroOptimizer.independent_gradient_partition_epilogue has cognitive complexity 31 (threshold 15). Drivers by points: if/else 9 (22 pts), loops 3 (7 pts), boolean chains 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":"deepspeed/runtime/zero/stage_1_and_2.py"},"region":{"startLine":1030}}}],"partialFingerprints":{"codehealthFindingId/v1":"24d0756570e0e9c44ecacc47b27945e9767a8c3aab85e9c21fb7285fc8846582"}},{"ruleId":"D2","level":"warning","message":{"text":"zero_to_fp32._zero2_merge_trainable_params (cognitive 31): zero_to_fp32._zero2_merge_trainable_params has cognitive complexity 31 (threshold 15). Drivers by points: if/else 9 (19 pts), loops 5 (9 pts), ternaries 1 (3 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":"deepspeed/utils/zero_to_fp32.py"},"region":{"startLine":307}}}],"partialFingerprints":{"codehealthFindingId/v1":"668f861227c9948bf4596c877e58d179d9fa197664bc5d192f0ee7af83de4b70"}},{"ruleId":"D2","level":"warning","message":{"text":"offload_activation._eligible_activations (cognitive 30): offload_activation._eligible_activations has cognitive complexity 30 (threshold 15). Drivers by points: if/else 13 (21 pts), ternaries 3 (5 pts), boolean chains 3, 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":"deepspeed/compile/passes/offload_activation.py"},"region":{"startLine":396}}}],"partialFingerprints":{"codehealthFindingId/v1":"bec477e5b4f1d69bbd1abbc62317fe43ea7e69d941607c9bd3b508d2c2da07ba"}},{"ruleId":"D2","level":"warning","message":{"text":"offload_activation._reload_activation_bwd (cognitive 30): offload_activation._reload_activation_bwd has cognitive complexity 30 (threshold 15). Drivers by points: if/else 11 (22 pts), loops 4 (6 pts), ternaries 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":"deepspeed/compile/passes/offload_activation.py"},"region":{"startLine":723}}}],"partialFingerprints":{"codehealthFindingId/v1":"709a11537e13ffc3343205ce1abe447c0a19329187d517a4100972eff4ffa6ea"}},{"ruleId":"D2","level":"warning","message":{"text":"FusedAdam.step (cognitive 30): FusedAdam.step has cognitive complexity 30 (threshold 15). Drivers by points: if/else 12 (25 pts), loops 2 (3 pts), ternaries 1 (2 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":"deepspeed/ops/adam/fused_adam.py"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"fbbd5a18b776315b0d5b0fc5dcc1ea668f9a0ccfded279eff095efed3da9180d"}},{"ruleId":"D2","level":"warning","message":{"text":"DeepSpeedEngine.__init__ (cognitive 30): DeepSpeedEngine.__init__ has cognitive complexity 30 (threshold 15). Drivers by points: if/else 22 (25 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":"deepspeed/runtime/engine.py"},"region":{"startLine":519}}}],"partialFingerprints":{"codehealthFindingId/v1":"fef5342ee6aa964867048ddf92333bdf61f76a736f26cfdb1685840a444e3d61"}},{"ruleId":"D2","level":"warning","message":{"text":"DeepSpeedEngine._muon_param_groups (cognitive 30): DeepSpeedEngine._muon_param_groups has cognitive complexity 30 (threshold 15). Drivers by points: if/else 8 (16 pts), ternaries 3 (8 pts), loops 3 (4 pts), boolean chains 2 (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":"deepspeed/runtime/engine.py"},"region":{"startLine":2498}}}],"partialFingerprints":{"codehealthFindingId/v1":"7015cc5891e8dfd590ed1a5767f7081cb7c2f7d1dec5916ade5d681c28d86d0c"}},{"ruleId":"D2","level":"warning","message":{"text":"PipelineModule._partition_layers (cognitive 30): PipelineModule._partition_layers has cognitive complexity 30 (threshold 15). Drivers by points: if/else 8 (15 pts), error handling 2 (8 pts), loops 3 (7 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":"deepspeed/runtime/pipe/module.py"},"region":{"startLine":395}}}],"partialFingerprints":{"codehealthFindingId/v1":"faa3004c3eb139615f8ebc42512c8d17af80713c27e94e6d881c9f79a3d90677"}},{"ruleId":"D2","level":"warning","message":{"text":"init_utils.merge_tp_model_init_into_config (cognitive 30): init_utils.merge_tp_model_init_into_config has cognitive complexity 30 (threshold 15). Drivers by points: if/else 17 (21 pts), boolean chains 9 (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":"deepspeed/runtime/tensor_parallel/init_utils.py"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"9602b6f4d45fdf7177dd01d0764d67a91bbd4c733af5749717bdc1b7103a0ec7"}},{"ruleId":"D2","level":"warning","message":{"text":"engine_stage3.partition_grads (cognitive 30): engine_stage3.partition_grads has cognitive complexity 30 (threshold 15). Drivers by points: if/else 11 (26 pts), loops 2 (3 pts), boolean chains 1 (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":"deepspeed/runtime/zenflow/engine_stage3.py"},"region":{"startLine":457}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2749c97adcf3510815dcf669fc0987949e6e29715ca55a2a8168e22e82538d5"}},{"ruleId":"D2","level":"warning","message":{"text":"DeepSpeedZeroOptimizer_Stage3._partitioned_buffers_all_gather (cognitive 30): DeepSpeedZeroOptimizer_Stage3._partitioned_buffers_all_gather has cognitive complexity 30 (threshold 15). Drivers by points: loops 10 (20 pts), if/else 5 (6 pts), ternaries 2 (3 pts), boolean chains 1 (nesting depth added 12). 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":"deepspeed/runtime/zero/stage3.py"},"region":{"startLine":2156}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e1a2b8520e1ce0dd23bef257f9b2b47f697cdcb63d2643ca3d3b080572b8955"}},{"ruleId":"D2","level":"warning","message":{"text":"FPQuantizerBuilder.is_compatible (cognitive 30): FPQuantizerBuilder.is_compatible has cognitive complexity 30 (threshold 15). Drivers by points: if/else 8 (24 pts), boolean chains 5, error handling 1 (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":"op_builder/fp_quantizer.py"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"366668fab43f2b6ef0ed09b76ed3e60100fd8eae8f1616a408cfe9acd94dabc5"}},{"ruleId":"D2","level":"warning","message":{"text":"InferenceCoreBuilder.is_compatible (cognitive 30): InferenceCoreBuilder.is_compatible has cognitive complexity 30 (threshold 15). Drivers by points: if/else 8 (24 pts), boolean chains 5, error handling 1 (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":"op_builder/inference_core_ops.py"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"5245359be418edb1433a0d3a8dbab90c48c71e320d60972b150c2f4317f66b4c"}},{"ruleId":"D2","level":"warning","message":{"text":"InferenceCutlassBuilder.is_compatible (cognitive 30): InferenceCutlassBuilder.is_compatible has cognitive complexity 30 (threshold 15). Drivers by points: if/else 8 (24 pts), boolean chains 5, error handling 1 (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":"op_builder/inference_cutlass_builder.py"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"e61b6b3c548b34cb20a4845ac697b8f8b37325201f4c4c2d85cdfa8394913580"}},{"ruleId":"D2","level":"warning","message":{"text":"RaggedOpsBuilder.is_compatible (cognitive 30): RaggedOpsBuilder.is_compatible has cognitive complexity 30 (threshold 15). Drivers by points: if/else 8 (24 pts), boolean chains 5, error handling 1 (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":"op_builder/ragged_ops.py"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"24c94af51d124a9587629e8ae997f47060c671547e685a034c9544529364a33c"}},{"ruleId":"D2","level":"warning","message":{"text":"RaggedUtilsBuilder.is_compatible (cognitive 30): RaggedUtilsBuilder.is_compatible has cognitive complexity 30 (threshold 15). Drivers by points: if/else 8 (24 pts), boolean chains 5, error handling 1 (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":"op_builder/ragged_utils.py"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"5048e32c5ca574cdf4190db5749e7c8a837d3b59a6d019aac2166eb1a158abf6"}},{"ruleId":"D2","level":"warning","message":{"text":"InferenceBuilder.is_compatible (cognitive 30): InferenceBuilder.is_compatible has cognitive complexity 30 (threshold 15). Drivers by points: if/else 8 (24 pts), boolean chains 5, error handling 1 (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":"op_builder/transformer_inference.py"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6142b54e51b57bd77c8bebb8c7a6cd3f9b6cbf2db15556130190cfcd7237a36"}},{"ruleId":"D2","level":"warning","message":{"text":"ProfilingInterpreter.run_node (cognitive 29): ProfilingInterpreter.run_node has cognitive complexity 29 (threshold 15). Drivers by points: if/else 16 (23 pts), ternaries 3, boolean chains 2, error handling 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":"deepspeed/compile/profilers/graph_profile.py"},"region":{"startLine":256}}}],"partialFingerprints":{"codehealthFindingId/v1":"d738433cd2de42aa71e07a00fd732bfbab28e85bceb4dcd847ec13346bc5f382"}},{"ruleId":"D2","level":"warning","message":{"text":"DeepSpeedEngine._cast_module_mixed_precision (cognitive 29): DeepSpeedEngine._cast_module_mixed_precision has cognitive complexity 29 (threshold 15). Drivers by points: if/else 10 (20 pts), boolean chains 5, 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":"deepspeed/runtime/engine.py"},"region":{"startLine":1885}}}],"partialFingerprints":{"codehealthFindingId/v1":"19fedb7ab531a706a532a10975a2b8c6a35f9a81f772b30d26b68db20cfe4d82"}},{"ruleId":"D2","level":"warning","message":{"text":"PipelineEngine.__init__ (cognitive 29): PipelineEngine.__init__ has cognitive complexity 29 (threshold 15). Drivers by points: if/else 18 (25 pts), boolean chains 2, 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":"deepspeed/runtime/pipe/engine.py"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"d90482bf6041d4d77cf81b893afee15532f08490e2de19c34c48fe6ebf296d6c"}},{"ruleId":"D2","level":"warning","message":{"text":"DeepSpeedZeroOptimizer_Stage3.reload_states (cognitive 29): DeepSpeedZeroOptimizer_Stage3.reload_states has cognitive complexity 29 (threshold 15). Drivers by points: if/else 11 (15 pts), loops 5 (12 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":"deepspeed/runtime/zero/stage3.py"},"region":{"startLine":4208}}}],"partialFingerprints":{"codehealthFindingId/v1":"71e8e9b868d42e397c72b74df73e7fc58bb227b7178a706c29220e7f129cc62f"}},{"ruleId":"D2","level":"warning","message":{"text":"DeepSpeedZeroOptimizer.reduce_independent_p_g_buckets_and_remove_grads (cognitive 29): DeepSpeedZeroOptimizer.reduce_independent_p_g_buckets_and_remove_grads has cognitive complexity 29 (threshold 15). Drivers by points: if/else 11 (19 pts), ternaries 2 (6 pts), boolean chains 4 (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":"deepspeed/runtime/zero/stage_1_and_2.py"},"region":{"startLine":1521}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb93937b6144d1cb6e79785a032412a466ef28201d89dcecb7a786cc5d355cb0"}},{"ruleId":"D2","level":"warning","message":{"text":"DeepSpeedZeroOptimizer._load_legacy_checkpoint (cognitive 29): DeepSpeedZeroOptimizer._load_legacy_checkpoint has cognitive complexity 29 (threshold 15). Drivers by points: if/else 11 (13 pts), boolean chains 9, ternaries 2 (4 pts), loops 1 (3 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":"deepspeed/runtime/zero/stage_1_and_2.py"},"region":{"startLine":3799}}}],"partialFingerprints":{"codehealthFindingId/v1":"b98321548ada06dc57222289665e6b81a62242971c557be7ffa4a9d822e7433d"}},{"ruleId":"D2","level":"warning","message":{"text":"ParamAffineMap.rebuild (cognitive 28): ParamAffineMap.rebuild has cognitive complexity 28 (threshold 15). Drivers by points: if/else 7 (20 pts), loops 3 (4 pts), ternaries 1 (3 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":"deepspeed/checkpoint/affine.py"},"region":{"startLine":364}}}],"partialFingerprints":{"codehealthFindingId/v1":"46faf54b5328433c633f7ac81cc1f3fb20a8cf645d2e00a71be7f6d805b909de"}},{"ruleId":"D2","level":"warning","message":{"text":"FusedLion.step (cognitive 28): FusedLion.step has cognitive complexity 28 (threshold 15). Drivers by points: if/else 12 (25 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":"deepspeed/ops/lion/fused_lion.py"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"c55809f8444089aa8ee2ac857b32274d07ffe8668a494221398afa202c814dcb"}},{"ruleId":"D2","level":"warning","message":{"text":"fused_rotary_pos_emb.assert_supported (cognitive 28): fused_rotary_pos_emb.assert_supported has cognitive complexity 28 (threshold 15). Drivers by points: if/else 14 (20 pts), boolean chains 5, loops 2, 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":"deepspeed/ops/triton_ops/fused_rotary_pos_emb.py"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"83d02199ebfa6bb9dd7055b73e46d47eaf41fe1ce645055236aa569bfc2852bc"}},{"ruleId":"D2","level":"warning","message":{"text":"DeepSpeedEngine._take_model_step (cognitive 28): DeepSpeedEngine._take_model_step has cognitive complexity 28 (threshold 15). Drivers by points: if/else 16 (20 pts), boolean chains 4, error handling 1 (2 pts), ternaries 1 (2 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":"deepspeed/runtime/engine.py"},"region":{"startLine":3588}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc134a91362d5935be457c0707937fdb4b55d5987f699923ca8bea17dd6204de"}},{"ruleId":"D2","level":"warning","message":{"text":"DeepSpeedEngine.load_checkpoint (cognitive 28): DeepSpeedEngine.load_checkpoint has cognitive complexity 28 (threshold 15). Drivers by points: if/else 11 (14 pts), boolean chains 7, ternaries 2 (4 pts), loops 1 (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":"deepspeed/runtime/engine.py"},"region":{"startLine":4477}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d4a1b6ab92af41ee60f53aa4692655f16447cc766aef1e24d4eb5928a6b616e"}},{"ruleId":"D2","level":"warning","message":{"text":"Init._allgather_params_sequential (cognitive 28): Init._allgather_params_sequential has cognitive complexity 28 (threshold 15). Drivers by points: if/else 9 (20 pts), loops 3 (8 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":"deepspeed/runtime/zero/partition_parameters.py"},"region":{"startLine":2108}}}],"partialFingerprints":{"codehealthFindingId/v1":"c83e8edcaccb0741c07da134a42765a53b0b0c34ef06a0c83315abb8f557b2f7"}},{"ruleId":"D2","level":"warning","message":{"text":"DeepSpeedZeroOptimizer_Stage3.initialize_optimizer_states (cognitive 28): DeepSpeedZeroOptimizer_Stage3.initialize_optimizer_states has cognitive complexity 28 (threshold 15). Drivers by points: if/else 12 (23 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":"deepspeed/runtime/zero/stage3.py"},"region":{"startLine":1369}}}],"partialFingerprints":{"codehealthFindingId/v1":"965672bb47d0df51b87de6bc9e7333e893e0658aad8b6a47935711691398d14b"}},{"ruleId":"D2","level":"warning","message":{"text":"z3_leaf_module.apply_zero_leaf_module_config (cognitive 28): z3_leaf_module.apply_zero_leaf_module_config has cognitive complexity 28 (threshold 15). Drivers by points: if/else 10 (18 pts), loops 3 (6 pts), boolean chains 4 (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":"deepspeed/utils/z3_leaf_module.py"},"region":{"startLine":182}}}],"partialFingerprints":{"codehealthFindingId/v1":"d71eb6d86c9bcd582ba4af276773c3301307e91c591b59901e095f38f63c13dc"}},{"ruleId":"D2","level":"warning","message":{"text":"deepspeed.set_optimizer_flags (cognitive 27): deepspeed.set_optimizer_flags has cognitive complexity 27 (threshold 15). Drivers by points: if/else 7 (15 pts), ternaries 3 (7 pts), boolean chains 3, loops 1 (2 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":"deepspeed/__init__.py"},"region":{"startLine":357}}}],"partialFingerprints":{"codehealthFindingId/v1":"52d96637defc81e9adab24f31f62dba4521e99f70918d0876ba11fabe0b66d51"}},{"ruleId":"D2","level":"warning","message":{"text":"AutoTP.tp_parser (cognitive 27): AutoTP.tp_parser has cognitive complexity 27 (threshold 15). Drivers by points: if/else 5 (13 pts), boolean chains 7, loops 3 (5 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":"deepspeed/module_inject/auto_tp.py"},"region":{"startLine":343}}}],"partialFingerprints":{"codehealthFindingId/v1":"e19a145163a8ba1967852cd3c8b9269a876b8d2a5d809eb6943af5191baf145b"}},{"ruleId":"D2","level":"warning","message":{"text":"DeepSpeedTransformerFunction.forward (cognitive 27): DeepSpeedTransformerFunction.forward has cognitive complexity 27 (threshold 15). Drivers by points: if/else 12 (17 pts), boolean chains 4, loops 2 (4 pts), ternaries 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":"deepspeed/ops/transformer/transformer.py"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e43a71173a4d7b6ee4b34d4afb47e3892cf890271516f9ef2cfc73747d143ca"}},{"ruleId":"D2","level":"warning","message":{"text":"FP16_Optimizer._update_scale (cognitive 27): FP16_Optimizer._update_scale has cognitive complexity 27 (threshold 15). Drivers by points: if/else 11 (26 pts), boolean chains 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":"deepspeed/runtime/fp16/fused_optimizer.py"},"region":{"startLine":404}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd8295b62e22069854e5f185dadac8ecf3e3a07636eb2d5af4511c385dd7497a"}},{"ruleId":"D2","level":"warning","message":{"text":"FP16_UnfusedOptimizer._update_scale (cognitive 27): FP16_UnfusedOptimizer._update_scale has cognitive complexity 27 (threshold 15). Drivers by points: if/else 11 (26 pts), boolean chains 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":"deepspeed/runtime/fp16/unfused_optimizer.py"},"region":{"startLine":277}}}],"partialFingerprints":{"codehealthFindingId/v1":"d88d54b5e688128dcfd767c8ad498da5322ff8005ef4e521ef05c131fcd7793d"}},{"ruleId":"D2","level":"warning","message":{"text":"SingleDeviceMuonWithAuxAdam.step (cognitive 27): SingleDeviceMuonWithAuxAdam.step has cognitive complexity 27 (threshold 15). Drivers by points: if/else 7 (20 pts), loops 3 (7 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":"deepspeed/runtime/zero/muon/original_muon.py"},"region":{"startLine":478}}}],"partialFingerprints":{"codehealthFindingId/v1":"74d8aa467a1449ddf905fa0bcb94c5ce3789425e0793047b5704b5439d96621b"}},{"ruleId":"D2","level":"warning","message":{"text":"CUDA_Accelerator._lazy_init_class_dict (cognitive 26): CUDA_Accelerator._lazy_init_class_dict has cognitive complexity 26 (threshold 15). Drivers by points: if/else 5 (16 pts), loops 3 (8 pts), boolean chains 2 (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":"accelerator/cuda_accelerator.py"},"region":{"startLine":367}}}],"partialFingerprints":{"codehealthFindingId/v1":"8bccb42f983e3c3ee3ce873ae5425052ca1b3d115594328165a622976b15173d"}},{"ruleId":"D2","level":"warning","message":{"text":"torch_latest.load_aws_config (cognitive 26): torch_latest.load_aws_config has cognitive complexity 26 (threshold 15). Drivers by points: if/else 9 (15 pts), boolean chains 9, error handling 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":"ci/torch_latest.py"},"region":{"startLine":815}}}],"partialFingerprints":{"codehealthFindingId/v1":"b162a111688ac53ec0426da568c84bfb8d6175bbcc7a4f19adfa66ddaa44bee9"}},{"ruleId":"D2","level":"warning","message":{"text":"Autotuner.tune_space (cognitive 26): Autotuner.tune_space has cognitive complexity 26 (threshold 15). Drivers by points: if/else 14 (17 pts), ternaries 5 (6 pts), boolean chains 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, 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":"deepspeed/autotuning/autotuner.py"},"region":{"startLine":523}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e62c7740612d1978b708c6cab2f3e93a1782ee441743a505640fc5cd4c61a17"}},{"ruleId":"D2","level":"warning","message":{"text":"auto_ep._detect_forward_contract (cognitive 26): auto_ep._detect_forward_contract has cognitive complexity 26 (threshold 15). Drivers by points: if/else 8 (19 pts), loops 2 (7 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":"deepspeed/module_inject/auto_ep.py"},"region":{"startLine":348}}}],"partialFingerprints":{"codehealthFindingId/v1":"e98d59a57738f00e07127e52f03af83a2a5bc05fbae5a715cb05df7dab2156b3"}},{"ruleId":"D2","level":"warning","message":{"text":"AutoTP._replace (cognitive 26): AutoTP._replace has cognitive complexity 26 (threshold 15). Drivers by points: if/else 14 (17 pts), boolean chains 9 (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":"deepspeed/module_inject/auto_tp.py"},"region":{"startLine":414}}}],"partialFingerprints":{"codehealthFindingId/v1":"626ec056c6899ed22927dc2bc4d9c2b6d1b1183ac4798e49d1005c2b40ac65ba"}},{"ruleId":"D2","level":"warning","message":{"text":"policy.maybe_copy (cognitive 26): policy.maybe_copy has cognitive complexity 26 (threshold 15). Drivers by points: if/else 8 (18 pts), ternaries 2 (6 pts), boolean chains 2 (nesting depth added 14). 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":"deepspeed/module_inject/policy.py"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"f15bfa91c305fe64bdddc6928d7016450174e7c49baf4644ae5503590f1a9581"}},{"ruleId":"D2","level":"warning","message":{"text":"SuperOffloadOptimizer_Stage3.partition_grads (cognitive 26): SuperOffloadOptimizer_Stage3.partition_grads has cognitive complexity 26 (threshold 15). Drivers by points: if/else 9 (20 pts), loops 3 (4 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":"deepspeed/runtime/superoffload/superoffload_stage3.py"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e9871e82aec95ca06aed4becd870d1f01a9dbc9b25dbe9a7e9d4987fda7cdb3"}},{"ruleId":"D2","level":"warning","message":{"text":"DeepSpeedZeroOptimizer.get_grad_norm_direct (cognitive 26): DeepSpeedZeroOptimizer.get_grad_norm_direct has cognitive complexity 26 (threshold 15). Drivers by points: if/else 12 (20 pts), loops 2 (4 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":"deepspeed/runtime/zero/stage_1_and_2.py"},"region":{"startLine":2724}}}],"partialFingerprints":{"codehealthFindingId/v1":"2454bcd304502c11a96b1acf8b0df22ff6d690d9deb605121ac6ffa493dcc257"}},{"ruleId":"D2","level":"warning","message":{"text":"DeepSpeedZeroOptimizer._clear_hp_buffer_references (cognitive 26): DeepSpeedZeroOptimizer._clear_hp_buffer_references has cognitive complexity 26 (threshold 15). Drivers by points: if/else 6 (17 pts), loops 4 (6 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":"deepspeed/runtime/zero/stage_1_and_2.py"},"region":{"startLine":3913}}}],"partialFingerprints":{"codehealthFindingId/v1":"abaac986843be9a87f4e8d02a0046958cd9872d782fe0bbfbab687ca119a1aef"}},{"ruleId":"D2","level":"warning","message":{"text":"cross_entropy.vocab_parallel_cross_entropy (cognitive 26): cross_entropy.vocab_parallel_cross_entropy has cognitive complexity 26 (threshold 15). Drivers by points: if/else 18 (23 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":"deepspeed/sequence/cross_entropy.py"},"region":{"startLine":198}}}],"partialFingerprints":{"codehealthFindingId/v1":"f11f963e71bb13365d59a62f226dc30291415181e64f548f29109e08dae558bf"}},{"ruleId":"D2","level":"warning","message":{"text":"mixed_precision_linkage._init_lp_to_hp_mapping (cognitive 26): mixed_precision_linkage._init_lp_to_hp_mapping has cognitive complexity 26 (threshold 15). Drivers by points: if/else 9 (20 pts), boolean chains 3, 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":"deepspeed/utils/mixed_precision_linkage.py"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7ab2b9d4875837cfd2750fab8c1086244ee1f8d72cb75b9bbc78f356f15fda4"}},{"ruleId":"D2","level":"warning","message":{"text":"affine.segmented_map (cognitive 25): affine.segmented_map has cognitive complexity 25 (threshold 15). Drivers by points: ternaries 4 (12 pts), loops 6 (8 pts), if/else 2 (4 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":"deepspeed/checkpoint/affine.py"},"region":{"startLine":694}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3d9935e358019d37517583aab8c7c6c2c027aadc414d40791fbd939f1a1ce8f"}},{"ruleId":"D2","level":"warning","message":{"text":"InputStorage._materialize_value (cognitive 25): InputStorage._materialize_value has cognitive complexity 25 (threshold 15). Drivers by points: error handling 4 (12 pts), if/else 5 (9 pts), boolean chains 2, ternaries 1 (2 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":"deepspeed/compile/input_storage.py"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"27c095d5f4b8f2cbfdf8ae434bfd565a3f120edda99f2207718b94ae069cf80f"}},{"ruleId":"D2","level":"warning","message":{"text":"AutoEPMoELayer._forward (cognitive 25): AutoEPMoELayer._forward has cognitive complexity 25 (threshold 15). Drivers by points: if/else 15 (18 pts), boolean chains 5, 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":"deepspeed/module_inject/auto_ep_layer.py"},"region":{"startLine":1089}}}],"partialFingerprints":{"codehealthFindingId/v1":"1033f93f0b57e22d8302dade366ae4b1fecc74f846f3afb7a028540d95259f6d"}},{"ruleId":"D2","level":"warning","message":{"text":"FlopsProfiler.print_model_profile (cognitive 25): FlopsProfiler.print_model_profile has cognitive complexity 25 (threshold 15). Drivers by points: if/else 14 (18 pts), ternaries 2 (4 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":"deepspeed/profiling/flops_profiler/profiler.py"},"region":{"startLine":286}}}],"partialFingerprints":{"codehealthFindingId/v1":"d42bf5500b6ef3517688ab4c656c00b13c259228ab96a4f2b96469c46214eb84"}},{"ruleId":"D2","level":"warning","message":{"text":"CheckpointFunction.backward (cognitive 25): CheckpointFunction.backward has cognitive complexity 25 (threshold 15). Drivers by points: if/else 13 (16 pts), loops 4 (5 pts), boolean chains 2, ternaries 1 (2 pts) (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":"deepspeed/runtime/activation_checkpointing/checkpointing.py"},"region":{"startLine":666}}}],"partialFingerprints":{"codehealthFindingId/v1":"875355c70bcaa00737f23eb2dff35bea954f1f9f797337c49d54701a5598572c"}},{"ruleId":"D2","level":"warning","message":{"text":"DataAnalyzer.update_metric_results (cognitive 25): DataAnalyzer.update_metric_results has cognitive complexity 25 (threshold 15). Drivers by points: if/else 6 (16 pts), loops 3 (7 pts), boolean chains 2 (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":"deepspeed/runtime/data_pipeline/data_sampling/data_analyzer.py"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"50a0ce82a53c05c9a907624770959265f17912993d69feaf5b7c6effeb80ff51"}},{"ruleId":"D2","level":"warning","message":{"text":"DeepSpeedHybridEngine.eval (cognitive 25): DeepSpeedHybridEngine.eval has cognitive complexity 25 (threshold 15). Drivers by points: if/else 11 (17 pts), loops 2 (5 pts), boolean chains 3 (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":"deepspeed/runtime/hybrid_engine.py"},"region":{"startLine":453}}}],"partialFingerprints":{"codehealthFindingId/v1":"65e45aa6bd4d5c0c4eb0ca0a599e85f8c4ffeba509b99b5e762742c6ed5371f8"}},{"ruleId":"D2","level":"warning","message":{"text":"PipelineEngine._exec_backward_pass (cognitive 25): PipelineEngine._exec_backward_pass has cognitive complexity 25 (threshold 15). Drivers by points: if/else 15 (21 pts), boolean chains 2, loops 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":"deepspeed/runtime/pipe/engine.py"},"region":{"startLine":791}}}],"partialFingerprints":{"codehealthFindingId/v1":"21767e090ad7f86ff8ad404d4709f8ae564f2d45dfe35e14cd6ec9e010b3fb59"}},{"ruleId":"D2","level":"warning","message":{"text":"SequenceTiledCompute.backward (cognitive 25): SequenceTiledCompute.backward has cognitive complexity 25 (threshold 15). Drivers by points: if/else 10 (16 pts), loops 3 (9 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":"deepspeed/runtime/sequence_parallel/ulysses_sp.py"},"region":{"startLine":857}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef7b006706558f8131d4fdcfb4ed27851ade822bb709e38409da7b60b89c648f"}},{"ruleId":"D2","level":"warning","message":{"text":"DeepSpeedZeroOptimizer.copy_grads_in_partition (cognitive 25): DeepSpeedZeroOptimizer.copy_grads_in_partition has cognitive complexity 25 (threshold 15). Drivers by points: if/else 12 (18 pts), loops 2 (5 pts), boolean chains 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":"deepspeed/runtime/zero/stage_1_and_2.py"},"region":{"startLine":2225}}}],"partialFingerprints":{"codehealthFindingId/v1":"416a97141ce393a6f2d5541b048bc65372ee45340ffea32b05bc4dc8daf6e5b4"}},{"ruleId":"D2","level":"warning","message":{"text":"HPU_Accelerator._lazy_init_class_dict (cognitive 24): HPU_Accelerator._lazy_init_class_dict has cognitive complexity 24 (threshold 15). Drivers by points: if/else 5 (16 pts), loops 2 (6 pts), boolean chains 2 (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":"accelerator/hpu_accelerator.py"},"region":{"startLine":263}}}],"partialFingerprints":{"codehealthFindingId/v1":"e58a1da029b76859f7873bfe51ad8b99ca4f81e6800727e6298e47242dd3d085"}},{"ruleId":"D2","level":"warning","message":{"text":"torch_latest.acquire_aws_instance (cognitive 24): torch_latest.acquire_aws_instance has cognitive complexity 24 (threshold 15). Drivers by points: error handling 3 (10 pts), if/else 3 (10 pts), loops 2 (3 pts), boolean chains 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":"ci/torch_latest.py"},"region":{"startLine":916}}}],"partialFingerprints":{"codehealthFindingId/v1":"9554411ae8fd1d01616caa98d86a785e1ead00e4e5a117f15a6b5606ecf15d80"}},{"ruleId":"D2","level":"warning","message":{"text":"affine_transfer._validate_holders (cognitive 24): affine_transfer._validate_holders has cognitive complexity 24 (threshold 15). Drivers by points: if/else 5 (13 pts), loops 6 (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":"deepspeed/checkpoint/affine_transfer.py"},"region":{"startLine":362}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5aae7140cd6431ee0527d984c06d820d568bdde7dd96237e29292670677f77d"}},{"ruleId":"D2","level":"warning","message":{"text":"affine_transfer._coalesce (cognitive 24): affine_transfer._coalesce has cognitive complexity 24 (threshold 15). Drivers by points: if/else 3 (13 pts), loops 5 (11 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":"deepspeed/checkpoint/affine_transfer.py"},"region":{"startLine":831}}}],"partialFingerprints":{"codehealthFindingId/v1":"877ab7ce5eeb02441942be6c142c399ca35c53663f4cc94bf1cde40a5942e58d"}},{"ruleId":"D2","level":"warning","message":{"text":"affine_transfer_executor._validate_buffers (cognitive 24): affine_transfer_executor._validate_buffers has cognitive complexity 24 (threshold 15). Drivers by points: if/else 6 (18 pts), loops 4 (6 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":"deepspeed/checkpoint/affine_transfer_executor.py"},"region":{"startLine":213}}}],"partialFingerprints":{"codehealthFindingId/v1":"d644fbfc6c496f36755472414d1b5c24fa5c5eeb4100cbcf57b80b45a478101f"}},{"ruleId":"D2","level":"warning","message":{"text":"autoep_affine.validate_autoep_placement_descriptor (cognitive 24): autoep_affine.validate_autoep_placement_descriptor has cognitive complexity 24 (threshold 15). Drivers by points: if/else 11 (19 pts), loops 2 (3 pts), boolean chains 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":"deepspeed/checkpoint/autoep_affine.py"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"80f58db199018f6fdec25bc70ed9398a6992e823decbcdbd7dbfa3a3c9d14299"}},{"ruleId":"D2","level":"warning","message":{"text":"sp_compile.pass_insert_attention_all_to_all (cognitive 24): sp_compile.pass_insert_attention_all_to_all has cognitive complexity 24 (threshold 15). Drivers by points: if/else 6 (15 pts), ternaries 2 (5 pts), loops 2 (3 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":"deepspeed/compile/passes/sp_compile.py"},"region":{"startLine":224}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ddc105d6a873bb4b174321bfbc6fb1638f26ebe83a14966f3af9983caf79c34"}},{"ruleId":"D2","level":"warning","message":{"text":"InferenceEngine._load_checkpoint (cognitive 24): InferenceEngine._load_checkpoint has cognitive complexity 24 (threshold 15). Drivers by points: if/else 10 (18 pts), boolean chains 2, loops 1 (2 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":"deepspeed/inference/engine.py"},"region":{"startLine":444}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f594f1620d0a03c5b508d0b871ae282bf19553e1edf65fc1f02a822e0d2bab8"}},{"ruleId":"D2","level":"warning","message":{"text":"qkv.shard_qkv_param (cognitive 24): qkv.shard_qkv_param has cognitive complexity 24 (threshold 15). Drivers by points: if/else 15 (21 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":"deepspeed/inference/v2/model_implementations/sharding/qkv.py"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a6df9bacacb1c59e38a598b285a5b6727fae5fa5db1401a31e8fe7923c41887"}},{"ruleId":"D2","level":"warning","message":{"text":"DeepSpeedTransformerInference.forward (cognitive 24): DeepSpeedTransformerInference.forward has cognitive complexity 24 (threshold 15). Drivers by points: if/else 10, ternaries 7 (9 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":"deepspeed/model_implementations/transformers/ds_transformer.py"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"6242ba11fa3cecc26770459aaf40bed8540d7bc32a757b3d6785dec4cc5c6fd3"}},{"ruleId":"D2","level":"warning","message":{"text":"replace_module._replace_module (cognitive 24): replace_module._replace_module has cognitive complexity 24 (threshold 15). Drivers by points: if/else 7 (17 pts), boolean chains 3, ternaries 1 (3 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":"deepspeed/module_inject/replace_module.py"},"region":{"startLine":676}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0b90c54dd55d848e002a7539891fa696b9bb848945a0b844fd9e36cef4bbcac"}},{"ruleId":"D2","level":"warning","message":{"text":"BF16_Optimizer._build_muon_exchange_layout (cognitive 24): BF16_Optimizer._build_muon_exchange_layout has cognitive complexity 24 (threshold 15). Drivers by points: if/else 5 (14 pts), loops 6 (8 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":"deepspeed/runtime/bf16_optimizer.py"},"region":{"startLine":244}}}],"partialFingerprints":{"codehealthFindingId/v1":"648f4ae37c4545df9b17bf35bcdb3c6d65bdc4e9c0da790023034046c23db761"}},{"ruleId":"D2","level":"warning","message":{"text":"compiler.compile_autoep_non_moe_regions (cognitive 24): compiler.compile_autoep_non_moe_regions has cognitive complexity 24 (threshold 15). Drivers by points: if/else 9 (14 pts), loops 5 (7 pts), boolean chains 2, error handling 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":"deepspeed/runtime/compiler.py"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"0288ef951cc7ffc14d28483f426bbab4740415e00fc108dba6f079ab3e6d1b31"}},{"ruleId":"D2","level":"warning","message":{"text":"DeepSpeedEngine._get_non_moe_state_dict (cognitive 24): DeepSpeedEngine._get_non_moe_state_dict has cognitive complexity 24 (threshold 15). Drivers by points: if/else 3 (10 pts), loops 4 (8 pts), boolean chains 3, ternaries 1 (2 pts), error handling 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":"deepspeed/runtime/engine.py"},"region":{"startLine":5090}}}],"partialFingerprints":{"codehealthFindingId/v1":"e921e4250d20fe81774cf91982dda2e7c1dda5161b17b8a1f70cb36dc42afc05"}},{"ruleId":"D2","level":"warning","message":{"text":"utils.filter_empty_parameters (cognitive 24): utils.filter_empty_parameters has cognitive complexity 24 (threshold 15). Drivers by points: if/else 8 (18 pts), loops 2 (5 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":"deepspeed/runtime/utils.py"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"95a5a330c23a89095687bf0159c711c9fae72c6133c936c7e86ed17a737417fb"}},{"ruleId":"D2","level":"warning","message":{"text":"PartitionedParameterCoordinator.__all_gather_params_ (cognitive 24): PartitionedParameterCoordinator.__all_gather_params_ has cognitive complexity 24 (threshold 15). Drivers by points: if/else 7 (14 pts), loops 3 (6 pts), ternaries 1 (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":"deepspeed/runtime/zero/partitioned_param_coordinator.py"},"region":{"startLine":582}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d9c352965384336575af1c4b566355b093376165373e1ac4c9003cc9a2b4508"}},{"ruleId":"D2","level":"warning","message":{"text":"DeepSpeedZeroOptimizer_Stage3.step (cognitive 24): DeepSpeedZeroOptimizer_Stage3.step has cognitive complexity 24 (threshold 15). Drivers by points: if/else 14 (22 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":"deepspeed/runtime/zero/stage3.py"},"region":{"startLine":3051}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca61a1dc7a68de152e0a8a2c25498c254a23cc6c514d184a58582648f3157200"}},{"ruleId":"D2","level":"warning","message":{"text":"Autotuner.print_tuning_results (cognitive 23): Autotuner.print_tuning_results has cognitive complexity 23 (threshold 15). Drivers by points: if/else 8 (17 pts), loops 2 (6 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":"deepspeed/autotuning/autotuner.py"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9a641c018ccaa1bfe94e891be54c7295a9508b87e23dd7698580035f8dbb8d0"}},{"ruleId":"D2","level":"warning","message":{"text":"sp_compile.pass_propagate_shapes (cognitive 23): sp_compile.pass_propagate_shapes has cognitive complexity 23 (threshold 15). Drivers by points: if/else 8 (16 pts), loops 4, 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":"deepspeed/compile/passes/sp_compile.py"},"region":{"startLine":285}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f6bde0bc4badbadf2c6364dcf43fff1418b5ccc8bc7191f83860c4ad76be785"}},{"ruleId":"D2","level":"warning","message":{"text":"superoffload_utils.superoffload_optimizer_worker (cognitive 23): superoffload_utils.superoffload_optimizer_worker has cognitive complexity 23 (threshold 15). Drivers by points: if/else 9 (14 pts), error handling 3 (5 pts), loops 2, ternaries 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":"deepspeed/runtime/superoffload/superoffload_utils.py"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"78db731271c321c35ea4706566973202a66f35cae499310f2167e6e6a8d70929"}},{"ruleId":"D2","level":"warning","message":{"text":"original_muon.zeropower_via_gram_newtonschulz (cognitive 23): original_muon.zeropower_via_gram_newtonschulz has cognitive complexity 23 (threshold 15). Drivers by points: if/else 11 (17 pts), loops 2 (3 pts), boolean chains 2, 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":"deepspeed/runtime/zero/muon/original_muon.py"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"a90b691cdd8f964ddd05321ea20e86a2c0370ec3c5c0cee602535d31d332cdb6"}},{"ruleId":"D2","level":"warning","message":{"text":"torch_latest._emit_ssm_output (cognitive 22): torch_latest._emit_ssm_output has cognitive complexity 22 (threshold 15). Drivers by points: if/else 5 (14 pts), loops 3 (6 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":"ci/torch_latest.py"},"region":{"startLine":1348}}}],"partialFingerprints":{"codehealthFindingId/v1":"485b953cd05941ad55cc47e3b8eff4d8f3986e5221526cce6f8955ca63f982c7"}},{"ruleId":"D2","level":"warning","message":{"text":"affine._nest_replicated_block (cognitive 22): affine._nest_replicated_block has cognitive complexity 22 (threshold 15). Drivers by points: loops 7 (14 pts), if/else 3 (8 pts) (nesting depth added 12). 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":"deepspeed/checkpoint/affine.py"},"region":{"startLine":880}}}],"partialFingerprints":{"codehealthFindingId/v1":"d59ec2a7584b7ecc2732e0f45118d32083f9e0ca1448a9c720cffa05f6aab974"}},{"ruleId":"D2","level":"warning","message":{"text":"reshape_3d_utils.get_model_3d_descriptor_from_metadata (cognitive 22): reshape_3d_utils.get_model_3d_descriptor_from_metadata has cognitive complexity 22 (threshold 15). Drivers by points: if/else 10 (18 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":"deepspeed/checkpoint/reshape_3d_utils.py"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a999e1b4ebcabd9455ed5881766fe6ca82361e7d3381ca17510b1a966e70bf4"}},{"ruleId":"D2","level":"warning","message":{"text":"universal_checkpoint._resolve_autoep_partition (cognitive 22): universal_checkpoint._resolve_autoep_partition has cognitive complexity 22 (threshold 15). Drivers by points: if/else 13 (14 pts), boolean chains 4, ternaries 2 (3 pts), error handling 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"deepspeed/checkpoint/universal_checkpoint.py"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"0165e6fa93280a58368996e1c62713b35d0e824ac9c82bddda94dec1b15cbcd7"}},{"ruleId":"D2","level":"warning","message":{"text":"InferenceEngine._create_ep_parallel_group (cognitive 22): InferenceEngine._create_ep_parallel_group has cognitive complexity 22 (threshold 15). Drivers by points: if/else 4 (11 pts), loops 4 (7 pts), ternaries 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":"deepspeed/inference/engine.py"},"region":{"startLine":291}}}],"partialFingerprints":{"codehealthFindingId/v1":"bfb0855ebebda362c369657b083dc090f32d731a8ec43aa40ffe0fe337c7f0c8"}},{"ruleId":"D2","level":"warning","message":{"text":"attn.get_local_heads (cognitive 22): attn.get_local_heads has cognitive complexity 22 (threshold 15). Drivers by points: if/else 12 (19 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":"deepspeed/inference/v2/model_implementations/sharding/attn.py"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"7913245d8026f9585e6007c41fc9214a0312db7adfd3fd903f96c8648dbf553d"}},{"ruleId":"D2","level":"warning","message":{"text":"MOELayer.forward (cognitive 22): MOELayer.forward has cognitive complexity 22 (threshold 15). Drivers by points: if/else 19 (20 pts), boolean chains 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":"deepspeed/moe/sharded_moe.py"},"region":{"startLine":649}}}],"partialFingerprints":{"codehealthFindingId/v1":"76f806d4900525fde7f238ea473b0eabe2522439daf30e9f40ae810b4f1eb69f"}},{"ruleId":"D2","level":"warning","message":{"text":"CheckpointFunction.forward (cognitive 22): CheckpointFunction.forward has cognitive complexity 22 (threshold 15). Drivers by points: if/else 13 (14 pts), boolean chains 5, ternaries 2 (3 pts) (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":"deepspeed/runtime/activation_checkpointing/checkpointing.py"},"region":{"startLine":579}}}],"partialFingerprints":{"codehealthFindingId/v1":"76d81569d4c2bdfd43cf646be0c7c0b4760125585fb6566e453fe0cebf2c0714"}},{"ruleId":"D2","level":"warning","message":{"text":"BF16_Optimizer._prepare_muon_updates (cognitive 22): BF16_Optimizer._prepare_muon_updates has cognitive complexity 22 (threshold 15). Drivers by points: loops 5 (12 pts), if/else 5 (10 pts) (nesting depth added 12). 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":"deepspeed/runtime/bf16_optimizer.py"},"region":{"startLine":440}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ab344b8db7e8d80816727e6c87e1a5a60b5d2a22f24b1ac8178a24281a4a0bd"}},{"ruleId":"D2","level":"warning","message":{"text":"DeepSpeedHybridEngine.create_inference_containers (cognitive 22): DeepSpeedHybridEngine.create_inference_containers has cognitive complexity 22 (threshold 15). Drivers by points: if/else 6 (12 pts), loops 2 (5 pts), ternaries 1 (5 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":"deepspeed/runtime/hybrid_engine.py"},"region":{"startLine":346}}}],"partialFingerprints":{"codehealthFindingId/v1":"62ef02628ce1e8c366fbd1cfe0abcb3cc084f1c8c5a586370b72fca4240a51d1"}},{"ruleId":"D2","level":"warning","message":{"text":"lr_schedules.override_1cycle_params (cognitive 22): lr_schedules.override_1cycle_params has cognitive complexity 22 (threshold 15). Drivers by points: boolean chains 11, if/else 11. 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":"deepspeed/runtime/lr_schedules.py"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"7920ff08fd900b3f41fdadde440d23d2295ed4371f7873857a766fc0ddf69d5b"}},{"ruleId":"D2","level":"warning","message":{"text":"PipelineEngine._aggregate_total_loss (cognitive 22): PipelineEngine._aggregate_total_loss has cognitive complexity 22 (threshold 15). Drivers by points: if/else 9 (16 pts), loops 1 (4 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":"deepspeed/runtime/pipe/engine.py"},"region":{"startLine":573}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b6083d87674aa6eee204d0251f22490ef6b172b459fabf19ae14d268edf9f56"}},{"ruleId":"D2","level":"warning","message":{"text":"PipelineEngine._exec_load_micro_batch (cognitive 22): PipelineEngine._exec_load_micro_batch has cognitive complexity 22 (threshold 15). Drivers by points: if/else 9 (16 pts), loops 2 (6 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":"deepspeed/runtime/pipe/engine.py"},"region":{"startLine":886}}}],"partialFingerprints":{"codehealthFindingId/v1":"bdc77422b26992dfa576557bc8fa4fe65adda7cf1c6821280bede9ca9242fbe4"}},{"ruleId":"D2","level":"warning","message":{"text":"UlyssesSPAttentionHF.register_with_transformers (cognitive 22): UlyssesSPAttentionHF.register_with_transformers has cognitive complexity 22 (threshold 15). Drivers by points: if/else 13 (15 pts), boolean chains 5, error handling 1 (2 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":"deepspeed/runtime/sequence_parallel/ulysses_sp.py"},"region":{"startLine":391}}}],"partialFingerprints":{"codehealthFindingId/v1":"62acdd0a708244ee586a3d2dd2b8c275673cfd380752aeb61adbf3820b545140"}},{"ruleId":"D2","level":"warning","message":{"text":"utils.get_global_norm_of_tensors (cognitive 22): utils.get_global_norm_of_tensors has cognitive complexity 22 (threshold 15). Drivers by points: if/else 8 (16 pts), loops 2 (4 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":"deepspeed/runtime/utils.py"},"region":{"startLine":984}}}],"partialFingerprints":{"codehealthFindingId/v1":"07d733f39d395e8dc98bc282e8196b3ab4d5e331da44bbd25597b0ef47cf827d"}},{"ruleId":"D2","level":"warning","message":{"text":"CUDAOpBuilder.nvcc_args (cognitive 22): CUDAOpBuilder.nvcc_args has cognitive complexity 22 (threshold 15). Drivers by points: if/else 7 (10 pts), ternaries 3 (7 pts), boolean chains 3, 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":"op_builder/builder.py"},"region":{"startLine":920}}}],"partialFingerprints":{"codehealthFindingId/v1":"80c6a016229296ab7618c09f85e29d401bf2a78b19176ed18bc4a05a260fb9a3"}},{"ruleId":"D2","level":"warning","message":{"text":"SpatialInferenceBuilder.is_compatible (cognitive 22): SpatialInferenceBuilder.is_compatible has cognitive complexity 22 (threshold 15). Drivers by points: if/else 6 (17 pts), boolean chains 4, error handling 1 (nesting depth added 11). 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":"op_builder/spatial_inference.py"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b55e916cace376a21854f1aeaf8ed29b135ef3f90e06d628a2639c72ea4247c"}},{"ruleId":"D2","level":"warning","message":{"text":"cpu_accelerator._cgroup_memory (cognitive 21): cpu_accelerator._cgroup_memory has cognitive complexity 21 (threshold 15). Drivers by points: if/else 4 (9 pts), ternaries 3 (7 pts), loops 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":"accelerator/cpu_accelerator.py"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"308bbbfdfc88b8fa18ab5b39d642042221428aa086de07fdadf99f5f57ac2c70"}},{"ruleId":"D2","level":"warning","message":{"text":"ResourceManager.schedule_experiments (cognitive 21): ResourceManager.schedule_experiments has cognitive complexity 21 (threshold 15). Drivers by points: if/else 6 (18 pts), boolean chains 2, 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":"deepspeed/autotuning/scheduler.py"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6d73a81df20dc28894a8c58d04bc27ac98ddee7293f81bf10a2f733853b9519"}},{"ruleId":"D2","level":"warning","message":{"text":"ParamAffineMap.validate_coverage (cognitive 21): ParamAffineMap.validate_coverage has cognitive complexity 21 (threshold 15). Drivers by points: loops 6 (12 pts), if/else 2 (8 pts), boolean chains 1 (nesting depth added 12). 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":"deepspeed/checkpoint/affine.py"},"region":{"startLine":323}}}],"partialFingerprints":{"codehealthFindingId/v1":"0cf41d8fff037340032de028818f752d87231e13c191aca0285ba950009327cf"}},{"ruleId":"D2","level":"warning","message":{"text":"affine.nest_affine_maps (cognitive 21): affine.nest_affine_maps has cognitive complexity 21 (threshold 15). Drivers by points: if/else 5 (12 pts), loops 6 (9 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":"deepspeed/checkpoint/affine.py"},"region":{"startLine":807}}}],"partialFingerprints":{"codehealthFindingId/v1":"a60330e06ea522a5d3fc4a7abb6401f2b6d38c55359c49760e4695f559670647"}},{"ruleId":"D2","level":"warning","message":{"text":"affine_transfer._frame_of (cognitive 21): affine_transfer._frame_of has cognitive complexity 21 (threshold 15). Drivers by points: if/else 13 (15 pts), boolean chains 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":"deepspeed/checkpoint/affine_transfer.py"},"region":{"startLine":230}}}],"partialFingerprints":{"codehealthFindingId/v1":"f07e0fa520a36a4e268bd98611c208cb1177fc32b443037bcf5816dcda08830f"}},{"ruleId":"D2","level":"warning","message":{"text":"list_schedule.init_schedule (cognitive 21): list_schedule.init_schedule has cognitive complexity 21 (threshold 15). Drivers by points: if/else 4 (12 pts), loops 4 (9 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":"deepspeed/compile/list_schedule.py"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8f13e67b1240713bd4a615c73f4c4706b3c6047243230fd1d157a07025f41a6"}},{"ruleId":"D2","level":"warning","message":{"text":"quantization._init_group_wise_weight_quantization (cognitive 21): quantization._init_group_wise_weight_quantization has cognitive complexity 21 (threshold 15). Drivers by points: if/else 6 (12 pts), loops 4 (6 pts), boolean chains 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":"deepspeed/inference/quantization/quantization.py"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"afe0330fd8dd4da95bd4471423134e918afb0979bd69d49fc22b97676ea14f0c"}},{"ruleId":"D2","level":"warning","message":{"text":"auto_ep_folding.validate_folding_global (cognitive 21): auto_ep_folding.validate_folding_global has cognitive complexity 21 (threshold 15). Drivers by points: if/else 12, boolean chains 9. 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":"deepspeed/module_inject/auto_ep_folding.py"},"region":{"startLine":184}}}],"partialFingerprints":{"codehealthFindingId/v1":"54574e99995217b78ebbc36489e3ad40704fecf2cd637d9c512276e6f9d0fe8b"}},{"ruleId":"D2","level":"warning","message":{"text":"checkpointing.non_reentrant_checkpoint (cognitive 21): checkpointing.non_reentrant_checkpoint has cognitive complexity 21 (threshold 15). Drivers by points: if/else 13, boolean chains 5, loops 1 (2 pts), ternaries 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":"deepspeed/runtime/activation_checkpointing/checkpointing.py"},"region":{"startLine":787}}}],"partialFingerprints":{"codehealthFindingId/v1":"23451db7bacc3ea2d9dcc43c0f2cfec2c2fb8a2a2ca09542c37528d461874f70"}},{"ruleId":"D2","level":"warning","message":{"text":"BF16_Optimizer.__init__ (cognitive 21): BF16_Optimizer.__init__ has cognitive complexity 21 (threshold 15). Drivers by points: if/else 6 (13 pts), loops 2 (6 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":"deepspeed/runtime/bf16_optimizer.py"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"228b9567e9933e1bf56eb502b40927c5c7609e62897d4706b1c24f506656100a"}},{"ruleId":"D2","level":"warning","message":{"text":"DominoTransformer.inter_layer_overlap_forward (cognitive 21): DominoTransformer.inter_layer_overlap_forward has cognitive complexity 21 (threshold 15). Drivers by points: if/else 12 (18 pts), boolean chains 2, 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":"deepspeed/runtime/domino/transformer.py"},"region":{"startLine":467}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b6fb0db095883cf25dd7e78d9eaa48f3462c1591473f194016fdde1f8a2e2ab"}},{"ruleId":"D2","level":"warning","message":{"text":"DeepSpeedEngine._validate_autoep_zero3_partitioned_metadata (cognitive 21): DeepSpeedEngine._validate_autoep_zero3_partitioned_metadata has cognitive complexity 21 (threshold 15). Drivers by points: if/else 6 (14 pts), loops 1 (3 pts), ternaries 1 (2 pts), boolean chains 1, 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":"deepspeed/runtime/engine.py"},"region":{"startLine":4588}}}],"partialFingerprints":{"codehealthFindingId/v1":"10ff0cdfdbe35a3071a123f5cdc083f44cca0a4f65a1a53c73aa54081c14935f"}},{"ruleId":"D2","level":"warning","message":{"text":"DeepSpeedEngine._autoep_expert_parameter_names (cognitive 21): DeepSpeedEngine._autoep_expert_parameter_names has cognitive complexity 21 (threshold 15). Drivers by points: if/else 7 (14 pts), loops 2 (3 pts), ternaries 1 (2 pts), boolean chains 1, error handling 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":"deepspeed/runtime/engine.py"},"region":{"startLine":4626}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef70b97de8bb52ed6b8eb338631e63cae52c77f83acde415b766385a51749eaa"}},{"ruleId":"D2","level":"warning","message":{"text":"PipelineEngine._exec_recv_activations (cognitive 21): PipelineEngine._exec_recv_activations has cognitive complexity 21 (threshold 15). Drivers by points: if/else 8 (14 pts), loops 2 (4 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":"deepspeed/runtime/pipe/engine.py"},"region":{"startLine":1107}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4d685bce3e80295b7d96b8ab227afb4288df32e812b70bb68ae93cfd1ccdaae"}},{"ruleId":"D2","level":"warning","message":{"text":"MegatronSDLoader.merge_state_dict (cognitive 21): MegatronSDLoader.merge_state_dict has cognitive complexity 21 (threshold 15). Drivers by points: if/else 8 (15 pts), boolean chains 4, 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":"deepspeed/runtime/state_dict_factory.py"},"region":{"startLine":299}}}],"partialFingerprints":{"codehealthFindingId/v1":"1635426db1af2b5ef737e38c68935e341304accce0a3775364aed412c12c59bf"}},{"ruleId":"D2","level":"warning","message":{"text":"DeepSpeedZeroOptimizer._restore_base_optimizer_state (cognitive 21): DeepSpeedZeroOptimizer._restore_base_optimizer_state has cognitive complexity 21 (threshold 15). Drivers by points: if/else 5 (10 pts), ternaries 2 (7 pts), loops 3 (4 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":"deepspeed/runtime/zero/stage_1_and_2.py"},"region":{"startLine":3693}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a3ec248a99ba42187fd7a52308a604f9fe1eabb009cb9668df63072ae1323cf"}},{"ruleId":"D2","level":"warning","message":{"text":"OpBuilder.installed_rocm_version (cognitive 21): OpBuilder.installed_rocm_version has cognitive complexity 21 (threshold 15). Drivers by points: if/else 8 (17 pts), loops 1 (4 pts) (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":"op_builder/builder.py"},"region":{"startLine":238}}}],"partialFingerprints":{"codehealthFindingId/v1":"9746e8aa3f3eab2092f9562a582f144cf5bb21357e576bb9734df5f5ceb098c2"}},{"ruleId":"D2","level":"warning","message":{"text":"deepspeed.initialize (cognitive 20): deepspeed.initialize has cognitive complexity 20 (threshold 15). Drivers by points: if/else 11 (13 pts), boolean chains 5, ternaries 1 (2 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":"deepspeed/__init__.py"},"region":{"startLine":433}}}],"partialFingerprints":{"codehealthFindingId/v1":"29fd96e9470d9b77518de2b5e854222c854122abe1fa94736fcbbf9d09ba7aba"}},{"ruleId":"D2","level":"warning","message":{"text":"affine_transfer._normalized (cognitive 20): affine_transfer._normalized has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8 (15 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":"deepspeed/checkpoint/affine_transfer.py"},"region":{"startLine":298}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd7fa613342c25ede94b38e0753effbf857901c87f3f8c25f962186b37cec11e"}},{"ruleId":"D2","level":"warning","message":{"text":"zero_affine.zero_optimizer_storage_affine_maps (cognitive 20): zero_affine.zero_optimizer_storage_affine_maps has cognitive complexity 20 (threshold 15). Drivers by points: if/else 5 (13 pts), loops 4 (6 pts), boolean chains 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":"deepspeed/checkpoint/zero_affine.py"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"07391dcfd74fb3979e5f052e92187aa1ee398330478dc11c3c8f66d4f34343aa"}},{"ruleId":"D2","level":"warning","message":{"text":"LayerContainer.set_dependency (cognitive 20): LayerContainer.set_dependency has cognitive complexity 20 (threshold 15). Drivers by points: if/else 6 (11 pts), loops 4 (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":"deepspeed/inference/v2/model_implementations/layer_container_base.py"},"region":{"startLine":272}}}],"partialFingerprints":{"codehealthFindingId/v1":"1de82fd37291f5bc4564469776612a601784d26140083d36ea4f33b705b8b0c1"}},{"ruleId":"D2","level":"warning","message":{"text":"AutoEPMoELayer.expert_storage_affine_maps (cognitive 20): AutoEPMoELayer.expert_storage_affine_maps has cognitive complexity 20 (threshold 15). Drivers by points: loops 7 (11 pts), if/else 5 (8 pts), boolean chains 1 (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":"deepspeed/module_inject/auto_ep_layer.py"},"region":{"startLine":817}}}],"partialFingerprints":{"codehealthFindingId/v1":"cee73f7ff79dfdca9673eef2917e248703b8447bbbb132e6840873a3aa459a67"}},{"ruleId":"D2","level":"warning","message":{"text":"ReplaceWithTensorSlicing.copy (cognitive 20): ReplaceWithTensorSlicing.copy has cognitive complexity 20 (threshold 15). Drivers by points: ternaries 5 (10 pts), if/else 7 (8 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":"deepspeed/module_inject/auto_tp.py"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f4311c141ccc2ef41c788900f87bad46bcf27e495a2394245c6593f9f7ec207"}},{"ruleId":"D2","level":"warning","message":{"text":"Loading.load (cognitive 20): Loading.load has cognitive complexity 20 (threshold 15). Drivers by points: if/else 9 (18 pts), boolean chains 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":"deepspeed/module_inject/auto_tp.py"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"49b8f5df6a4b99b372ede5483401baa826a0bd964d33651209e6754545ebbe40"}},{"ruleId":"D2","level":"warning","message":{"text":"tp_shard.get_shard_size (cognitive 20): tp_shard.get_shard_size has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8 (12 pts), ternaries 3 (6 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":"deepspeed/module_inject/tp_shard.py"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"9941b64bb8284af853c206221eb69a914b59b7561ac73e860764c3f6970cf87c"}},{"ruleId":"D2","level":"warning","message":{"text":"DeepSpeedCPUAdam.step (cognitive 20): DeepSpeedCPUAdam.step has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (13 pts), ternaries 1 (4 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":"deepspeed/ops/adam/cpu_adam.py"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa6cd3852bfbeef57433d2c9e590f5535253f8150e4509d9416abed5cd4081b0"}},{"ruleId":"D2","level":"warning","message":{"text":"QKVGemmOp.__init__ (cognitive 20): QKVGemmOp.__init__ has cognitive complexity 20 (threshold 15). Drivers by points: if/else 9 (17 pts), boolean chains 2, 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":"deepspeed/ops/transformer/inference/op_binding/qkv_gemm.py"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d644cfca0b6b7ddf9079ab22199853df022d5ac2f265ff3f6427670fff3e6fd"}},{"ruleId":"D2","level":"warning","message":{"text":"DeepSpeedDataSampler.__init__ (cognitive 20): DeepSpeedDataSampler.__init__ has cognitive complexity 20 (threshold 15). Drivers by points: if/else 6 (18 pts), loops 1 (2 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":"deepspeed/runtime/data_pipeline/data_sampling/data_sampler.py"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb8a1e049802f007502a81bd3533b3f8c2aba2df60ac24be77acb486f776f2fb"}},{"ruleId":"D2","level":"warning","message":{"text":"variable_batch_size_and_lr.batch_by_seqlens (cognitive 20): variable_batch_size_and_lr.batch_by_seqlens has cognitive complexity 20 (threshold 15). Drivers by points: if/else 10 (15 pts), loops 3 (4 pts), 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":"deepspeed/runtime/data_pipeline/data_sampling/variable_batch_size_and_lr.py"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"4008539612ffbc64b43273193ad2c9d9f833e0fec6aa4069f4918cca3fdf1d36"}},{"ruleId":"D2","level":"warning","message":{"text":"DeepSpeedEngine._optimized_linear_offload_setup (cognitive 20): DeepSpeedEngine._optimized_linear_offload_setup has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8 (17 pts), loops 3 (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":"deepspeed/runtime/engine.py"},"region":{"startLine":789}}}],"partialFingerprints":{"codehealthFindingId/v1":"09cfb7b22e8fb1ade6b21b0e40dc316bfb1e9e03985c4542f875cef6d63a04ea"}},{"ruleId":"D2","level":"warning","message":{"text":"DeepSpeedEngine._do_optimizer_sanity_check (cognitive 20): DeepSpeedEngine._do_optimizer_sanity_check has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8 (16 pts), boolean chains 2, ternaries 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":"deepspeed/runtime/engine.py"},"region":{"startLine":2367}}}],"partialFingerprints":{"codehealthFindingId/v1":"b18069aef7cbd9ddbea8b405ad11701eb778569a09c2827d5dde7e96da13736f"}},{"ruleId":"D2","level":"warning","message":{"text":"DeepSpeedEngine._configure_basic_optimizer (cognitive 20): DeepSpeedEngine._configure_basic_optimizer has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8 (11 pts), error handling 3 (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":"deepspeed/runtime/engine.py"},"region":{"startLine":2549}}}],"partialFingerprints":{"codehealthFindingId/v1":"374795043670c1f6a5f1cac5cbf19ce955e2b90c9ce98dfceb4bd4948d798338"}},{"ruleId":"D2","level":"warning","message":{"text":"PipelineEngine._reduce_outputs (cognitive 20): PipelineEngine._reduce_outputs has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8 (12 pts), loops 2 (7 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":"deepspeed/runtime/pipe/engine.py"},"region":{"startLine":527}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2b3595a6c10b8d6173a59fbcc1e28572af2d45c95c12817ec4f9fb231c7bec4"}},{"ruleId":"D2","level":"warning","message":{"text":"HybridEngineRollout._continuous_prefill (cognitive 20): HybridEngineRollout._continuous_prefill has cognitive complexity 20 (threshold 15). Drivers by points: if/else 6 (10 pts), loops 5 (10 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":"deepspeed/runtime/rollout/hybrid_engine_rollout.py"},"region":{"startLine":970}}}],"partialFingerprints":{"codehealthFindingId/v1":"b07b70eb99780fbe4612a9516755db195ee3915986401c3c3dc9161fd01ddf7d"}},{"ruleId":"D2","level":"warning","message":{"text":"MegatronSDLoader.split_state_dict (cognitive 20): MegatronSDLoader.split_state_dict has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (14 pts), boolean chains 4, 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":"deepspeed/runtime/state_dict_factory.py"},"region":{"startLine":348}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e368840966711e1c9e067e6e03310904366d0446fe491fdb98ba9c2f175acef"}},{"ruleId":"D2","level":"warning","message":{"text":"engine_stage3.initialize_optimizer_states (cognitive 20): engine_stage3.initialize_optimizer_states has cognitive complexity 20 (threshold 15). Drivers by points: if/else 10 (16 pts), loops 2 (3 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":"deepspeed/runtime/zenflow/engine_stage3.py"},"region":{"startLine":372}}}],"partialFingerprints":{"codehealthFindingId/v1":"784c55d51a1f3ad19f378bad0e3756f291b4a3629df23ae46c9b48be458c3a45"}},{"ruleId":"D2","level":"warning","message":{"text":"AllGatherCoalescedHandle.wait (cognitive 20): AllGatherCoalescedHandle.wait has cognitive complexity 20 (threshold 15). Drivers by points: if/else 6 (10 pts), loops 4 (8 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":"deepspeed/runtime/zero/partition_parameters.py"},"region":{"startLine":756}}}],"partialFingerprints":{"codehealthFindingId/v1":"03254ba254d4ffd17b812b8c801069ada61e031be5ac3bb0aad857c9dc505f1e"}},{"ruleId":"D2","level":"warning","message":{"text":"DeepSpeedZeroOptimizer_Stage3._apply_muon_to_accumulated_grads (cognitive 20): DeepSpeedZeroOptimizer_Stage3._apply_muon_to_accumulated_grads has cognitive complexity 20 (threshold 15). Drivers by points: loops 4 (9 pts), if/else 4 (8 pts), boolean chains 3 (nesting depth added 9). 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":"deepspeed/runtime/zero/stage3.py"},"region":{"startLine":1919}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e95834ec3578c65238708e8a58626f38dadce99ff206d4a68c62b2bb7f30a9d"}},{"ruleId":"D2","level":"warning","message":{"text":"linear_cross_entropy.vocab_parallel_linear_cross_entropy (cognitive 20): linear_cross_entropy.vocab_parallel_linear_cross_entropy has cognitive complexity 20 (threshold 15). Drivers by points: if/else 13 (15 pts), boolean chains 3, ternaries 1 (2 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"deepspeed/sequence/linear_cross_entropy.py"},"region":{"startLine":215}}}],"partialFingerprints":{"codehealthFindingId/v1":"d00756deb9742d7210698a4656f58a2acb40dbb29339bf2a2b0c50058c83dac5"}},{"ruleId":"D2","level":"warning","message":{"text":"torch_latest.load_test_selection (cognitive 19): torch_latest.load_test_selection has cognitive complexity 19 (threshold 15). Drivers by points: if/else 12 (14 pts), boolean chains 3, error handling 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":"ci/torch_latest.py"},"region":{"startLine":350}}}],"partialFingerprints":{"codehealthFindingId/v1":"b91172090f386c8114e67b054c3eeaa8878abad4d1d41a5e68ae015c21a5e9f8"}},{"ruleId":"D2","level":"warning","message":{"text":"contract.validate_schedule (cognitive 19): contract.validate_schedule has cognitive complexity 19 (threshold 15). Drivers by points: if/else 4 (13 pts), loops 3 (6 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":"deepspeed/compile/passes/contract.py"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6ce29ef648457e7fdd9c801b6c90a6c20e4ddb86d21a06563027d8217a54d17"}},{"ruleId":"D2","level":"warning","message":{"text":"AutoTP._gather_zero3_params (cognitive 19): AutoTP._gather_zero3_params has cognitive complexity 19 (threshold 15). Drivers by points: loops 5 (10 pts), if/else 4 (9 pts) (nesting depth added 10). 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":"deepspeed/module_inject/auto_tp.py"},"region":{"startLine":521}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e7afbd2dd17cbccfe61864af8aecd6da364240107bb29f20e9f9be5142f84a5"}},{"ruleId":"D2","level":"warning","message":{"text":"sharded_moe.top1gating (cognitive 19): sharded_moe.top1gating has cognitive complexity 19 (threshold 15). Drivers by points: if/else 12 (15 pts), ternaries 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":"deepspeed/moe/sharded_moe.py"},"region":{"startLine":216}}}],"partialFingerprints":{"codehealthFindingId/v1":"24195cf01fdf851aec89100f0f0b6f37c40b437a5fce60048f22a67555696f00"}},{"ruleId":"D2","level":"warning","message":{"text":"zenflow_torch_adam._fused_adamw (cognitive 19): zenflow_torch_adam._fused_adamw has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (12 pts), boolean chains 3, ternaries 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":"deepspeed/ops/adam/zenflow_torch_adam.py"},"region":{"startLine":968}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f6ba324fb33902a6eaa9b56cb08acb05a747d183277a3324ee29ef3874f2530"}},{"ruleId":"D2","level":"warning","message":{"text":"RandomLayerTokenDrop.forward (cognitive 19): RandomLayerTokenDrop.forward has cognitive complexity 19 (threshold 15). Drivers by points: if/else 12 (18 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":"deepspeed/runtime/data_pipeline/data_routing/basic_layer.py"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"7379f1aeadff757f701c0abfe9d08d0dc238cb0aed0f3a50824b01a75c78bd37"}},{"ruleId":"D2","level":"warning","message":{"text":"keep_in_fp32.keep_in_fp32_pattern (cognitive 19): keep_in_fp32.keep_in_fp32_pattern has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (11 pts), loops 2 (5 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":"deepspeed/runtime/keep_in_fp32.py"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c2fc4835c6e613ef0b446440dab6b3042f9b03a5dfc801b477dd345a282e0e2"}},{"ruleId":"D2","level":"warning","message":{"text":"UlyssesSPDataLoaderAdapter.refill (cognitive 19): UlyssesSPDataLoaderAdapter.refill has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (12 pts), loops 4 (6 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":"deepspeed/runtime/sequence_parallel/ulysses_sp.py"},"region":{"startLine":646}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e5dab3a7d3f29bd109fe0f87212395e52c877630fc268f54b3e9001aa27188e"}},{"ruleId":"D2","level":"warning","message":{"text":"torch_autocast.autocast_if_enabled (cognitive 19): torch_autocast.autocast_if_enabled has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (19 pts) (nesting depth added 11). 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":"deepspeed/runtime/torch_autocast.py"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7ca09013d6b168b0a10126e5fb6b9781ee77aa2e01fc43dcfa501965db2264a"}},{"ruleId":"D2","level":"warning","message":{"text":"utils.get_weight_norm (cognitive 19): utils.get_weight_norm has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (14 pts), boolean chains 3, loops 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":"deepspeed/runtime/utils.py"},"region":{"startLine":612}}}],"partialFingerprints":{"codehealthFindingId/v1":"dda61d7d43508aa12e15552d02d081c05c59d6d18483b8a526783301024a4110"}},{"ruleId":"D2","level":"warning","message":{"text":"ZeROOrderedDict.__getitem__ (cognitive 19): ZeROOrderedDict.__getitem__ has cognitive complexity 19 (threshold 15). Drivers by points: if/else 9 (15 pts), boolean chains 4 (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":"deepspeed/runtime/zero/parameter_offload.py"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1567bf70a074339522d60a9c0cbad06ba9c13f67d647a8faedf8f6995b13d62"}},{"ruleId":"D2","level":"warning","message":{"text":"CUDAQuantizer.quantize (cognitive 19): CUDAQuantizer.quantize has cognitive complexity 19 (threshold 15). Drivers by points: if/else 4 (10 pts), loops 2 (6 pts), error handling 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":"deepspeed/runtime/zero/partition_parameters.py"},"region":{"startLine":862}}}],"partialFingerprints":{"codehealthFindingId/v1":"edb7df23c206e0da5cb8852ffef5a3bb95c90c9d7ba6c9d2290018b2ea0d02bc"}},{"ruleId":"D2","level":"warning","message":{"text":"PartitionedParameterCoordinator.release_sub_module (cognitive 19): PartitionedParameterCoordinator.release_sub_module has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (12 pts), boolean chains 3, ternaries 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":"deepspeed/runtime/zero/partitioned_param_coordinator.py"},"region":{"startLine":495}}}],"partialFingerprints":{"codehealthFindingId/v1":"3fcce3bbab2b3e686ee4893aee7a1e46249f1cd4bddd42058b3c24a99d8cc4bd"}},{"ruleId":"D2","level":"warning","message":{"text":"DeepSpeedZeroOptimizer_Stage3.load_module_checkpoint_state_from_checkpoint_dir_stage3 (cognitive 19): DeepSpeedZeroOptimizer_Stage3.load_module_checkpoint_state_from_checkpoint_dir_stage3 has cognitive complexity 19 (threshold 15). Drivers by points: if/else 5 (11 pts), loops 4 (6 pts), ternaries 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":"deepspeed/runtime/zero/stage3.py"},"region":{"startLine":3945}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc6cd4267f5e3a4f79d47a76bb3511a894fc3d869559199ee572f201ae1bca40"}},{"ruleId":"D2","level":"warning","message":{"text":"DeepSpeedZeroOptimizer_Stage3.load_hp_checkpoint_state (cognitive 19): DeepSpeedZeroOptimizer_Stage3.load_hp_checkpoint_state has cognitive complexity 19 (threshold 15). Drivers by points: if/else 10 (17 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":"deepspeed/runtime/zero/stage3.py"},"region":{"startLine":3990}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a8f40f92d5cca2a4816c1b1cc652ccb5c7bf0b2a1ffb15abfe11d22be4a34e3"}},{"ruleId":"D2","level":"warning","message":{"text":"zero_to_fp32.parse_model_states (cognitive 19): zero_to_fp32.parse_model_states has cognitive complexity 19 (threshold 15). Drivers by points: if/else 5 (11 pts), loops 3 (6 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":"deepspeed/utils/zero_to_fp32.py"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"aed2248308562a5fb16823961c2a739282312bb0f0c638b96317967f627db30e"}},{"ruleId":"D2","level":"warning","message":{"text":"utils.find_replace (cognitive 18): utils.find_replace has cognitive complexity 18 (threshold 15). Drivers by points: if/else 4 (10 pts), loops 3 (8 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":"deepspeed/autotuning/utils.py"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee6f4d62fd71e9c1da4669e6baec2b5d749e0faf18819174dacfdca15ff1efa5"}},{"ruleId":"D2","level":"warning","message":{"text":"affine_transfer_executor._validate_segment (cognitive 18): affine_transfer_executor._validate_segment has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (10 pts), boolean chains 4, loops 3 (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":"deepspeed/checkpoint/affine_transfer_executor.py"},"region":{"startLine":196}}}],"partialFingerprints":{"codehealthFindingId/v1":"9eaa4c6046a3e45215550b160214e9cf7cecca5c513147854e163c690da36f2b"}},{"ruleId":"D2","level":"warning","message":{"text":"universal_checkpoint._resolve_autotp_partition (cognitive 18): universal_checkpoint._resolve_autotp_partition has cognitive complexity 18 (threshold 15). Drivers by points: if/else 13 (16 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":"deepspeed/checkpoint/universal_checkpoint.py"},"region":{"startLine":148}}}],"partialFingerprints":{"codehealthFindingId/v1":"6045cda7c817fbdcb78176916bf8004945bd1e44619ff3b96b28660332464be2"}},{"ruleId":"D2","level":"warning","message":{"text":"util.get_no_copy_ops (cognitive 18): util.get_no_copy_ops has cognitive complexity 18 (threshold 15). Drivers by points: if/else 2 (8 pts), loops 3 (6 pts), error handling 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":"deepspeed/compile/util.py"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"23420b5e0875947b3f467f4f49faee62f4b0a8c4b118cf6be0bfc2a3baef87e8"}},{"ruleId":"D2","level":"warning","message":{"text":"IMPIRunner.get_cmd (cognitive 18): IMPIRunner.get_cmd has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9 (15 pts), loops 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":"deepspeed/launcher/multinode_runner.py"},"region":{"startLine":289}}}],"partialFingerprints":{"codehealthFindingId/v1":"92cfec50020c02c66ed105d34644eed0ed93b26d33d27aca61a59aabe3758b78"}},{"ruleId":"D2","level":"warning","message":{"text":"DeepSpeedCPUAdagrad.step (cognitive 18): DeepSpeedCPUAdagrad.step has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (11 pts), ternaries 1 (4 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":"deepspeed/ops/adagrad/cpu_adagrad.py"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac6e712f04e69acfdcdda0f65ba3ae330ed159cd0c867c1c770a05eedc7cc8df"}},{"ruleId":"D2","level":"warning","message":{"text":"zenflow_torch_adam.adamw (cognitive 18): zenflow_torch_adam.adamw has cognitive complexity 18 (threshold 15). Drivers by points: if/else 10 (11 pts), boolean chains 7 (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":"deepspeed/ops/adam/zenflow_torch_adam.py"},"region":{"startLine":1057}}}],"partialFingerprints":{"codehealthFindingId/v1":"900001f9416e6cc6341c325d603f2ded4a1b2ac5fb16101c2e7b57980eda20ff"}},{"ruleId":"D2","level":"warning","message":{"text":"DeepSpeedDataSampler.get_next_global_batch (cognitive 18): DeepSpeedDataSampler.get_next_global_batch has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (12 pts), loops 2 (5 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":"deepspeed/runtime/data_pipeline/data_sampling/data_sampler.py"},"region":{"startLine":264}}}],"partialFingerprints":{"codehealthFindingId/v1":"e149e24cc5ba4743327ccd497362868bf4a6df4a98aaf7b7b600e3293f31e205"}},{"ruleId":"D2","level":"warning","message":{"text":"DeepSpeedEngine._configure_optimizer (cognitive 18): DeepSpeedEngine._configure_optimizer has cognitive complexity 18 (threshold 15). Drivers by points: if/else 10 (15 pts), ternaries 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":"deepspeed/runtime/engine.py"},"region":{"startLine":2401}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0b60ddd348bef8ba3f9ce82f6ad0d7cd2f733b283b4fa0cdb16b7b212a7d83b"}},{"ruleId":"D2","level":"warning","message":{"text":"keep_in_fp32.keep_tensors_in_fp32 (cognitive 18): keep_in_fp32.keep_tensors_in_fp32 has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (14 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":"deepspeed/runtime/keep_in_fp32.py"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"8fe49f71d88a1f03740f657dff8b85a7e2efd84e636b2923fb62369bc3099132"}},{"ruleId":"D2","level":"warning","message":{"text":"PipelineEngine.train_batch (cognitive 18): PipelineEngine.train_batch has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (11 pts), loops 1 (4 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":"deepspeed/runtime/pipe/engine.py"},"region":{"startLine":332}}}],"partialFingerprints":{"codehealthFindingId/v1":"69f3b8207fef101a09cdc81ba184b5f26fa48c0ba785431d7d7c5dffee3e7b8a"}},{"ruleId":"D2","level":"warning","message":{"text":"PipelineModule._build (cognitive 18): PipelineModule._build has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (16 pts), loops 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":"deepspeed/runtime/pipe/module.py"},"region":{"startLine":234}}}],"partialFingerprints":{"codehealthFindingId/v1":"f94bc33f58f4e9067dc206e5a85ad8173929f9fffa1e5d6e4b927f55fad9462a"}},{"ruleId":"D2","level":"warning","message":{"text":"MuonWithAuxAdam.__init__ (cognitive 18): MuonWithAuxAdam.__init__ has cognitive complexity 18 (threshold 15). Drivers by points: if/else 4 (7 pts), loops 2 (7 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":"deepspeed/runtime/zero/muon/muon_optimizer.py"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"3248bc2c9debbcfb78810c895725cee6592eddcd3f3053462c37698a97c2a2d6"}},{"ruleId":"D2","level":"warning","message":{"text":"DeepSpeedZeroOptimizer_Stage3._get_trainable_parameter_groups (cognitive 18): DeepSpeedZeroOptimizer_Stage3._get_trainable_parameter_groups has cognitive complexity 18 (threshold 15). Drivers by points: if/else 4 (10 pts), loops 4 (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":"deepspeed/runtime/zero/stage3.py"},"region":{"startLine":748}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed5f2cd557f0d10addb706fb4e497bffbbb74c3c7f0a61a65adf07e356075fee"}},{"ruleId":"D2","level":"warning","message":{"text":"DeepSpeedZeroOptimizer_Stage3.update_fp32_grad_for_param_vectorized (cognitive 18): DeepSpeedZeroOptimizer_Stage3.update_fp32_grad_for_param_vectorized has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9 (14 pts), loops 3 (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":"deepspeed/runtime/zero/stage3.py"},"region":{"startLine":3481}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ca850b6e289612e77dad3069c1a51e1b596a1ec43a45709508557ea258a0220"}},{"ruleId":"D2","level":"warning","message":{"text":"_FPDTGPUAttentionImpl_.backward (cognitive 18): _FPDTGPUAttentionImpl_.backward has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (13 pts), loops 4 (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":"deepspeed/sequence/fpdt_layer.py"},"region":{"startLine":348}}}],"partialFingerprints":{"codehealthFindingId/v1":"e08a58b4fe07b696fe7f2d779be7370a0d4e25d3e142329b7508e481c65c3bba"}},{"ruleId":"D2","level":"warning","message":{"text":"zero_to_fp32.convert_zero_checkpoint_to_state_dict (cognitive 18): zero_to_fp32.convert_zero_checkpoint_to_state_dict has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (8 pts), error handling 2 (4 pts), loops 2 (3 pts), ternaries 2 (3 pts) (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":"deepspeed/utils/zero_to_fp32.py"},"region":{"startLine":679}}}],"partialFingerprints":{"codehealthFindingId/v1":"e030e694b02698583d24544729104200ddee11723dc376469273829a409e78b5"}},{"ruleId":"D2","level":"warning","message":{"text":"NPUInference._softmax_context (cognitive 18): NPUInference._softmax_context has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9 (10 pts), ternaries 4 (5 pts), boolean chains 2, loops 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":"op_builder/npu/inference.py"},"region":{"startLine":193}}}],"partialFingerprints":{"codehealthFindingId/v1":"b44d2ff5f3f8f6ef20f912c2103dea37bb3f65775187dab8f625af1343a816eb"}},{"ruleId":"D2","level":"warning","message":{"text":"torch_latest.run_aws_controller (cognitive 17): torch_latest.run_aws_controller has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9 (10 pts), error handling 4 (5 pts), boolean chains 2 (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":"ci/torch_latest.py"},"region":{"startLine":1795}}}],"partialFingerprints":{"codehealthFindingId/v1":"27120fdba1df59dbfdcd1f9c3c9995503faa607725b047da78c025f22b1e2aba"}},{"ruleId":"D2","level":"warning","message":{"text":"util.count_inflight_values (cognitive 17): util.count_inflight_values has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (7 pts), ternaries 3 (6 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":"deepspeed/compile/util.py"},"region":{"startLine":308}}}],"partialFingerprints":{"codehealthFindingId/v1":"0721564a8deac244c490033a48bf21f2cfb8b23bf45aa05ecd9fb74639c6dea4"}},{"ruleId":"D2","level":"warning","message":{"text":"AutoEPMoELayer._finalize_output (cognitive 17): AutoEPMoELayer._finalize_output has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9 (17 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":"deepspeed/module_inject/auto_ep_layer.py"},"region":{"startLine":1026}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1af4adb1b80cbd702378d6dda14f81c6224c4b97fc524990ec3f1ee2e55939a"}},{"ruleId":"D2","level":"warning","message":{"text":"ReplaceWithTensorSlicing.strided_copy (cognitive 17): ReplaceWithTensorSlicing.strided_copy has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (12 pts), error handling 1 (3 pts), boolean chains 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":"deepspeed/module_inject/auto_tp.py"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"6fa3843ec05671daa61f4d498078162a492dfc2cb9ed63a390cb9ebe548e022c"}},{"ruleId":"D2","level":"warning","message":{"text":"ds_aio_args.validate_args (cognitive 17): ds_aio_args.validate_args has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9 (10 pts), boolean chains 5, 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":"deepspeed/nvme/ds_aio_args.py"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"e220b656cb4587b02c820b5a28a0239fd81a1f7a0dc7fb2f8a43e6ca8bfad6ac"}},{"ruleId":"D2","level":"warning","message":{"text":"DeepSpeedMoEInference.forward (cognitive 17): DeepSpeedMoEInference.forward has cognitive complexity 17 (threshold 15). Drivers by points: if/else 12, ternaries 2 (3 pts), boolean chains 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":"deepspeed/ops/transformer/inference/moe_inference.py"},"region":{"startLine":271}}}],"partialFingerprints":{"codehealthFindingId/v1":"a28aace5023683f52998f17446aed64ce1652378ff6a5b046927052ad7c6b174"}},{"ruleId":"D2","level":"warning","message":{"text":"DeepSpeedConfigModel._process_deprecated_field (cognitive 17): DeepSpeedConfigModel._process_deprecated_field has cognitive complexity 17 (threshold 15). Drivers by points: error handling 2 (6 pts), if/else 3 (6 pts), ternaries 2 (4 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":"deepspeed/runtime/config_utils.py"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"4abce63ee9e8802f39e15d9528eb144bdc33896ee9ee76630efae14a9fa325fa"}},{"ruleId":"D2","level":"warning","message":{"text":"DeepSpeedEngine.get_optimizer_configuration (cognitive 17): DeepSpeedEngine.get_optimizer_configuration has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (12 pts), ternaries 2 (4 pts), error handling 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":"deepspeed/runtime/engine.py"},"region":{"startLine":2450}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa409e6c785ed63b637996fb9243a29336e69ab89dde702674b889ee813b93dc"}},{"ruleId":"D2","level":"warning","message":{"text":"DeepSpeedEngine._load_zero_checkpoint (cognitive 17): DeepSpeedEngine._load_zero_checkpoint has cognitive complexity 17 (threshold 15). Drivers by points: if/else 10 (13 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":"deepspeed/runtime/engine.py"},"region":{"startLine":4817}}}],"partialFingerprints":{"codehealthFindingId/v1":"f51ce4b9d73f43c56f3f5f5d824e3a02e1dfbd84e157a7474cbbee14be006dda"}},{"ruleId":"D2","level":"warning","message":{"text":"DeepSpeedEngine._get_all_zero_checkpoint_state_dicts (cognitive 17): DeepSpeedEngine._get_all_zero_checkpoint_state_dicts has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (6 pts), ternaries 2 (6 pts), boolean chains 4, 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":"deepspeed/runtime/engine.py"},"region":{"startLine":4905}}}],"partialFingerprints":{"codehealthFindingId/v1":"924dbbd6fd72243bdaf096df5be0a95082ad72b2ed8bb4e04383bd3cd9da4ee8"}},{"ruleId":"D2","level":"warning","message":{"text":"DeepSpeedEngine._get_zero_param_shapes (cognitive 17): DeepSpeedEngine._get_zero_param_shapes has cognitive complexity 17 (threshold 15). Drivers by points: ternaries 3 (8 pts), if/else 3 (5 pts), loops 2 (3 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":"deepspeed/runtime/engine.py"},"region":{"startLine":5551}}}],"partialFingerprints":{"codehealthFindingId/v1":"54ebc847fdf3a391c877bcdf5db8bacb670796323ed3442341b39c3349887934"}},{"ruleId":"D2","level":"warning","message":{"text":"DualPipeVSchedule.steps (cognitive 17): DualPipeVSchedule.steps has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (8 pts), loops 8, boolean chains 1 (nesting depth added 3). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"deepspeed/runtime/pipe/schedule.py"},"region":{"startLine":360}}}],"partialFingerprints":{"codehealthFindingId/v1":"a956e85882ec1400ac1c688ce8d014336a5dcb304d6bf75b33b34e082965aac7"}},{"ruleId":"D2","level":"warning","message":{"text":"Init._partition_param_sec (cognitive 17): Init._partition_param_sec has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (15 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":"deepspeed/runtime/zero/partition_parameters.py"},"region":{"startLine":1883}}}],"partialFingerprints":{"codehealthFindingId/v1":"efa7c6becfb9a953d34c778b4bb447b647dc0afe854acc2e3018f5373f34b222"}},{"ruleId":"D2","level":"warning","message":{"text":"GatheredParameters._exit (cognitive 17): GatheredParameters._exit has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (14 pts), loops 2, 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":"deepspeed/runtime/zero/partition_parameters.py"},"region":{"startLine":2478}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7de26ecd7f22c2770c92520a178ccb51165d705b80a04520d3aaf12b1165ec6"}},{"ruleId":"D2","level":"warning","message":{"text":"DeepSpeedZeroOptimizer_Stage3._setup_for_real_optimizer (cognitive 17): DeepSpeedZeroOptimizer_Stage3._setup_for_real_optimizer has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (10 pts), loops 4 (6 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":"deepspeed/runtime/zero/stage3.py"},"region":{"startLine":783}}}],"partialFingerprints":{"codehealthFindingId/v1":"61df052bb842d2084d2b755b7463831eb0731ac41bf6bfae94da468a837ea161"}},{"ruleId":"D2","level":"warning","message":{"text":"DeepSpeedZeroOptimizer_Stage3.create_reduce_and_remove_grad_hooks (cognitive 17): DeepSpeedZeroOptimizer_Stage3.create_reduce_and_remove_grad_hooks has cognitive complexity 17 (threshold 15). Drivers by points: if/else 3 (10 pts), loops 5 (7 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":"deepspeed/runtime/zero/stage3.py"},"region":{"startLine":1558}}}],"partialFingerprints":{"codehealthFindingId/v1":"3199bde1d5c46b7340491e93f3b27d45b9a7cd2ddac212afb73194bfa547980a"}},{"ruleId":"D2","level":"warning","message":{"text":"DeepSpeedZeroOptimizer_Stage3.get_grad_norm_direct (cognitive 17): DeepSpeedZeroOptimizer_Stage3.get_grad_norm_direct has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (14 pts), loops 1 (2 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":"deepspeed/runtime/zero/stage3.py"},"region":{"startLine":2518}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac84a2c0640b0cff62e3b223ccd4e30f716ca66aca4d34850cd6079f5c45fc9d"}},{"ruleId":"D2","level":"warning","message":{"text":"DeepSpeedZeroOptimizer._offload_compact_grad_partitions (cognitive 17): DeepSpeedZeroOptimizer._offload_compact_grad_partitions has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (12 pts), loops 2 (3 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":"deepspeed/runtime/zero/stage_1_and_2.py"},"region":{"startLine":1362}}}],"partialFingerprints":{"codehealthFindingId/v1":"571758e2aba693205f5a02fd1f7b996076bd2946a976db2c12e8062cbe135a4f"}},{"ruleId":"D2","level":"warning","message":{"text":"DeepSpeedZeroOptimizer.allreduce_and_copy (cognitive 17): DeepSpeedZeroOptimizer.allreduce_and_copy has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (11 pts), boolean chains 3, loops 1 (2 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":"deepspeed/runtime/zero/stage_1_and_2.py"},"region":{"startLine":2479}}}],"partialFingerprints":{"codehealthFindingId/v1":"59320118d3b7925bcf5166e3bc1b84e817789b34009a58fe79f8fc74d888075f"}},{"ruleId":"D2","level":"warning","message":{"text":"DeepSpeedZeroOptimizer.get_flat_partition (cognitive 17): DeepSpeedZeroOptimizer.get_flat_partition has cognitive complexity 17 (threshold 15). Drivers by points: if/else 10 (14 pts), boolean chains 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":"deepspeed/runtime/zero/stage_1_and_2.py"},"region":{"startLine":2800}}}],"partialFingerprints":{"codehealthFindingId/v1":"96202f841a15ee1d3fa4dccb15ea0f1287492112f0b4513b35df3db0972216d4"}},{"ruleId":"D2","level":"warning","message":{"text":"DeepSpeedZeroOptimizer.scaled_global_norm (cognitive 17): DeepSpeedZeroOptimizer.scaled_global_norm has cognitive complexity 17 (threshold 15). Drivers by points: ternaries 3 (9 pts), if/else 4 (7 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":"deepspeed/runtime/zero/stage_1_and_2.py"},"region":{"startLine":3039}}}],"partialFingerprints":{"codehealthFindingId/v1":"2277521c3d2d3abf79faaa10f1c70f921362b79ce83e5757592bab936c87efc8"}},{"ruleId":"D2","level":"warning","message":{"text":"utils.apply_to_tensors_only (cognitive 17): utils.apply_to_tensors_only has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (11 pts), loops 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":"deepspeed/runtime/zero/utils.py"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"8789fa62f2007f4ada512da6eb23a9b22a1c58976ec4a56a8e3292bd047501f6"}},{"ruleId":"D2","level":"warning","message":{"text":"DeepSpeedStaticCache.compact (cognitive 17): DeepSpeedStaticCache.compact has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (9 pts), boolean chains 4, ternaries 2 (3 pts), loops 1 (nesting depth added 3). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"deepspeed/utils/static_cache.py"},"region":{"startLine":258}}}],"partialFingerprints":{"codehealthFindingId/v1":"133750cc9ee56b5a63f26e7d1e9117edc7a5331a1841633f7faf074f1a2f5a7f"}},{"ruleId":"D2","level":"warning","message":{"text":"zero_to_fp32.to_torch_tensor (cognitive 17): zero_to_fp32.to_torch_tensor has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (8 pts), ternaries 2 (7 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":"deepspeed/utils/zero_to_fp32.py"},"region":{"startLine":586}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa89e1b85c6369c06213d8deaf2e1f3dd39bc345e97d695e2bf4771e1c178827"}},{"ruleId":"D2","level":"warning","message":{"text":"CUDAOpBuilder.builder (cognitive 17): CUDAOpBuilder.builder has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9 (12 pts), loops 1 (2 pts), boolean chains 1, error handling 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":"op_builder/builder.py"},"region":{"startLine":849}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb96db4ac7fbc14ff05a22e5bcc10850d99666438a75f891b2f4ff3f31dd1406"}},{"ruleId":"D2","level":"warning","message":{"text":"Autotuner._generate_experiments (cognitive 16): Autotuner._generate_experiments has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (12 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":"deepspeed/autotuning/autotuner.py"},"region":{"startLine":304}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2d4cc24f57a75b95352fad158c9e6d986b72de3c7bf5ab9204cca104d09f94a"}},{"ruleId":"D2","level":"warning","message":{"text":"autoep_affine.autoep_metadata_to_affine_map (cognitive 16): autoep_affine.autoep_metadata_to_affine_map 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":"deepspeed/checkpoint/autoep_affine.py"},"region":{"startLine":210}}}],"partialFingerprints":{"codehealthFindingId/v1":"41ec59915416b567cae959b21df38ffa69c6d42beb7bcba2ed44b6e9023ca75a"}},{"ruleId":"D2","level":"warning","message":{"text":"autoep_universal.get_autoep_zero12_fp32_fallback_param_names (cognitive 16): autoep_universal.get_autoep_zero12_fp32_fallback_param_names has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (10 pts), loops 2 (3 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":"deepspeed/checkpoint/autoep_universal.py"},"region":{"startLine":254}}}],"partialFingerprints":{"codehealthFindingId/v1":"13cdeec3ffda61366ff1508074f0c07c369b67cd3dade975eec954a63fdb36b9"}},{"ruleId":"D2","level":"warning","message":{"text":"ds_to_universal._merge_zero_shards (cognitive 16): ds_to_universal._merge_zero_shards has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (10 pts), loops 3 (5 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":"deepspeed/checkpoint/ds_to_universal.py"},"region":{"startLine":235}}}],"partialFingerprints":{"codehealthFindingId/v1":"a75e8f2b9c150c21589dc2ba1ba818982224f70598fb6ca9c3d6b45dd3a782fe"}},{"ruleId":"D2","level":"warning","message":{"text":"ds_to_universal._validate_autoep_expert_shapes (cognitive 16): ds_to_universal._validate_autoep_expert_shapes has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (12 pts), loops 2 (3 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":"deepspeed/checkpoint/ds_to_universal.py"},"region":{"startLine":731}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e5cec27db0d5dc539bef02d9619ef1d8d5ac1a309a4f0b9107023836766ac26"}},{"ruleId":"D2","level":"warning","message":{"text":"offload_adam_states.insert_offload_opt_states (cognitive 16): offload_adam_states.insert_offload_opt_states has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (10 pts), loops 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":"deepspeed/compile/passes/offload_adam_states.py"},"region":{"startLine":551}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee7438c46afcc202a209201d41b011468c7f63dbb3c311b59c2eb7dc870223f9"}},{"ruleId":"D2","level":"warning","message":{"text":"sp_compile.pass_shard_seq_dim (cognitive 16): sp_compile.pass_shard_seq_dim has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (11 pts), loops 4 (5 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":"deepspeed/compile/passes/sp_compile.py"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6fde464f63a95a0cd145afb668c3c38408d1d4a14cf841b1240137c562012ff"}},{"ruleId":"D2","level":"warning","message":{"text":"attention._check_causal_only (cognitive 16): attention._check_causal_only has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (10 pts), boolean chains 2, loops 1 (2 pts), 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":"deepspeed/models/glm_moe_dsa/attention.py"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"fdf15aaf2deba9bab10597ce3946443edfb637645d09518f24a1f9694591d5b0"}},{"ruleId":"D2","level":"warning","message":{"text":"AutoTP._find_tied_row_parallel_embedding_ids (cognitive 16): AutoTP._find_tied_row_parallel_embedding_ids has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (10 pts), boolean chains 3, 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":"deepspeed/module_inject/auto_tp.py"},"region":{"startLine":626}}}],"partialFingerprints":{"codehealthFindingId/v1":"3bb1a4291a16b3ac2cd244ed85b15565461dea80446e9c0b5850ace06886f855"}},{"ruleId":"D2","level":"warning","message":{"text":"inject.module_inject (cognitive 16): inject.module_inject 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":"deepspeed/module_inject/inject.py"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e78874b9d00f0dbc3d869d6fd180511d7429764348152af0c638c34752f6311"}},{"ruleId":"D2","level":"warning","message":{"text":"DeepSpeedTransformerFunction.backward (cognitive 16): DeepSpeedTransformerFunction.backward has cognitive complexity 16 (threshold 15). Drivers by points: ternaries 8, boolean chains 4, if/else 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":"deepspeed/ops/transformer/transformer.py"},"region":{"startLine":243}}}],"partialFingerprints":{"codehealthFindingId/v1":"090f7167e0bd1cca3282ac8d3f0560f2b68e0122617f96922d08dc5f524c051e"}},{"ruleId":"D2","level":"warning","message":{"text":"DeepSpeedDataLoader.__init__ (cognitive 16): DeepSpeedDataLoader.__init__ has cognitive complexity 16 (threshold 15). Drivers by points: if/else 10 (16 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":"deepspeed/runtime/dataloader.py"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"3da3ec0da389ee4f2a45f6698f9145372fd5fd3b7de4b7fe3314f98507f0898d"}},{"ruleId":"D2","level":"warning","message":{"text":"DeepSpeedEngine._resolve_zero3_param_placement (cognitive 16): DeepSpeedEngine._resolve_zero3_param_placement has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (14 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":"deepspeed/runtime/engine.py"},"region":{"startLine":2315}}}],"partialFingerprints":{"codehealthFindingId/v1":"c380aae10b7fe11a44173f38861f823daff4c00a3e8c911ec44542ecdf767be8"}},{"ruleId":"D2","level":"warning","message":{"text":"engine.split_half_float_double_sparse (cognitive 16): engine.split_half_float_double_sparse has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (12 pts), loops 3 (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":"deepspeed/runtime/engine.py"},"region":{"startLine":167}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b55a3581a85d51ca24303953a1d6388f37c3068daee98506519b65b3c1d19cd"}},{"ruleId":"D2","level":"warning","message":{"text":"engine._resolve_replacement_param_groups (cognitive 16): engine._resolve_replacement_param_groups has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (11 pts), loops 3 (4 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":"deepspeed/runtime/engine.py"},"region":{"startLine":269}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5a34fddf02afae74d2a440801db6f271d4898739d2b0310513df1cbb758f024"}},{"ruleId":"D2","level":"warning","message":{"text":"DeepSpeedHybridEngine.create_inference_module (cognitive 16): DeepSpeedHybridEngine.create_inference_module has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (10 pts), loops 1 (3 pts), ternaries 1 (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":"deepspeed/runtime/hybrid_engine.py"},"region":{"startLine":377}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6cdc1938ad5052b878a1b975bf9f1a20f2ba2812c471b70a0b5f1d8ee238d60"}},{"ruleId":"D2","level":"warning","message":{"text":"utils.get_flattened_grad_norm (cognitive 16): utils.get_flattened_grad_norm has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (12 pts), boolean chains 2, loops 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":"deepspeed/runtime/utils.py"},"region":{"startLine":506}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c1ef87e1c7a4a540c8ec870cd7e10f3e23c8b3d77474c54982bf88945714927"}},{"ruleId":"D2","level":"warning","message":{"text":"engine.configure_zenflow (cognitive 16): engine.configure_zenflow has cognitive complexity 16 (threshold 15). Drivers by points: if/else 12 (15 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":"deepspeed/runtime/zenflow/engine.py"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"01dae0cc4c7aa64d7416a318e7835b9755863830c6ae3d638b9c3de793107b30"}},{"ruleId":"D2","level":"warning","message":{"text":"ZenFlowZeroOptimizer._unpin_offload_buffers (cognitive 16): ZenFlowZeroOptimizer._unpin_offload_buffers has cognitive complexity 16 (threshold 15). Drivers by points: loops 5 (9 pts), if/else 2 (5 pts), boolean chains 2 (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":"deepspeed/runtime/zenflow/zenflow_stage_1_and_2.py"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef0f10fb3807cce467eccdbd5185f2bd6201a13e350f3fdaca0b672807f6c939"}},{"ruleId":"D2","level":"warning","message":{"text":"ZenFlowZeroOptimizer._configure_zenflow (cognitive 16): ZenFlowZeroOptimizer._configure_zenflow has cognitive complexity 16 (threshold 15). Drivers by points: if/else 12 (15 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":"deepspeed/runtime/zenflow/zenflow_stage_1_and_2.py"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a782610c7841dd813915ff9d4dd68b886b1c544fb72c190aec7a86dce1a86e6"}},{"ruleId":"D2","level":"warning","message":{"text":"GatheredParameters.__init__ (cognitive 16): GatheredParameters.__init__ has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9 (11 pts), loops 2 (4 pts), boolean chains 1 (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":"deepspeed/runtime/zero/partition_parameters.py"},"region":{"startLine":2294}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c5ca820174f7f546b040398b665799889847426970ec99f7b3ba2d14cfd2627"}},{"ruleId":"D2","level":"warning","message":{"text":"DeepSpeedZeroOptimizer_Stage3.partition_grads (cognitive 16): DeepSpeedZeroOptimizer_Stage3.partition_grads has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (15 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":"deepspeed/runtime/zero/stage3.py"},"region":{"startLine":2106}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6566543e2472ae925ed76be35677eef517c7f90e0b06c8ab6f33a2c90e3b7e3"}},{"ruleId":"D2","level":"warning","message":{"text":"DeepSpeedZeroOptimizer_Stage3._rigid_load_state_dict (cognitive 16): DeepSpeedZeroOptimizer_Stage3._rigid_load_state_dict has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (8 pts), loops 5 (7 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":"deepspeed/runtime/zero/stage3.py"},"region":{"startLine":3753}}}],"partialFingerprints":{"codehealthFindingId/v1":"eaeed329c455aa2729ef8d131dd3a442bf4599738081a591368d8948007b6ae9"}},{"ruleId":"D2","level":"warning","message":{"text":"stage3.estimate_zero3_model_states_mem_needs (cognitive 16): stage3.estimate_zero3_model_states_mem_needs has cognitive complexity 16 (threshold 15). Drivers by points: if/else 10 (16 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":"deepspeed/runtime/zero/stage3.py"},"region":{"startLine":4284}}}],"partialFingerprints":{"codehealthFindingId/v1":"98e8ebcd8055483ad75ecf0e81be63a97e1226dc095ee3726e1a59dbbdefc198"}},{"ruleId":"D2","level":"warning","message":{"text":"DeepSpeedZeroOptimizer._get_flat_partition_unpadded (cognitive 16): DeepSpeedZeroOptimizer._get_flat_partition_unpadded has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (12 pts), boolean chains 3, 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":"deepspeed/runtime/zero/stage_1_and_2.py"},"region":{"startLine":2923}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ce05259da128e949f17b4ef3a2f67d232bbfdf6a72d058594dd33f7e9218047"}},{"ruleId":"D2","level":"warning","message":{"text":"ThroughputTimer.stop (cognitive 16): ThroughputTimer.stop 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":"deepspeed/utils/timer.py"},"region":{"startLine":253}}}],"partialFingerprints":{"codehealthFindingId/v1":"787a6f37e1a0cf507751831b299fa59113699140333cffa55b37f61d26af1b96"}},{"ruleId":"D2","level":"warning","message":{"text":"OpBuilder.jit_load (cognitive 16): OpBuilder.jit_load has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (9 pts), boolean chains 4, ternaries 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":"op_builder/builder.py"},"region":{"startLine":616}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c6a2e867717667f6e17b6e414a41be5800fc4ac51022d972b390db8dd3dd1cf"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: DeepSpeedEngine: TooManyMethods \u2014 303 methods. The bar is 30 methods; this is 273 over it, 10.10\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":"deepspeed/runtime/engine.py"},"region":{"startLine":516}}}],"partialFingerprints":{"codehealthFindingId/v1":"953c96dfe6ef4ddcbf53abfe9e0b9fe361a3ef090d9e13cbcf18cbefb3da203b"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: zero/stage3.py: FileTooLong \u2014 3146 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 2646 over it, 6.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":"deepspeed/runtime/zero/stage3.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"fbb81210f46049f49de8601fe991a7c562dfa2bc8d3d8f34f6e0dae6e4ca720b"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: DeepSpeedZeroOptimizer_Stage3: TooManyMethods \u2014 183 methods. The bar is 30 methods; this is 153 over it, 6.10\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":"deepspeed/runtime/zero/stage3.py"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"421c17a63cf77b40248a53d7d2ec070c166d784dbe9856d16d4e3dda9889a52b"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: zero/stage_1_and_2.py: FileTooLong \u2014 2834 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 2334 over it, 5.67\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":"deepspeed/runtime/zero/stage_1_and_2.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ca382e85261a1f80da4e202d6770f448c102426cbe40742f6d5290e042800d1"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: runtime/engine.py: FileTooLong \u2014 2650 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 2150 over it, 5.30\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":"deepspeed/runtime/engine.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b0e02478d4413890a0f11da0dc84e9d7a6b002510afcfa6aa9789e5c8aa7435"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: DeepSpeedZeroOptimizer: TooManyMethods \u2014 158 methods. The bar is 30 methods; this is 128 over it, 5.27\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":"deepspeed/runtime/zero/stage_1_and_2.py"},"region":{"startLine":158}}}],"partialFingerprints":{"codehealthFindingId/v1":"00e8b9fde19543608fd2b42f4c833a1743185aa1f646d442ddfd20c3e3529ccb"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: ci/torch_latest.py: FileTooLong \u2014 1644 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 1144 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":"ci/torch_latest.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"18181b782eb49cdc3709d0a948b23463357478fb267edc01a6a26dc7c244282b"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: zero/partition_parameters.py: FileTooLong \u2014 1636 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 1136 over it, 3.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":"deepspeed/runtime/zero/partition_parameters.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a3ed5035915c48cf73007d9f504208e32c73029bac8128fbe7901d5abb1edd9"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: module_inject/layers.py: FileTooLong \u2014 1633 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 1133 over it, 3.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":"deepspeed/module_inject/layers.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d73ce18b8666ee528e5e565463a96f7831aa85f3b1627b88be824a46758590f6"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: rollout/hybrid_engine_rollout.py: FileTooLong \u2014 1268 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 768 over it, 2.54\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":"deepspeed/runtime/rollout/hybrid_engine_rollout.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb45bfd66b7f1633c70457c1e5e1dde17f84b0c4d8a835f23778cbc5b2e69b18"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: DeepSpeedAccelerator: TooManyMethods \u2014 75 methods. The bar is 30 methods; this is 45 over it, 2.50\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":"accelerator/abstract_accelerator.py"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"8665660607d8aa8674c7904b3cb25a1587a1cea95d87f82adea1bffac62e5cc4"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: sequence/fpdt_layer.py: FileTooLong \u2014 1118 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 618 over it, 2.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":"deepspeed/sequence/fpdt_layer.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"989f0cb425aae23896f591d7d7b2d7c2b34f7fb40b44ccd97d2865a6d1211d03"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: CUDA_Accelerator: TooManyMethods \u2014 67 methods. The bar is 30 methods; this is 37 over it, 2.23\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":"accelerator/cuda_accelerator.py"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"9748fd6069fe29f75c530502d4d6cc4628bc25c3f386768ac29e8fbbe825f8dc"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: NPU_Accelerator: TooManyMethods \u2014 63 methods. The bar is 30 methods; this is 33 over it, 2.10\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":"accelerator/npu_accelerator.py"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a9e16f32848643cee00ba9236dd0eb10b5d34e5e1dcbd12337ba7bd474fbb55"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: XPU_Accelerator: TooManyMethods \u2014 63 methods. The bar is 30 methods; this is 33 over it, 2.10\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":"accelerator/xpu_accelerator.py"},"region":{"startLine":177}}}],"partialFingerprints":{"codehealthFindingId/v1":"154a7f3251c10d19c363eb5c860ac2f260d62f16294332249415b522604ac5ab"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: CPU_Accelerator: TooManyMethods \u2014 62 methods. The bar is 30 methods; this is 32 over it, 2.07\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":"accelerator/cpu_accelerator.py"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f47ae3f362373be9c5623bc2aea376abece1703db72d951e56dee0b2db1be56"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: MPS_Accelerator: TooManyMethods \u2014 62 methods. The bar is 30 methods; this is 32 over it, 2.07\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":"accelerator/mps_accelerator.py"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0e91aecfa055ad037656eb9c0a5ffef3bd82a8ebb72f067b51167db8ee728fe"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: HPU_Accelerator: TooManyMethods \u2014 61 methods. The bar is 30 methods; this is 31 over it, 2.03\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":"accelerator/hpu_accelerator.py"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"43b474301ff57107d5a15239a6898219b42420aadfd7228db061963547ffe510"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: SUPA_Accelerator: TooManyMethods \u2014 61 methods. The bar is 30 methods; this is 31 over it, 2.03\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":"accelerator/supa_accelerator.py"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f59f9b5f9cf568472de280cad3649c8a4e8e7ddf4cff8016dabe0a5d04caa4b"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: checkpoint/ds_to_universal.py: FileTooLong \u2014 1014 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 514 over it, 2.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":"deepspeed/checkpoint/ds_to_universal.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"254110c01bf5cbbc37f5573b966f1c639d8488969b0aee21abf8304dbb9c2aac"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: MLU_Accelerator: 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":"accelerator/mlu_accelerator.py"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9a3e5ffd50a46ad272c5645f635d53bc3f9dcac24c6f3812c20972bd38479ca"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: SDAA_Accelerator: 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":"accelerator/sdaa_accelerator.py"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b8dca910e865d975eea4503f3c95dbaa10ee0607ad4174b0a8ab0c2739bfef4"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: module_inject/auto_ep_layer.py: FileTooLong \u2014 906 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 406 over it, 1.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":"deepspeed/module_inject/auto_ep_layer.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0edb85c2413b5190605d70cfda63a3b2e16b2a599ebda50048a3ddc8611e306"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: module_inject/auto_tp.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":"deepspeed/module_inject/auto_tp.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"748c81c82f6baa4b707aa28f85743909969e52737a744ca1bb48e7d5d3767a71"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: SUPAInference: TooManyMethods \u2014 53 methods. The bar is 30 methods; this is 23 over it, 1.77\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":"op_builder/supa/inference.py"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb81f7be436a8b9acf78e2856e52c9377f04835c536ac7833120229785f18a56"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: pipe/engine.py: FileTooLong \u2014 880 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 380 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":"deepspeed/runtime/pipe/engine.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a31d492427c7884902a0064931e5981c7ab95635abb2ab2795fd2a2cce53b1cb"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: flops_profiler/profiler.py: FileTooLong \u2014 864 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 364 over it, 1.73\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":"deepspeed/profiling/flops_profiler/profiler.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ecf0f83c27a47dd091d06db8bc0ecfa6d4f1b5acb8761f20f079562406c0b9e5"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: autotuning/autotuner.py: FileTooLong \u2014 842 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 342 over it, 1.68\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":"deepspeed/autotuning/autotuner.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"bbaee14d0c097995b3a64e0a5fdcf96b58be1ceb753ef9c58453385813165469"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: runtime/utils.py: FileTooLong \u2014 835 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 335 over it, 1.67\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":"deepspeed/runtime/utils.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e04079bf6a9008a1a3adca065ac1843d149586dc8c91852045e00347a369226d"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: adam/zenflow_torch_adam.py: FileTooLong \u2014 819 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 319 over it, 1.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":"deepspeed/ops/adam/zenflow_torch_adam.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2738b80dcfbb10d81428cb7695fef6c88a2ced90260d49a9b7abf5e261cdb5ef"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: PipelineEngine: TooManyMethods \u2014 49 methods. The bar is 30 methods; this is 19 over it, 1.63\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":"deepspeed/runtime/pipe/engine.py"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c962ca98d979cc82756e3d1e4ae87f8c76f6d66ea58493092b4b007c883b213"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: activation_checkpointing/checkpointing.py: FileTooLong \u2014 754 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 254 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":"deepspeed/runtime/activation_checkpointing/checkpointing.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb8ed9b6cc222c3b00de3ccb3f98b57d80462da96ae57ca021ba04ed3132af26"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: data_sampling/data_analyzer.py: FileTooLong \u2014 730 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 230 over it, 1.46\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":"deepspeed/runtime/data_pipeline/data_sampling/data_analyzer.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b46b1586060fb4a355c776dbb090ecb0470f8be3126c18db3c1f0b6c1d6f3eba"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: TorchBackend: TooManyMethods \u2014 42 methods. The bar is 30 methods; this is 12 over it, 1.40\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":"deepspeed/comm/torch.py"},"region":{"startLine":238}}}],"partialFingerprints":{"codehealthFindingId/v1":"118715216bc4698098f3f3fadacad7cbb2aacfae6ba8a72188e3a5eb254b76ee"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: HybridEngineRollout: TooManyMethods \u2014 42 methods. The bar is 30 methods; this is 12 over it, 1.40\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":"deepspeed/runtime/rollout/hybrid_engine_rollout.py"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"20dff2e3834e646930690d490adb1db9713310f49979753c4e1fe5babc3485ad"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: op_builder/builder.py: FileTooLong \u2014 692 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 192 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":"op_builder/builder.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"266965d030da4b6d5520373b8acd0650b6f7254acc2dab2457e490af5cda00c3"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: sequence_parallel/ulysses_sp.py: FileTooLong \u2014 662 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 162 over it, 1.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":"deepspeed/runtime/sequence_parallel/ulysses_sp.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"36b2c5eb35a2022b7caff4cb8afc2ea64171b80a5046fb9871eeb7c09433b367"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: DeepSpeedCheckpoint: TooManyMethods \u2014 39 methods. The bar is 30 methods; this is 9 over it, 1.30\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":"deepspeed/checkpoint/deepspeed_checkpoint.py"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"2385cfa0fbfe6844e7dfcfd1e565c505b12edf46918e4d9b5969dae8546c0f11"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: AutoTP: TooManyMethods \u2014 38 methods. The bar is 30 methods; this is 8 over it, 1.27\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":"deepspeed/module_inject/auto_tp.py"},"region":{"startLine":210}}}],"partialFingerprints":{"codehealthFindingId/v1":"97099ebec25a878eccb4f413c0d17e13f4ff487894c2b936ef1345b106dea0f5"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: checkpoint/affine.py: FileTooLong \u2014 623 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 123 over it, 1.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":"deepspeed/checkpoint/affine.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"784106abe87004d0ca5a1c98e459b05843bab620bb44d4a3a47df788a2728cd4"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: comm/comm.py: FileTooLong \u2014 604 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 104 over it, 1.21\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":"deepspeed/comm/comm.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a04d48a87542d874fc585663dc62a63420d2000eee257ac9bb8d74861a96f88"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: zenflow/zenflow_stage_1_and_2.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":"deepspeed/runtime/zenflow/zenflow_stage_1_and_2.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed70a299333d0d0c266f9b40082baf22a8a42013bc830aa8c305cee8b81b6fc9"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: checkpoint/affine_transfer.py: FileTooLong \u2014 595 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 95 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":"deepspeed/checkpoint/affine_transfer.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"63d5cab9e8d1e9c04494ba3cd29bd2b6825d3624220440efe9809f07636f9202"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: BF16_Optimizer: 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":"deepspeed/runtime/bf16_optimizer.py"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"f49fbea79df2f45b5816355d13bf293890d62ea105305f1d699cac81c88b29c1"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: runtime/bf16_optimizer.py: FileTooLong \u2014 569 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 69 over it, 1.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":"deepspeed/runtime/bf16_optimizer.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b9f4eb74924b465a1504f451775ef0b5ae94955ac140928391262f10d0ad2f4"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: compile/list_schedule.py: FileTooLong \u2014 563 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 63 over it, 1.13\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":"deepspeed/compile/list_schedule.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c16f938293775eb169ea56ed9a907c47459e25b15d93a698b4a5214c7d6c79e9"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: module_inject/auto_ep.py: FileTooLong \u2014 558 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 58 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":"deepspeed/module_inject/auto_ep.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a8694079d3a61e58fbb1670d49c316683f1a872a9df47d6afc35b3b9a867c35"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Autotuner: TooManyMethods \u2014 33 methods. The bar is 30 methods; this is 3 over it, 1.10\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":"deepspeed/autotuning/autotuner.py"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"f47572b79ca9a90b651ae9314b2134d6b54156673482f5de66a92a9d1438b874"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: module_inject/replace_module.py: FileTooLong \u2014 536 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 36 over it, 1.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":"deepspeed/module_inject/replace_module.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c505c33458ff007796e3e424700f4652f81020b3ad6b7b584251f17928d8f7a6"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: runtime/lr_schedules.py: FileTooLong \u2014 535 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 35 over it, 1.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":"deepspeed/runtime/lr_schedules.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd5381828169d69ec0ec4c293add5a004574b2c66b3ed50c6d86a21f92d5fd5e"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: utils/zero_to_fp32.py: FileTooLong \u2014 525 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 25 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":"deepspeed/utils/zero_to_fp32.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8aa0d69a579b274c8077799bdda6f7ed2b5cb8c03ee04b30f879dcbefe1cb473"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: runtime/config.py: FileTooLong \u2014 524 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 24 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":"deepspeed/runtime/config.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c110ec36dc03f91c81f232dd2e7a6189a1f693353d62278b424b027df01d2fc7"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: inference/engine.py: FileTooLong \u2014 501 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 1 over it, 1.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":"deepspeed/inference/engine.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4eec57f138d0e2552fab87da82d614f918be2689babbbdaf30904a427074793"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member family (4 members, 25 shared lines): deepspeed/ops/adam/zenflow_torch_adam.py:105-162 | deepspeed/ops/adam/zenflow_torch_adam.py:204-273 | deepspeed/ops/adam/zenflow_torch_adam.py:333-402 | deepspeed/ops/adam/zenflow_torch_adam.py:542-635 \u2014 These 4 members are variants of one another: a block of 25 lines reported below appears in every one of them, and the pairwise near-duplicate rows they would otherwise produce are collapsed into this row. Read them 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":"deepspeed/ops/adam/zenflow_torch_adam.py"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a13f1f302848bc5d870e19d0a458c3422def76128dcd13fcd5bc778a79422db"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member family (3 members, 29 shared lines): deepspeed/ops/transformer/inference/triton/matmul_ext.py:275-317 | deepspeed/ops/transformer/inference/triton/matmul_ext.py:321-372 | deepspeed/ops/transformer/inference/triton/matmul_ext.py:376-429 \u2014 These 3 members are variants of one another: a block of 29 lines reported below appears in every one of them, and the pairwise near-duplicate rows they would otherwise produce are collapsed into this row. Read them as one construct written 3 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 3 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"deepspeed/ops/transformer/inference/triton/matmul_ext.py"},"region":{"startLine":275}}}],"partialFingerprints":{"codehealthFindingId/v1":"32570f1d699284fe2da88bbdfca7aa314be305a42eb2195f7f0b560d3f7f76c3"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (55 shared lines): deepspeed/sequence/fpdt_layer.py:196-345 | deepspeed/sequence/fpdt_layer.py:626-836 \u2014 These two members are variants of one another: 55 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":"deepspeed/sequence/fpdt_layer.py"},"region":{"startLine":196}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff7e81a8c7fe5d95ea60ee57d238e1751a6e380e344cda94b6dea29222f804f2"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (36 shared lines): deepspeed/ops/transformer/inference/ds_attention.py:22-91 | deepspeed/ops/transformer/inference/triton/attention.py:26-106 \u2014 These two members are variants of one another: 36 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":"deepspeed/ops/transformer/inference/ds_attention.py"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e4986729fad4769e57ba0acac0d2f441354888425289c171d13dbb96e8ce795"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (30 shared lines): deepspeed/runtime/zero/stage_1_and_2.py:2808-2876 | deepspeed/runtime/zero/stage_1_and_2.py:2931-2981 \u2014 These two members are variants of one another: 30 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":"deepspeed/runtime/zero/stage_1_and_2.py"},"region":{"startLine":2808}}}],"partialFingerprints":{"codehealthFindingId/v1":"3394083c0c573c88a072827200bd70e50d866e8e3162d10fca6b65c97d08782a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): csrc/aio/py_test/parse_aio_stats.py:37-57 | deepspeed/nvme/parse_nvme_stats.py:37-57 \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":"csrc/aio/py_test/parse_aio_stats.py"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"f92644a4b82da19cbdc4b3e8357fd89c563283ec235eab4d2af3bd6a4f70f1b3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): deepspeed/runtime/zero/partition_parameters.py:64-77 | deepspeed/runtime/zero/partition_parameters.py:92-106 \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":"deepspeed/runtime/zero/partition_parameters.py"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa3f30d4f8f3a9d780f9871f753da51365169be3b86e1a2e9cf06506a4ed479e"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (11 members, 50\u002B identical tokens): deepspeed/inference/v2/model_implementations/exaone4/model.py:189-200 | deepspeed/inference/v2/model_implementations/falcon/model.py:179-199 | deepspeed/inference/v2/model_implementations/llama_v2/model.py:178-197 | deepspeed/inference/v2/model_implementations/mistral/model.py:177-196 | deepspeed/inference/v2/model_implementations/mixtral/model.py:231-250 | deepspeed/inference/v2/model_implementations/opt/model.py:166-182 | deepspeed/inference/v2/model_implementations/phi/model.py:164-185 | deepspeed/inference/v2/model_implementations/phi3/model.py:174-193 | deepspeed/inference/v2/model_implementations/qwen/model.py:192-211 | deepspeed/inference/v2/model_implementations/qwen_v2/model.py:190-209 | deepspeed/inference/v2/model_implementations/qwen_v2_moe/model.py:329-348 \u2014 These 11 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 11 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 11 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"deepspeed/inference/v2/model_implementations/exaone4/model.py"},"region":{"startLine":189}}}],"partialFingerprints":{"codehealthFindingId/v1":"1310f56f116899651ae1c65e32448acc9aa0ba418781500de012b46386b8525d"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (8 members, 50\u002B identical tokens): op_builder/evoformer_attn.py:58-99 | op_builder/fp_quantizer.py:23-46 | op_builder/inference_core_ops.py:23-45 | op_builder/inference_cutlass_builder.py:22-44 | op_builder/ragged_ops.py:23-45 | op_builder/ragged_utils.py:23-45 | op_builder/spatial_inference.py:22-40 | op_builder/transformer_inference.py:22-44 \u2014 These 8 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 8 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 8 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"op_builder/evoformer_attn.py"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a68590de71483696f458dd04c84dbcb9aff479ac82173ad757011774ceef5b4"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (7 members, 50\u002B identical tokens): deepspeed/inference/v2/model_implementations/llama_v2/model.py:135-175 | deepspeed/inference/v2/model_implementations/mistral/model.py:134-174 | deepspeed/inference/v2/model_implementations/opt/model.py:130-163 | deepspeed/inference/v2/model_implementations/phi3/model.py:134-171 | deepspeed/inference/v2/model_implementations/qwen/model.py:149-189 | deepspeed/inference/v2/model_implementations/qwen_v2/model.py:147-187 | deepspeed/inference/v2/model_implementations/qwen_v2_moe/model.py:281-326 \u2014 These 7 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 7 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 7 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"deepspeed/inference/v2/model_implementations/llama_v2/model.py"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"9cd82fcd97506f572ef39c643ceaad9fe050f0875da968b050fc68fb1ead8476"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (7 members, 50\u002B identical tokens): deepspeed/utils/numa.py:44-62 | op_builder/async_io.py:78-96 | op_builder/cpu/async_io.py:54-72 | op_builder/klxpu/async_io.py:50-68 | op_builder/npu/async_io.py:61-79 | op_builder/supa/async_io.py:50-68 | op_builder/xpu/async_io.py:63-81 \u2014 These 7 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 7 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 7 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"deepspeed/utils/numa.py"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"ffdc6a6d5e104af7e914eb41f18496d37e3cd7757f09f07ba5f2ff0ded2ce5d0"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (6 members, 50\u002B identical tokens): csrc/aio/py_test/ds_aio_basic.py:44-64 | csrc/aio/py_test/torch_fastio_engine.py:53-87 | csrc/aio/py_test/torch_io.py:40-64 | deepspeed/nvme/ds_aio_basic.py:44-64 | deepspeed/nvme/torch_fastio_engine.py:53-87 | deepspeed/nvme/torch_io.py:40-64 \u2014 These 6 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 6 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 6 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"csrc/aio/py_test/ds_aio_basic.py"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"13fd13f2730896768af5f7a21f339d23f6054de947d04e8418dddd3a55a20c25"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (6 members, 50\u002B identical tokens): op_builder/fp_quantizer.py:49-58 | op_builder/inference_core_ops.py:48-57 | op_builder/inference_cutlass_builder.py:47-57 | op_builder/ragged_ops.py:48-58 | op_builder/ragged_utils.py:48-57 | op_builder/transformer_inference.py:47-56 \u2014 These 6 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 6 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 6 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"op_builder/fp_quantizer.py"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4a07435fe8862084dc794e4c4d911da5580a55d60dd178eb70642e3a962ce71"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (5 members, 50\u002B identical tokens): deepspeed/ops/adagrad/cpu_adagrad.py:42-99 | deepspeed/ops/adam/cpu_adam.py:118-196 | deepspeed/ops/adam/cpu_adam.py:232-265 | deepspeed/ops/adam/zenflow_cpu_adam.py:23-74 | deepspeed/ops/lion/cpu_lion.py:78-129 \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":"deepspeed/ops/adagrad/cpu_adagrad.py"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa5f5a2d77d6193f0872529bd6112797f9de70cb9be96ff32cdbdb79c35988d8"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (5 members, 50\u002B identical tokens): deepspeed/runtime/zero/muon/muon_optimizer.py:58-123 | deepspeed/runtime/zero/muon/original_muon.py:271-300 | deepspeed/runtime/zero/muon/original_muon.py:315-337 | deepspeed/runtime/zero/muon/original_muon.py:402-447 | deepspeed/runtime/zero/muon/original_muon.py:480-518 \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":"deepspeed/runtime/zero/muon/muon_optimizer.py"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"65492017b78c615bb788bc088c24caa6d09a2363dbe272558d95c3a7064e78db"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): csrc/aio/py_test/aio_bench_perf_sweep.py:49-88 | csrc/aio/py_test/ds_aio_args.py:117-196 | deepspeed/nvme/ds_aio_args.py:117-196 | deepspeed/nvme/perf_run_sweep.py:67-111 \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":"csrc/aio/py_test/aio_bench_perf_sweep.py"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ce54366b5adea4f69269cad9883726c5c9e38bb01244b177ef6f348545927dd"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): deepspeed/inference/v2/model_implementations/llama_v2/model.py:87-98 | deepspeed/inference/v2/model_implementations/mistral/model.py:87-97 | deepspeed/inference/v2/model_implementations/mixtral/model.py:92-102 | deepspeed/inference/v2/model_implementations/phi3/model.py:87-97 \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":"deepspeed/inference/v2/model_implementations/llama_v2/model.py"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"134a14b47011a44f1bb21a9a554f02b1e786ca8836d4b304e2c99326eadfb558"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): deepspeed/launcher/multinode_runner.py:148-154 | deepspeed/launcher/multinode_runner.py:209-215 | deepspeed/launcher/multinode_runner.py:281-287 | deepspeed/launcher/multinode_runner.py:470-475 \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":"deepspeed/launcher/multinode_runner.py"},"region":{"startLine":148}}}],"partialFingerprints":{"codehealthFindingId/v1":"efec4650bdc27d04e6dd7a958cb38425af494d3524647ba6f406bb884c31de73"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): op_builder/klxpu/builder.py:16-27 | op_builder/mlu/builder.py:19-29 | op_builder/sdaa/builder.py:44-54 | op_builder/supa/builder.py:15-26 \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":"op_builder/klxpu/builder.py"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ba4e4a8e74290a3487306dc4e75c71849959138796c61b618c96de4a64bdd02"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (76 corresponding lines): deepspeed/ops/adam/fused_adam.py:108-195 | deepspeed/ops/lion/fused_lion.py:56-131 \u2014 These two members are one piece of code written twice and then edited apart: 76 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"deepspeed/ops/adam/fused_adam.py"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"e11c07d04adbe4f1e7c61579dc4bacae978a2fd44b678320e6ff00a25ccd50e1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (42 corresponding lines): deepspeed/ops/fp_quantizer/fp8_gemm_triton.py:27-68 | deepspeed/ops/fp_quantizer/fp8_gemm_triton.py:76-125 \u2014 These two members are one piece of code written twice and then edited apart: 42 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"deepspeed/ops/fp_quantizer/fp8_gemm_triton.py"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"9080c2871e25f3eefd31be7609fab1f38ed29c8204d05c57d5c154a81572206d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (71 corresponding lines): deepspeed/runtime/zenflow/engine_stage3.py:373-443 | deepspeed/runtime/zero/stage3.py:1370-1441 \u2014 These two members are one piece of code written twice and then edited apart: 71 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"deepspeed/runtime/zenflow/engine_stage3.py"},"region":{"startLine":373}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c521ddc6e4afa10e11f305bbd0596f5fff7aedae7d7ee7abcbbbc290174113d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 31\u002B corresponding lines): deepspeed/ops/transformer/inference/triton/layer_norm.py:28-58 | deepspeed/ops/transformer/inference/triton/layer_norm.py:75-110 | deepspeed/ops/transformer/inference/triton/layer_norm.py:128-164 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 31 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":"deepspeed/ops/transformer/inference/triton/layer_norm.py"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"6282788461c29e7535ff706ffb0596152e2b6b05f850a5b4d2ec6b288bd0f6d7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (36 corresponding lines): deepspeed/runtime/fp16/fused_optimizer.py:405-440 | deepspeed/runtime/fp16/unfused_optimizer.py:278-313 \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":"deepspeed/runtime/fp16/fused_optimizer.py"},"region":{"startLine":405}}}],"partialFingerprints":{"codehealthFindingId/v1":"436fa323f3c6a03edc7928ca40be2db6df766b895a3e0aff1e916034749413d2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (20 corresponding lines): deepspeed/module_inject/containers/megatron_gpt.py:85-113 | deepspeed/module_inject/containers/megatron_gpt_moe.py:64-83 \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":"deepspeed/module_inject/containers/megatron_gpt.py"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"e504ff487416bee5033d7ca1466ae3a983146da9fa1cbcbdee2bc062cb65562f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (30 corresponding lines): csrc/aio/py_test/ds_aio_handle.py:77-106 | deepspeed/nvme/ds_aio_handle.py:86-126 \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":"csrc/aio/py_test/ds_aio_handle.py"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"ebf696b86b143a79488d49f04977afe0ee5428f2198463429bbb011ab1b2cd17"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (39 corresponding lines): deepspeed/profiling/flops_profiler/profiler.py:570-611 | deepspeed/profiling/flops_profiler/profiler.py:624-662 \u2014 These two members are one piece of code written twice and then edited apart: 39 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"deepspeed/profiling/flops_profiler/profiler.py"},"region":{"startLine":570}}}],"partialFingerprints":{"codehealthFindingId/v1":"decb61d14b50d286ad2c25cd497fb72d8259e5ceb4b31e6ace814cf193ea7904"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (32 corresponding lines): deepspeed/compile/init_z1_and_2.py:66-97 | deepspeed/runtime/zero/stage_1_and_2.py:1317-1349 \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":"deepspeed/compile/init_z1_and_2.py"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"098acdaaab3819b7798239d639535336dd6c81b6991390a3fbeeec070aa5c4d1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (20 corresponding lines): deepspeed/runtime/zero/muon/original_muon.py:377-397 | deepspeed/runtime/zero/muon/original_muon.py:456-475 \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":"deepspeed/runtime/zero/muon/original_muon.py"},"region":{"startLine":377}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b69b634995bcb17c0b6d5482bd743072e3837e0999fff05a352c9561b41e7a4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (41 corresponding lines): deepspeed/runtime/zenflow/engine_stage3.py:30-70 | deepspeed/runtime/zenflow/zenflow_stage_1_and_2.py:112-157 \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":"deepspeed/runtime/zenflow/engine_stage3.py"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9767e4feb1ab4b069ba36c87b5220f71e645ab75fe4ace00d8173714467e407"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (39 corresponding lines): op_builder/npu/fused_lamb.py:42-80 | op_builder/supa/fused_lamb.py:25-64 \u2014 These two members are one piece of code written twice and then edited apart: 39 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"op_builder/npu/fused_lamb.py"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"77f9a6e67cfab16a28344ef66b45131545dde43e1ca305f424b583679b4db3b5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (27 corresponding lines): csrc/aio/py_test/aio_bench_generate_param.py:51-77 | deepspeed/nvme/perf_generate_param.py:53-83 \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":"csrc/aio/py_test/aio_bench_generate_param.py"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef6bcaf7a1f6441ae159a6aa19d394bf2bb596e30f2483074595b302137af032"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (34 corresponding lines): deepspeed/compile/custom_ops/tp_collectives.py:53-86 | deepspeed/module_inject/layers.py:325-358 \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":"deepspeed/compile/custom_ops/tp_collectives.py"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"bdc354ed394ed48dc3377518ac2bc3cc2f095021f803652ed773e369632a22d7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (24 corresponding lines): deepspeed/module_inject/layers.py:2182-2210 | deepspeed/module_inject/layers.py:2316-2339 \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":"deepspeed/module_inject/layers.py"},"region":{"startLine":2182}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b3e0842940535dad5843311556ba7a0957c0de7577db4b58c9de0b0cf129753"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 27\u002B corresponding lines): deepspeed/module_inject/containers/internlm.py:77-114 | deepspeed/module_inject/containers/llama.py:132-162 | deepspeed/module_inject/containers/llama2.py:82-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 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 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"deepspeed/module_inject/containers/internlm.py"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"0225cc25da17b6b2b9095342535f873d8fca358eec218513281dc6739bc8d7d5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (32 corresponding lines): deepspeed/module_inject/containers/bloom.py:71-102 | deepspeed/module_inject/containers/gptneox.py:62-94 \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":"deepspeed/module_inject/containers/bloom.py"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc2487d5d69bbaa44a51d1d58b86d7cb5519f59423f766588918917d4cf524f6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): deepspeed/autotuning/utils.py:419-440 | deepspeed/autotuning/utils.py:444-461 \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":"deepspeed/autotuning/utils.py"},"region":{"startLine":419}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5a381cd99c45fd3eaa2f961110af68dc2f79363473ecf6b28772853f35b16dd"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (37 corresponding lines): deepspeed/inference/v2/model_implementations/falcon/model.py:128-176 | deepspeed/inference/v2/model_implementations/phi/model.py:125-161 \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":"deepspeed/inference/v2/model_implementations/falcon/model.py"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"53a5b25110e3f3ec20991d1af52d5f9f9184248816e827e313ba3e72ac57bdd6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (20 corresponding lines): deepspeed/runtime/zero/stage3.py:1455-1474 | deepspeed/runtime/zero/stage_1_and_2.py:1008-1028 \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":"deepspeed/runtime/zero/stage3.py"},"region":{"startLine":1455}}}],"partialFingerprints":{"codehealthFindingId/v1":"e283ad71d0e683b9544a2893fe757b18979807c8c95e8e49fb9dc3a77696aefb"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (47 corresponding lines): deepspeed/ops/adam/cpu_adam.py:26-98 | deepspeed/ops/lion/cpu_lion.py:17-63 \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":"deepspeed/ops/adam/cpu_adam.py"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d698e658c4ccc3daa72522802d059ba0065d42707c542175c161aaf299c69c8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (33 corresponding lines): deepspeed/runtime/domino/transformer.py:161-193 | deepspeed/runtime/domino/transformer.py:201-233 \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":"deepspeed/runtime/domino/transformer.py"},"region":{"startLine":161}}}],"partialFingerprints":{"codehealthFindingId/v1":"4fb253dbe948e8d7fbbb657e3563ac223211d7984785501eeceafdd52aebb75c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): deepspeed/module_inject/containers/features/hybrid_megatron.py:15-29 | deepspeed/module_inject/containers/features/megatron.py:17-25 \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":"deepspeed/module_inject/containers/features/hybrid_megatron.py"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d7dd1f8a9eeab46d9f1d0c40ace01b849d68869425f051ff61150d4e0e79f96"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): deepspeed/runtime/zenflow/engine_stage3.py:541-557 | deepspeed/runtime/zenflow/zenflow_stage_1_and_2.py:759-776 \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":"deepspeed/runtime/zenflow/engine_stage3.py"},"region":{"startLine":541}}}],"partialFingerprints":{"codehealthFindingId/v1":"5be9f479d551b9d383a386788a0c70272de696694ab0ef4300fc427ac44fb684"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (22 corresponding lines): deepspeed/ops/fp_quantizer/quantize.py:122-143 | deepspeed/ops/fp_quantizer/quantize.py:152-178 \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":"deepspeed/ops/fp_quantizer/quantize.py"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"e410190e71a1f2e7e7f220c7fa9b02d7f73f0716a13c108ea74fda6e67269f6a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (38 corresponding lines): deepspeed/ops/triton_ops/group_gemm_triton.py:323-360 | deepspeed/ops/triton_ops/group_gemm_triton.py:364-403 \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":"deepspeed/ops/triton_ops/group_gemm_triton.py"},"region":{"startLine":323}}}],"partialFingerprints":{"codehealthFindingId/v1":"daeb88fdf417b06959ef8b6be1322260884cf68c2293f1a0a05670a014f5a3f0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (27 corresponding lines): deepspeed/ops/transformer/inference/ds_mlp.py:93-125 | deepspeed/ops/transformer/inference/triton/mlp.py:56-82 \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":"deepspeed/ops/transformer/inference/ds_mlp.py"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"261aab81f72aac74982dad00566dbe6a682534a454a9d8a40c0a80a91d7e4107"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): deepspeed/profiling/flops_profiler/profiler.py:786-804 | deepspeed/profiling/flops_profiler/profiler.py:808-827 \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":"deepspeed/profiling/flops_profiler/profiler.py"},"region":{"startLine":786}}}],"partialFingerprints":{"codehealthFindingId/v1":"b270f3c8a7861a720e1e0f5e54ae1e45d023f6b4d8a2fc83a5db94e909c21ff6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (30 corresponding lines): deepspeed/moe/ep_experts.py:310-348 | deepspeed/moe/ep_experts.py:361-390 \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":"deepspeed/moe/ep_experts.py"},"region":{"startLine":310}}}],"partialFingerprints":{"codehealthFindingId/v1":"b94551078cf2677e9e5f8b9ace67504d3fb18d2ce4f42cc5071c95d646a9c807"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 16\u002B corresponding lines): accelerator/cuda_accelerator.py:368-393 | accelerator/klxpu_accelerator.py:50-69 | accelerator/supa_accelerator.py:244-259 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 16 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":"accelerator/cuda_accelerator.py"},"region":{"startLine":368}}}],"partialFingerprints":{"codehealthFindingId/v1":"5184a1b2069e1979ae463d7958845c6062e2d4e94f12e3b89c2e682fa5cff682"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): deepspeed/ops/transformer/inference/op_binding/linear.py:15-32 | deepspeed/ops/transformer/inference/op_binding/vector_matmul.py:15-33 \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":"deepspeed/ops/transformer/inference/op_binding/linear.py"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7a638d1387c8c18d961b270dd5579b8a908d9895181f31fac4955d63e8c81be"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (46 corresponding lines): deepspeed/runtime/fp16/fused_optimizer.py:493-538 | deepspeed/runtime/fp16/unfused_optimizer.py:377-422 \u2014 These two members are one piece of code written twice and then edited apart: 46 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"deepspeed/runtime/fp16/fused_optimizer.py"},"region":{"startLine":493}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b9e69608522e8431d552d981ccf3edc0bb003a6e1e7ffb7f782630151b3f6e4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): deepspeed/runtime/zero/stage3.py:2812-2829 | deepspeed/runtime/zero/stage3.py:2863-2882 \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":"deepspeed/runtime/zero/stage3.py"},"region":{"startLine":2812}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1d34b92a6b8b4951bfdbfe5841e2dd1b8d19bc2bada56d200603843a8ccd735"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (39 corresponding lines): deepspeed/inference/v2/model_implementations/sharding/attn_out.py:73-111 | deepspeed/inference/v2/model_implementations/sharding/qkv.py:122-167 \u2014 These two members are one piece of code written twice and then edited apart: 39 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"deepspeed/inference/v2/model_implementations/sharding/attn_out.py"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"6102886231ed0f2f3263ef36646a339fe7332e5db2bcff2c9f0b2660eff7bcd0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 14\u002B corresponding lines): deepspeed/module_inject/containers/bert.py:58-71 | deepspeed/module_inject/containers/distil_bert.py:54-67 | deepspeed/module_inject/containers/internlm.py:153-166 \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":"deepspeed/module_inject/containers/bert.py"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ac3df5acf2e81e5a4cdac86a186e6532b0bbc9f9cae859a16aa0ab1d350e9ae"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): deepspeed/ops/transformer/inference/triton/triton_matmul_kernel.py:16-34 | deepspeed/ops/transformer/inference/triton/triton_matmul_kernel.py:207-228 \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":"deepspeed/ops/transformer/inference/triton/triton_matmul_kernel.py"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad64e3fb35943c2a68475cbd9a01d9967f38baaa1d76f13a4d62b149f665f441"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): deepspeed/runtime/zenflow/zenflow_stage_1_and_2.py:638-657 | deepspeed/runtime/zero/stage_1_and_2.py:950-967 \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":"deepspeed/runtime/zenflow/zenflow_stage_1_and_2.py"},"region":{"startLine":638}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ee83e62d7bc95c12106a9c91a31e0563e834b9a40cf07a09d7a4813fa216645"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): deepspeed/env_report.py:85-101 | op_builder/npu/builder.py:59-73 \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":"deepspeed/env_report.py"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"049eb0285f04ffa5f90936f0fda7d87df76c19f8309da54394767a72fcd62a16"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (29 corresponding lines): deepspeed/runtime/zero/stage_1_and_2.py:1659-1695 | deepspeed/runtime/zero/stage_1_and_2.py:2529-2557 \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":"deepspeed/runtime/zero/stage_1_and_2.py"},"region":{"startLine":1659}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a33290fb022a3d7ddb078757b273ba90274bd98f188ef33d5bbc6455bda5944"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (21 corresponding lines): deepspeed/ops/triton_ops/vocab_parallel_softmax.py:442-462 | deepspeed/ops/triton_ops/vocab_parallel_softmax.py:494-517 \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":"deepspeed/ops/triton_ops/vocab_parallel_softmax.py"},"region":{"startLine":442}}}],"partialFingerprints":{"codehealthFindingId/v1":"6712f13ad7247001a96140315a530ade69b6a6f26cb5aaca90a204c26b5adaa2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (20 corresponding lines): deepspeed/module_inject/layers.py:2281-2304 | deepspeed/module_inject/layers.py:2390-2409 \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":"deepspeed/module_inject/layers.py"},"region":{"startLine":2281}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7edbf5d3d5e103093b45fd61c9538fabf9ab1453d4142156d45cab0ff722925"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): deepspeed/monitor/csv_monitor.py:23-38 | deepspeed/monitor/tensorboard.py:28-45 \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":"deepspeed/monitor/csv_monitor.py"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"e78639f06a5f6f94d4c34ff8c342ead914ca91acedd8e822208867a3adf72f61"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): deepspeed/module_inject/auto_ep_presets/base.py:444-466 | deepspeed/module_inject/auto_ep_presets/qwen3_5_moe.py:74-92 \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":"deepspeed/module_inject/auto_ep_presets/base.py"},"region":{"startLine":444}}}],"partialFingerprints":{"codehealthFindingId/v1":"377448acf3955f17ce3f0746a30b11f71347df1300f15e5c30ba18399f23d09c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): csrc/aio/py_test/aio_bench_perf_sweep.py:128-143 | deepspeed/nvme/perf_run_sweep.py:137-152 \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":"csrc/aio/py_test/aio_bench_perf_sweep.py"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"858ebe9f19f69c00c1a9867ae287f8ece7cfc288a1692c16a45030bc8f60bd61"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 28\u002B corresponding lines): deepspeed/inference/v2/kernels/ragged_ops/linear_blocked_kv_rotary/blocked_kv_rotary.py:26-55 | deepspeed/inference/v2/kernels/ragged_ops/linear_blocked_kv_rotary/blocked_trained_kv_rotary.py:30-57 | deepspeed/inference/v2/kernels/ragged_ops/linear_blocked_kv_rotary/linear_blocked_kv_copy.py:30-57 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 28 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":"deepspeed/inference/v2/kernels/ragged_ops/linear_blocked_kv_rotary/blocked_kv_rotary.py"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a65f5b1f7960a31647e98d401bd675473f4678970addb8b1b95949c14d0f848"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 16\u002B corresponding lines): deepspeed/model_implementations/diffusers/unet.py:49-64 | deepspeed/model_implementations/diffusers/vae.py:39-54 | deepspeed/model_implementations/diffusers/vae.py:82-97 | deepspeed/model_implementations/diffusers/vae.py:133-148 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 16 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":"deepspeed/model_implementations/diffusers/unet.py"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"919f41028191719bcc5cb1287955912edf08fd6011654e134ad26a29a9a89317"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (21 corresponding lines): deepspeed/module_inject/containers/features/hybrid_megatron.py:32-53 | deepspeed/module_inject/containers/features/hybrid_megatron.py:70-90 \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":"deepspeed/module_inject/containers/features/hybrid_megatron.py"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"4605baf220a9f418ea002f5bc6bed25eeb69164ece21b5900d72a9f1973e7547"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): deepspeed/module_inject/layers.py:887-900 | deepspeed/module_inject/layers.py:982-995 \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":"deepspeed/module_inject/layers.py"},"region":{"startLine":887}}}],"partialFingerprints":{"codehealthFindingId/v1":"7303efb76a1850b63460b5935ab4332f5a008625be8644cd9d8b303e77a135c2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (22 corresponding lines): deepspeed/runtime/fp16/fused_optimizer.py:462-485 | deepspeed/runtime/fp16/unfused_optimizer.py:347-368 \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":"deepspeed/runtime/fp16/fused_optimizer.py"},"region":{"startLine":462}}}],"partialFingerprints":{"codehealthFindingId/v1":"d84d629a612b205ddbffe261960d72f96d97d27bf8c4c6c332aee87def4c2f2a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (29 corresponding lines): deepspeed/runtime/zero/stage3.py:2438-2466 | deepspeed/runtime/zero/stage_1_and_2.py:2656-2687 \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":"deepspeed/runtime/zero/stage3.py"},"region":{"startLine":2438}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c3db3ef9a6e21337819df4ea372eda619a2f65c6b6b4c4e6f97d8cc853c3099"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 15\u002B corresponding lines): deepspeed/inference/v2/kernels/ragged_ops/linear_blocked_kv_rotary/blocked_kv_rotary.py:58-72 | deepspeed/inference/v2/kernels/ragged_ops/linear_blocked_kv_rotary/blocked_trained_kv_rotary.py:61-80 | deepspeed/inference/v2/kernels/ragged_ops/linear_blocked_kv_rotary/linear_blocked_kv_copy.py:60-74 \u2014 These 3 members are one piece of code written 3 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 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"deepspeed/inference/v2/kernels/ragged_ops/linear_blocked_kv_rotary/blocked_kv_rotary.py"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1fb5dc7b784f5430bf9efa859f4de87990f1e78bd06198000f4d7872b344af7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): deepspeed/ops/transformer/inference/op_binding/layer_norm.py:28-35 | deepspeed/ops/transformer/inference/op_binding/layer_norm.py:39-48 \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":"deepspeed/ops/transformer/inference/op_binding/layer_norm.py"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"b94ce82385f50e4924112fc1c02ae032f786d7029c9fa22afe2d07e1141eceee"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): op_builder/builder.py:274-287 | op_builder/builder.py:291-305 \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":"op_builder/builder.py"},"region":{"startLine":274}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee453d84c1a3347a1b0e2553538b6b9c8f75bf3715cfd4adbbf6f315ee6fe422"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): csrc/aio/py_test/aio_bench_perf_sweep.py:34-45 | deepspeed/nvme/perf_run_sweep.py:34-46 \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":"csrc/aio/py_test/aio_bench_perf_sweep.py"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2271d6ef90f80fe8734f2ac564feb7ab6de7d5efce8e274c95020b5f8ab6803"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): deepspeed/inference/v2/kernels/cutlass_ops/mixed_gemm/mixed_gemm.py:25-42 | deepspeed/inference/v2/kernels/cutlass_ops/moe_gemm/mixed_moe_gemm.py:25-42 \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":"deepspeed/inference/v2/kernels/cutlass_ops/mixed_gemm/mixed_gemm.py"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"269679ffbfdc1699ee3b4b1ac335951c5df14505a5cc529eb210003fc8ffba7b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 14\u002B corresponding lines): deepspeed/runtime/zero/parameter_offload.py:553-567 | deepspeed/runtime/zero/parameter_offload.py:571-588 | deepspeed/runtime/zero/parameter_offload.py:592-605 \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":"deepspeed/runtime/zero/parameter_offload.py"},"region":{"startLine":553}}}],"partialFingerprints":{"codehealthFindingId/v1":"53ba400f50f936731fc150a569425205bafc59c7ffd7df247debf20d03b47f1f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): deepspeed/module_inject/layers.py:1671-1690 | deepspeed/module_inject/layers.py:1711-1728 \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":"deepspeed/module_inject/layers.py"},"region":{"startLine":1671}}}],"partialFingerprints":{"codehealthFindingId/v1":"b894baf9836bc1311339a1cf5dd53693dddd49264ce8bd279dab7a5a445ba058"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 9\u002B corresponding lines): deepspeed/ops/transformer/inference/op_binding/linear.py:52-60 | deepspeed/ops/transformer/inference/op_binding/qkv_gemm.py:49-57 | deepspeed/ops/transformer/inference/op_binding/vector_matmul.py:46-54 | deepspeed/ops/transformer/inference/triton/attention.py:116-124 \u2014 These 4 members are one piece of code written 4 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 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"deepspeed/ops/transformer/inference/op_binding/linear.py"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed6ee1b1695ab44ed52a61e3f4bbc523a9ecd49767b943f412cfbd3a3a6c5c3a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): deepspeed/comm/comm.py:282-305 | deepspeed/comm/comm.py:345-356 \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":"deepspeed/comm/comm.py"},"region":{"startLine":282}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7fabac057c4a191c2bd5d969b1315392b27cf4e73301d8ea0ab1108fed8713f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (21 corresponding lines): deepspeed/runtime/utils.py:152-172 | deepspeed/runtime/utils.py:176-198 \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":"deepspeed/runtime/utils.py"},"region":{"startLine":152}}}],"partialFingerprints":{"codehealthFindingId/v1":"68a0bc1ec636e30b5650fe0f2894b8b3fc20dfb7e5c4849e2e975f61317413af"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): deepspeed/runtime/pipe/p2p.py:47-64 | deepspeed/runtime/pipe/p2p.py:68-84 \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":"deepspeed/runtime/pipe/p2p.py"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"7143cf3f34a694e1a5de00c3babbe65cb823476ce751d7311a6ab53a1a3ef0e3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): deepspeed/inference/v2/model_implementations/inference_transformer_base.py:636-653 | deepspeed/inference/v2/model_implementations/qwen_v2_moe/model.py:127-144 \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":"deepspeed/inference/v2/model_implementations/inference_transformer_base.py"},"region":{"startLine":636}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2f64fcd234d9d5829e10d957e51fb3c4da482d8500c3e88863e14de41638bf6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): deepspeed/inference/v2/modules/implementations/pre_norm/cuda_pre_ln.py:42-49 | deepspeed/inference/v2/modules/implementations/pre_norm/cuda_pre_rms.py:42-52 \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":"deepspeed/inference/v2/modules/implementations/pre_norm/cuda_pre_ln.py"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f425c94d9b7f7625abdc36b5172e118276501c1eb1e139aefc4a0f7683d30c1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): deepspeed/runtime/zenflow/zenflow_stage_1_and_2.py:660-667 | deepspeed/runtime/zero/stage_1_and_2.py:1902-1909 \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":"deepspeed/runtime/zenflow/zenflow_stage_1_and_2.py"},"region":{"startLine":660}}}],"partialFingerprints":{"codehealthFindingId/v1":"23d3365e0cff744cea7793d73b461a514f89fff65fa5612705a14aa97ef4358d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): deepspeed/module_inject/layers.py:945-962 | deepspeed/module_inject/layers.py:1052-1070 \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":"deepspeed/module_inject/layers.py"},"region":{"startLine":945}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e179f4097e9b36adc498905b82aa1f40540c6d41729ed77746bcddae37f6daa"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): deepspeed/runtime/zero/stage3.py:3338-3354 | deepspeed/runtime/zero/stage3.py:3377-3394 \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":"deepspeed/runtime/zero/stage3.py"},"region":{"startLine":3338}}}],"partialFingerprints":{"codehealthFindingId/v1":"38e618cba0ea1e02d1fd2503fb2ae9302706d4ebc1e5d5fa7eb474a9e511a30a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (23 corresponding lines): deepspeed/autotuning/scheduler.py:187-209 | deepspeed/utils/logging.py:157-180 \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":"deepspeed/autotuning/scheduler.py"},"region":{"startLine":187}}}],"partialFingerprints":{"codehealthFindingId/v1":"58e02aba864f782d1ab359fa66017c2998308afb9b0c72eaa111a8e60ebe3b1c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): deepspeed/runtime/engine.py:3961-3979 | deepspeed/runtime/engine.py:3984-4002 \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":"deepspeed/runtime/engine.py"},"region":{"startLine":3961}}}],"partialFingerprints":{"codehealthFindingId/v1":"9fe0d94efdc0af4f938962d656e197b0968b3a8a7d583b571e6115e5f58285c0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): deepspeed/utils/zero_to_fp32.py:399-418 | deepspeed/utils/zero_to_fp32.py:565-583 \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":"deepspeed/utils/zero_to_fp32.py"},"region":{"startLine":399}}}],"partialFingerprints":{"codehealthFindingId/v1":"e430467713a355983b9e7a4a4b4c7e46c82c4b0ced70dc820806e895c80152d8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): csrc/aio/py_test/ds_aio_job.py:43-49 | deepspeed/nvme/ds_aio_job.py:43-50 \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":"csrc/aio/py_test/ds_aio_job.py"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e3bff5345b79c58fd6db19b47c6b4b53fa5bc82932b639b5705785a57d6133c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): deepspeed/runtime/data_pipeline/curriculum_scheduler.py:118-137 | deepspeed/runtime/data_pipeline/data_routing/scheduler.py:20-28 \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":"deepspeed/runtime/data_pipeline/curriculum_scheduler.py"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d6c618726b1b82027a59ea8897c2bd0c28461d283dcf3fce2c348c7a6af4d11"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): deepspeed/ops/transformer/inference/op_binding/residual_add.py:40-51 | op_builder/npu/inference.py:455-467 \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":"deepspeed/ops/transformer/inference/op_binding/residual_add.py"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"f73b8ff241385b420613f6ad557b247432527dd252a21448089db2cbd5f3c2b4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): op_builder/builder.py:835-844 | op_builder/xpu/builder.py:45-59 \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":"op_builder/builder.py"},"region":{"startLine":835}}}],"partialFingerprints":{"codehealthFindingId/v1":"43cec19604853431b6575529748381c586450dc899516c862bc16d392fbcf009"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): deepspeed/ops/triton_ops/swiglu_triton.py:209-229 | deepspeed/ops/triton_ops/swiglu_triton.py:457-471 \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":"deepspeed/ops/triton_ops/swiglu_triton.py"},"region":{"startLine":209}}}],"partialFingerprints":{"codehealthFindingId/v1":"101631247608168ee10a2c8c445650c201fe104efca034dc8c85089a4902aaec"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): deepspeed/runtime/zero/stage3.py:3409-3425 | deepspeed/runtime/zero/stage3.py:3462-3476 \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":"deepspeed/runtime/zero/stage3.py"},"region":{"startLine":3409}}}],"partialFingerprints":{"codehealthFindingId/v1":"46d3b3fc88fa2906fac902ca2595610e56dc5c2e6739ba956ad820e699eb05c7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): deepspeed/inference/v2/modules/implementations/linear/blas_fp_linear.py:36-53 | deepspeed/inference/v2/modules/implementations/linear/quantized_linear.py:108-127 \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":"deepspeed/inference/v2/modules/implementations/linear/blas_fp_linear.py"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"da6bdf4401516d20c91615264ed389574d767c1c0330f61e7d25db82c9117d6b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): deepspeed/runtime/zenflow/engine_stage3.py:349-361 | deepspeed/runtime/zenflow/zenflow_stage_1_and_2.py:572-596 \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":"deepspeed/runtime/zenflow/engine_stage3.py"},"region":{"startLine":349}}}],"partialFingerprints":{"codehealthFindingId/v1":"67d7b7c13bcf319226308769dc1ac5e69a0731afed26722d203dd4765cce141d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): deepspeed/runtime/bf16_optimizer.py:598-607 | deepspeed/runtime/zero/stage_1_and_2.py:3281-3290 \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":"deepspeed/runtime/bf16_optimizer.py"},"region":{"startLine":598}}}],"partialFingerprints":{"codehealthFindingId/v1":"4fa95ccd0f8463d973916dced80e326d095c0d8f2a85e63e113636e01a776756"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): csrc/aio/py_test/aio_bench_perf_sweep.py:273-298 | deepspeed/nvme/perf_run_sweep.py:292-306 \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":"csrc/aio/py_test/aio_bench_perf_sweep.py"},"region":{"startLine":273}}}],"partialFingerprints":{"codehealthFindingId/v1":"a576ede79840ea7f35ccf83d329b44575bad1183f76ba1137ed8703def72c3dc"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (6 members, 8\u002B corresponding lines): deepspeed/inference/engine.py:548-555 | deepspeed/model_implementations/diffusers/unet.py:27-34 | deepspeed/model_implementations/diffusers/vae.py:25-32 | deepspeed/model_implementations/diffusers/vae.py:68-75 | deepspeed/model_implementations/diffusers/vae.py:111-118 | deepspeed/model_implementations/transformers/clip_encoder.py:35-42 \u2014 These 6 members are one piece of code written 6 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 6 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"deepspeed/inference/engine.py"},"region":{"startLine":548}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d5bf2587b9d29056a00530392cf695e7008db88f401cdbea332d80d29f5a661"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): deepspeed/inference/v2/model_implementations/inference_transformer_base.py:364-379 | deepspeed/inference/v2/model_implementations/inference_transformer_base.py:477-492 \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":"deepspeed/inference/v2/model_implementations/inference_transformer_base.py"},"region":{"startLine":364}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc5bc514a279e77ace738924798869dc1beb0330ad8b5a74f46a17c2cd9f9fb0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): deepspeed/runtime/lr_schedules.py:185-195 | deepspeed/runtime/lr_schedules.py:202-212 \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":"deepspeed/runtime/lr_schedules.py"},"region":{"startLine":185}}}],"partialFingerprints":{"codehealthFindingId/v1":"84a0f10b75fc44f5ae0b0c03d1e72380b11b03c7c7630f007cd4d3cb545e1d6e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): deepspeed/runtime/zero/stage3.py:2417-2435 | deepspeed/runtime/zero/stage_1_and_2.py:2637-2653 \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":"deepspeed/runtime/zero/stage3.py"},"region":{"startLine":2417}}}],"partialFingerprints":{"codehealthFindingId/v1":"3309644f4e8ef5982442b8690cb21c3712e254999eac760aff063661e3699496"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 8\u002B corresponding lines): csrc/aio/py_test/aio_bench_perf_sweep.py:251-258 | csrc/aio/py_test/aio_bench_perf_sweep.py:262-269 | deepspeed/nvme/perf_run_sweep.py:264-274 | deepspeed/nvme/perf_run_sweep.py:278-288 \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":"csrc/aio/py_test/aio_bench_perf_sweep.py"},"region":{"startLine":251}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd1957730ae700c108bd687566cfb34363713b744cf755dc4ebff97f6b4a0743"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): deepspeed/inference/v2/model_implementations/exaone4_5/model.py:141-152 | deepspeed/inference/v2/model_implementations/inference_transformer_base.py:395-411 \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":"deepspeed/inference/v2/model_implementations/exaone4_5/model.py"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"c441a22b00548025d5891478698fef0ce9283805d5fb83ef62af5cc5cdc3e2e5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 12\u002B corresponding lines): deepspeed/inference/v2/model_implementations/falcon/policy.py:21-33 | deepspeed/inference/v2/model_implementations/llama_v2/policy.py:20-31 | deepspeed/inference/v2/model_implementations/phi/policy.py:20-32 | deepspeed/inference/v2/model_implementations/qwen_v2/policy.py:20-31 \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":"deepspeed/inference/v2/model_implementations/falcon/policy.py"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e07d067bc2d640887ab3f212a6afeb9e55680a50472aeb0eaa058512e8987c8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): op_builder/async_io.py:53-62 | op_builder/cpu/async_io.py:41-48 \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":"op_builder/async_io.py"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"bce6efc589db6aef9dfab1edcbff201490bd5cc87568d7a434751fbbe0f5a5fb"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 10\u002B corresponding lines): deepspeed/ops/transformer/inference/op_binding/residual_add.py:17-27 | deepspeed/ops/transformer/inference/op_binding/softmax.py:16-26 | deepspeed/ops/transformer/inference/op_binding/softmax_context.py:17-26 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 10 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":"deepspeed/ops/transformer/inference/op_binding/residual_add.py"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e42e56465848a536322de5adf905e347b686b27f3bed4379f1c913e3860a426"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): deepspeed/module_inject/auto_tp.py:762-770 | deepspeed/module_inject/auto_tp.py:776-787 \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":"deepspeed/module_inject/auto_tp.py"},"region":{"startLine":762}}}],"partialFingerprints":{"codehealthFindingId/v1":"bad91fe6b89c2417300641da1f7aaf09be280d9ce5cd8bc4d2c2fda63e479c10"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (6 members, 4\u002B corresponding lines): deepspeed/module_inject/containers/gptj.py:46-49 | deepspeed/module_inject/containers/gptneo.py:57-63 | deepspeed/module_inject/containers/internlm.py:51-54 | deepspeed/module_inject/containers/llama.py:106-109 | deepspeed/module_inject/containers/llama2.py:56-59 | deepspeed/module_inject/containers/opt.py:59-62 \u2014 These 6 members are one piece of code written 6 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 6 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"deepspeed/module_inject/containers/gptj.py"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"f656b1f9b1ea445920a4db0cf8f63a980768c196daffdee8bedc203a7c2f38a7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): deepspeed/runtime/bf16_optimizer.py:329-338 | deepspeed/runtime/zero/stage_1_and_2.py:821-830 \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":"deepspeed/runtime/bf16_optimizer.py"},"region":{"startLine":329}}}],"partialFingerprints":{"codehealthFindingId/v1":"791f432464f6b5e33813eb608d23c37d83b0779d5be1ff4908bf3b805e20af5b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 9\u002B corresponding lines): deepspeed/inference/v2/model_implementations/falcon/model.py:202-213 | deepspeed/inference/v2/model_implementations/opt/model.py:186-197 | deepspeed/inference/v2/model_implementations/phi/model.py:188-199 | deepspeed/inference/v2/model_implementations/phi3/model.py:196-204 \u2014 These 4 members are one piece of code written 4 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 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"deepspeed/inference/v2/model_implementations/falcon/model.py"},"region":{"startLine":202}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d8424ed840199a0315b6334cdcbb4a8001dcb5f3fbb0083cca92a98a76ece13"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): deepspeed/runtime/fp16/fused_optimizer.py:376-387 | deepspeed/runtime/fp16/unfused_optimizer.py:245-258 \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":"deepspeed/runtime/fp16/fused_optimizer.py"},"region":{"startLine":376}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ecdca66f03af6e32e3e7a501407ffa7ac0bad41964662c67c03fb888b9eed36"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): deepspeed/compile/backend.py:162-170 | deepspeed/compile/passes/zero3_compile.py:58-66 \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":"deepspeed/compile/backend.py"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba73c37c1ca57e11819972aa11b137a1b68e47a442fec564896ff3b2f2f8d156"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): deepspeed/compile/passes/offload_adam_states.py:115-124 | deepspeed/compile/passes/offload_adam_states.py:144-153 \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":"deepspeed/compile/passes/offload_adam_states.py"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"67d5bf3c5562dac41f1b4f61f78026ac2e8178b6500c0433697bdf396e237af1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 10\u002B corresponding lines): deepspeed/module_inject/containers/gptj.py:111-120 | deepspeed/module_inject/containers/gptneo.py:124-133 | deepspeed/module_inject/containers/llama.py:194-203 | deepspeed/module_inject/containers/llama2.py:134-143 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 10 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":"deepspeed/module_inject/containers/gptj.py"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"25a272ec8869d1518a1cf8626fd2478d1c242417585a0cad55c62ace142947c7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): deepspeed/module_inject/layers.py:1127-1137 | deepspeed/module_inject/layers.py:1248-1257 \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":"deepspeed/module_inject/layers.py"},"region":{"startLine":1127}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ba0cf238014bd4911790dbd86bd5b0d65aa0c7327336cae2bbcd818751c68ea"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): deepspeed/module_inject/layers.py:2424-2429 | deepspeed/ops/transformer/inference/op_binding/rms_norm.py:24-30 \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":"deepspeed/module_inject/layers.py"},"region":{"startLine":2424}}}],"partialFingerprints":{"codehealthFindingId/v1":"2758155f1cd47b48ae8edbb7603a71468d623ff9ccd70856a449a0ad5bdbf22c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): deepspeed/ops/triton_ops/swiglu_triton.py:233-252 | deepspeed/ops/triton_ops/swiglu_triton.py:478-489 \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":"deepspeed/ops/triton_ops/swiglu_triton.py"},"region":{"startLine":233}}}],"partialFingerprints":{"codehealthFindingId/v1":"01342e9327c142e5f7789ba49d2552de26354404a62c35e5cc14f22aa4aac16e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): deepspeed/runtime/zero/contiguous_memory_allocator.py:98-106 | deepspeed/runtime/zero/contiguous_memory_allocator.py:109-118 \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":"deepspeed/runtime/zero/contiguous_memory_allocator.py"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ed742838593a3ce10e86947d1a8c677c8310a74889f2c66191be7530e03385b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): deepspeed/inference/quantization/utils.py:90-98 | deepspeed/inference/quantization/utils.py:156-162 \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":"deepspeed/inference/quantization/utils.py"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"daebcb74c7650582eaaf362e41c90f61704afdc52adf4a02cafb25bddc6fa1f1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): deepspeed/inference/v2/kernels/ragged_ops/moe_gather/moe_gather.py:23-34 | deepspeed/inference/v2/kernels/ragged_ops/moe_scatter/moe_scatter.py:24-34 \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":"deepspeed/inference/v2/kernels/ragged_ops/moe_gather/moe_gather.py"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d36bd698ea777e332687dc437acba37d573cf7c43084276950c39839af83421"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): deepspeed/linear/quantization.py:60-65 | deepspeed/linear/quantization.py:68-76 \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":"deepspeed/linear/quantization.py"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4f1a4d2c549fa1438ebdeb82ee62e65d94612cafc59088767a1f52cfd79da23"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): deepspeed/module_inject/layers.py:1367-1386 | deepspeed/module_inject/layers.py:1395-1411 \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":"deepspeed/module_inject/layers.py"},"region":{"startLine":1367}}}],"partialFingerprints":{"codehealthFindingId/v1":"32742033da40b61518ebb726777f69ba159c0d28bbbec49a9965c12d541c5b1f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 11\u002B corresponding lines): deepspeed/ops/transformer/inference/op_binding/bias_add.py:14-24 | deepspeed/ops/transformer/inference/op_binding/bias_gelu.py:15-25 | deepspeed/ops/transformer/inference/op_binding/bias_relu.py:15-25 \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":"deepspeed/ops/transformer/inference/op_binding/bias_add.py"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"559dccd51bcf20af5af59f6f931f86fb2d1ce66fe1a93ccd67e2ba1116dead2c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): deepspeed/ops/triton_ops/vocab_parallel_softmax.py:421-438 | deepspeed/ops/triton_ops/vocab_parallel_softmax.py:466-471 \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":"deepspeed/ops/triton_ops/vocab_parallel_softmax.py"},"region":{"startLine":421}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6294863c9acefdccbe88bbd74f6ff33df95930094eab10e4aaa4bd1ff9e9d51"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): csrc/aio/py_test/aio_bench_perf_sweep.py:226-234 | deepspeed/nvme/perf_run_sweep.py:235-243 \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":"csrc/aio/py_test/aio_bench_perf_sweep.py"},"region":{"startLine":226}}}],"partialFingerprints":{"codehealthFindingId/v1":"e31185426b13e42e056ade81446565439a24603970152a06829ff359046f89a3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): deepspeed/compile/passes/offload_parameters.py:20-30 | deepspeed/compile/passes/offload_parameters.py:34-43 \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":"deepspeed/compile/passes/offload_parameters.py"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"19a105ae9f588d06e9a6ec04dc3dcdf9ff2edb9503a1c2d710051609f924d344"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): deepspeed/runtime/engine.py:3912-3922 | deepspeed/runtime/zero/stage3.py:2399-2408 \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":"deepspeed/runtime/engine.py"},"region":{"startLine":3912}}}],"partialFingerprints":{"codehealthFindingId/v1":"087b76a53bee86facbdf3f293c901580aaa35bdee5f4aa64e9e7ce2404a1c02b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): deepspeed/checkpoint/reshape_meg_2d.py:57-65 | deepspeed/checkpoint/reshape_meg_2d.py:69-77 \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":"deepspeed/checkpoint/reshape_meg_2d.py"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c5098e1092ea1ba464a0c4b5d77d0cdfe3075ca0d03a3f82c41d6d546e8f076"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (5 corresponding lines): deepspeed/inference/v2/model_implementations/common_parameters/mlp_parameters.py:44-66 | deepspeed/inference/v2/model_implementations/common_parameters/mlp_parameters.py:80-84 \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":"deepspeed/inference/v2/model_implementations/common_parameters/mlp_parameters.py"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"f97d93cbac52f5215aacf3965b0dd1e12fab908d2c29b40a0f28a07c36a2e98a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (5 members, 15\u002B corresponding lines): deepspeed/inference/v2/model_implementations/inference_transformer_base.py:514-529 | deepspeed/inference/v2/model_implementations/inference_transformer_base.py:545-559 | deepspeed/inference/v2/model_implementations/qwen_v2_moe/model.py:148-163 | deepspeed/inference/v2/model_implementations/qwen_v2_moe/model.py:167-181 | deepspeed/inference/v2/model_implementations/qwen_v2_moe/model.py:185-199 \u2014 These 5 members are one piece of code written 5 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 5 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"deepspeed/inference/v2/model_implementations/inference_transformer_base.py"},"region":{"startLine":514}}}],"partialFingerprints":{"codehealthFindingId/v1":"32fd80b292a140117f11bd25605622a26aedac205790c79b6ff1df1b6c2b3511"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): deepspeed/compile/passes/tp_compile.py:134-145 | deepspeed/compile/passes/tp_compile.py:149-156 \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":"deepspeed/compile/passes/tp_compile.py"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"d48592563d5b1117dfdff6a244d9c00dba76ee36e81bf2e100cf51e11d0dd620"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (5 corresponding lines): deepspeed/models/glm_moe_dsa/attention.py:67-71 | deepspeed/models/glm_moe_dsa/attention.py:84-90 \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":"deepspeed/models/glm_moe_dsa/attention.py"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf40f3fbcad7dd734ef6e0d312cce049fa0d841752400f5c94f16c9672fd01ed"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): deepspeed/module_inject/containers/gptj.py:52-60 | deepspeed/module_inject/containers/gptneo.py:46-54 \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":"deepspeed/module_inject/containers/gptj.py"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"559a97454312e89c4cd0238e9d8e30f58c7ab6c1e1516780c5096f38bd561c44"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): deepspeed/runtime/zero/partition_parameters.py:261-270 | deepspeed/utils/init_on_device.py:44-52 \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":"deepspeed/runtime/zero/partition_parameters.py"},"region":{"startLine":261}}}],"partialFingerprints":{"codehealthFindingId/v1":"8990fb5e46f68b82a44a5e7eeed3a46ca040b87f95e10c250a1ab741fdf822eb"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (5 corresponding lines): deepspeed/comm/torch.py:365-369 | deepspeed/comm/torch.py:374-383 \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":"deepspeed/comm/torch.py"},"region":{"startLine":365}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3ea36a97e076518ec51c67de2e02b2e3feabcdc2698ff455197d90671caa7aa"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): deepspeed/inference/v2/model_implementations/inference_transformer_base.py:580-595 | deepspeed/inference/v2/model_implementations/qwen/model.py:108-124 \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":"deepspeed/inference/v2/model_implementations/inference_transformer_base.py"},"region":{"startLine":580}}}],"partialFingerprints":{"codehealthFindingId/v1":"41951c5148b5f56446fc7035ff6ad3569001569134b43b6ee1c5fb2681ae5129"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): deepspeed/runtime/utils.py:1070-1080 | deepspeed/runtime/zero/stage3.py:2845-2860 \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":"deepspeed/runtime/utils.py"},"region":{"startLine":1070}}}],"partialFingerprints":{"codehealthFindingId/v1":"c96e67204113bce4e35ff05607f245506c8a1e05771d57b3d7c0ce67676311d8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): deepspeed/nvme/perf_generate_param.py:16-28 | csrc/aio/py_test/aio_bench_generate_param.py:16-26 \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":"deepspeed/nvme/perf_generate_param.py"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a03583685a1b581761188b64c39cab03f945f44d4caf9611b8a09701b1f4d77"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 11\u002B corresponding lines): deepspeed/module_inject/containers/gptneox.py:102-112 | deepspeed/module_inject/containers/megatron_gpt.py:43-56 | deepspeed/module_inject/containers/megatron_gpt_moe.py:43-55 \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":"deepspeed/module_inject/containers/gptneox.py"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d1b71e377cdb0d6ffe5d0de63e01e913df34adf1032a88bca710fd64ca826e1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 4\u002B corresponding lines): deepspeed/runtime/config.py:674-680 | deepspeed/runtime/swap_tensor/utils.py:30-34 | deepspeed/utils/logging.py:80-83 \u2014 These 3 members are one piece of code written 3 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 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"deepspeed/runtime/config.py"},"region":{"startLine":674}}}],"partialFingerprints":{"codehealthFindingId/v1":"ffc0eecde5e77a0994c8861bf97c9c91257151369a47d345aa59e66a0b3e6c1b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): deepspeed/inference/v2/kernels/ragged_ops/blocked_flash/blocked_flash.py:71-86 | deepspeed/inference/v2/kernels/ragged_ops/logits_gather/logits_gather.py:23-36 \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":"deepspeed/inference/v2/kernels/ragged_ops/blocked_flash/blocked_flash.py"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"a41b516661e135d1f76d81ff2e9d76a5d219008b8b79cb5606e7811034938e2b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): deepspeed/ops/transformer/inference/op_binding/bias_residual.py:14-22 | deepspeed/ops/transformer/inference/op_binding/einsum_sec_sm_ecm.py:14-22 \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":"deepspeed/ops/transformer/inference/op_binding/bias_residual.py"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"23c662ea0c8f695a16f1f1207841476646a1c9e08cfd086a139cbaeff4a299a5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 28\u002B corresponding lines): deepspeed/inference/v2/model_implementations/inference_transformer_base.py:272-300 | deepspeed/inference/v2/model_implementations/mixtral/model.py:141-168 | deepspeed/inference/v2/model_implementations/qwen_v2_moe/model.py:226-256 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 28 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":"deepspeed/inference/v2/model_implementations/inference_transformer_base.py"},"region":{"startLine":272}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e8eaa2af6ff36c930ead19b3a141b67edcf3909b8d0ded24a009159840e4016"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): deepspeed/module_inject/containers/llama.py:82-90 | deepspeed/module_inject/containers/internlm.py:28-35 \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":"deepspeed/module_inject/containers/llama.py"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8b525227d07ff4e90f7ded7c2e9609e57ecad376a8f8ea4de865ca8dfd0ea50"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): deepspeed/module_inject/auto_ep_presets/deepseek_v2.py:63-71 | deepspeed/module_inject/auto_ep_presets/deepseek_v3.py:53-58 \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":"deepspeed/module_inject/auto_ep_presets/deepseek_v2.py"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"f78edf4dd5782c7666b93d60a4b1643eaf1a9e91c38a59c2d0c634acc38112f8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): deepspeed/runtime/bf16_optimizer.py:651-654 | deepspeed/runtime/zero/stage_1_and_2.py:3656-3659 \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":"deepspeed/runtime/bf16_optimizer.py"},"region":{"startLine":651}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ca836d09fa516167eab2192770d03f8473c015a5fe0d6686e533b2f06e864ef"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): deepspeed/runtime/zenflow/engine_stage3.py:529-536 | deepspeed/runtime/zero/stage3.py:3169-3175 \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":"deepspeed/runtime/zenflow/engine_stage3.py"},"region":{"startLine":529}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c00d536572af4e479856118bae19f4597b0ea0579c0013086cf169dfdbc16b4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): csrc/aio/py_test/parse_aio_stats.py:104-112 | deepspeed/nvme/parse_nvme_stats.py:104-112 \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":"csrc/aio/py_test/parse_aio_stats.py"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"efc6051825cc324c13ea211f8d4c236bcfaf6981d40703f1f2a49658db385942"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 4\u002B corresponding lines): csrc/aio/py_test/torch_fastio_engine.py:31-34 | csrc/aio/py_test/torch_io.py:24-27 | deepspeed/nvme/torch_fastio_engine.py:31-34 | deepspeed/nvme/torch_io.py:24-27 \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":"csrc/aio/py_test/torch_fastio_engine.py"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"4347c4efeb1568d38b772ff2dba20df6b281d9e3ac7d75770b94d4b792d12a75"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (3 corresponding lines): deepspeed/runtime/zenflow/engine_stage3.py:147-149 | deepspeed/runtime/zenflow/zenflow_stage_1_and_2.py:160-162 \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":"deepspeed/runtime/zenflow/engine_stage3.py"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"53f3a6ebb6d4d5a1396e09926a2a65caf15a3e89406ac2a02f2c45d19717a772"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): csrc/aio/py_test/parse_aio_stats.py:61-64 | deepspeed/nvme/parse_nvme_stats.py:61-64 \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":"csrc/aio/py_test/parse_aio_stats.py"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"098c3f24fb3f42c206146c55f84fcd88c62158aa98541a755a05ff264fd0c44c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): deepspeed/module_inject/containers/gptneox.py:126-134 | deepspeed/module_inject/containers/megatron_gpt.py:71-82 \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":"deepspeed/module_inject/containers/gptneox.py"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c1a01dcb526adc2fe628f096fe35901272d8431a112dcd38d9c5ed2c17eaa6a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): deepspeed/module_inject/containers/llama.py:168-178 | deepspeed/module_inject/containers/llama2.py:114-124 \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":"deepspeed/module_inject/containers/llama.py"},"region":{"startLine":168}}}],"partialFingerprints":{"codehealthFindingId/v1":"02e3d50d6d43541c737b094fa0396dd5feec2c4d150b8b9b7d4abbca223efa74"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): deepspeed/comm/ccl.py:17-22 | deepspeed/comm/torch.py:75-80 \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":"deepspeed/comm/ccl.py"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"97a6203d25df5c72e7f011297517ee887ce895c4639a692c20e648f1d9512ae4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 8\u002B corresponding lines): deepspeed/inference/v2/modules/implementations/post_norm/cuda_post_ln.py:27-34 | deepspeed/inference/v2/modules/implementations/pre_norm/cuda_pre_ln.py:28-39 | deepspeed/inference/v2/modules/implementations/pre_norm/cuda_pre_rms.py:27-39 \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":"deepspeed/inference/v2/modules/implementations/post_norm/cuda_post_ln.py"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec2f55672a2f0d6b628bf1ad4654985b20fb2542bf4219bdc09d399b6e9258cd"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (3 corresponding lines): csrc/aio/py_test/aio_bench_perf_sweep.py:98-100 | deepspeed/nvme/perf_run_sweep.py:121-123 \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":"csrc/aio/py_test/aio_bench_perf_sweep.py"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2889dbf69a8c8bb02df249f12212f02689d1ea27040073bb58cb1e31e9bc738"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (3 corresponding lines): deepspeed/sequence/fpdt_layer.py:28-30 | deepspeed/sequence/layer.py:123-128 \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":"deepspeed/sequence/fpdt_layer.py"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d27d3328c1229fa5c64e4c005fa7417278d6c5e94fa2601bcee26ccee444e17"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): deepspeed/inference/v2/model_implementations/inference_transformer_base.py:304-314 | deepspeed/inference/v2/model_implementations/opt/model.py:102-113 \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":"deepspeed/inference/v2/model_implementations/inference_transformer_base.py"},"region":{"startLine":304}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd8e8ca66ceaba17843e60aa500bbe4e6042122cbc705d0f4d5a93147737416d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (7 members, 4\u002B corresponding lines): deepspeed/module_inject/containers/bert.py:24-27 | deepspeed/module_inject/containers/clip.py:21-24 | deepspeed/module_inject/containers/distil_bert.py:24-27 | deepspeed/module_inject/containers/gpt2.py:19-22 | deepspeed/module_inject/containers/gptj.py:28-31 | deepspeed/module_inject/containers/gptneo.py:28-31 | deepspeed/module_inject/containers/opt.py:27-30 \u2014 These 7 members are one piece of code written 7 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 7 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"deepspeed/module_inject/containers/bert.py"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"003b5b6d6995e6304aed88fb82314c89db4f527ec144ae8163e12602671b384b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): deepspeed/module_inject/containers/bloom.py:133-136 | deepspeed/module_inject/containers/gptneox.py:137-140 \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":"deepspeed/module_inject/containers/bloom.py"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a15aa7921bc588036d5628a1c12b2eeff9fd2326ce988b2da6d4fcfe6d71e2e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): deepspeed/module_inject/containers/gpt2.py:51-54 | deepspeed/module_inject/containers/gptneo.py:136-139 \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":"deepspeed/module_inject/containers/gpt2.py"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"6fa648de58867aa04926cee1fbae8e62d560e69f06768ad0be2560a65fed0bbc"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): deepspeed/runtime/zero/stage3.py:2355-2358 | deepspeed/runtime/zero/stage_1_and_2.py:2430-2433 \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":"deepspeed/runtime/zero/stage3.py"},"region":{"startLine":2355}}}],"partialFingerprints":{"codehealthFindingId/v1":"baac2e6a63567117398fb455b7709dc5b2269c45ea32c2eaf2d4d64f7cbb46d1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (3 corresponding lines): op_builder/klxpu/async_io.py:42-44 | op_builder/supa/async_io.py:42-44 \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":"op_builder/klxpu/async_io.py"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ec8050497a2561bd936218bd2be60a9efb2dc4ad7720f63855a994f352a2a34"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (3 corresponding lines): csrc/aio/py_test/aio_bench_perf_sweep.py:92-94 | deepspeed/nvme/perf_run_sweep.py:115-117 \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":"csrc/aio/py_test/aio_bench_perf_sweep.py"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"b72d3bd33a972b70bd6d00fafc4698a175283d97c877bf6b0f7107b12e1ffb71"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 4\u002B corresponding lines): deepspeed/runtime/fp16/unfused_optimizer.py:192-195 | deepspeed/runtime/zero/stage3.py:3045-3048 | deepspeed/runtime/zero/stage_1_and_2.py:3028-3031 \u2014 These 3 members are one piece of code written 3 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 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"deepspeed/runtime/fp16/unfused_optimizer.py"},"region":{"startLine":192}}}],"partialFingerprints":{"codehealthFindingId/v1":"5babc2f23ac1e7eaa7dbeb13968e5f0fd041407b7b98af16a5580d025cc432c3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 3\u002B corresponding lines): deepspeed/ops/transformer/inference/config.py:131-133 | deepspeed/ops/transformer/inference/moe_inference.py:105-107 | deepspeed/ops/transformer/transformer.py:138-140 \u2014 These 3 members are one piece of code written 3 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 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"deepspeed/ops/transformer/inference/config.py"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"8721eb33a77397dce2ec4d0812861a0d64d0c101fdaf3a493228bf540fd6f491"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (1 corresponding lines): ci/tests_fetcher.py:632-633 | ci/torch_latest.py:780-780 \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":"ci/tests_fetcher.py"},"region":{"startLine":632}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd3499bf635654c13a4b3f23a922e964c5575ebdae91d883afd4574d3166af6e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 4\u002B corresponding lines): deepspeed/module_inject/containers/bloom.py:139-142 | deepspeed/module_inject/containers/gptneox.py:143-146 | deepspeed/module_inject/containers/megatron_gpt.py:116-119 \u2014 These 3 members are one piece of code written 3 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 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"deepspeed/module_inject/containers/bloom.py"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"5beecdcc2e942139d81a205c5707852e7997ecf9022660fd5dd64b1bceee2699"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): deepspeed/module_inject/containers/gpt2.py:57-60 | deepspeed/module_inject/containers/gptneo.py:142-145 \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":"deepspeed/module_inject/containers/gpt2.py"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba078a0636c42dd6cd47ffb1e3de8b2650eff31e12890d1078980b13b8728075"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): deepspeed/checkpoint/ds_to_universal.py:605-608 | deepspeed/utils/zero_to_fp32.py:422-425 \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":"deepspeed/checkpoint/ds_to_universal.py"},"region":{"startLine":605}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5f4890c9f7f471cde8ab5e902ee83b079c889875340dfe6c4be41f778d0c6a2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (3 corresponding lines): deepspeed/env_report.py:79-81 | op_builder/npu/builder.py:54-56 \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":"deepspeed/env_report.py"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"64e7dd2d02d643af53b34eac3bac0aff6f7ac441dcf811ee6e2bb7fdbcca96fe"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (3 corresponding lines): op_builder/klxpu/builder.py:30-32 | op_builder/supa/builder.py:29-31 \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":"op_builder/klxpu/builder.py"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb9b212cc9b26265bc4dbb2bf083697fcbfff670dc6cf5efa34197b6eda0c075"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (80 lines \u00D7 2): csrc/aio/py_test/ds_aio_args.py:117-196 | deepspeed/nvme/ds_aio_args.py:117-196 \u2014 before extracting anything, compare \u0060csrc/aio/py_test/ds_aio_args.py\u0060 and \u0060deepspeed/nvme/ds_aio_args.py\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 198 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. 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":"csrc/aio/py_test/ds_aio_args.py"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f3f560fece7b5325df8b95d2d0487a340f2e96188c9557a038571dc6ebd9217"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (49 lines \u00D7 2): csrc/aio/py_test/aio_bench_perf_sweep.py:174-222 | deepspeed/nvme/perf_run_sweep.py:183-231 \u2014 before extracting anything, compare \u0060csrc/aio/py_test/aio_bench_perf_sweep.py\u0060 and \u0060deepspeed/nvme/perf_run_sweep.py\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 148 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"csrc/aio/py_test/aio_bench_perf_sweep.py"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ba1bafe47611f5ba238a5af7ef87af92b0e380fa6e03bd949764b4a2a8fc2c6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (45 lines \u00D7 2): csrc/aio/py_test/ds_aio_args.py:69-113 | deepspeed/nvme/ds_aio_args.py:69-113 \u2014 before extracting anything, compare \u0060csrc/aio/py_test/ds_aio_args.py\u0060 and \u0060deepspeed/nvme/ds_aio_args.py\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 198 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. 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":"csrc/aio/py_test/ds_aio_args.py"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c27bf2124289b2b1b781fd878c1ef8897f762fc2d6cfde5d3078dd72e2203c4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (41 lines \u00D7 2): csrc/aio/py_test/io_engine.py:70-110 | deepspeed/nvme/io_engine.py:70-110 \u2014 before extracting anything, compare \u0060csrc/aio/py_test/io_engine.py\u0060 and \u0060deepspeed/nvme/io_engine.py\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 69 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. 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":"csrc/aio/py_test/io_engine.py"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad7dc5136fc112d8c537f302ddabc8700ebb431d0941e18f8ce3db4f2f6a7db0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (41 lines \u00D7 2): deepspeed/ops/adam/zenflow_torch_adam.py:225-265 | deepspeed/ops/adam/zenflow_torch_adam.py:582-622 \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":"deepspeed/ops/adam/zenflow_torch_adam.py"},"region":{"startLine":225}}}],"partialFingerprints":{"codehealthFindingId/v1":"d63dcbee36e66be92963c374884b9974b4953621b3df3fac6a9b41878ab6a57b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (39 lines \u00D7 2): deepspeed/sequence/autosp_fusion.py:115-153 | deepspeed/sequence/autosp_fusion.py:300-338 \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":"deepspeed/sequence/autosp_fusion.py"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ae7d5dca1e001b03081a8952cae5a7fe9c08021c0acf3d4f721a803febcd6e8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21\u201337 lines \u00D7 4): deepspeed/ops/adagrad/cpu_adagrad.py:42-78 | deepspeed/ops/adam/cpu_adam.py:152-172 | deepspeed/ops/adam/zenflow_cpu_adam.py:23-59 | deepspeed/ops/lion/cpu_lion.py:78-114 \u2014 \u0060deepspeed/ops/adam/cpu_adam.py\u0060 and \u0060deepspeed/ops/lion/cpu_lion.py\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 4 separate duplicated blocks between them, totalling at least 68 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. Read the line range as the matched WINDOW rather than a finished unit: at \u0060deepspeed/ops/adagrad/cpu_adagrad.py:42\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":"deepspeed/ops/adagrad/cpu_adagrad.py"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"82f52df57a17f4ee4411471bd5de99ae92a5003210bc964482d3d924cf9cfba9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (35\u201337 lines \u00D7 2): deepspeed/ops/adam/zenflow_torch_adam.py:119-155 | deepspeed/ops/adam/zenflow_torch_adam.py:357-391 \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":"deepspeed/ops/adam/zenflow_torch_adam.py"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ba09104890377cc03999f4692c5a0c3ec06bd88cba3ab79942e30a7f90bee1c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (35\u201336 lines \u00D7 2): csrc/aio/py_test/aio_bench_perf_sweep.py:49-83 | deepspeed/nvme/perf_run_sweep.py:67-102 \u2014 before extracting anything, compare \u0060csrc/aio/py_test/aio_bench_perf_sweep.py\u0060 and \u0060deepspeed/nvme/perf_run_sweep.py\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 148 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"csrc/aio/py_test/aio_bench_perf_sweep.py"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"746852b7759d63d4fd78fb2541181cba6358a1ff6923fae066b71f4cb0a6add5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (33 lines \u00D7 2): csrc/aio/py_test/torch_fastio_engine.py:55-87 | deepspeed/nvme/torch_fastio_engine.py:55-87 \u2014 before extracting anything, compare \u0060csrc/aio/py_test/torch_fastio_engine.py\u0060 and \u0060deepspeed/nvme/torch_fastio_engine.py\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 74 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. 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":"csrc/aio/py_test/torch_fastio_engine.py"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2d52a9bfcd3f5e6cfd1c55c777e9a08343c10f80e714d69b6772a4b8e73d7ae"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (29\u201330 lines \u00D7 3): deepspeed/ops/transformer/inference/triton/matmul_ext.py:279-308 | deepspeed/ops/transformer/inference/triton/matmul_ext.py:335-363 | deepspeed/ops/transformer/inference/triton/matmul_ext.py:390-419 \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 \u0060deepspeed/ops/transformer/inference/triton/matmul_ext.py:279\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":"deepspeed/ops/transformer/inference/triton/matmul_ext.py"},"region":{"startLine":279}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9686d4e7dcde150761263c12cb4862e6d57b2374b96c4b4db3ec657a2d33fc5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (30 lines \u00D7 2): deepspeed/runtime/zenflow/engine_stage3.py:30-59 | deepspeed/runtime/zenflow/zenflow_stage_1_and_2.py:118-147 \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":"deepspeed/runtime/zenflow/engine_stage3.py"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"958aa44aeed698782b6086314813f93dcc81a3ff7c81471511167a7fce336c7a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (28 lines \u00D7 2): deepspeed/runtime/domino/transformer.py:163-190 | deepspeed/runtime/domino/transformer.py:201-228 \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":"deepspeed/runtime/domino/transformer.py"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"f23c322dddbafff3bac2980913df53c94edeb5925867b97837f74615938b8ec1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (30 lines \u00D7 2): deepspeed/runtime/zenflow/engine_stage3.py:373-402 | deepspeed/runtime/zero/stage3.py:1370-1399 \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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060deepspeed/runtime/zero/stage3.py:1402\u0060 calls \u0060get\u0060, \u0060_create_momentum_buffer\u0060 and \u0060deepspeed/runtime/zenflow/engine_stage3.py:404\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":"deepspeed/runtime/zenflow/engine_stage3.py"},"region":{"startLine":373}}}],"partialFingerprints":{"codehealthFindingId/v1":"da5a9aa089489032b8633c2e6de52558dbe7e23087ace44722df9d6ec5be20aa"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (24 lines \u00D7 2): deepspeed/runtime/fp16/fused_optimizer.py:417-440 | deepspeed/runtime/fp16/unfused_optimizer.py:290-313 \u2014 before extracting anything, compare \u0060deepspeed/runtime/fp16/fused_optimizer.py\u0060 and \u0060deepspeed/runtime/fp16/unfused_optimizer.py\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 84 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":"deepspeed/runtime/fp16/fused_optimizer.py"},"region":{"startLine":417}}}],"partialFingerprints":{"codehealthFindingId/v1":"43da135b1ea3a31dcaf399c8c5442d0e86bcc93c014ff4be36739a4cddfe4d3c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17\u201324 lines \u00D7 2): deepspeed/runtime/zero/stage3.py:2597-2620 | deepspeed/runtime/zero/stage_1_and_2.py:2959-2975 \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 \u0060deepspeed/runtime/zero/stage3.py:2597\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":"deepspeed/runtime/zero/stage3.py"},"region":{"startLine":2597}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e70d16dd3101b4d8e6d9ba8e609372a7e0270173343d078f8091703cb4ac83e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (23 lines \u00D7 2): deepspeed/module_inject/containers/bloom.py:71-93 | deepspeed/module_inject/containers/gptneox.py:62-84 \u2014 before extracting anything, compare \u0060deepspeed/module_inject/containers/bloom.py\u0060 and \u0060deepspeed/module_inject/containers/gptneox.py\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 42 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 \u0060deepspeed/module_inject/containers/bloom.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":"deepspeed/module_inject/containers/bloom.py"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae5771401cc905d66bfb2f8486e8bc1814762506028848c7148297a06ebdccc5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (22\u201323 lines \u00D7 2): deepspeed/sequence/fpdt_layer.py:196-218 | deepspeed/sequence/fpdt_layer.py:626-647 \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":"deepspeed/sequence/fpdt_layer.py"},"region":{"startLine":196}}}],"partialFingerprints":{"codehealthFindingId/v1":"932be5de0fce535e849b1dabd9f3ebfd41117e23df9563a729541a7f5b20dd1f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20\u201322 lines \u00D7 3): deepspeed/inference/v2/model_implementations/llama_v2/model.py:135-156 | deepspeed/inference/v2/model_implementations/mistral/model.py:134-155 | deepspeed/inference/v2/model_implementations/phi3/model.py:134-153 \u2014 \u0060deepspeed/inference/v2/model_implementations/llama_v2/model.py\u0060 and \u0060deepspeed/inference/v2/model_implementations/mistral/model.py\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 10 separate duplicated blocks between them, totalling at least 116 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"deepspeed/inference/v2/model_implementations/llama_v2/model.py"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"71be7a19786f86c08cff5098dc1fd11b619826349adf96b59653fb8696a85b5c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (22 lines \u00D7 3): deepspeed/inference/v2/model_implementations/qwen/model.py:149-170 | deepspeed/inference/v2/model_implementations/qwen_v2/model.py:147-168 | deepspeed/inference/v2/model_implementations/qwen_v2_moe/model.py:281-302 \u2014 \u0060deepspeed/inference/v2/model_implementations/qwen/model.py\u0060 and \u0060deepspeed/inference/v2/model_implementations/qwen_v2/model.py\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 10 separate duplicated blocks between them, totalling at least 112 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"deepspeed/inference/v2/model_implementations/qwen/model.py"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"21412bda31225e59f5c118ccc8b9b2d06b3f968cb6d502b74e51c0cf9e6ea309"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (22 lines \u00D7 2): csrc/aio/py_test/ds_aio_args.py:44-65 | deepspeed/nvme/ds_aio_args.py:44-65 \u2014 before extracting anything, compare \u0060csrc/aio/py_test/ds_aio_args.py\u0060 and \u0060deepspeed/nvme/ds_aio_args.py\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 198 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. 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":"csrc/aio/py_test/ds_aio_args.py"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"cae7244774fba15cd3e9660c7a7df6609b5ef17c724919b3e9b131598c722f14"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (3\u201322 lines \u00D7 6): csrc/aio/py_test/ds_aio_basic.py:45-47 | csrc/aio/py_test/torch_fastio_engine.py:54-56 | csrc/aio/py_test/torch_io.py:43-64 | deepspeed/nvme/ds_aio_basic.py:45-47 | deepspeed/nvme/torch_fastio_engine.py:54-56 | deepspeed/nvme/torch_io.py:43-64 \u2014 before extracting anything, compare \u0060csrc/aio/py_test/ds_aio_basic.py\u0060 and \u0060deepspeed/nvme/ds_aio_basic.py\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 52 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. 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. 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, \u0060csrc/aio/py_test/torch_fastio_engine.py:50\u0060 calls \u0060_dump_state\u0060 and \u0060csrc/aio/py_test/ds_aio_basic.py:41\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":"csrc/aio/py_test/ds_aio_basic.py"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"98d7be77e2cd1b61b0f124374980278f1c870196003b80cf8080cdcd22ff54ae"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (22 lines \u00D7 2): deepspeed/runtime/zero/stage3.py:2321-2342 | deepspeed/runtime/zero/stage_1_and_2.py:2396-2417 \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":"deepspeed/runtime/zero/stage3.py"},"region":{"startLine":2321}}}],"partialFingerprints":{"codehealthFindingId/v1":"5507d7ac9fad943be0ef436e420cf139397049133f8ed02466940e231368106f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 2): accelerator/cuda_accelerator.py:368-388 | accelerator/hpu_accelerator.py:264-284 \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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060accelerator/cuda_accelerator.py:391\u0060 calls \u0060import_module\u0060, \u0060format\u0060, \u0060getattr\u0060 and \u0060accelerator/hpu_accelerator.py:288\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":"accelerator/cuda_accelerator.py"},"region":{"startLine":368}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc502f6028ca7eacd8e82e17a9012dd3b6da404e1cd860c56e07c42b211d2615"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 2): deepspeed/runtime/activation_checkpointing/checkpointing.py:677-697 | deepspeed/runtime/activation_checkpointing/checkpointing.py:912-932 \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":"deepspeed/runtime/activation_checkpointing/checkpointing.py"},"region":{"startLine":677}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a8d1a442fe55d3c0a4a35ba3f696fe49a724e5ca2366af5ffaed9b88c2c1260"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19\u201321 lines \u00D7 2): deepspeed/utils/logging.py:87-107 | deepspeed/utils/logging.py:157-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":"deepspeed/utils/logging.py"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"897af4e8adfd6502c6fe385422f8b167decd925d1caeba5045cbbd6b33ffb29d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (24\u201325 lines \u00D7 2): csrc/aio/py_test/aio_bench_generate_param.py:53-77 | deepspeed/nvme/perf_generate_param.py:60-83 \u2014 before extracting anything, compare \u0060csrc/aio/py_test/aio_bench_generate_param.py\u0060 and \u0060deepspeed/nvme/perf_generate_param.py\u0060 as WHOLE FILES: 83% 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. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. 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, \u0060deepspeed/nvme/perf_generate_param.py:56\u0060 calls \u0060items\u0060 and \u0060csrc/aio/py_test/aio_bench_generate_param.py:52\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":"csrc/aio/py_test/aio_bench_generate_param.py"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"98a276224adf9702d0c0447f19b2ab3f7c96e7cd3943b75780826f2f3f5ce072"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18\u201319 lines \u00D7 4): deepspeed/ops/adam/zenflow_torch_adam.py:134-152 | deepspeed/ops/adam/zenflow_torch_adam.py:245-263 | deepspeed/ops/adam/zenflow_torch_adam.py:372-389 | deepspeed/ops/adam/zenflow_torch_adam.py:602-620 \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":"deepspeed/ops/adam/zenflow_torch_adam.py"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"69e9d7b29ee13b8720b48b298ef27b6dd7fd4dc54e398ef82bcf125b48e0aa81"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2): csrc/aio/py_test/ds_aio_handle.py:56-74 | deepspeed/nvme/ds_aio_handle.py:65-83 \u2014 before extracting anything, compare \u0060csrc/aio/py_test/ds_aio_handle.py\u0060 and \u0060deepspeed/nvme/ds_aio_handle.py\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 68 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. 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":"csrc/aio/py_test/ds_aio_handle.py"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"21ca0977e334036ec654c85c2eb8be7ca294a11f2658615ce6cc6eaaae6847bf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2): deepspeed/runtime/zenflow/engine_stage3.py:590-608 | deepspeed/runtime/zero/stage3.py:3120-3138 \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":"deepspeed/runtime/zenflow/engine_stage3.py"},"region":{"startLine":590}}}],"partialFingerprints":{"codehealthFindingId/v1":"13a374b168da386ad6ab2369971457ea191aaef525f07df863ce83238858d8de"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): deepspeed/launcher/launcher_helper.py:33-50 | deepspeed/launcher/runner.py:171-188 \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 \u0060deepspeed/launcher/launcher_helper.py:33\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":"deepspeed/launcher/launcher_helper.py"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"96da8df3dbc8c9b117d886d3dcce4d6a45fd2c3f8930be58f3bd58ca591522ed"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): deepspeed/ops/triton_ops/group_gemm_triton.py:343-360 | deepspeed/ops/triton_ops/group_gemm_triton.py:386-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 \u0060deepspeed/ops/triton_ops/group_gemm_triton.py:343\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":"deepspeed/ops/triton_ops/group_gemm_triton.py"},"region":{"startLine":343}}}],"partialFingerprints":{"codehealthFindingId/v1":"d15d557c62ea18bbe04be2fdb26b416113ebde0f8159a8788642dd06308ef164"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15\u201318 lines \u00D7 2): deepspeed/runtime/zenflow/engine_stage3.py:163-177 | deepspeed/runtime/zenflow/engine_stage3.py:195-212 \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":"deepspeed/runtime/zenflow/engine_stage3.py"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9dd00134a1315dd1cdb7efe93f2b853784b7bedbd700a5622a9e575fbc5f5a8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): deepspeed/sequence/fpdt_layer.py:220-237 | deepspeed/sequence/fpdt_layer.py:650-667 \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":"deepspeed/sequence/fpdt_layer.py"},"region":{"startLine":220}}}],"partialFingerprints":{"codehealthFindingId/v1":"70af335ad827fbb7272a95180bb004612a9921fa099ed6e88969fd50d4d2817b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16\u201317 lines \u00D7 5): deepspeed/inference/v2/model_implementations/llama_v2/model.py:153-169 | deepspeed/inference/v2/model_implementations/mistral/model.py:152-168 | deepspeed/inference/v2/model_implementations/phi3/model.py:150-165 | deepspeed/inference/v2/model_implementations/qwen/model.py:167-183 | deepspeed/inference/v2/model_implementations/qwen_v2/model.py:165-181 \u2014 \u0060deepspeed/inference/v2/model_implementations/llama_v2/model.py\u0060 and \u0060deepspeed/inference/v2/model_implementations/mistral/model.py\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 10 separate duplicated blocks between them, totalling at least 116 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"deepspeed/inference/v2/model_implementations/llama_v2/model.py"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d234d86d5da4db9f33b555e36fa5ea64c92bf2a80a4bc406204557ff7ee792b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14\u201317 lines \u00D7 3): deepspeed/runtime/zenflow/zenflow_stage_1_and_2.py:202-215 | deepspeed/runtime/zenflow/zenflow_stage_1_and_2.py:311-324 | deepspeed/runtime/zero/stage_1_and_2.py:1757-1773 \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":"deepspeed/runtime/zenflow/zenflow_stage_1_and_2.py"},"region":{"startLine":202}}}],"partialFingerprints":{"codehealthFindingId/v1":"610d3c0ec0cdab6cb5a10f316e24e9f5627170e2a6aa595750d712727f9dffa0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): csrc/aio/py_test/ds_aio_basic.py:48-64 | deepspeed/nvme/ds_aio_basic.py:48-64 \u2014 before extracting anything, compare \u0060csrc/aio/py_test/ds_aio_basic.py\u0060 and \u0060deepspeed/nvme/ds_aio_basic.py\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 52 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. 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":"csrc/aio/py_test/ds_aio_basic.py"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"b66e2e280b2c098ea1aa74bf3f00e2748155155289ebbf682f76339f87a2e9e6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): deepspeed/inference/v2/model_implementations/qwen_v2/model.py:106-122 | deepspeed/inference/v2/model_implementations/qwen_v2_moe/model.py:202-218 \u2014 \u0060deepspeed/inference/v2/model_implementations/qwen_v2/model.py\u0060 and \u0060deepspeed/inference/v2/model_implementations/qwen_v2_moe/model.py\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 9 separate duplicated blocks between them, totalling at least 103 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"deepspeed/inference/v2/model_implementations/qwen_v2/model.py"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"385738ce0e2975b40207f9ffa368c7d7449687158748d379c10c76186ade02b3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16\u201317 lines \u00D7 2): deepspeed/module_inject/containers/features/hybrid_megatron.py:32-48 | deepspeed/module_inject/containers/features/hybrid_megatron.py:70-85 \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":"deepspeed/module_inject/containers/features/hybrid_megatron.py"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc8e632a807ceed9afefd4314cbcba95fa9e787d6beecc1e5910ba3ca4d654ba"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): deepspeed/ops/adam/fused_adam.py:108-126 | deepspeed/ops/lion/fused_lion.py:56-72 \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":"deepspeed/ops/adam/fused_adam.py"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"c67ea9d4dc70f31747f3ae02bdd5b9973b732e3a9142867994dd9ecc00ad2239"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16\u201317 lines \u00D7 2): deepspeed/ops/fp_quantizer/quantize.py:125-141 | deepspeed/ops/fp_quantizer/quantize.py:159-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 \u0060deepspeed/ops/fp_quantizer/quantize.py:125\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":"deepspeed/ops/fp_quantizer/quantize.py"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"70c79edd808e712c7b06b84fba2ca5e42c48cae441a90d23abfa9fb96da9b889"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): deepspeed/ops/transformer/inference/ds_mlp.py:58-74 | deepspeed/ops/transformer/inference/triton/mlp.py:37-53 \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 \u0060deepspeed/ops/transformer/inference/ds_mlp.py:58\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":"deepspeed/ops/transformer/inference/ds_mlp.py"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"b002337a63bfd88eccea3d5e256d1f6dfe6aaf0466733bf6be45cac2329fcdf7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): deepspeed/runtime/zero/muon/original_muon.py:431-447 | deepspeed/runtime/zero/muon/original_muon.py:502-518 \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 \u0060deepspeed/runtime/zero/muon/original_muon.py:431\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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060deepspeed/runtime/zero/muon/original_muon.py:429\u0060 calls \u0060all_gather\u0060, \u0060get_world_size\u0060, \u0060get_rank\u0060 and \u0060deepspeed/runtime/zero/muon/original_muon.py:501\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":"deepspeed/runtime/zero/muon/original_muon.py"},"region":{"startLine":431}}}],"partialFingerprints":{"codehealthFindingId/v1":"81b6e584b8e5901400479d334c4ef27621b3268053e16e4966e089a1aafbe1e8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 7): deepspeed/utils/numa.py:44-59 | op_builder/async_io.py:78-93 | op_builder/cpu/async_io.py:54-69 | op_builder/klxpu/async_io.py:50-65 | op_builder/npu/async_io.py:61-76 | op_builder/supa/async_io.py:50-65 | op_builder/xpu/async_io.py:63-78 \u2014 before extracting anything, compare \u0060op_builder/async_io.py\u0060 and \u0060op_builder/cpu/async_io.py\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 34 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"deepspeed/utils/numa.py"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"9eb93a14785949ad5268b3e2e7af8d6ac5397ede698633206ca97383881766fc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 4): csrc/aio/py_test/aio_bench_perf_sweep.py:64-79 | csrc/aio/py_test/ds_aio_args.py:147-162 | deepspeed/nvme/ds_aio_args.py:147-162 | deepspeed/nvme/perf_run_sweep.py:82-98 \u2014 before extracting anything, compare \u0060csrc/aio/py_test/aio_bench_perf_sweep.py\u0060 and \u0060deepspeed/nvme/perf_run_sweep.py\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 148 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060csrc/aio/py_test/aio_bench_perf_sweep.py:64\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, \u0060csrc/aio/py_test/ds_aio_args.py:143\u0060 calls \u0060suffix\u0060, \u0060add_argument\u0060, \u0060depth\u0060 and \u0060csrc/aio/py_test/aio_bench_perf_sweep.py:64\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":"csrc/aio/py_test/aio_bench_perf_sweep.py"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1e85f3d24ba06367032c0a2499e4533ee6b5cc3b49417e64dce7214d0e621f8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): csrc/aio/py_test/parse_aio_stats.py:37-52 | deepspeed/nvme/parse_nvme_stats.py:37-52 \u2014 before extracting anything, compare \u0060csrc/aio/py_test/parse_aio_stats.py\u0060 and \u0060deepspeed/nvme/parse_nvme_stats.py\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 70 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. 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":"csrc/aio/py_test/parse_aio_stats.py"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"a947074b3e3e8a92214b5ead0a3e6d4591ab3762c46eb65d9e7eee7670234aa0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): deepspeed/compile/input_storage.py:93-108 | deepspeed/compile/input_storage.py:124-139 \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":"deepspeed/compile/input_storage.py"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd0bc112d0dd4fb47aed5fa5ae2015891ffcd9954ef2489cc07506f78ab84159"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14\u201316 lines \u00D7 2): deepspeed/compile/passes/offload_activation.py:591-604 | deepspeed/compile/passes/offload_activation.py:608-623 \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":"deepspeed/compile/passes/offload_activation.py"},"region":{"startLine":591}}}],"partialFingerprints":{"codehealthFindingId/v1":"eaa019799c949e48891a798a7d76ebb2719149603b3f1e89a5c72b3ee430fee9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14\u201316 lines \u00D7 2): deepspeed/launcher/multinode_runner.py:218-233 | deepspeed/launcher/multinode_runner.py:290-303 \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":"deepspeed/launcher/multinode_runner.py"},"region":{"startLine":218}}}],"partialFingerprints":{"codehealthFindingId/v1":"2288996e63b9a460680d50fe19a7ffd459197b0b9342e393cedf3aad9e52a1ed"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): deepspeed/ops/transformer/inference/triton/triton_matmul_kernel.py:16-32 | deepspeed/ops/transformer/inference/triton/triton_matmul_kernel.py:210-226 \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":"deepspeed/ops/transformer/inference/triton/triton_matmul_kernel.py"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"d86139fac5d88d777e16c3d692a9a0b269b76451b6955d5796ecafbe03c2d7fb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): deepspeed/runtime/utils.py:1234-1249 | deepspeed/runtime/zero/offload_states.py:60-75 \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":"deepspeed/runtime/utils.py"},"region":{"startLine":1234}}}],"partialFingerprints":{"codehealthFindingId/v1":"dbdccd54d92c8a21732acb1456b3c8c6f29a6a290dc135635bbc801bbaf0d758"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14\u201316 lines \u00D7 2): deepspeed/runtime/zero/stage3.py:2449-2464 | deepspeed/runtime/zero/stage_1_and_2.py:2670-2683 \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 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":"deepspeed/runtime/zero/stage3.py"},"region":{"startLine":2449}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9e99438724273744c842f83d234d15e66fd5be0c6c4192833d4925b7895d3cb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14\u201315 lines \u00D7 3): deepspeed/ops/transformer/inference/diffusers_attention.py:141-154 | deepspeed/ops/transformer/inference/ds_attention.py:45-58 | deepspeed/ops/transformer/inference/triton/attention.py:52-66 \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 \u0060deepspeed/ops/transformer/inference/diffusers_attention.py:141\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":"deepspeed/ops/transformer/inference/diffusers_attention.py"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"6bda45f51e7eb01f774a1caa3ace9ac6a88e801e35b364c56f9ec6aa8fea6ca8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201315 lines \u00D7 3): deepspeed/runtime/superoffload/superoffload_stage3.py:151-159 | deepspeed/runtime/zenflow/engine_stage3.py:475-489 | deepspeed/runtime/zero/stage3.py:2125-2139 \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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"deepspeed/runtime/superoffload/superoffload_stage3.py"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"1359d840b1adceff95dab58359bb7e0554911f67d767a58fb2935c8bd1d2ca2c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): csrc/aio/py_test/aio_bench_perf_sweep.py:284-298 | deepspeed/nvme/perf_run_sweep.py:292-306 \u2014 before extracting anything, compare \u0060csrc/aio/py_test/aio_bench_perf_sweep.py\u0060 and \u0060deepspeed/nvme/perf_run_sweep.py\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 148 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060csrc/aio/py_test/aio_bench_perf_sweep.py:284\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":"csrc/aio/py_test/aio_bench_perf_sweep.py"},"region":{"startLine":284}}}],"partialFingerprints":{"codehealthFindingId/v1":"7433e2bf15968ea37bb9ca7c828e0b5c760e108194c45dd4f674efb321399262"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): deepspeed/compile/list_schedule.py:769-783 | deepspeed/compile/list_schedule.py:786-800 \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":"deepspeed/compile/list_schedule.py"},"region":{"startLine":769}}}],"partialFingerprints":{"codehealthFindingId/v1":"130815b1b77045fa1a52cda939b454b9680f82a4f5daa90d426271e4243d092b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): deepspeed/module_inject/layers.py:2183-2197 | deepspeed/module_inject/layers.py:2317-2331 \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":"deepspeed/module_inject/layers.py"},"region":{"startLine":2183}}}],"partialFingerprints":{"codehealthFindingId/v1":"f14c29d041c7f7cd0a28e047e849b8257dd683b81df000caa7d57dcc9e8122f2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): deepspeed/ops/adam/zenflow_torch_adam.py:207-221 | deepspeed/ops/adam/zenflow_torch_adam.py:557-571 \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":"deepspeed/ops/adam/zenflow_torch_adam.py"},"region":{"startLine":207}}}],"partialFingerprints":{"codehealthFindingId/v1":"314ec5b74d7143ad134c49d8d77ffbea31f6c377227bc20911e1d50b0bf00100"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): deepspeed/runtime/zenflow/engine_stage3.py:414-428 | deepspeed/runtime/zero/stage3.py:1411-1425 \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 \u0060deepspeed/runtime/zenflow/engine_stage3.py:414\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":"deepspeed/runtime/zenflow/engine_stage3.py"},"region":{"startLine":414}}}],"partialFingerprints":{"codehealthFindingId/v1":"3dd93593af8ad3e6a04cc88b80055a677b64b3558a519f2f3ce240ea0fe1d94f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): op_builder/builder.py:429-443 | op_builder/builder.py:530-544 \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":"op_builder/builder.py"},"region":{"startLine":429}}}],"partialFingerprints":{"codehealthFindingId/v1":"3bf24bbce14e2a560f5de554fb06284b02119b19068fe16dc94d7f869ab5e9f2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201314 lines \u00D7 6): op_builder/fp_quantizer.py:33-46 | op_builder/inference_core_ops.py:33-45 | op_builder/inference_cutlass_builder.py:32-44 | op_builder/ragged_ops.py:33-45 | op_builder/ragged_utils.py:33-45 | op_builder/transformer_inference.py:32-44 \u2014 before extracting anything, compare \u0060op_builder/fp_quantizer.py\u0060 and \u0060op_builder/inference_core_ops.py\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 36 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":"op_builder/fp_quantizer.py"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"75853f05b5ccb48c73b3ca45ac88542519a9f8f1b90c9a8bdb2b9c4e867f541d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): deepspeed/inference/v2/model_implementations/inference_transformer_base.py:514-527 | deepspeed/inference/v2/model_implementations/qwen_v2_moe/model.py:148-161 \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":"deepspeed/inference/v2/model_implementations/inference_transformer_base.py"},"region":{"startLine":514}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a98d009e9bd8769996092d6930555d34dfd8c18c6a011ae8516a646f794caa4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): deepspeed/inference/v2/modules/implementations/linear/blas_fp_linear.py:40-53 | deepspeed/inference/v2/modules/implementations/linear/quantized_linear.py:114-127 \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":"deepspeed/inference/v2/modules/implementations/linear/blas_fp_linear.py"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"77955ef0c3508b64612464e14e980dd4119f43a393c0fcbd8030168fcb89c298"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201314 lines \u00D7 2): deepspeed/module_inject/layers.py:2281-2294 | deepspeed/module_inject/layers.py:2390-2402 \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 \u0060deepspeed/module_inject/layers.py:2281\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":"deepspeed/module_inject/layers.py"},"region":{"startLine":2281}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d83f2887dbd18949e827c8e488cbf0d78176f94ca851b6baa6cb4931fe7d4cf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): deepspeed/runtime/fp16/fused_optimizer.py:110-123 | deepspeed/runtime/fp16/unfused_optimizer.py:95-108 \u2014 before extracting anything, compare \u0060deepspeed/runtime/fp16/fused_optimizer.py\u0060 and \u0060deepspeed/runtime/fp16/unfused_optimizer.py\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 84 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":"deepspeed/runtime/fp16/fused_optimizer.py"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"0eaece859f42b671b083624472831ee2b48fecf58625ee3a95f8166f7fbd7207"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): deepspeed/runtime/sequence_parallel/ulysses_sp.py:1047-1060 | deepspeed/runtime/sequence_parallel/ulysses_sp.py:1178-1191 \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":"deepspeed/runtime/sequence_parallel/ulysses_sp.py"},"region":{"startLine":1047}}}],"partialFingerprints":{"codehealthFindingId/v1":"47e9fd3e699cf66752cf653912a6abae7eab8cbe067f2c8518252da2c50622dc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): deepspeed/runtime/zenflow/zenflow_stage_1_and_2.py:472-485 | deepspeed/runtime/zero/stage_1_and_2.py:1739-1752 \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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060deepspeed/runtime/zero/stage_1_and_2.py:1753\u0060 calls \u0060frozenset\u0060, \u0060isinstance\u0060, \u0060getattr\u0060 and \u0060deepspeed/runtime/zenflow/zenflow_stage_1_and_2.py:486\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":"deepspeed/runtime/zenflow/zenflow_stage_1_and_2.py"},"region":{"startLine":472}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7649ef2ccdcc68de058691225c2cd50c025c16ecc1725482c7a9d43f775f98c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): deepspeed/runtime/zero/muon/original_muon.py:382-397 | deepspeed/runtime/zero/muon/original_muon.py:460-475 \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, \u0060deepspeed/runtime/zero/muon/original_muon.py:380\u0060 calls \u0060sorted\u0060, \u0060size\u0060 and \u0060deepspeed/runtime/zero/muon/original_muon.py:458\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":"deepspeed/runtime/zero/muon/original_muon.py"},"region":{"startLine":382}}}],"partialFingerprints":{"codehealthFindingId/v1":"d98a8bc3a0b3e342bc1c9cd7d6d69cf14685a748072b6066e7697e56da34d9a0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): deepspeed/sequence/fpdt_layer.py:350-363 | deepspeed/sequence/fpdt_layer.py:840-853 \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":"deepspeed/sequence/fpdt_layer.py"},"region":{"startLine":350}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9792a8e7ccafe624084074ddb5f4e2c9c7abe52ce8b161011f7decd6c7cc5cb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 4): deepspeed/runtime/zero/muon/original_muon.py:283-296 | deepspeed/runtime/zero/muon/original_muon.py:322-335 | deepspeed/runtime/zero/muon/original_muon.py:415-428 | deepspeed/runtime/zero/muon/original_muon.py:488-501 \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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060deepspeed/runtime/zero/muon/original_muon.py:429\u0060 calls \u0060all_gather\u0060, \u0060get_world_size\u0060, \u0060get_rank\u0060 and \u0060deepspeed/runtime/zero/muon/original_muon.py:502\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":"deepspeed/runtime/zero/muon/original_muon.py"},"region":{"startLine":283}}}],"partialFingerprints":{"codehealthFindingId/v1":"bed9b7fd1dfb4f6d68dac16041a344f2e4e742672d36407f08bd8c3b600e263b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): ci/torch_latest.py:1883-1895 | ci/torch_latest.py:1949-1961 \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":"ci/torch_latest.py"},"region":{"startLine":1883}}}],"partialFingerprints":{"codehealthFindingId/v1":"63b7aa8f94176f8bb0a29db3f50d3de7d7c929e0eecbdff7b5949ae40abd99b2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): csrc/aio/py_test/aio_bench_perf_sweep.py:158-170 | deepspeed/nvme/perf_run_sweep.py:167-179 \u2014 before extracting anything, compare \u0060csrc/aio/py_test/aio_bench_perf_sweep.py\u0060 and \u0060deepspeed/nvme/perf_run_sweep.py\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 148 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. 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":"csrc/aio/py_test/aio_bench_perf_sweep.py"},"region":{"startLine":158}}}],"partialFingerprints":{"codehealthFindingId/v1":"252e38221dbf5937dd54d817d9191cb2cd23d9a6d93fbe9d520d0125f719ce33"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): csrc/aio/py_test/parse_aio_stats.py:21-33 | deepspeed/nvme/parse_nvme_stats.py:21-33 \u2014 before extracting anything, compare \u0060csrc/aio/py_test/parse_aio_stats.py\u0060 and \u0060deepspeed/nvme/parse_nvme_stats.py\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 70 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. 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":"csrc/aio/py_test/parse_aio_stats.py"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0c2d5fc13f2996848e701944496e255037c9e81a54f6f59288def0d6eac798c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): csrc/aio/py_test/torch_fastio_engine.py:38-50 | deepspeed/nvme/torch_fastio_engine.py:38-50 \u2014 before extracting anything, compare \u0060csrc/aio/py_test/torch_fastio_engine.py\u0060 and \u0060deepspeed/nvme/torch_fastio_engine.py\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 74 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"csrc/aio/py_test/torch_fastio_engine.py"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c76e04981a2a3ab00ca4b7655e22a5cbe02b679829426fd742c798957e433fa"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): deepspeed/env_report.py:89-101 | op_builder/npu/builder.py:61-73 \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":"deepspeed/env_report.py"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"6aef556fdc01b6433cebc0edfc0b2ae82534b229745fb1f16bc637e96005fd22"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): deepspeed/inference/v2/model_implementations/inference_transformer_base.py:641-653 | deepspeed/inference/v2/model_implementations/qwen_v2_moe/model.py:132-144 \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":"deepspeed/inference/v2/model_implementations/inference_transformer_base.py"},"region":{"startLine":641}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5f32ce9a05012bcc656abc2e47f383bfc21cabe5adfa61aafe16d438ebdd0f2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201313 lines \u00D7 2): deepspeed/ops/transformer/inference/ds_attention.py:29-40 | deepspeed/ops/transformer/inference/triton/attention.py:37-49 \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 \u0060deepspeed/ops/transformer/inference/triton/attention.py:37\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":"deepspeed/ops/transformer/inference/ds_attention.py"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"cfa37128f89af6c0c7444bee58a1884c389fd97ae0a910a6f261c5b270f04bec"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201313 lines \u00D7 2): deepspeed/runtime/fp16/fused_optimizer.py:510-521 | deepspeed/runtime/fp16/unfused_optimizer.py:393-405 \u2014 before extracting anything, compare \u0060deepspeed/runtime/fp16/fused_optimizer.py\u0060 and \u0060deepspeed/runtime/fp16/unfused_optimizer.py\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 84 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":"deepspeed/runtime/fp16/fused_optimizer.py"},"region":{"startLine":510}}}],"partialFingerprints":{"codehealthFindingId/v1":"b094a9c07113552e2272da7cbd16b2679d1502b181c2c7bd03a88b07c50c16a6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): deepspeed/runtime/zenflow/zenflow_stage_1_and_2.py:734-746 | deepspeed/runtime/zero/stage_1_and_2.py:3256-3268 \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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060deepspeed/runtime/zenflow/zenflow_stage_1_and_2.py:748\u0060 calls \u0060timers\u0060, \u0060start\u0060 and \u0060deepspeed/runtime/zero/stage_1_and_2.py:3271\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":"deepspeed/runtime/zenflow/zenflow_stage_1_and_2.py"},"region":{"startLine":734}}}],"partialFingerprints":{"codehealthFindingId/v1":"90522e3a2771f3201927e46ae495e7aa21717e3df617e2d1d195bc8ee55e5991"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): deepspeed/runtime/zero/stage3.py:1458-1470 | deepspeed/runtime/zero/stage_1_and_2.py:1011-1023 \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":"deepspeed/runtime/zero/stage3.py"},"region":{"startLine":1458}}}],"partialFingerprints":{"codehealthFindingId/v1":"2cd7f27719d27501b896550fd0cabe5c9ac16e88e089253849a02081eee79272"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): deepspeed/runtime/zero/stage3.py:2423-2435 | deepspeed/runtime/zero/stage_1_and_2.py:2641-2653 \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":"deepspeed/runtime/zero/stage3.py"},"region":{"startLine":2423}}}],"partialFingerprints":{"codehealthFindingId/v1":"530f615965d75c3352b6412937cfac4b14ea950c737702bb7a245129b4e88fd3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): deepspeed/runtime/zero/stage3.py:3769-3781 | deepspeed/runtime/zero/stage3.py:3918-3930 \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, \u0060deepspeed/runtime/zero/stage3.py:3784\u0060 calls \u0060zip\u0060, \u0060copy_\u0060 and \u0060deepspeed/runtime/zero/stage3.py:3932\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":"deepspeed/runtime/zero/stage3.py"},"region":{"startLine":3769}}}],"partialFingerprints":{"codehealthFindingId/v1":"907fbb50d16e1a611475ac5778676db5c3f917b3d9fc723b55bf0a3a3e16642e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201313 lines \u00D7 2): deepspeed/runtime/zero/stage3.py:3788-3800 | deepspeed/runtime/zero/stage3.py:3932-3943 \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, \u0060deepspeed/runtime/zero/stage3.py:3784\u0060 calls \u0060zip\u0060, \u0060copy_\u0060 and \u0060deepspeed/runtime/zero/stage3.py:3930\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":"deepspeed/runtime/zero/stage3.py"},"region":{"startLine":3788}}}],"partialFingerprints":{"codehealthFindingId/v1":"de23c0cc673344960688c85b304abcf1218d45b477fe0436252a6e9036a14df9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 6): deepspeed/inference/v2/model_implementations/llama_v2/model.py:164-175 | deepspeed/inference/v2/model_implementations/mistral/model.py:163-174 | deepspeed/inference/v2/model_implementations/phi3/model.py:160-171 | deepspeed/inference/v2/model_implementations/qwen/model.py:178-189 | deepspeed/inference/v2/model_implementations/qwen_v2/model.py:176-187 | deepspeed/inference/v2/model_implementations/qwen_v2_moe/model.py:315-326 \u2014 \u0060deepspeed/inference/v2/model_implementations/llama_v2/model.py\u0060 and \u0060deepspeed/inference/v2/model_implementations/mistral/model.py\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 10 separate duplicated blocks between them, totalling at least 116 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. 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":"deepspeed/inference/v2/model_implementations/llama_v2/model.py"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"3338d0c9738a677aae32fc8e5f51a9686ce91c235487bd8dd81e2a20c346123a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 5): deepspeed/ops/adagrad/cpu_adagrad.py:69-81 | deepspeed/ops/adam/cpu_adam.py:163-175 | deepspeed/ops/adam/cpu_adam.py:244-255 | deepspeed/ops/adam/zenflow_cpu_adam.py:50-62 | deepspeed/ops/lion/cpu_lion.py:105-117 \u2014 \u0060deepspeed/ops/adam/cpu_adam.py\u0060 and \u0060deepspeed/ops/lion/cpu_lion.py\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 4 separate duplicated blocks between them, totalling at least 68 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. 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":"deepspeed/ops/adagrad/cpu_adagrad.py"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3323fe49a66a024ef3d495693ee4ce8a731f473ffb2aabc1341e189bcb57544"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 3): deepspeed/ops/triton_ops/fused_rotary_pos_emb.py:176-187 | deepspeed/ops/triton_ops/group_gemm_triton.py:345-356 | deepspeed/ops/triton_ops/group_gemm_triton.py:388-399 \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":"deepspeed/ops/triton_ops/fused_rotary_pos_emb.py"},"region":{"startLine":176}}}],"partialFingerprints":{"codehealthFindingId/v1":"7341966317ef4dc94acd14af2f6c64ba93ee26d40b12ecc673269fe2e4ee2dfa"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 3): deepspeed/sequence/fpdt_layer.py:928-939 | deepspeed/sequence/fpdt_layer.py:947-958 | deepspeed/sequence/fpdt_layer.py:965-976 \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 \u0060deepspeed/sequence/fpdt_layer.py:928\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":"deepspeed/sequence/fpdt_layer.py"},"region":{"startLine":928}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2710fd706c97c1a38477ca7d476a3d55868e5f45717c1fac394f0ab0389d60f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): accelerator/klxpu_accelerator.py:50-61 | accelerator/supa_accelerator.py:244-255 \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":"accelerator/klxpu_accelerator.py"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"05e79f4aeffb8de1594220ad527f3baca09d3d1aabe6d844b5972f5895ad958d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): csrc/aio/py_test/ds_aio_handle.py:42-53 | deepspeed/nvme/ds_aio_handle.py:51-62 \u2014 before extracting anything, compare \u0060csrc/aio/py_test/ds_aio_handle.py\u0060 and \u0060deepspeed/nvme/ds_aio_handle.py\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 68 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"csrc/aio/py_test/ds_aio_handle.py"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb67e460f83111e07a6d36e1ac30b5d40d26cb3ff4386e2004dd0585d303d7ac"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): csrc/aio/py_test/parse_aio_stats.py:89-100 | deepspeed/nvme/parse_nvme_stats.py:89-100 \u2014 before extracting anything, compare \u0060csrc/aio/py_test/parse_aio_stats.py\u0060 and \u0060deepspeed/nvme/parse_nvme_stats.py\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 70 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. 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":"csrc/aio/py_test/parse_aio_stats.py"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"812dfd6fed0db1058e92dc59b57245f39ff4bbf49ba0419a0999af10cc72291c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): deepspeed/module_inject/layers.py:2267-2278 | deepspeed/module_inject/layers.py:2376-2387 \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":"deepspeed/module_inject/layers.py"},"region":{"startLine":2267}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f36c891bf9e1a04439e80e26aec64bd967dd18eaa19efc01cfbde4db4f55550"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): deepspeed/monitor/csv_monitor.py:24-35 | deepspeed/monitor/tensorboard.py:30-41 \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":"deepspeed/monitor/csv_monitor.py"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"37c5009b65f958ee621f00f933e2282abd901ded5d5289d5b6bde836c5e56efe"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): deepspeed/ops/adam/cpu_adam.py:76-87 | deepspeed/ops/lion/cpu_lion.py:43-54 \u2014 \u0060deepspeed/ops/adam/cpu_adam.py\u0060 and \u0060deepspeed/ops/lion/cpu_lion.py\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 4 separate duplicated blocks between them, totalling at least 68 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. 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":"deepspeed/ops/adam/cpu_adam.py"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8fdb97d675bfb59a6573117ef4e2ceac4217fd60db6ffc355f8580ad5ab0ced"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): deepspeed/ops/adam/zenflow_torch_adam.py:90-101 | deepspeed/ops/adam/zenflow_torch_adam.py:318-329 \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":"deepspeed/ops/adam/zenflow_torch_adam.py"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0121dc9acd0b71190c69977215921dd8a2e3c9ded507fb921a19c54ce296cc8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): deepspeed/ops/fp_quantizer/fp8_gemm_triton.py:28-44 | deepspeed/ops/fp_quantizer/fp8_gemm_triton.py:77-93 \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 \u0060deepspeed/ops/fp_quantizer/fp8_gemm_triton.py:28\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 after the matched lines, \u0060deepspeed/ops/fp_quantizer/fp8_gemm_triton.py:95\u0060 calls \u0060load\u0060 and \u0060deepspeed/ops/fp_quantizer/fp8_gemm_triton.py:46\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":"deepspeed/ops/fp_quantizer/fp8_gemm_triton.py"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea80a534f291259df4e907d62db58629d3eae4d2dc59fe5552c946060ec23d8c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): deepspeed/runtime/activation_checkpointing/checkpointing.py:631-642 | deepspeed/runtime/activation_checkpointing/checkpointing.py:1009-1020 \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":"deepspeed/runtime/activation_checkpointing/checkpointing.py"},"region":{"startLine":631}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a71be3755a8657b108452a3e7c6f9d3f4d8af85469177ab640867128e023547"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201312 lines \u00D7 2): deepspeed/runtime/engine.py:4253-4264 | deepspeed/runtime/engine.py:4288-4298 \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 \u0060deepspeed/runtime/engine.py:4253\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":"deepspeed/runtime/engine.py"},"region":{"startLine":4253}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d612e89ee9cdac58733161cddec6fc2617793525dfe882ed7e530bca1441e78"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): deepspeed/runtime/utils.py:1293-1304 | deepspeed/runtime/utils.py:1311-1322 \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":"deepspeed/runtime/utils.py"},"region":{"startLine":1293}}}],"partialFingerprints":{"codehealthFindingId/v1":"41b79c246e6a7c8e1e17048b6fd38f2364625ad3aa3ba9b663982367d3a4ae7f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201312 lines \u00D7 2): deepspeed/runtime/zero/partition_parameters.py:64-75 | deepspeed/runtime/zero/partition_parameters.py:96-106 \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":"deepspeed/runtime/zero/partition_parameters.py"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"2da2e8e28efe7c1b761e22860915e12dc98a3b276db070ca10961a1b6d72b8ad"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201312 lines \u00D7 2): deepspeed/runtime/zero/stage_1_and_2.py:2488-2499 | deepspeed/runtime/zero/stage_1_and_2.py:2562-2570 \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 \u0060deepspeed/runtime/zero/stage_1_and_2.py:2488\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":"deepspeed/runtime/zero/stage_1_and_2.py"},"region":{"startLine":2488}}}],"partialFingerprints":{"codehealthFindingId/v1":"41f7ff81022be96577ed765913e4bf9eb420c00a87b3356743e5c977335d7d2b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201311 lines \u00D7 8): op_builder/evoformer_attn.py:80-90 | op_builder/fp_quantizer.py:26-35 | op_builder/inference_core_ops.py:26-35 | op_builder/inference_cutlass_builder.py:25-34 | op_builder/ragged_ops.py:26-35 | op_builder/ragged_utils.py:26-35 | op_builder/spatial_inference.py:25-34 | op_builder/transformer_inference.py:25-34 \u2014 before extracting anything, compare \u0060op_builder/fp_quantizer.py\u0060 and \u0060op_builder/inference_core_ops.py\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 36 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":"op_builder/evoformer_attn.py"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"1fb5ddca40c7e594e33e99159e91a6e079334283278e0645e81f4518c643e7d0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 6): deepspeed/inference/v2/model_implementations/llama_v2/model.py:178-188 | deepspeed/inference/v2/model_implementations/mistral/model.py:177-187 | deepspeed/inference/v2/model_implementations/mixtral/model.py:231-241 | deepspeed/inference/v2/model_implementations/qwen/model.py:192-202 | deepspeed/inference/v2/model_implementations/qwen_v2/model.py:190-200 | deepspeed/inference/v2/model_implementations/qwen_v2_moe/model.py:329-339 \u2014 \u0060deepspeed/inference/v2/model_implementations/llama_v2/model.py\u0060 and \u0060deepspeed/inference/v2/model_implementations/mistral/model.py\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 10 separate duplicated blocks between them, totalling at least 116 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"deepspeed/inference/v2/model_implementations/llama_v2/model.py"},"region":{"startLine":178}}}],"partialFingerprints":{"codehealthFindingId/v1":"8cf3457f2a2bfc934950b7f09f1f112416f1cc4b06a4272fd5c8f5d398ffd59b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201311 lines \u00D7 6): op_builder/fp_quantizer.py:49-58 | op_builder/inference_core_ops.py:48-57 | op_builder/inference_cutlass_builder.py:47-57 | op_builder/ragged_ops.py:48-58 | op_builder/ragged_utils.py:48-57 | op_builder/transformer_inference.py:47-56 \u2014 before extracting anything, compare \u0060op_builder/fp_quantizer.py\u0060 and \u0060op_builder/inference_core_ops.py\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 36 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":"op_builder/fp_quantizer.py"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"56df0a8baed1f8e9dc0926bf14a09d62b2960235895243ec870d922aaabcdace"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 4): deepspeed/inference/v2/model_implementations/llama_v2/model.py:87-98 | deepspeed/inference/v2/model_implementations/mistral/model.py:87-97 | deepspeed/inference/v2/model_implementations/mixtral/model.py:92-102 | deepspeed/inference/v2/model_implementations/phi3/model.py:87-97 \u2014 \u0060deepspeed/inference/v2/model_implementations/llama_v2/model.py\u0060 and \u0060deepspeed/inference/v2/model_implementations/mistral/model.py\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 10 separate duplicated blocks between them, totalling at least 116 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. 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":"deepspeed/inference/v2/model_implementations/llama_v2/model.py"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"d84bfeb54977071052a6f8a1e03b70bdde9d4fc0705c2a2dc8ed32d12c526c9f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u201311 lines \u00D7 3): deepspeed/module_inject/layers.py:1023-1033 | deepspeed/module_inject/layers.py:1202-1208 | deepspeed/module_inject/layers.py:1303-1309 \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":"deepspeed/module_inject/layers.py"},"region":{"startLine":1023}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a226793d72701eafaedeb254a4a64c5d578fea1f32060c7a5fc2dd1a2fbdf79"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): csrc/aio/py_test/aio_bench_perf_sweep.py:128-138 | deepspeed/nvme/perf_run_sweep.py:137-147 \u2014 before extracting anything, compare \u0060csrc/aio/py_test/aio_bench_perf_sweep.py\u0060 and \u0060deepspeed/nvme/perf_run_sweep.py\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 148 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"csrc/aio/py_test/aio_bench_perf_sweep.py"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f8bfbaabc8c2eae49c8f64c8f52d05412aa4e9cf221e80ad843bf23eaf7c625"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): csrc/aio/py_test/ds_aio_handle.py:29-39 | deepspeed/nvme/ds_aio_handle.py:34-44 \u2014 before extracting anything, compare \u0060csrc/aio/py_test/ds_aio_handle.py\u0060 and \u0060deepspeed/nvme/ds_aio_handle.py\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 68 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"csrc/aio/py_test/ds_aio_handle.py"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"87b1c2718a26b34e0053a2770f90429069bc2195c9bfa05e8794f01350b98bad"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): deepspeed/autotuning/autotuner.py:683-693 | deepspeed/autotuning/autotuner.py:765-775 \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":"deepspeed/autotuning/autotuner.py"},"region":{"startLine":683}}}],"partialFingerprints":{"codehealthFindingId/v1":"0fb331d5422e536e44b0df163e29e75553b042b2500289be5b2d724166b1c6fd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): deepspeed/checkpoint/autoep_universal.py:352-362 | deepspeed/checkpoint/autoep_universal.py:371-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. 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":"deepspeed/checkpoint/autoep_universal.py"},"region":{"startLine":352}}}],"partialFingerprints":{"codehealthFindingId/v1":"51ccb90ee8c63df47173468ab6450aaeff9e6a29000fa3fef6bc436df838f406"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): deepspeed/compile/passes/zero3_compile.py:437-447 | deepspeed/compile/passes/zero3_compile.py:494-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":"deepspeed/compile/passes/zero3_compile.py"},"region":{"startLine":437}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c98be362787aac57fa820d127c9f8da2b3fe0b0ca02b46230a93ace260cf7e8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (2\u201311 lines \u00D7 3): deepspeed/inference/v2/kernels/ragged_ops/linear_blocked_kv_rotary/blocked_kv_rotary.py:58-68 | deepspeed/inference/v2/kernels/ragged_ops/linear_blocked_kv_rotary/blocked_trained_kv_rotary.py:75-76 | deepspeed/inference/v2/kernels/ragged_ops/linear_blocked_kv_rotary/linear_blocked_kv_copy.py:60-70 \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":"deepspeed/inference/v2/kernels/ragged_ops/linear_blocked_kv_rotary/blocked_kv_rotary.py"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"bacc54abd7f5e60834aa2325ca5eedb615508639b97add8056279fe46020341d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): deepspeed/launcher/multinode_runner.py:181-191 | deepspeed/launcher/multinode_runner.py:498-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. 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":"deepspeed/launcher/multinode_runner.py"},"region":{"startLine":181}}}],"partialFingerprints":{"codehealthFindingId/v1":"97361250eb8b2f2f59d6d5dc77eccb6bd6acc89433a967c1b61c41cda84e789c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): deepspeed/moe/sharded_moe.py:367-377 | deepspeed/moe/sharded_moe.py:465-475 \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 \u0060deepspeed/moe/sharded_moe.py:367\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":"deepspeed/moe/sharded_moe.py"},"region":{"startLine":367}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce2f2d6e86f8c7eddb92dff1160311dad69a422f73683b56be1b15d8aeb5bb1c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): deepspeed/ops/triton_ops/swiglu_triton.py:209-223 | deepspeed/ops/triton_ops/swiglu_triton.py:457-467 \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":"deepspeed/ops/triton_ops/swiglu_triton.py"},"region":{"startLine":209}}}],"partialFingerprints":{"codehealthFindingId/v1":"668f20ffcc294a673c4db9067d806dfdeb2fb38ae767e28ceeefaef66824ca84"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): deepspeed/runtime/fp16/fused_optimizer.py:405-415 | deepspeed/runtime/fp16/unfused_optimizer.py:278-288 \u2014 before extracting anything, compare \u0060deepspeed/runtime/fp16/fused_optimizer.py\u0060 and \u0060deepspeed/runtime/fp16/unfused_optimizer.py\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 84 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":"deepspeed/runtime/fp16/fused_optimizer.py"},"region":{"startLine":405}}}],"partialFingerprints":{"codehealthFindingId/v1":"373e029dc5854099f0bfea9948762a9bfc8ca82e840c300c598088457e53cff7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): deepspeed/runtime/rollout/hybrid_engine_rollout.py:572-582 | deepspeed/runtime/rollout/hybrid_engine_rollout.py:749-759 \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":"deepspeed/runtime/rollout/hybrid_engine_rollout.py"},"region":{"startLine":572}}}],"partialFingerprints":{"codehealthFindingId/v1":"610f24c834122fe1025f15b8833672bc56037eb133833762e546c21288cad0cd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201311 lines \u00D7 2): deepspeed/runtime/zero/stage_1_and_2.py:2820-2830 | deepspeed/runtime/zero/stage_1_and_2.py:2931-2940 \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, \u0060deepspeed/runtime/zero/stage_1_and_2.py:2832\u0060 calls \u0060get_rank\u0060 and \u0060deepspeed/runtime/zero/stage_1_and_2.py:2942\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":"deepspeed/runtime/zero/stage_1_and_2.py"},"region":{"startLine":2820}}}],"partialFingerprints":{"codehealthFindingId/v1":"933f8803138ec79d17e5a2d90ea044ffd2824bba9777c826f8ca68dc55c1a580"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201311 lines \u00D7 2): op_builder/inference_cutlass_builder.py:75-84 | op_builder/ragged_ops.py:89-99 \u2014 before extracting anything, compare \u0060op_builder/inference_cutlass_builder.py\u0060 and \u0060op_builder/ragged_ops.py\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 47 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":"op_builder/inference_cutlass_builder.py"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"91f8744e7db5c06f0a881b8b443d2b0f2de1ff421d04b8293c00208bca47284f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (22 lines \u00D7 3): deepspeed/ops/transformer/inference/triton/layer_norm.py:37-58 | deepspeed/ops/transformer/inference/triton/layer_norm.py:89-110 | deepspeed/ops/transformer/inference/triton/layer_norm.py:143-164 \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, \u0060deepspeed/ops/transformer/inference/triton/layer_norm.py:86\u0060 calls \u0060load\u0060, \u0060to\u0060, \u0060store\u0060 and \u0060deepspeed/ops/transformer/inference/triton/layer_norm.py:36\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":"deepspeed/ops/transformer/inference/triton/layer_norm.py"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"110e7220704fe3bda6eb8ddf678f1d50a6af22ad3ad4f765b5b8d2373639e8ae"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): csrc/aio/py_test/ds_aio_args.py:19-28 | deepspeed/nvme/ds_aio_args.py:19-28 \u2014 before extracting anything, compare \u0060csrc/aio/py_test/ds_aio_args.py\u0060 and \u0060deepspeed/nvme/ds_aio_args.py\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 198 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. 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":"csrc/aio/py_test/ds_aio_args.py"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"a43a137898777d0359d7d0d52bb042d0020ad74a4eb1e4f5a17e159f34cddf59"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): csrc/aio/py_test/ds_aio_handle.py:97-106 | deepspeed/nvme/ds_aio_handle.py:117-126 \u2014 before extracting anything, compare \u0060csrc/aio/py_test/ds_aio_handle.py\u0060 and \u0060deepspeed/nvme/ds_aio_handle.py\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 68 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. 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":"csrc/aio/py_test/ds_aio_handle.py"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5846255e5c407562bd03109b533207e05972e793141d87dd897f5c88c8dfd38"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): csrc/aio/py_test/io_engine.py:18-27 | deepspeed/nvme/io_engine.py:18-27 \u2014 before extracting anything, compare \u0060csrc/aio/py_test/io_engine.py\u0060 and \u0060deepspeed/nvme/io_engine.py\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 69 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. 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. Note first that the copies are not typed on the same thing: \u0060AIOBasic_Engine\u0060 names \u0060.ds_aio_basic\u0060 in one and \u0060ds_aio_basic\u0060 in another \u2014 different types that share a simple name, which is why the text matched. A single extracted unit cannot be given a parameter type that fits both, so unifying those types (or introducing a shared abstraction over them) is the step that has to come BEFORE the extraction above; if they are deliberately separate, 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":"csrc/aio/py_test/io_engine.py"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"38a5cd559f0a47112487022de2308a85b2842b0cca2fcce6c29adb750d482ab1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u201315 lines \u00D7 3): deepspeed/module_inject/containers/clip.py:48-61 | deepspeed/module_inject/containers/internlm.py:158-164 | deepspeed/module_inject/containers/opt.py:134-148 \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. 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":"deepspeed/module_inject/containers/clip.py"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"6bd5babef7ea09da618b1f4c4b185799fa95f3d4525c2707ea175404f9b6e0f8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): deepspeed/ops/transformer/inference/ds_attention.py:68-77 | deepspeed/ops/transformer/inference/triton/attention.py:79-88 \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 \u0060deepspeed/ops/transformer/inference/ds_attention.py:68\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, \u0060deepspeed/ops/transformer/inference/triton/attention.py:75\u0060 calls \u0060get_accelerator\u0060, \u0060is_triton_supported\u0060 and \u0060deepspeed/ops/transformer/inference/ds_attention.py:65\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":"deepspeed/ops/transformer/inference/ds_attention.py"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"e747698430c2bf843f1f8f492218776d57936123ed531a7da41e902620253aff"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): deepspeed/ops/transformer/inference/triton/layer_norm.py:75-84 | deepspeed/ops/transformer/inference/triton/layer_norm.py:128-137 \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":"deepspeed/ops/transformer/inference/triton/layer_norm.py"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"87ac474602f633649a1fe5bedc48732183aec1a0ecd097e67335c06ecebdacaf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): deepspeed/ops/transformer/inference/triton/layer_norm.py:175-184 | deepspeed/ops/transformer/inference/triton/layer_norm.py:210-219 \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 \u0060deepspeed/ops/transformer/inference/triton/layer_norm.py:175\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":"deepspeed/ops/transformer/inference/triton/layer_norm.py"},"region":{"startLine":175}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8f80b66ce3fe4d63220f220666df59ee64c74c0b11cd2724a6f5c49a8b3b7df"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15\u201316 lines \u00D7 2): deepspeed/profiling/flops_profiler/profiler.py:790-804 | deepspeed/profiling/flops_profiler/profiler.py:812-827 \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":"deepspeed/profiling/flops_profiler/profiler.py"},"region":{"startLine":790}}}],"partialFingerprints":{"codehealthFindingId/v1":"40706c72925c651f1b7534cc6d874779cd02c063f64a3d1d18b2e0c02451f5b6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): deepspeed/profiling/flops_profiler/profiler.py:1257-1266 | deepspeed/profiling/flops_profiler/profiler.py:1269-1278 \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":"deepspeed/profiling/flops_profiler/profiler.py"},"region":{"startLine":1257}}}],"partialFingerprints":{"codehealthFindingId/v1":"63e0cad1d661168493fe4d7bce82a224ee3c65e3c36361008561a3f9ace035c5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): deepspeed/runtime/utils.py:1253-1262 | deepspeed/runtime/zero/offload_states.py:79-88 \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":"deepspeed/runtime/utils.py"},"region":{"startLine":1253}}}],"partialFingerprints":{"codehealthFindingId/v1":"d488939b9331774a62a2ace27c51d9470202401dbca5c9ad8611957f3d07efce"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): deepspeed/runtime/zenflow/engine_stage3.py:548-557 | deepspeed/runtime/zenflow/zenflow_stage_1_and_2.py:767-776 \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 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":"deepspeed/runtime/zenflow/engine_stage3.py"},"region":{"startLine":548}}}],"partialFingerprints":{"codehealthFindingId/v1":"682657168ca750e0cccfbdee033fece166d72da624117a8970a2af7d2394c2b1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): deepspeed/runtime/zero/stage_1_and_2.py:4026-4035 | deepspeed/runtime/zero/stage_1_and_2.py:4099-4108 \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":"deepspeed/runtime/zero/stage_1_and_2.py"},"region":{"startLine":4026}}}],"partialFingerprints":{"codehealthFindingId/v1":"f980b78b66fce44e55059dd13d936a09983a1a3c481068d3366b57479bbb117e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201310 lines \u00D7 2): deepspeed/sequence/fpdt_layer.py:284-292 | deepspeed/sequence/fpdt_layer.py:737-746 \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 \u0060deepspeed/sequence/fpdt_layer.py:284\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":"deepspeed/sequence/fpdt_layer.py"},"region":{"startLine":284}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d6a098813304bc7302da90a107128d8f211863573f51a623d27e2f5f7164de6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): op_builder/builder.py:835-844 | op_builder/xpu/builder.py:50-59 \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":"op_builder/builder.py"},"region":{"startLine":835}}}],"partialFingerprints":{"codehealthFindingId/v1":"714e5d038d73b04b8aaebe3e5f8d58e633e064585d04651224eb9e96a288aba5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3): ci/torch_latest.py:1746-1754 | ci/torch_latest.py:1888-1896 | ci/torch_latest.py:1954-1962 \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":"ci/torch_latest.py"},"region":{"startLine":1746}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d9dd27bbf374c2a621739c9a5e195c4496393843caf2f06dbfe411d658ce2b8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3): deepspeed/inference/v2/model_implementations/llama_v2/model.py:201-209 | deepspeed/inference/v2/model_implementations/qwen/model.py:215-223 | deepspeed/inference/v2/model_implementations/qwen_v2/model.py:213-221 \u2014 \u0060deepspeed/inference/v2/model_implementations/llama_v2/model.py\u0060 and \u0060deepspeed/inference/v2/model_implementations/qwen/model.py\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 8 separate duplicated blocks between them, totalling at least 85 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. 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":"deepspeed/inference/v2/model_implementations/llama_v2/model.py"},"region":{"startLine":201}}}],"partialFingerprints":{"codehealthFindingId/v1":"90185b16286cf7a61de63b3e8a29c3676d8abe29f2a758ac041ab233b2323ee5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u20139 lines \u00D7 3): deepspeed/runtime/zero/stage3.py:2610-2618 | deepspeed/runtime/zero/stage_1_and_2.py:2860-2868 | deepspeed/runtime/zero/stage_1_and_2.py:2968-2975 \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":"deepspeed/runtime/zero/stage3.py"},"region":{"startLine":2610}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec7f15761e3d0ad7fd7cbe2fe95ee255b12ac1430b55cb643a3ac5c3d8489f08"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): csrc/aio/py_test/ds_aio_args.py:32-40 | deepspeed/nvme/ds_aio_args.py:32-40 \u2014 before extracting anything, compare \u0060csrc/aio/py_test/ds_aio_args.py\u0060 and \u0060deepspeed/nvme/ds_aio_args.py\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 198 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. 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":"csrc/aio/py_test/ds_aio_args.py"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed923c3fd2d878b2a442e358bbbb6d4c3fe7173a0b259f209abbbba6936b80c3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): csrc/aio/py_test/ds_aio_args.py:200-214 | deepspeed/nvme/ds_aio_args.py:200-214 \u2014 before extracting anything, compare \u0060csrc/aio/py_test/ds_aio_args.py\u0060 and \u0060deepspeed/nvme/ds_aio_args.py\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 198 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. 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":"csrc/aio/py_test/ds_aio_args.py"},"region":{"startLine":200}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6f5bbc44b391a85cfd85f2e71ea3a0b2b241541da3f4d9fb110a35bf8c06d8a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): csrc/aio/py_test/ds_aio_handle.py:88-96 | deepspeed/nvme/ds_aio_handle.py:107-115 \u2014 before extracting anything, compare \u0060csrc/aio/py_test/ds_aio_handle.py\u0060 and \u0060deepspeed/nvme/ds_aio_handle.py\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 68 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"csrc/aio/py_test/ds_aio_handle.py"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"772a1b767d0b5c4fa85eb19acd7772ac16a6510d054711d8979358af878b67c6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): deepspeed/model_implementations/diffusers/unet.py:37-45 | deepspeed/model_implementations/diffusers/vae.py:121-129 \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":"deepspeed/model_implementations/diffusers/unet.py"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"ddaacd9e34fa8941666fb2c7a12cb07a2c76dceaf06072ac2b2ee36165f2062d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): deepspeed/module_inject/containers/megatron_gpt.py:22-30 | deepspeed/module_inject/containers/megatron_gpt_moe.py:23-31 \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":"deepspeed/module_inject/containers/megatron_gpt.py"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"137ad84bc51f98a61d948eebbfdbc19518de937ac20293562cd9564bd0d4e317"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): deepspeed/module_inject/layers.py:1671-1679 | deepspeed/module_inject/layers.py:1711-1719 \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":"deepspeed/module_inject/layers.py"},"region":{"startLine":1671}}}],"partialFingerprints":{"codehealthFindingId/v1":"e919d37f7829f752b288605600310bec2dcd1fbe17e0ef64ab98fc084bb3da36"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): deepspeed/ops/deepspeed4science/evoformer_attn.py:16-24 | deepspeed/ops/deepspeed4science/evoformer_attn.py:37-45 \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":"deepspeed/ops/deepspeed4science/evoformer_attn.py"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"764014c161eb99acb06b68609719bb6ec5c660048449ef5c99cea8903319f142"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u20139 lines \u00D7 2): deepspeed/ops/random_ltd/dropping_utils.py:25-32 | deepspeed/ops/random_ltd/dropping_utils.py:59-67 \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":"deepspeed/ops/random_ltd/dropping_utils.py"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d770d50ced44ee698aa53009dece1b3542d892430bbe244c1652e00bcee3a17"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): deepspeed/runtime/domino/transformer.py:508-516 | deepspeed/runtime/domino/transformer.py:535-543 \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":"deepspeed/runtime/domino/transformer.py"},"region":{"startLine":508}}}],"partialFingerprints":{"codehealthFindingId/v1":"263cad5945be10bcc507ae8b04e7ee86f3398f7ade72fbbed7f8d2e3df6b52c1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): deepspeed/runtime/fp16/fused_optimizer.py:474-482 | deepspeed/runtime/fp16/unfused_optimizer.py:358-366 \u2014 before extracting anything, compare \u0060deepspeed/runtime/fp16/fused_optimizer.py\u0060 and \u0060deepspeed/runtime/fp16/unfused_optimizer.py\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 84 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":"deepspeed/runtime/fp16/fused_optimizer.py"},"region":{"startLine":474}}}],"partialFingerprints":{"codehealthFindingId/v1":"553df6d1a506f0408d2bf24ae6b1f68939231e5811074439cdcaede9e16957c0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): deepspeed/runtime/zero/stage3.py:2267-2275 | deepspeed/runtime/zero/stage_1_and_2.py:2376-2384 \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":"deepspeed/runtime/zero/stage3.py"},"region":{"startLine":2267}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4e7ee675e3278ebb06c57d486413ffb997c4011d729415098052f480967fece"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): op_builder/builder.py:617-625 | op_builder/xpu/builder.py:138-146 \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":"op_builder/builder.py"},"region":{"startLine":617}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ff8df289a65e23a4c1fab1e8e215e101c26418d7f8dac83f31364d9e102410f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): op_builder/cpu/builder.py:20-30 | op_builder/hpu/builder.py:21-31 \u2014 \u0060op_builder/cpu/builder.py\u0060 and \u0060op_builder/hpu/builder.py\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 1 separate duplicated blocks between them, totalling at least 11 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. 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":"op_builder/cpu/builder.py"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed4a9d73d36d64f3cd145dd14766eab52456e7dc89027710a518cf214c274e11"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u20139 lines \u00D7 2): op_builder/npu/fused_lamb.py:63-71 | op_builder/supa/fused_lamb.py:51-58 \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":"op_builder/npu/fused_lamb.py"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5d1a9cb9e72b087c9ed84a74f8635a59d53479a196b6c8cdefc4d6296a8bba1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 4): deepspeed/module_inject/containers/gptj.py:74-81 | deepspeed/module_inject/containers/gptneo.py:80-87 | deepspeed/module_inject/containers/llama.py:142-150 | deepspeed/module_inject/containers/llama2.py:92-100 \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 4 call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060deepspeed/module_inject/containers/gptj.py:74\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":"deepspeed/module_inject/containers/gptj.py"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"19dc596acd47824b163e405992837657257fbc806caa85588f5de25bbdc36575"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u20138 lines \u00D7 4): deepspeed/ops/adam/zenflow_torch_adam.py:108-114 | deepspeed/ops/adam/zenflow_torch_adam.py:211-218 | deepspeed/ops/adam/zenflow_torch_adam.py:340-346 | deepspeed/ops/adam/zenflow_torch_adam.py:561-568 \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":"deepspeed/ops/adam/zenflow_torch_adam.py"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"279821a6ac84a8a7137c671b286f059f964ecfad0f351e345cbd51702d191ce9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): deepspeed/inference/v2/model_implementations/mistral/model.py:200-207 | deepspeed/inference/v2/model_implementations/mixtral/model.py:254-261 | deepspeed/inference/v2/model_implementations/qwen_v2_moe/model.py:352-359 \u2014 \u0060deepspeed/inference/v2/model_implementations/mistral/model.py\u0060 and \u0060deepspeed/inference/v2/model_implementations/mixtral/model.py\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 7 separate duplicated blocks between them, totalling at least 66 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. 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":"deepspeed/inference/v2/model_implementations/mistral/model.py"},"region":{"startLine":200}}}],"partialFingerprints":{"codehealthFindingId/v1":"937445d9a0a94eb468f67085007dea9af1266f24068a2dd0d9495a43c08dd7b4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3): deepspeed/runtime/utils.py:336-344 | deepspeed/runtime/zero/stage3.py:4273-4281 | deepspeed/runtime/zero/stage_1_and_2.py:4124-4132 \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. 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":"deepspeed/runtime/utils.py"},"region":{"startLine":336}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6f8a95f2e59e24db2a777eb47bd9e2f413d4d6407d6948950f47a4ec8acd120"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u20138 lines \u00D7 2): deepspeed/inference/engine.py:402-409 | deepspeed/module_inject/replace_module.py:340-346 \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":"deepspeed/inference/engine.py"},"region":{"startLine":402}}}],"partialFingerprints":{"codehealthFindingId/v1":"e92c8073124a16228ef1765e715bba48e89a02356b751dab37360d24285b6caa"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6\u20138 lines \u00D7 2): deepspeed/ops/transformer/inference/ds_attention.py:177-182 | deepspeed/ops/transformer/inference/triton/attention.py:171-178 \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":"deepspeed/ops/transformer/inference/ds_attention.py"},"region":{"startLine":177}}}],"partialFingerprints":{"codehealthFindingId/v1":"6bd400110c71dafffc49f4cee137f64fbeef8db7e5b7564bc7f760f19d910571"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): deepspeed/runtime/data_pipeline/data_sampling/data_analyzer.py:119-126 | deepspeed/runtime/data_pipeline/data_sampling/data_analyzer.py:139-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":"deepspeed/runtime/data_pipeline/data_sampling/data_analyzer.py"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"6564fca68489668e2f59be92a9d6f42da9546d3a8996386634eb14ad13e1c94d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): deepspeed/runtime/engine.py:4322-4329 | deepspeed/runtime/engine.py:4768-4775 \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":"deepspeed/runtime/engine.py"},"region":{"startLine":4322}}}],"partialFingerprints":{"codehealthFindingId/v1":"af869628797b7a93678924fe445513fb5e12351f6aa8be1810b551811a9d0aaa"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): deepspeed/runtime/superoffload/superoffload_stage3.py:66-73 | deepspeed/runtime/zero/stage3.py:1268-1275 \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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060deepspeed/runtime/superoffload/superoffload_stage3.py:76\u0060 calls \u0060max\u0060 and \u0060deepspeed/runtime/zero/stage3.py:1276\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":"deepspeed/runtime/superoffload/superoffload_stage3.py"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"2caf18662d03fb3bd872dc34011ca481707f8d9cfa804021a4c4581d4c06e311"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): deepspeed/runtime/zero/parameter_offload.py:542-549 | deepspeed/runtime/zero/parameter_offload.py:581-588 \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":"deepspeed/runtime/zero/parameter_offload.py"},"region":{"startLine":542}}}],"partialFingerprints":{"codehealthFindingId/v1":"9499e9f175456faa47d8bb291a320fe2352c8f7f08190f1f33b674ea31357d11"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): deepspeed/runtime/zero/parameter_offload.py:553-560 | deepspeed/runtime/zero/parameter_offload.py:592-599 \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":"deepspeed/runtime/zero/parameter_offload.py"},"region":{"startLine":553}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d5a8746e2946715447b52a9015cec1150f1350b4eeae6dd5401f4f41c096bf7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): deepspeed/runtime/zero/stage3.py:2345-2352 | deepspeed/runtime/zero/stage_1_and_2.py:2420-2427 \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":"deepspeed/runtime/zero/stage3.py"},"region":{"startLine":2345}}}],"partialFingerprints":{"codehealthFindingId/v1":"c830bfbd2f1318e2f8512c0a330990ab8b0f7ada5b9a1b9e1ef8f028d7127117"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): deepspeed/sequence/fpdt_layer.py:746-753 | deepspeed/sequence/fpdt_layer.py:758-765 \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 \u0060deepspeed/sequence/fpdt_layer.py:746\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":"deepspeed/sequence/fpdt_layer.py"},"region":{"startLine":746}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac095c89418caacfd59ca5ee5e08e4e165baf2d8f2ddb1a1232eb49fef202001"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): op_builder/klxpu/builder.py:20-27 | op_builder/supa/builder.py:19-26 \u2014 \u0060op_builder/klxpu/builder.py\u0060 and \u0060op_builder/supa/builder.py\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 2 separate duplicated blocks between them, totalling at least 16 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. 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":"op_builder/klxpu/builder.py"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"84cc0a9db818f6494b5b6d1ffecc6ef8193c0dd0131b78d0e08c3db33b8d5b74"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 6): deepspeed/inference/v2/model_implementations/llama_v2/model.py:152-158 | deepspeed/inference/v2/model_implementations/mistral/model.py:151-157 | deepspeed/inference/v2/model_implementations/phi3/model.py:149-155 | deepspeed/inference/v2/model_implementations/qwen/model.py:166-172 | deepspeed/inference/v2/model_implementations/qwen_v2/model.py:164-170 | deepspeed/inference/v2/model_implementations/qwen_v2_moe/model.py:298-304 \u2014 \u0060deepspeed/inference/v2/model_implementations/llama_v2/model.py\u0060 and \u0060deepspeed/inference/v2/model_implementations/mistral/model.py\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 10 separate duplicated blocks between them, totalling at least 116 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"deepspeed/inference/v2/model_implementations/llama_v2/model.py"},"region":{"startLine":152}}}],"partialFingerprints":{"codehealthFindingId/v1":"394b1785664591ab912a6999d17822ade7acca07fc324fe80639c279f80e120e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 5): deepspeed/runtime/zero/muon/muon_optimizer.py:75-81 | deepspeed/runtime/zero/muon/original_muon.py:286-292 | deepspeed/runtime/zero/muon/original_muon.py:325-331 | deepspeed/runtime/zero/muon/original_muon.py:418-424 | deepspeed/runtime/zero/muon/original_muon.py:491-497 \u2014 there are 5 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 5 sites; resolving a subset leaves the remainder to drift apart. Read the line range as the matched WINDOW rather than a finished unit: at \u0060deepspeed/runtime/zero/muon/muon_optimizer.py:75\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, \u0060deepspeed/runtime/zero/muon/muon_optimizer.py:67\u0060 calls \u0060dim\u0060 and \u0060deepspeed/runtime/zero/muon/original_muon.py:285\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":"deepspeed/runtime/zero/muon/muon_optimizer.py"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c6016e90377870f0f58c8080f2a805e29ee8b64d5bbc8fd31aabb7fd9027334"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 4): op_builder/klxpu/builder.py:16-23 | op_builder/mlu/builder.py:19-26 | op_builder/sdaa/builder.py:44-51 | op_builder/supa/builder.py:15-22 \u2014 \u0060op_builder/klxpu/builder.py\u0060 and \u0060op_builder/supa/builder.py\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 2 separate duplicated blocks between them, totalling at least 16 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. Read the line range as the matched WINDOW rather than a finished unit: at \u0060op_builder/klxpu/builder.py:16\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":"op_builder/klxpu/builder.py"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"b01c85106f36e026a7502d2c7a0aa37048e02ecee76f0b50f527d61d74fd619c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): deepspeed/moe/sharded_moe.py:251-257 | deepspeed/moe/sharded_moe.py:370-376 | deepspeed/moe/sharded_moe.py:468-474 \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":"deepspeed/moe/sharded_moe.py"},"region":{"startLine":251}}}],"partialFingerprints":{"codehealthFindingId/v1":"462167af4eea2768601f4b3f019b8aef74e62e216a49322d9b0484d53cf30e8c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): deepspeed/ops/fp_quantizer/fp8_gemm_triton.py:27-33 | deepspeed/ops/fp_quantizer/fp8_gemm_triton.py:76-82 | deepspeed/ops/transformer/inference/triton/triton_matmul_kernel.py:348-354 \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":"deepspeed/ops/fp_quantizer/fp8_gemm_triton.py"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"7331e8d67ca9058d9d9baa5d738123906466f4c69832738f7d9354aec82bff33"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): deepspeed/ops/transformer/inference/triton/layer_norm.py:29-35 | deepspeed/ops/transformer/inference/triton/layer_norm.py:78-84 | deepspeed/ops/transformer/inference/triton/layer_norm.py:131-137 \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":"deepspeed/ops/transformer/inference/triton/layer_norm.py"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb0a983842b3d3637410ab95e963f20dcaa209d9ac9218dccaf79eb278c200de"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): csrc/aio/py_test/aio_bench_perf_sweep.py:228-234 | deepspeed/nvme/perf_run_sweep.py:237-243 \u2014 before extracting anything, compare \u0060csrc/aio/py_test/aio_bench_perf_sweep.py\u0060 and \u0060deepspeed/nvme/perf_run_sweep.py\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 148 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. 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":"csrc/aio/py_test/aio_bench_perf_sweep.py"},"region":{"startLine":228}}}],"partialFingerprints":{"codehealthFindingId/v1":"d77bc7caa83f1e206231b67fd5cf0488016ddbca5019a64b365dd0ba72f5c6ca"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): csrc/aio/py_test/ds_aio_handle.py:20-26 | deepspeed/nvme/ds_aio_handle.py:25-31 \u2014 before extracting anything, compare \u0060csrc/aio/py_test/ds_aio_handle.py\u0060 and \u0060deepspeed/nvme/ds_aio_handle.py\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 68 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"csrc/aio/py_test/ds_aio_handle.py"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"f584debc0b07e83b09ab3c6505a01c384adcd25f899089e19a6ac7fbcba17fb2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): deepspeed/autotuning/autotuner.py:764-770 | deepspeed/autotuning/autotuner.py:1059-1065 \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, \u0060deepspeed/autotuning/autotuner.py:1067\u0060 calls \u0060debug\u0060 and \u0060deepspeed/autotuning/autotuner.py:772\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":"deepspeed/autotuning/autotuner.py"},"region":{"startLine":764}}}],"partialFingerprints":{"codehealthFindingId/v1":"6302f4ae9c5959e22fcf867f592c19dfd8e2018e096f0a3798190050d5b440ed"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): deepspeed/autotuning/autotuner.py:884-890 | deepspeed/autotuning/autotuner.py:914-920 \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":"deepspeed/autotuning/autotuner.py"},"region":{"startLine":884}}}],"partialFingerprints":{"codehealthFindingId/v1":"289e5a11757a57cd712cd05782e79fbde1bf6a878b187ce32950834c65c6da66"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): deepspeed/comm/comm.py:979-985 | deepspeed/comm/comm.py:993-999 \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":"deepspeed/comm/comm.py"},"region":{"startLine":979}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c7fa7d373608b169ebcdd3914c8f1fb8fbbec5266537d60ba215fdce3426734"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): deepspeed/module_inject/containers/gptneo.py:88-95 | deepspeed/module_inject/containers/opt.py:93-100 \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":"deepspeed/module_inject/containers/gptneo.py"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b81f4a1e50cf137c3f8ead4be16bd74dacd83af7fc375708899cfe5ba60b89a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): deepspeed/module_inject/containers/internlm.py:169-175 | deepspeed/module_inject/containers/llama.py:206-212 \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":"deepspeed/module_inject/containers/internlm.py"},"region":{"startLine":169}}}],"partialFingerprints":{"codehealthFindingId/v1":"f91fab842c6af3d3a1e3002eb2f71a28bf44dc73c4a455781aca8a35db88a00d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): deepspeed/module_inject/layers.py:903-909 | deepspeed/module_inject/layers.py:2342-2348 \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":"deepspeed/module_inject/layers.py"},"region":{"startLine":903}}}],"partialFingerprints":{"codehealthFindingId/v1":"79834e566eacee3ed53c8323d1800f5b8923ed960d4e7ece0ab28e8355d52389"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): deepspeed/ops/adam/zenflow_torch_adam.py:350-356 | deepspeed/ops/adam/zenflow_torch_adam.py:574-580 \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 \u0060deepspeed/ops/adam/zenflow_torch_adam.py:350\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 after the matched lines, \u0060deepspeed/ops/adam/zenflow_torch_adam.py:357\u0060 calls \u0060hasattr\u0060, \u0060copy_\u0060 and \u0060deepspeed/ops/adam/zenflow_torch_adam.py:582\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":"deepspeed/ops/adam/zenflow_torch_adam.py"},"region":{"startLine":350}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6b95b449029fb56f80589d53e68c894ab97c8337f3f07481ee20cc64692b9ab"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): deepspeed/ops/transformer/inference/op_binding/layer_norm.py:28-34 | deepspeed/ops/transformer/inference/op_binding/layer_norm.py:39-45 \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":"deepspeed/ops/transformer/inference/op_binding/layer_norm.py"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"2583ceec726064917f731efb9a3d108286a0ecd499682e880de93b61817fe647"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): deepspeed/ops/transformer/inference/op_binding/residual_add.py:40-46 | op_builder/npu/inference.py:455-461 \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":"deepspeed/ops/transformer/inference/op_binding/residual_add.py"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e240ffcc72042dd74368d1152b05a4f8736df3090a057cae32433a74756df22"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): deepspeed/ops/transformer/inference/triton/attention.py:270-276 | deepspeed/ops/transformer/inference/triton_ops.py:70-76 \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":"deepspeed/ops/transformer/inference/triton/attention.py"},"region":{"startLine":270}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3a053d0b6ca289e91b925377345dd3571077876d6dd77ae4b2e1d8113ed5724"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): deepspeed/ops/transformer/inference/triton/layer_norm.py:88-94 | deepspeed/ops/transformer/inference/triton/layer_norm.py:142-148 \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":"deepspeed/ops/transformer/inference/triton/layer_norm.py"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"3257e0ed120f86a37920dbd3589bb7f8d937e70fedc1228bd6bac9b754c72754"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): deepspeed/profiling/flops_profiler/profiler.py:575-581 | deepspeed/profiling/flops_profiler/profiler.py:632-638 \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":"deepspeed/profiling/flops_profiler/profiler.py"},"region":{"startLine":575}}}],"partialFingerprints":{"codehealthFindingId/v1":"30817dcf0da3fcf418009a584a9a3c0e866eba3c77b1bda5dcf3770b6c6d52a6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6\u20137 lines \u00D7 2): deepspeed/runtime/pipe/engine.py:947-952 | deepspeed/runtime/pipe/engine.py:964-970 \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":"deepspeed/runtime/pipe/engine.py"},"region":{"startLine":947}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a930e89d94a6035d912488047af11f5e13f1db5a6a1aa9218bb434b2396977b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): deepspeed/runtime/rollout/hybrid_engine_rollout.py:1011-1017 | deepspeed/runtime/rollout/hybrid_engine_rollout.py:1048-1054 \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":"deepspeed/runtime/rollout/hybrid_engine_rollout.py"},"region":{"startLine":1011}}}],"partialFingerprints":{"codehealthFindingId/v1":"7bccfdf31a05e2e5a205015f9f2e60829a4c92bc9f3d9d316ef7e68a6a147513"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): deepspeed/runtime/utils.py:530-536 | deepspeed/runtime/utils.py:635-641 \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":"deepspeed/runtime/utils.py"},"region":{"startLine":530}}}],"partialFingerprints":{"codehealthFindingId/v1":"65662fc3dc92dae8d67ccb3e0b3c96538104e7cb517d4830f16d2ae3865cb2b6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): deepspeed/runtime/zero/partition_parameters.py:2123-2129 | deepspeed/runtime/zero/partition_parameters.py:2146-2152 \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 \u0060deepspeed/runtime/zero/partition_parameters.py:2123\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":"deepspeed/runtime/zero/partition_parameters.py"},"region":{"startLine":2123}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b594b8dbafceb3b0db67cae0282cb1a1835cc1bf8b5c89f4113be9ecb7f1567"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): deepspeed/runtime/zero/stage3.py:2091-2097 | deepspeed/runtime/zero/stage3.py:2566-2572 \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":"deepspeed/runtime/zero/stage3.py"},"region":{"startLine":2091}}}],"partialFingerprints":{"codehealthFindingId/v1":"cfa0924de68af53cbe13f699c1dc6d70795c8275d29b45be1bc68a6f3aadf1d2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): deepspeed/runtime/zero/stage3.py:2812-2818 | deepspeed/runtime/zero/stage3.py:2863-2869 \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":"deepspeed/runtime/zero/stage3.py"},"region":{"startLine":2812}}}],"partialFingerprints":{"codehealthFindingId/v1":"86159a466d18b329e2674fe5c6df9a38e1c12043d2a8b7763d349641f71c79fa"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): deepspeed/runtime/zero/stage_1_and_2.py:1376-1382 | deepspeed/runtime/zero/stage_1_and_2.py:1408-1414 \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":"deepspeed/runtime/zero/stage_1_and_2.py"},"region":{"startLine":1376}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d206dd6566dd7c4aa47b9ff60ecb5c39dad806322e1fd08a29138cce8684f95"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): op_builder/builder.py:276-282 | op_builder/builder.py:294-300 \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":"op_builder/builder.py"},"region":{"startLine":276}}}],"partialFingerprints":{"codehealthFindingId/v1":"5cd9f331d55bb2856c97a3d3cd695776534c99b26987678344d38804d6efadfe"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 7): deepspeed/inference/v2/model_implementations/exaone4/model.py:189-194 | deepspeed/inference/v2/model_implementations/llama_v2/model.py:182-188 | deepspeed/inference/v2/model_implementations/mistral/model.py:181-187 | deepspeed/inference/v2/model_implementations/mixtral/model.py:235-241 | deepspeed/inference/v2/model_implementations/qwen/model.py:196-202 | deepspeed/inference/v2/model_implementations/qwen_v2/model.py:194-200 | deepspeed/inference/v2/model_implementations/qwen_v2_moe/model.py:333-339 \u2014 \u0060deepspeed/inference/v2/model_implementations/llama_v2/model.py\u0060 and \u0060deepspeed/inference/v2/model_implementations/mistral/model.py\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 10 separate duplicated blocks between them, totalling at least 116 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"deepspeed/inference/v2/model_implementations/exaone4/model.py"},"region":{"startLine":189}}}],"partialFingerprints":{"codehealthFindingId/v1":"15acdce5d14a4b89e864a162cdb177b61a2a83e0f726be207872288fee4b4437"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): deepspeed/autotuning/autotuner.py:825-831 | deepspeed/autotuning/autotuner.py:883-888 | deepspeed/autotuning/autotuner.py:913-918 \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":"deepspeed/autotuning/autotuner.py"},"region":{"startLine":825}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ce44d3c915925d7b15cc9c1910036541f8ba0c4425daf94a1bb7e44d0e49e80"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): deepspeed/autotuning/autotuner.py:882-887 | deepspeed/autotuning/autotuner.py:898-903 | deepspeed/autotuning/autotuner.py:912-917 \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":"deepspeed/autotuning/autotuner.py"},"region":{"startLine":882}}}],"partialFingerprints":{"codehealthFindingId/v1":"6918fb48ffb4b897acc44ddb3d0d74f6f63d986789a83fafb9ebec9083a4e919"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): deepspeed/inference/engine.py:548-553 | deepspeed/model_implementations/diffusers/unet.py:27-32 | deepspeed/model_implementations/diffusers/vae.py:111-116 \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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"deepspeed/inference/engine.py"},"region":{"startLine":548}}}],"partialFingerprints":{"codehealthFindingId/v1":"944f71f7d36fafc9f3d634240c65dba8dc72075a9776e1a32f1dc25e591e6396"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): deepspeed/model_implementations/diffusers/unet.py:49-54 | deepspeed/model_implementations/diffusers/vae.py:133-138 | deepspeed/model_implementations/transformers/clip_encoder.py:58-63 \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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"deepspeed/model_implementations/diffusers/unet.py"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"96bbf5109d55c829f33ea8bd5f33fe18b97acd185f026c4a824be8c7b0932019"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): deepspeed/ops/transformer/inference/op_binding/linear.py:52-57 | deepspeed/ops/transformer/inference/op_binding/qkv_gemm.py:49-54 | deepspeed/ops/transformer/inference/op_binding/vector_matmul.py:46-51 \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":"deepspeed/ops/transformer/inference/op_binding/linear.py"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"51756cc36422b6321d5d3b1120828c268b2bdbe7e76fc0749c200bdc7320a1cb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): deepspeed/autotuning/autotuner.py:932-938 | deepspeed/autotuning/autotuner.py:962-967 \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":"deepspeed/autotuning/autotuner.py"},"region":{"startLine":932}}}],"partialFingerprints":{"codehealthFindingId/v1":"2bcfe5aff81a5ef541897089e29e75189bbf24a8385d8bf7c89cb1821a13fbe5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): deepspeed/autotuning/utils.py:336-341 | deepspeed/autotuning/utils.py:373-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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"deepspeed/autotuning/utils.py"},"region":{"startLine":336}}}],"partialFingerprints":{"codehealthFindingId/v1":"49d300e5e42e41acc73ec679c29047617952f57e02ac2d92f2d0cbfe6f039e40"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): deepspeed/compile/custom_ops/all_to_all.py:37-42 | deepspeed/compile/custom_ops/all_to_all.py:47-52 \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":"deepspeed/compile/custom_ops/all_to_all.py"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e3d0f317e70423284f75e612bf2c9a7255fd6fbd2c287d70fafb9921221c604"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): deepspeed/inference/v2/modules/implementations/linear/blas_fp_linear.py:61-66 | deepspeed/inference/v2/modules/implementations/linear/quantized_linear.py:139-144 \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":"deepspeed/inference/v2/modules/implementations/linear/blas_fp_linear.py"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"1fec427966ac6430192f529de43be2c44d11be5b8329725dc9d357231aaf3391"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): deepspeed/module_inject/containers/bloom.py:95-102 | deepspeed/module_inject/containers/gptneox.py:87-94 \u2014 before extracting anything, compare \u0060deepspeed/module_inject/containers/bloom.py\u0060 and \u0060deepspeed/module_inject/containers/gptneox.py\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 42 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":"deepspeed/module_inject/containers/bloom.py"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6ba31e88609aa8f84807dd4b3b36d0f50822882f92b7328cbde1886afa615ba"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): deepspeed/module_inject/containers/internlm.py:57-65 | deepspeed/module_inject/containers/opt.py:48-56 \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":"deepspeed/module_inject/containers/internlm.py"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"aaf6cf7146467f07f4441a28f30d4f8d012229548e8b109338d84cdcd1ed50f4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): deepspeed/ops/transformer/inference/triton/attention.py:301-306 | deepspeed/ops/transformer/inference/triton_ops.py:91-96 \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":"deepspeed/ops/transformer/inference/triton/attention.py"},"region":{"startLine":301}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb9b2e9b434baeffcf8433749f06888beaffc9e7522b98024c964d00f8817a61"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): deepspeed/runtime/bf16_optimizer.py:739-744 | deepspeed/runtime/zero/stage_1_and_2.py:102-107 \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":"deepspeed/runtime/bf16_optimizer.py"},"region":{"startLine":739}}}],"partialFingerprints":{"codehealthFindingId/v1":"efc92caaf4978c8d51ea9d4c5ea5c4a272d90d572f42093be1e63880606f9cfa"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): deepspeed/runtime/swap_tensor/partitioned_param_swapper.py:192-197 | deepspeed/runtime/swap_tensor/partitioned_param_swapper.py:361-366 \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":"deepspeed/runtime/swap_tensor/partitioned_param_swapper.py"},"region":{"startLine":192}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f351bd022eed3e1feae07039a30094b8364d141a4c73e3b06dddbb897ac54a8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): deepspeed/runtime/utils.py:561-569 | deepspeed/runtime/utils.py:657-665 \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":"deepspeed/runtime/utils.py"},"region":{"startLine":561}}}],"partialFingerprints":{"codehealthFindingId/v1":"76cb69861b962cb14c534ace31a862d56848dbacccb567e82c3fff8a231bb6b2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): deepspeed/runtime/zenflow/zenflow_stage_1_and_2.py:685-691 | deepspeed/runtime/zero/stage_1_and_2.py:1978-1983 \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 \u0060deepspeed/runtime/zenflow/zenflow_stage_1_and_2.py:685\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":"deepspeed/runtime/zenflow/zenflow_stage_1_and_2.py"},"region":{"startLine":685}}}],"partialFingerprints":{"codehealthFindingId/v1":"a657e3f976bba01a569c3b291f2117fc7397dfcea131d92dd6749eb3b7b1e762"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): deepspeed/runtime/zero/stage3.py:4399-4405 | deepspeed/runtime/zero/stage_1_and_2.py:4217-4222 \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 \u0060deepspeed/runtime/zero/stage3.py:4399\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":"deepspeed/runtime/zero/stage3.py"},"region":{"startLine":4399}}}],"partialFingerprints":{"codehealthFindingId/v1":"a245c137bfdfa39a30e9833d0c601bc4c098cbc4e8fdd5898912bdd50dd6c603"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): op_builder/async_io.py:53-58 | op_builder/cpu/async_io.py:41-46 \u2014 before extracting anything, compare \u0060op_builder/async_io.py\u0060 and \u0060op_builder/cpu/async_io.py\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 34 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. 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, \u0060op_builder/async_io.py:60\u0060 calls \u0060cpu_arch\u0060, \u0060simd_width\u0060 and \u0060op_builder/cpu/async_io.py:47\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":"op_builder/async_io.py"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f1a07fe405fc8fbd0decc47f6d5fe77d1916b39f6eef6d0e210e4d15e598123"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 11): deepspeed/inference/v2/model_implementations/exaone4/model.py:196-200 | deepspeed/inference/v2/model_implementations/falcon/model.py:193-199 | deepspeed/inference/v2/model_implementations/llama_v2/model.py:191-197 | deepspeed/inference/v2/model_implementations/mistral/model.py:190-196 | deepspeed/inference/v2/model_implementations/mixtral/model.py:244-250 | deepspeed/inference/v2/model_implementations/opt/model.py:176-182 | deepspeed/inference/v2/model_implementations/phi/model.py:179-185 | deepspeed/inference/v2/model_implementations/phi3/model.py:187-193 | deepspeed/inference/v2/model_implementations/qwen/model.py:205-211 | deepspeed/inference/v2/model_implementations/qwen_v2/model.py:203-209 | deepspeed/inference/v2/model_implementations/qwen_v2_moe/model.py:342-348 \u2014 \u0060deepspeed/inference/v2/model_implementations/falcon/model.py\u0060 and \u0060deepspeed/inference/v2/model_implementations/phi/model.py\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 4 separate duplicated blocks between them, totalling at least 34 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. 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 after the matched lines, \u0060deepspeed/inference/v2/model_implementations/mistral/model.py:202\u0060 calls \u0060norm\u0060 and \u0060deepspeed/inference/v2/model_implementations/exaone4/model.py:205\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":"deepspeed/inference/v2/model_implementations/exaone4/model.py"},"region":{"startLine":196}}}],"partialFingerprints":{"codehealthFindingId/v1":"1df2c21910ebff1156b4d717cd04b0f13ee9ee75b1e6976fb7bb33bd8a70ea97"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 4): deepspeed/inference/v2/model_implementations/opt/model.py:130-134 | deepspeed/inference/v2/model_implementations/qwen/model.py:162-166 | deepspeed/inference/v2/model_implementations/qwen_v2/model.py:160-164 | deepspeed/inference/v2/model_implementations/qwen_v2_moe/model.py:294-298 \u2014 \u0060deepspeed/inference/v2/model_implementations/qwen/model.py\u0060 and \u0060deepspeed/inference/v2/model_implementations/qwen_v2/model.py\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 10 separate duplicated blocks between them, totalling at least 112 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"deepspeed/inference/v2/model_implementations/opt/model.py"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd5177af30d2bbb4a8aa3430fd7b431bdce7a5ecab477cdc756f81eb10b1a7f1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 4): deepspeed/launcher/multinode_runner.py:148-153 | deepspeed/launcher/multinode_runner.py:209-214 | deepspeed/launcher/multinode_runner.py:281-286 | deepspeed/launcher/multinode_runner.py:470-474 \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":"deepspeed/launcher/multinode_runner.py"},"region":{"startLine":148}}}],"partialFingerprints":{"codehealthFindingId/v1":"da151f50fad1bb1f43b414b4c34fce297abcf3aa4072795c9a710c17321b5461"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): deepspeed/module_inject/containers/bloom.py:97-101 | deepspeed/module_inject/containers/gptj.py:83-87 | deepspeed/module_inject/containers/gptneox.py:89-93 \u2014 before extracting anything, compare \u0060deepspeed/module_inject/containers/bloom.py\u0060 and \u0060deepspeed/module_inject/containers/gptneox.py\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 42 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 \u0060deepspeed/module_inject/containers/bloom.py:97\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":"deepspeed/module_inject/containers/bloom.py"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f3f0858594754fd96dd40ac280d98bbd8e96900a0b0a9834f4f6f69a02a7daa"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): deepspeed/module_inject/containers/gptj.py:80-84 | deepspeed/module_inject/containers/gptneo.py:86-90 | deepspeed/module_inject/containers/opt.py:91-95 \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 \u0060deepspeed/module_inject/containers/gptj.py:80\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":"deepspeed/module_inject/containers/gptj.py"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9436df7bb00414a123a8bf4a1008a05bb2f6bab9c8e191bc86424886eb85ebb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): deepspeed/ops/adam/cpu_adam.py:178-183 | deepspeed/ops/adam/cpu_adam.py:257-261 | deepspeed/ops/lion/cpu_lion.py:120-125 \u2014 \u0060deepspeed/ops/adam/cpu_adam.py\u0060 and \u0060deepspeed/ops/lion/cpu_lion.py\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 4 separate duplicated blocks between them, totalling at least 68 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"deepspeed/ops/adam/cpu_adam.py"},"region":{"startLine":178}}}],"partialFingerprints":{"codehealthFindingId/v1":"e155a80bdf9623a3cbf513477800f9c2a5e48b7d2bde4cfe698d40c03eac3a9a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): csrc/aio/py_test/ds_aio_job.py:44-49 | deepspeed/nvme/ds_aio_job.py:45-50 \u2014 before extracting anything, compare \u0060csrc/aio/py_test/ds_aio_job.py\u0060 and \u0060deepspeed/nvme/ds_aio_job.py\u0060 as WHOLE FILES: 94% 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 1 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. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"csrc/aio/py_test/ds_aio_job.py"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a2d4f24b60497601d743db9475900d547f6d2aa6d0f340372cd988bcedaba0f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): csrc/aio/py_test/io_engine.py:119-125 | deepspeed/nvme/io_engine.py:119-125 \u2014 before extracting anything, compare \u0060csrc/aio/py_test/io_engine.py\u0060 and \u0060deepspeed/nvme/io_engine.py\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 69 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"csrc/aio/py_test/io_engine.py"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"befa8969cd937efa7881afd89e26cf2581dd9b588803b577a6a561b815bb276a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): csrc/aio/py_test/parse_aio_stats.py:126-132 | deepspeed/nvme/parse_nvme_stats.py:126-132 \u2014 before extracting anything, compare \u0060csrc/aio/py_test/parse_aio_stats.py\u0060 and \u0060deepspeed/nvme/parse_nvme_stats.py\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 70 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. 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":"csrc/aio/py_test/parse_aio_stats.py"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"74c5256cd8662aaa262b88538e975329584e2d8022bd41b137a273e776d6ed0b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): csrc/aio/py_test/torch_io.py:31-37 | deepspeed/nvme/torch_io.py:31-37 \u2014 before extracting anything, compare \u0060csrc/aio/py_test/torch_io.py\u0060 and \u0060deepspeed/nvme/torch_io.py\u0060 as WHOLE FILES: 95% 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. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"csrc/aio/py_test/torch_io.py"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc35e9fc73e81a3561142e49f1472fd39fcda14e6892beea804bc11f3795f597"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): deepspeed/autotuning/utils.py:419-425 | deepspeed/autotuning/utils.py:444-450 \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 after the matched lines, \u0060deepspeed/autotuning/utils.py:427\u0060 calls \u0060str\u0060, \u0060round\u0060 and \u0060deepspeed/autotuning/utils.py:451\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":"deepspeed/autotuning/utils.py"},"region":{"startLine":419}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b6c18810e120365de616684e401ae23ff9b7678bece9308cc21733ba2f61a02"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): deepspeed/autotuning/utils.py:433-437 | deepspeed/autotuning/utils.py:454-458 \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, \u0060deepspeed/autotuning/utils.py:432\u0060 calls \u0060str\u0060, \u0060round\u0060 and \u0060deepspeed/autotuning/utils.py:453\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":"deepspeed/autotuning/utils.py"},"region":{"startLine":433}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f5c8ca1214656fa94d455cf39a9851effb4978d29f6254e1b3c67e675b67109"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): deepspeed/checkpoint/affine_transfer_executor.py:387-393 | deepspeed/checkpoint/affine_transfer_executor.py:394-400 \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":"deepspeed/checkpoint/affine_transfer_executor.py"},"region":{"startLine":387}}}],"partialFingerprints":{"codehealthFindingId/v1":"09b89d761bff1506a5df2ef1a6185a454f439868fa3e9a695c9ba65a2ca20633"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): deepspeed/inference/v2/model_implementations/falcon/model.py:186-191 | deepspeed/inference/v2/model_implementations/phi/model.py:172-177 \u2014 \u0060deepspeed/inference/v2/model_implementations/falcon/model.py\u0060 and \u0060deepspeed/inference/v2/model_implementations/phi/model.py\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 4 separate duplicated blocks between them, totalling at least 34 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. Read the line range as the matched WINDOW rather than a finished unit: at \u0060deepspeed/inference/v2/model_implementations/falcon/model.py:186\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":"deepspeed/inference/v2/model_implementations/falcon/model.py"},"region":{"startLine":186}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf0fc07367bcaa2e997744e26928048b63c2042ba65dbadc5641a7df1d94614f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): deepspeed/module_inject/containers/bert.py:65-69 | deepspeed/module_inject/containers/distil_bert.py:61-65 \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":"deepspeed/module_inject/containers/bert.py"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"94c7cba50aae915a492fc0efa537dd36e448750126bcae8412f4c17d7a879d6b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): deepspeed/module_inject/containers/megatron_gpt.py:100-107 | deepspeed/module_inject/containers/megatron_gpt_moe.py:76-83 \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":"deepspeed/module_inject/containers/megatron_gpt.py"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"cbd0f06ad2f7cbc52a8926b6279b6b22021a18efe301d041f8815493bd01cd11"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (4\u20135 lines \u00D7 3): deepspeed/ops/adam/fused_adam.py:179-183 | deepspeed/ops/adam/fused_adam.py:185-189 | deepspeed/ops/adam/fused_adam.py:190-193 \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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060deepspeed/ops/adam/fused_adam.py:179\u0060 calls \u0060multi_tensor_applier\u0060 and \u0060deepspeed/ops/adam/fused_adam.py:190\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":"deepspeed/ops/adam/fused_adam.py"},"region":{"startLine":179}}}],"partialFingerprints":{"codehealthFindingId/v1":"26ee3fdac3b51bb82628f048b26cef4069f1322060e0f9ff4b8f167f1fdaac21"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): deepspeed/ops/adam/zenflow_torch_adam.py:393-397 | deepspeed/ops/adam/zenflow_torch_adam.py:625-629 | deepspeed/ops/adam/zenflow_torch_adam.py:664-668 \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 \u0060deepspeed/ops/adam/zenflow_torch_adam.py:393\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":"deepspeed/ops/adam/zenflow_torch_adam.py"},"region":{"startLine":393}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3d711ae7e4866a537319251f753f75407ab1c0940823e55d9a6c8a4e06b6a87"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): deepspeed/runtime/zenflow/zenflow_stage_1_and_2.py:660-664 | deepspeed/runtime/zero/stage_1_and_2.py:1902-1906 \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":"deepspeed/runtime/zenflow/zenflow_stage_1_and_2.py"},"region":{"startLine":660}}}],"partialFingerprints":{"codehealthFindingId/v1":"b387d21d045081f3ab3ae8bc087dd2fc2c987699a4d3b9bbc57b61fec7e458d9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): deepspeed/runtime/zero/stage_1_and_2.py:2833-2844 | deepspeed/runtime/zero/stage_1_and_2.py:2942-2953 \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 \u0060deepspeed/runtime/zero/stage_1_and_2.py:2833\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":"deepspeed/runtime/zero/stage_1_and_2.py"},"region":{"startLine":2833}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e25e6fc598da951742f80aecd90fa2535561622e6a8240d783aa01668279191"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): deepspeed/sequence/fpdt_layer.py:254-258 | deepspeed/sequence/fpdt_layer.py:264-268 \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":"deepspeed/sequence/fpdt_layer.py"},"region":{"startLine":254}}}],"partialFingerprints":{"codehealthFindingId/v1":"84b17da907d5d8ca4e36111abcbe1b511d4641a409f48c5dca05e4177fb6e802"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): deepspeed/sequence/layer.py:65-69 | deepspeed/sequence/layer.py:86-90 \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 \u0060deepspeed/sequence/layer.py:65\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":"deepspeed/sequence/layer.py"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a115eab0fde12253f82b30c6aba8b15f4d3640456a7ec058798db9f583fac3d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): deepspeed/sequence/layer.py:251-255 | deepspeed/sequence/layer.py:258-262 \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":"deepspeed/sequence/layer.py"},"region":{"startLine":251}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f6744a894742379b852098e21c82c64fc010040bf2bee298a91b1fc6605830f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): op_builder/builder.py:589-595 | op_builder/mps/cpu_adam.py:33-39 \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":"op_builder/builder.py"},"region":{"startLine":589}}}],"partialFingerprints":{"codehealthFindingId/v1":"2041612be26ed33e5ce5b0d297d0ad75c23feb4cb148f0196bfac9d8c53a4e5d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): op_builder/cpu/cpu_adagrad.py:12-21 | op_builder/mlu/cpu_adagrad.py:15-24 \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":"op_builder/cpu/cpu_adagrad.py"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8ff67f994e8d25cd33e4f550fe1aa033e4b7d08fad274bb43b5d1f723b23bc8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 6): op_builder/cpu/cpu_adam.py:14-27 | op_builder/cpu/cpu_lion.py:14-27 | op_builder/hpu/cpu_adam.py:15-28 | op_builder/mlu/cpu_adam.py:15-28 | op_builder/sdaa/cpu_adam.py:40-53 | op_builder/xpu/cpu_adam.py:14-27 \u2014 \u0060op_builder/cpu/cpu_adam.py\u0060 and \u0060op_builder/hpu/cpu_adam.py\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 2 separate duplicated blocks between them, totalling at least 28 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"op_builder/cpu/cpu_adam.py"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"df66a8f11b94ac3f161616bd676a21668b2118981b6869fec263bcb288290651"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 8): op_builder/cpu/cpu_adam.py:14-27 | op_builder/cpu/cpu_lion.py:14-27 | op_builder/cpu/fused_adam.py:14-23 | op_builder/hpu/cpu_adam.py:15-28 | op_builder/mlu/cpu_adam.py:15-28 | op_builder/sdaa/cpu_adam.py:40-53 | op_builder/xpu/cpu_adagrad.py:14-23 | op_builder/xpu/cpu_adam.py:14-27 \u2014 \u0060op_builder/cpu/cpu_adam.py\u0060 and \u0060op_builder/hpu/cpu_adam.py\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 2 separate duplicated blocks between them, totalling at least 28 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. 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":"op_builder/cpu/cpu_adam.py"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a9f43eaa16b3e0a2ac77342903bedeaf10c5d9581a82cfc80748d2bde1bd152"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 6): op_builder/cpu/no_impl.py:14-24 | op_builder/hpu/no_impl.py:14-24 | op_builder/mlu/no_impl.py:15-34 | op_builder/npu/no_impl.py:14-33 | op_builder/sdaa/no_impl.py:40-59 | op_builder/xpu/no_impl.py:14-33 \u2014 \u0060op_builder/mlu/no_impl.py\u0060 and \u0060op_builder/npu/no_impl.py\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 3 separate duplicated blocks between them, totalling at least 60 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"op_builder/cpu/no_impl.py"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"39cffaa8febbc0631793503794cccdcf8ecc7283a79d2bcfcb2405c7ca23600d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (22 lines \u00D7 2): op_builder/fused_adam.py:16-37 | op_builder/fused_lion.py:16-37 \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":"op_builder/fused_adam.py"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8ed84a5c8e4d59cfdb6e99a0371f0d7e73eae6824422cc9440833060c6c87fa"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 3): op_builder/klxpu/cpu_adagrad.py:12-23 | op_builder/npu/cpu_adagrad.py:14-25 | op_builder/supa/cpu_adagrad.py:14-25 \u2014 \u0060op_builder/npu/cpu_adagrad.py\u0060 and \u0060op_builder/supa/cpu_adagrad.py\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 1 separate duplicated blocks between them, totalling at least 12 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"op_builder/klxpu/cpu_adagrad.py"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c448f1ff3acdd8d1030ec128023cd11852d6ca4886bf9d0ab46f6dde423be1f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 6): op_builder/klxpu/cpu_adam.py:12-23 | op_builder/klxpu/cpu_lion.py:12-23 | op_builder/npu/cpu_adam.py:14-25 | op_builder/npu/cpu_lion.py:14-25 | op_builder/supa/cpu_adam.py:12-23 | op_builder/supa/cpu_lion.py:12-23 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 6 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 6 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"op_builder/klxpu/cpu_adam.py"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"7948f546af8f00a8e4f64fe5217b70ccc8cfd9bd47df0ec6161b8166c110d064"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 4): op_builder/mlu/no_impl.py:15-34 | op_builder/npu/no_impl.py:14-33 | op_builder/sdaa/no_impl.py:40-59 | op_builder/xpu/no_impl.py:14-33 \u2014 \u0060op_builder/mlu/no_impl.py\u0060 and \u0060op_builder/npu/no_impl.py\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 3 separate duplicated blocks between them, totalling at least 60 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"op_builder/mlu/no_impl.py"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"143eff4af0f172f05af4ab0a8dea809e0af5c97104bcc3d86b87cc1aad0aa8aa"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 7): op_builder/cpu/no_impl.py:14-24 | op_builder/hpu/no_impl.py:14-24 | op_builder/mlu/no_impl.py:15-34 | op_builder/mps/no_impl.py:13-20 | op_builder/npu/no_impl.py:14-33 | op_builder/sdaa/no_impl.py:40-59 | op_builder/xpu/no_impl.py:14-33 \u2014 \u0060op_builder/mlu/no_impl.py\u0060 and \u0060op_builder/npu/no_impl.py\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 3 separate duplicated blocks between them, totalling at least 60 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. 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":"op_builder/cpu/no_impl.py"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"a20bc983a52c3e1653b1386f4f1c608713920e97aa5da949f46ff793ef7f79c3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (22 lines \u00D7 2): op_builder/klxpu/no_impl.py:16-168 | op_builder/supa/no_impl.py:17-38 \u2014 \u0060op_builder/klxpu/no_impl.py\u0060 and \u0060op_builder/supa/no_impl.py\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 1 separate duplicated blocks between them, totalling at least 153 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. 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":"op_builder/klxpu/no_impl.py"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"75588f499141824fbf1a5a7ec9cdaa3ad17022e30e5a70f335ffa2cc0f3dc6d9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 8): accelerator/cpu_accelerator.py:522-527 | accelerator/cuda_accelerator.py:430-435 | accelerator/hpu_accelerator.py:325-330 | accelerator/mlu_accelerator.py:284-289 | accelerator/mps_accelerator.py:309-314 | accelerator/npu_accelerator.py:353-358 | accelerator/sdaa_accelerator.py:312-317 | accelerator/xpu_accelerator.py:507-512 \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 8 call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"accelerator/cpu_accelerator.py"},"region":{"startLine":522}}}],"partialFingerprints":{"codehealthFindingId/v1":"8415a9098402138c65a50a63798e51d3c666fb76ed9427d36e60d7c879f3d1e2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): accelerator/cuda_accelerator.py:227-232 | accelerator/mlu_accelerator.py:157-162 | accelerator/sdaa_accelerator.py:187-192 \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 \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":"accelerator/cuda_accelerator.py"},"region":{"startLine":227}}}],"partialFingerprints":{"codehealthFindingId/v1":"62f5c60e2344ae3db4bc3c026be60725ebae5d4d5977f1cece042de1408c8cf6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): accelerator/hpu_accelerator.py:297-301 | accelerator/npu_accelerator.py:329-333 \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":"accelerator/hpu_accelerator.py"},"region":{"startLine":297}}}],"partialFingerprints":{"codehealthFindingId/v1":"55e0208c69ff60879db83874fcdf4340cf5593c06c1a0ab5e4ea480d2697f6d3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 4): accelerator/mlu_accelerator.py:243-251 | accelerator/npu_accelerator.py:312-320 | accelerator/sdaa_accelerator.py:271-279 | accelerator/xpu_accelerator.py:466-474 \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 4 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":"accelerator/mlu_accelerator.py"},"region":{"startLine":243}}}],"partialFingerprints":{"codehealthFindingId/v1":"47f0e412ccf5ec22ef8afa32dba3aa2a063d0946a66249d22615828c23abb825"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): csrc/aio/py_test/aio_bench_generate_param.py:30-36 | deepspeed/nvme/perf_generate_param.py:32-38 \u2014 before extracting anything, compare \u0060csrc/aio/py_test/aio_bench_generate_param.py\u0060 and \u0060deepspeed/nvme/perf_generate_param.py\u0060 as WHOLE FILES: 83% 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. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. 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":"csrc/aio/py_test/aio_bench_generate_param.py"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b3b5b5b2e544cbd7dd22280ad81b37b07963e17ebde5be928243bb26471b33a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): csrc/aio/py_test/io_engine.py:56-66 | deepspeed/nvme/io_engine.py:56-66 \u2014 before extracting anything, compare \u0060csrc/aio/py_test/io_engine.py\u0060 and \u0060deepspeed/nvme/io_engine.py\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 69 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. 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":"csrc/aio/py_test/io_engine.py"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"99ba5f921339e317bcec37c7b3f97fa86c5eb8b53462387c5cefab06374ff046"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): csrc/aio/py_test/parse_aio_stats.py:68-73 | deepspeed/nvme/parse_nvme_stats.py:68-73 \u2014 before extracting anything, compare \u0060csrc/aio/py_test/parse_aio_stats.py\u0060 and \u0060deepspeed/nvme/parse_nvme_stats.py\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 70 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. 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":"csrc/aio/py_test/parse_aio_stats.py"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"01679be4fd3f4d57dfdc644b4ab6b63d44c46a91cd9315966286d7dd3cfca93b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): csrc/aio/py_test/parse_aio_stats.py:116-122 | deepspeed/nvme/parse_nvme_stats.py:116-122 \u2014 before extracting anything, compare \u0060csrc/aio/py_test/parse_aio_stats.py\u0060 and \u0060deepspeed/nvme/parse_nvme_stats.py\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 70 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. 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":"csrc/aio/py_test/parse_aio_stats.py"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d52916371fe831c936a68f863b5e0d56cc822dfd73ebea4ba9742a4af12189c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): csrc/aio/py_test/parse_aio_stats.py:136-144 | deepspeed/nvme/parse_nvme_stats.py:136-144 \u2014 before extracting anything, compare \u0060csrc/aio/py_test/parse_aio_stats.py\u0060 and \u0060deepspeed/nvme/parse_nvme_stats.py\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 70 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"csrc/aio/py_test/parse_aio_stats.py"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"b915617f5f70511c3add40a84efa381fd03233b0a79b507541ece8cfc82513c4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): csrc/aio/py_test/torch_fastio_engine.py:23-28 | deepspeed/nvme/torch_fastio_engine.py:23-28 \u2014 before extracting anything, compare \u0060csrc/aio/py_test/torch_fastio_engine.py\u0060 and \u0060deepspeed/nvme/torch_fastio_engine.py\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 74 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"csrc/aio/py_test/torch_fastio_engine.py"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2da7412288fd1b761889e6bf5c31b6615bfa0bddbf90500f4143706f6ae9f1a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): deepspeed/checkpoint/ds_to_universal.py:1048-1053 | deepspeed/utils/zero_to_fp32.py:108-113 \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":"deepspeed/checkpoint/ds_to_universal.py"},"region":{"startLine":1048}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b7df252e8d3bf3c4afe65ef77cfc2ccd4a3c658982d0826213d6a4230953e2b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): deepspeed/inference/engine.py:505-511 | deepspeed/runtime/state_dict_factory.py:140-146 \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":"deepspeed/inference/engine.py"},"region":{"startLine":505}}}],"partialFingerprints":{"codehealthFindingId/v1":"aae3289444a69ea9d1b69566f9bbc5c44a536cb1457a87d9defecfa85241a92e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): deepspeed/inference/quantization/utils.py:173-187 | deepspeed/utils/module_utils.py:24-38 \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":"deepspeed/inference/quantization/utils.py"},"region":{"startLine":173}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a3dd25a46ba9b1b33bee3e7f0ea12026675f9a443a52591f7c85c62a3a1f409"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 8): deepspeed/inference/v2/model_implementations/exaone4/model.py:68-73 | deepspeed/inference/v2/model_implementations/falcon/model.py:79-84 | deepspeed/inference/v2/model_implementations/llama_v2/model.py:78-83 | deepspeed/inference/v2/model_implementations/mistral/model.py:78-83 | deepspeed/inference/v2/model_implementations/mixtral/model.py:83-88 | deepspeed/inference/v2/model_implementations/opt/model.py:74-79 | deepspeed/inference/v2/model_implementations/phi/model.py:78-83 | deepspeed/inference/v2/model_implementations/phi3/model.py:78-83 \u2014 \u0060deepspeed/inference/v2/model_implementations/falcon/model.py\u0060 and \u0060deepspeed/inference/v2/model_implementations/phi/model.py\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 4 separate duplicated blocks between them, totalling at least 34 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. 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":"deepspeed/inference/v2/model_implementations/exaone4/model.py"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c19ccff24cb4461e71a038532c66b11b37628b3e518effcdd6f3ff65d84ae10"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 9): deepspeed/inference/v2/model_implementations/falcon/model.py:110-124 | deepspeed/inference/v2/model_implementations/llama_v2/model.py:117-131 | deepspeed/inference/v2/model_implementations/mistral/model.py:116-130 | deepspeed/inference/v2/model_implementations/mixtral/model.py:171-185 | deepspeed/inference/v2/model_implementations/phi/model.py:107-121 | deepspeed/inference/v2/model_implementations/phi3/model.py:116-130 | deepspeed/inference/v2/model_implementations/qwen/model.py:131-145 | deepspeed/inference/v2/model_implementations/qwen_v2/model.py:129-143 | deepspeed/inference/v2/model_implementations/qwen_v2_moe/model.py:263-277 \u2014 \u0060deepspeed/inference/v2/model_implementations/falcon/model.py\u0060 and \u0060deepspeed/inference/v2/model_implementations/phi/model.py\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 4 separate duplicated blocks between them, totalling at least 34 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. 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":"deepspeed/inference/v2/model_implementations/falcon/model.py"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"9426fd16a21fb7e156851932f8b9750fc49b5a70e7a3327b286853c2ea4fbdb0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): deepspeed/module_inject/containers/bloom.py:52-57 | deepspeed/module_inject/containers/gptneox.py:38-43 \u2014 before extracting anything, compare \u0060deepspeed/module_inject/containers/bloom.py\u0060 and \u0060deepspeed/module_inject/containers/gptneox.py\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 42 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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060deepspeed/module_inject/containers/bloom.py:47\u0060 calls \u0060attention_qkv_mp\u0060 and \u0060deepspeed/module_inject/containers/gptneox.py:35\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":"deepspeed/module_inject/containers/bloom.py"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba30d73100b33ffabc68982269e093d2559fc39927907e6bc2a462b3d78d9630"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): deepspeed/module_inject/containers/internlm.py:68-74 | deepspeed/module_inject/containers/llama.py:123-129 \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":"deepspeed/module_inject/containers/internlm.py"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"99e89d1b041ed17fe8aecc215fa006ab6086f5069c7ecc451a0395e1523a900f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): deepspeed/runtime/bf16_optimizer.py:307-312 | deepspeed/runtime/zero/stage_1_and_2.py:1255-1260 \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":"deepspeed/runtime/bf16_optimizer.py"},"region":{"startLine":307}}}],"partialFingerprints":{"codehealthFindingId/v1":"881f8d6625da55a595a45fccd82530bf60abff1402174ec3ea33d24bb7f612ce"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): deepspeed/runtime/fp16/fused_optimizer.py:138-149 | deepspeed/runtime/fp16/unfused_optimizer.py:111-123 \u2014 before extracting anything, compare \u0060deepspeed/runtime/fp16/fused_optimizer.py\u0060 and \u0060deepspeed/runtime/fp16/unfused_optimizer.py\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 84 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":"deepspeed/runtime/fp16/fused_optimizer.py"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c48ffe7f25412146cb3ceb43b596b06a4f262858965aacde7c95286731195c9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): deepspeed/runtime/zenflow/engine_stage3.py:447-453 | deepspeed/runtime/zenflow/zenflow_stage_1_and_2.py:670-676 \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 \u0060deepspeed/runtime/zenflow/engine_stage3.py:447\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":"deepspeed/runtime/zenflow/engine_stage3.py"},"region":{"startLine":447}}}],"partialFingerprints":{"codehealthFindingId/v1":"86279cf097dbcffc0d6f5fb8f247c85c3f9bd6159570dceea37b22197d252dbc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): deepspeed/runtime/zero/stage3.py:2312-2317 | deepspeed/runtime/zero/stage_1_and_2.py:2387-2392 \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":"deepspeed/runtime/zero/stage3.py"},"region":{"startLine":2312}}}],"partialFingerprints":{"codehealthFindingId/v1":"49ddff0193f0a8a72413b6e2fd7be631068e886376372a005d226bd3384df224"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 6): op_builder/async_io.py:111-122 | op_builder/cpu/async_io.py:87-98 | op_builder/klxpu/async_io.py:86-97 | op_builder/npu/async_io.py:97-108 | op_builder/supa/async_io.py:86-97 | op_builder/xpu/async_io.py:99-110 \u2014 before extracting anything, compare \u0060op_builder/async_io.py\u0060 and \u0060op_builder/cpu/async_io.py\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 34 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060op_builder/async_io.py:111\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":"op_builder/async_io.py"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"e118eec9555075d0ce208a44bdaa4f2a6910776d6fe72dadfe3089071a3bc018"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 4): op_builder/klxpu/async_io.py:73-78 | op_builder/npu/async_io.py:84-89 | op_builder/supa/async_io.py:73-78 | op_builder/xpu/async_io.py:86-91 \u2014 \u0060op_builder/klxpu/async_io.py\u0060 and \u0060op_builder/npu/async_io.py\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 3 separate duplicated blocks between them, totalling at least 34 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. 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 first that the copies are not typed on the same thing: \u0060PinMemoryBuilder\u0060 names \u0060deepspeed.ops.op_builder.pin_memory\u0060 in one and \u0060op_builder.pin_memory\u0060 in another \u2014 different types that share a simple name, which is why the text matched. A single extracted unit cannot be given a parameter type that fits both, so unifying those types (or introducing a shared abstraction over them) is the step that has to come BEFORE the extraction above; if they are deliberately separate, 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":"op_builder/klxpu/async_io.py"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"c12be8df4bd6edc6d9fb8c571b351838ed3a569d2405793ef40a0ae7d7a91692"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): op_builder/npu/builder.py:23-31 | op_builder/xpu/builder.py:20-26 \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":"op_builder/npu/builder.py"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e4375967bb6d94fb51f9d40af923a45ec9994b73a3eafb171b50fa4489da0bd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): op_builder/supa/inference.py:26-31 | op_builder/supa/quantizer.py:24-29 \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":"op_builder/supa/inference.py"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"9500bb7222daf1e5bc6e1cd78af79fefb0e1c5c5f1aaeb85ee02629f952ee544"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): deepspeed/inference/v2/kernels/core_ops/cuda_layer_norm/cuda_fp_ln_base.py:22-37 | deepspeed/inference/v2/kernels/core_ops/cuda_rms_norm/rms_norm_base.py:22-37 \u2014 before extracting anything, compare \u0060deepspeed/inference/v2/kernels/core_ops/cuda_layer_norm/cuda_fp_ln_base.py\u0060 and \u0060deepspeed/inference/v2/kernels/core_ops/cuda_rms_norm/rms_norm_base.py\u0060 as WHOLE FILES: 85% 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 1 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. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"deepspeed/inference/v2/kernels/core_ops/cuda_layer_norm/cuda_fp_ln_base.py"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"65a310b4365745e2745862b009fab4b592f1e2e610e5526ddecae4906e66e878"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 5): deepspeed/inference/v2/model_implementations/exaone4/policy.py:19-27 | deepspeed/inference/v2/model_implementations/mistral/policy.py:20-30 | deepspeed/inference/v2/model_implementations/mixtral/policy.py:21-31 | deepspeed/inference/v2/model_implementations/phi3/policy.py:20-30 | deepspeed/inference/v2/model_implementations/qwen_v2_moe/policy.py:20-30 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 5 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 5 times. 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":"deepspeed/inference/v2/model_implementations/exaone4/policy.py"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"18401379b48f77eb54441d34ef93bf264c58ef8ddbc132c4ca684b3d5a889455"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): deepspeed/ops/adam/fused_adam.py:100-105 | deepspeed/ops/lion/fused_lion.py:48-53 \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":"deepspeed/ops/adam/fused_adam.py"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"4232cf0a0f4b3ac54a35eea7e0767c7918465451682731ed05cf9721f3f72f7f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): deepspeed/runtime/bf16_optimizer.py:315-323 | deepspeed/runtime/zero/stage_1_and_2.py:807-815 \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":"deepspeed/runtime/bf16_optimizer.py"},"region":{"startLine":315}}}],"partialFingerprints":{"codehealthFindingId/v1":"53ebd08634ecd248847e2a69c46e8968cbe0767503abf7f3592a2c51a0c31b68"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): deepspeed/runtime/bf16_optimizer.py:362-366 | deepspeed/runtime/zero/stage_1_and_2.py:867-871 \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":"deepspeed/runtime/bf16_optimizer.py"},"region":{"startLine":362}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d7629dbe147b9ca44421fd28b33d13fb51cd09ea7750cb2d55c463cac0ea07c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): csrc/aio/py_test/ds_aio_basic.py:34-41 | deepspeed/nvme/ds_aio_basic.py:34-41 \u2014 before extracting anything, compare \u0060csrc/aio/py_test/ds_aio_basic.py\u0060 and \u0060deepspeed/nvme/ds_aio_basic.py\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 52 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"csrc/aio/py_test/ds_aio_basic.py"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0281017fc08e295a77aff5a32e0c759da0129156212f9497ec4c01a48e1d09f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): csrc/aio/py_test/ds_aio_basic.py:26-30 | deepspeed/nvme/ds_aio_basic.py:26-30 \u2014 before extracting anything, compare \u0060csrc/aio/py_test/ds_aio_basic.py\u0060 and \u0060deepspeed/nvme/ds_aio_basic.py\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 52 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"csrc/aio/py_test/ds_aio_basic.py"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"34bbcb5571a9821066b50aaea8e15c847d5ee9dd3493466a1a5f02c3972395be"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): deepspeed/compile/passes/selective_gather.py:138-142 | deepspeed/compile/passes/selective_gather.py:149-153 \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":"deepspeed/compile/passes/selective_gather.py"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b38225bcaca25bd934826bf3fb21fc205b8d48bc458bdd703414001a6936c9a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): deepspeed/inference/quantization/utils.py:62-66 | deepspeed/inference/quantization/utils.py:138-142 \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":"deepspeed/inference/quantization/utils.py"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"13c2d4f2d1ed77a821e3201fbbc20fa9a5bb7cdd7042a3f0a47d1d7006f568b2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): deepspeed/module_inject/containers/base.py:298-302 | deepspeed/module_inject/replace_module.py:109-113 \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":"deepspeed/module_inject/containers/base.py"},"region":{"startLine":298}}}],"partialFingerprints":{"codehealthFindingId/v1":"db2ba30235613e5c3a0c641c632ce8518b12448866d8b392365c6b84f61f19e3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): deepspeed/module_inject/containers/internlm.py:109-114 | deepspeed/module_inject/containers/llama.py:153-158 | deepspeed/module_inject/containers/llama2.py:103-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 all 3 call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"deepspeed/module_inject/containers/internlm.py"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1e033c612dd1e6db70365509bb8ff24ea3cbe16bc2d74211293b20948b3b29d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): deepspeed/module_inject/layers.py:1000-1004 | deepspeed/module_inject/layers.py:2214-2218 \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":"deepspeed/module_inject/layers.py"},"region":{"startLine":1000}}}],"partialFingerprints":{"codehealthFindingId/v1":"42115c5f72d534eff1dd2e3cde9dc017ba3a0d6b8b9ec647201daa8abe1f0274"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): deepspeed/moe/ep_tp_dispatch.py:173-177 | deepspeed/moe/ep_tp_dispatch.py:215-219 \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":"deepspeed/moe/ep_tp_dispatch.py"},"region":{"startLine":173}}}],"partialFingerprints":{"codehealthFindingId/v1":"451b46ef89e26b0f8662813712e89938a6a85807f359f6e8819a41a8fc929e9f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): deepspeed/runtime/zero/stage3.py:1812-1817 | deepspeed/runtime/zero/stage3.py:1824-1829 \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":"deepspeed/runtime/zero/stage3.py"},"region":{"startLine":1812}}}],"partialFingerprints":{"codehealthFindingId/v1":"75e2fab0d66e4e7b496f87ea6887a91d5595996dab27e135a6383267ac5e65a2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): deepspeed/sequence/fpdt_layer.py:249-253 | deepspeed/sequence/fpdt_layer.py:691-695 \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":"deepspeed/sequence/fpdt_layer.py"},"region":{"startLine":249}}}],"partialFingerprints":{"codehealthFindingId/v1":"50ead658cf2bc70af610308ca18092da579436c6cd1a67a142b23986ff4a6024"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): deepspeed/sequence/fpdt_layer.py:490-495 | deepspeed/sequence/fpdt_layer.py:525-530 \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":"deepspeed/sequence/fpdt_layer.py"},"region":{"startLine":490}}}],"partialFingerprints":{"codehealthFindingId/v1":"309768d1b7ad181a5627b054245fd1ab8dedfe5df1e28c5d220272b1e53f51bd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): op_builder/klxpu/fused_adam.py:65-72 | op_builder/supa/fused_adam.py:59-66 \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":"op_builder/klxpu/fused_adam.py"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"1eb813e04cc3ed2cb7a320d339330230d4aa08b602584b8020af58da0e1a11dd"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): scripts/replace_copyright.py:103-128 | scripts/replace_copyright.py:132-148 \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":"scripts/replace_copyright.py"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee3198d8bf66628d17af95cfe62efdd16369d7f9fc1e65c968ba9c4f56a96664"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: TorchBackend (LCOM4 9): TorchBackend\u0027s methods fall into 9 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 9 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":"deepspeed/comm/torch.py"},"region":{"startLine":238}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1cb2647976651953634c1f950ec67f22c01272dd8b89926dd2dc0edfa8a306a"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: CUDA_Accelerator (LCOM4 8): CUDA_Accelerator\u0027s methods fall into 8 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 8 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":"accelerator/cuda_accelerator.py"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"c889f4ca04653fefbee0ecc9776c910f9035389c21511c637c05f9fb5b53aaac"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: TensorParallel_Layer (LCOM4 6): TensorParallel_Layer\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":"deepspeed/module_inject/layers.py"},"region":{"startLine":368}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3d2c37d6e05094da2264e5773df1d5b3c58d01f8f893ad6be3a90a9406a002c"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: CPU_Accelerator (LCOM4 5): CPU_Accelerator\u0027s methods fall into 5 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 5 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":"accelerator/cpu_accelerator.py"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"893d04f8958094988ea2d790f62b6d9b0eb1cdc2291feffe0c5a2619a341eb23"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: InferenceEngine (LCOM4 5): InferenceEngine\u0027s methods fall into 5 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 5 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":"deepspeed/inference/engine.py"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"cab723227d1fa6bac66d4b7790713e5ccbe5359c4df260f96e24a244f6a37484"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: MLU_Accelerator (LCOM4 4): MLU_Accelerator\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":"accelerator/mlu_accelerator.py"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7c596256ee2304cdf4f9c0d5e047358ca1f540352d16948c1a484951abc5171"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: SDAA_Accelerator (LCOM4 4): SDAA_Accelerator\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":"accelerator/sdaa_accelerator.py"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"16e24fc129363ae58cf03b07e6343e22f44077db5c489451df38124d2b9c2d92"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: XPU_Accelerator (LCOM4 4): XPU_Accelerator\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":"accelerator/xpu_accelerator.py"},"region":{"startLine":177}}}],"partialFingerprints":{"codehealthFindingId/v1":"5fd19a48b1fab364f179c4a55b5fcf36057229bcbd969eaba1dc7a382dec7dd7"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: DeepSpeedCheckpoint (LCOM4 4): DeepSpeedCheckpoint\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":"deepspeed/checkpoint/deepspeed_checkpoint.py"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9bb96259de3f9aea1e1d95878da1d4bec83475cbee63cbe3c7c5f79121e6d07"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: DSTransformerModelBase (LCOM4 4): DSTransformerModelBase\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":"deepspeed/inference/v2/model_implementations/inference_transformer_base.py"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c4dca088e096ab5e92abfe824652e8e5b791e5e2ee480184f49bea2492d5728"}},{"ruleId":"D11","level":"error","message":{"text":"Test declared unreliable: test_tiled_forward: This test is disabled or skipped with a reason naming unreliability \u2014 the repository\u0027s own words: \u0022seeing nondeterministic failures, skipping for now\u0022. A test that is skipped for flakiness is neither passing nor protecting the code it covers; either stabilise it or delete it, but do not leave it disabled indefinitely. (Found by reading the repository\u0027s own test source \u2014 the suite itself was not re-run, since the reliability runner does not support this ecosystem.)"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/unit/runtime/zero/test_zero_tiled.py"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"e11e17413c825473d53ceffd49f35810cce99f9519323d3cd45d241666f3e2d3"}},{"ruleId":"D11","level":"error","message":{"text":"Test declared unreliable: test_tiled_backward: This test is disabled or skipped with a reason naming unreliability \u2014 the repository\u0027s own words: \u0022seeing nondeterministic failures, skipping for now\u0022. A test that is skipped for flakiness is neither passing nor protecting the code it covers; either stabilise it or delete it, but do not leave it disabled indefinitely. (Found by reading the repository\u0027s own test source \u2014 the suite itself was not re-run, since the reliability runner does not support this ecosystem.)"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/unit/runtime/zero/test_zero_tiled.py"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"6263deee9bb3c40451989a9b3100f59f9651f3bb9cc491f460082bfe0e301abb"}},{"ruleId":"D11","level":"error","message":{"text":"Test declared unreliable: test_tiled_returnbias_backward: This test is disabled or skipped with a reason naming unreliability \u2014 the repository\u0027s own words: \u0022seeing nondeterministic failures, skipping for now\u0022. A test that is skipped for flakiness is neither passing nor protecting the code it covers; either stabilise it or delete it, but do not leave it disabled indefinitely. (Found by reading the repository\u0027s own test source \u2014 the suite itself was not re-run, since the reliability runner does not support this ecosystem.)"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/unit/runtime/zero/test_zero_tiled.py"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4eeb4d9f5aecd642345e1ac04eac3d4e53b653c278e3bdb230ded797e85fcc3"}},{"ruleId":"D12","level":"warning","message":{"text":"No Gemfile.lock committed by an application: This repository declares 10 gem(s) across 1 Bundler manifest(s) and ships no application \u0060.gemspec\u0060, so it is an APPLICATION \u2014 but no \u0060Gemfile.lock\u0060 is committed. Nothing records the versions a working build resolved to, so \u0060bundle install\u0060 re-resolves against whatever rubygems.org serves today and two deploys of this commit are not guaranteed to be the same deploy. Run \u0060bundle install\u0060 and commit the resulting \u0060Gemfile.lock\u0060. (A published GEM correctly omits its lock, which is why this is asked only of a repository that ships no .gemspec.)"},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"cce86a6764b0429f696055851835123ad1dee71ace60575c329aed06e5e6bcd7"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: deepspeed/runtime/zero/stage_1_and_2.py: deepspeed/runtime/zero/stage_1_and_2.py changed 33 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 71 in DeepSpeedZeroOptimizer.__init__ at line 170. 9 of those changes were fix/bug commits, and the other 24 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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 00:08:46 \u002B00:00\u0027 --until=\u00272026-11-14 00:08:46 \u002B00:00\u0027 --full-history --no-merges -- deepspeed/runtime/zero/stage_1_and_2.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":"deepspeed/runtime/zero/stage_1_and_2.py"},"region":{"startLine":170}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e32f7d80620c592892b1e33baedf11e8dae0dbdfd41bc512a49fbb8fd94f916"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: deepspeed/runtime/engine.py: deepspeed/runtime/engine.py changed 55 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 42 in DeepSpeedEngine._load_checkpoint at line 4656. 9 of those changes were fix/bug commits, and the other 46 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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 00:08:46 \u002B00:00\u0027 --until=\u00272026-11-14 00:08:46 \u002B00:00\u0027 --full-history --no-merges -- deepspeed/runtime/engine.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":"deepspeed/runtime/engine.py"},"region":{"startLine":4656}}}],"partialFingerprints":{"codehealthFindingId/v1":"0aaf3a42b751635fe40ff02354307bcac2a065feac5a1c456305501ff7d7cb45"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: deepspeed/runtime/zero/stage3.py: deepspeed/runtime/zero/stage3.py changed 30 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 35 in DeepSpeedZeroOptimizer_Stage3.__init__ at line 159. 5 of those changes were fix/bug commits, and the other 25 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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 00:08:46 \u002B00:00\u0027 --until=\u00272026-11-14 00:08:46 \u002B00:00\u0027 --full-history --no-merges -- deepspeed/runtime/zero/stage3.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":"deepspeed/runtime/zero/stage3.py"},"region":{"startLine":159}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6ba9c01567f2237d5a5642ea180592283d88532d09c2744aad278024cd47f7b"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: deepspeed/runtime/rollout/hybrid_engine_rollout.py: deepspeed/runtime/rollout/hybrid_engine_rollout.py changed 18 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 51 in HybridEngineRollout._generate_continuous at line 333. 4 of those changes were fix/bug commits, and the other 14 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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 00:08:46 \u002B00:00\u0027 --until=\u00272026-11-14 00:08:46 \u002B00:00\u0027 --full-history --no-merges -- deepspeed/runtime/rollout/hybrid_engine_rollout.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":"deepspeed/runtime/rollout/hybrid_engine_rollout.py"},"region":{"startLine":333}}}],"partialFingerprints":{"codehealthFindingId/v1":"47cd4cf9e126cfb3502af161d88b70d83419cecfe83569c3a9f0010352c7cdd7"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: deepspeed/module_inject/auto_ep_layer.py: deepspeed/module_inject/auto_ep_layer.py changed 19 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 29 in AutoEPMoELayer.__init__ at line 517. 1 of those changes was a fix/bug commit, and the other 18 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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 00:08:46 \u002B00:00\u0027 --until=\u00272026-11-14 00:08:46 \u002B00:00\u0027 --full-history --no-merges -- deepspeed/module_inject/auto_ep_layer.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":"deepspeed/module_inject/auto_ep_layer.py"},"region":{"startLine":517}}}],"partialFingerprints":{"codehealthFindingId/v1":"424e4d4af9e68a2e90d66e37a1cf4044d697c72cc3bac1255a2992137387238d"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: deepspeed/module_inject/auto_ep_config.py: deepspeed/module_inject/auto_ep_config.py changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 73 in auto_ep_config.validate_autoep_config at line 105. 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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 00:08:46 \u002B00:00\u0027 --until=\u00272026-11-14 00:08:46 \u002B00:00\u0027 --full-history --no-merges -- deepspeed/module_inject/auto_ep_config.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":"deepspeed/module_inject/auto_ep_config.py"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"769fcbe9289b0b3ba726195fb379a57d01d1de79010807ecb62e06236910d27b"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: deepspeed/module_inject/layers.py: deepspeed/module_inject/layers.py changed 16 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 25 in layers.collect_autotp_universal_checkpoint_info at line 695. 2 of those changes were fix/bug commits, and the other 14 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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 00:08:46 \u002B00:00\u0027 --until=\u00272026-11-14 00:08:46 \u002B00:00\u0027 --full-history --no-merges -- deepspeed/module_inject/layers.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":"deepspeed/module_inject/layers.py"},"region":{"startLine":695}}}],"partialFingerprints":{"codehealthFindingId/v1":"2daed4e523f85c3199a5a66e449d3bed0ece38d10d006fa9fc652d3a8841d4b2"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: deepspeed/runtime/zero/partition_parameters.py: deepspeed/runtime/zero/partition_parameters.py changed 11 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 32 in Init.__init__ at line 955. 1 of those changes was a fix/bug commit, and the other 10 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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 00:08:46 \u002B00:00\u0027 --until=\u00272026-11-14 00:08:46 \u002B00:00\u0027 --full-history --no-merges -- deepspeed/runtime/zero/partition_parameters.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":"deepspeed/runtime/zero/partition_parameters.py"},"region":{"startLine":955}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb28e8e7b3aac66e404916d6c1872b628110c6c93ebfdcbe8a5c0154316827da"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: deepspeed/module_inject/auto_tp.py: deepspeed/module_inject/auto_tp.py changed 12 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 28 in AutoTP._replace_module at line 1057. 2 of those changes were fix/bug commits, and the other 10 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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 00:08:46 \u002B00:00\u0027 --until=\u00272026-11-14 00:08:46 \u002B00:00\u0027 --full-history --no-merges -- deepspeed/module_inject/auto_tp.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":"deepspeed/module_inject/auto_tp.py"},"region":{"startLine":1057}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c8c28b1aa616db66277bf531a801f681b27d1994c8778af4c2f50f47e4bf652"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: deepspeed/runtime/utils.py: deepspeed/runtime/utils.py changed 11 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 28 in utils.clip_grad_norm_ at line 358. 1 of those changes was a fix/bug commit, and the other 10 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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 00:08:46 \u002B00:00\u0027 --until=\u00272026-11-14 00:08:46 \u002B00:00\u0027 --full-history --no-merges -- deepspeed/runtime/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":"deepspeed/runtime/utils.py"},"region":{"startLine":358}}}],"partialFingerprints":{"codehealthFindingId/v1":"877e06e374a143a9786e0e08ada285b2b75fe219707fa7129d3a291c2b186f67"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: ci/torch_latest.py: ci/torch_latest.py changed 16 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in torch_latest.wait_for_ssm_command at line 1476. 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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 00:08:46 \u002B00:00\u0027 --until=\u00272026-11-14 00:08:46 \u002B00:00\u0027 --full-history --no-merges -- ci/torch_latest.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":"ci/torch_latest.py"},"region":{"startLine":1476}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3df2913262f3b6e480f68a19ce224190908a499847b171be36fb93b10abf8e5"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: deepspeed/module_inject/replace_module.py: deepspeed/module_inject/replace_module.py changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 33 in replace_module.replace_transformer_layer at line 181. 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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 00:08:46 \u002B00:00\u0027 --until=\u00272026-11-14 00:08:46 \u002B00:00\u0027 --full-history --no-merges -- deepspeed/module_inject/replace_module.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":"deepspeed/module_inject/replace_module.py"},"region":{"startLine":181}}}],"partialFingerprints":{"codehealthFindingId/v1":"48eb7e8918fd8f9f45022bc4ae5fc4bddee3b8e016e24d67cd2d3c115253ef4d"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: deepspeed/checkpoint/ds_to_universal.py: deepspeed/checkpoint/ds_to_universal.py changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 31 in ds_to_universal.main at line 1140. 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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 00:08:46 \u002B00:00\u0027 --until=\u00272026-11-14 00:08:46 \u002B00:00\u0027 --full-history --no-merges -- deepspeed/checkpoint/ds_to_universal.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":"deepspeed/checkpoint/ds_to_universal.py"},"region":{"startLine":1140}}}],"partialFingerprints":{"codehealthFindingId/v1":"01dbc409dca7377bcc72699f81b6074247493e7aac9268e42d3339bb9526725d"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: deepspeed/module_inject/auto_ep.py: deepspeed/module_inject/auto_ep.py changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 39 in AutoEP.ep_parser at line 417. 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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 00:08:46 \u002B00:00\u0027 --until=\u00272026-11-14 00:08:46 \u002B00:00\u0027 --full-history --no-merges -- deepspeed/module_inject/auto_ep.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":"deepspeed/module_inject/auto_ep.py"},"region":{"startLine":417}}}],"partialFingerprints":{"codehealthFindingId/v1":"ebecab5b143534359e242269e7581b347c82bcecaafbc67b67be1764db0460d7"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: deepspeed/checkpoint/affine.py: deepspeed/checkpoint/affine.py changed 9 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 20 in ParamAffineMap._validate_destinations at line 269. 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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 00:08:46 \u002B00:00\u0027 --until=\u00272026-11-14 00:08:46 \u002B00:00\u0027 --full-history --no-merges -- deepspeed/checkpoint/affine.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":"deepspeed/checkpoint/affine.py"},"region":{"startLine":269}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b90fe03c0d7e6ed91e0dc1efac63e0fd5a1b1a3b4f03eb0fef735d2e3b2adb7"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: deepspeed/checkpoint/universal_checkpoint.py: deepspeed/checkpoint/universal_checkpoint.py changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 25 in universal_checkpoint.load_hp_checkpoint_state at line 236. 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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 00:08:46 \u002B00:00\u0027 --until=\u00272026-11-14 00:08:46 \u002B00:00\u0027 --full-history --no-merges -- deepspeed/checkpoint/universal_checkpoint.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":"deepspeed/checkpoint/universal_checkpoint.py"},"region":{"startLine":236}}}],"partialFingerprints":{"codehealthFindingId/v1":"9fa0ca0095b77c9f4e7537c3070dfab27593b45bbc8d3cf73066ed541016947f"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: deepspeed/runtime/fp16/fused_optimizer.py: deepspeed/runtime/fp16/fused_optimizer.py changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 30 in FP16_Optimizer.step at line 256. 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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 00:08:46 \u002B00:00\u0027 --until=\u00272026-11-14 00:08:46 \u002B00:00\u0027 --full-history --no-merges -- deepspeed/runtime/fp16/fused_optimizer.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":"deepspeed/runtime/fp16/fused_optimizer.py"},"region":{"startLine":256}}}],"partialFingerprints":{"codehealthFindingId/v1":"d57b86c2d77a2eb5a83180c5f262423e6b9fc6b03d4b6694183eccbfc55453a3"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: op_builder/builder.py: op_builder/builder.py changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in OpBuilder.simd_width at line 529. 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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 00:08:46 \u002B00:00\u0027 --until=\u00272026-11-14 00:08:46 \u002B00:00\u0027 --full-history --no-merges -- op_builder/builder.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":"op_builder/builder.py"},"region":{"startLine":529}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f8f3d1a4c2a16ebb5b2171940849b93d274072e2488ac4908d002a9dd301209"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: deepspeed/__init__.py: deepspeed/__init__.py changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in deepspeed.initialize at line 433. 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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 00:08:46 \u002B00:00\u0027 --until=\u00272026-11-14 00:08:46 \u002B00:00\u0027 --full-history --no-merges -- deepspeed/__init__.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":"deepspeed/__init__.py"},"region":{"startLine":433}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f013d6286048492b392eb3708d597144c775d0c0835c9ebfabb17cda7f7c81c"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: deepspeed/sequence/cross_entropy.py: deepspeed/sequence/cross_entropy.py changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 20 in cross_entropy.vocab_parallel_cross_entropy at line 198. 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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 00:08:46 \u002B00:00\u0027 --until=\u00272026-11-14 00:08:46 \u002B00:00\u0027 --full-history --no-merges -- deepspeed/sequence/cross_entropy.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":"deepspeed/sequence/cross_entropy.py"},"region":{"startLine":198}}}],"partialFingerprints":{"codehealthFindingId/v1":"c66bebeae51d9a80a8802fd0494bb491bc70ed16fec057451822640a1e713977"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: deepspeed/sequence/fpdt_layer.py: deepspeed/sequence/fpdt_layer.py changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in _FPDTGPUOffloadingAttentionImpl_.backward at line 839. 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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 00:08:46 \u002B00:00\u0027 --until=\u00272026-11-14 00:08:46 \u002B00:00\u0027 --full-history --no-merges -- deepspeed/sequence/fpdt_layer.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":"deepspeed/sequence/fpdt_layer.py"},"region":{"startLine":839}}}],"partialFingerprints":{"codehealthFindingId/v1":"6baa69d50d277e8b9d2fc48d1195effa9481b5b46a2252770d92eafe8fb46136"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: deepspeed/runtime/activation_checkpointing/checkpointing.py: deepspeed/runtime/activation_checkpointing/checkpointing.py changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 21 in CheckpointFunction.forward at line 579. 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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 00:08:46 \u002B00:00\u0027 --until=\u00272026-11-14 00:08:46 \u002B00:00\u0027 --full-history --no-merges -- deepspeed/runtime/activation_checkpointing/checkpointing.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":"deepspeed/runtime/activation_checkpointing/checkpointing.py"},"region":{"startLine":579}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5b46ad217d1f9766c6905fe3356f92188d9eecf73d78a6e560515c433890be0"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: deepspeed/compile/init_z3.py: deepspeed/compile/init_z3.py changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 27 in init_z3.init_z3 at line 87. 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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 00:08:46 \u002B00:00\u0027 --until=\u00272026-11-14 00:08:46 \u002B00:00\u0027 --full-history --no-merges -- deepspeed/compile/init_z3.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":"deepspeed/compile/init_z3.py"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8a4036aac86e74761a03eb84027d8eadd169626baab7183afb05579fcb9f311"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: deepspeed/compile/init_z1_and_2.py: deepspeed/compile/init_z1_and_2.py changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in init_z1_and_2.init_z1_and_2 at line 100. 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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 00:08:46 \u002B00:00\u0027 --until=\u00272026-11-14 00:08:46 \u002B00:00\u0027 --full-history --no-merges -- deepspeed/compile/init_z1_and_2.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":"deepspeed/compile/init_z1_and_2.py"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"8218b42295c085733b100aa99ab1fa5ac1300107d46e00c708a3fa52a7a2b143"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: deepspeed/runtime/zero/muon/muon_optimizer.py: deepspeed/runtime/zero/muon/muon_optimizer.py changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 24 in MuonWithAuxAdam.step at line 57. 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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 00:08:46 \u002B00:00\u0027 --until=\u00272026-11-14 00:08:46 \u002B00:00\u0027 --full-history --no-merges -- deepspeed/runtime/zero/muon/muon_optimizer.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":"deepspeed/runtime/zero/muon/muon_optimizer.py"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"856a8c1d01afb95cad5922743d0202406c475541bb686c3160a00f92190b10f8"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: deepspeed/compile/profilers/graph_profile.py: deepspeed/compile/profilers/graph_profile.py changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 22 in ProfilingInterpreter.run_node at line 256. 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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 00:08:46 \u002B00:00\u0027 --until=\u00272026-11-14 00:08:46 \u002B00:00\u0027 --full-history --no-merges -- deepspeed/compile/profilers/graph_profile.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":"deepspeed/compile/profilers/graph_profile.py"},"region":{"startLine":256}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e67399e14413fed51c310d700f4dc4efb6f6effaede4ef632d11e4ec7582bcc"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: deepspeed/compile/passes/offload_activation.py: deepspeed/compile/passes/offload_activation.py changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 21 in offload_activation._eligible_activations at line 396. 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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 00:08:46 \u002B00:00\u0027 --until=\u00272026-11-14 00:08:46 \u002B00:00\u0027 --full-history --no-merges -- deepspeed/compile/passes/offload_activation.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":"deepspeed/compile/passes/offload_activation.py"},"region":{"startLine":396}}}],"partialFingerprints":{"codehealthFindingId/v1":"8230d46fed610f9bb74393a8a083d2aa7efdf6ed39d2f09459c643cedcf1e1a7"}},{"ruleId":"D16","level":"note","message":{"text":"Off-boarding risk: anonymized user #1: If anonymized user #1 becomes unavailable, 7 significant file(s) lose their only recent owner: deepspeed/inference/v2/model_implementations/inference_transformer_base.py, deepspeed/inference/v2/model_implementations/mixtral/model.py, deepspeed/inference/v2/model_implementations/qwen_v2/model.py, deepspeed/inference/v2/model_implementations/llama_v2/model.py, deepspeed/inference/v2/model_implementations/mistral/model.py, deepspeed/inference/v2/model_implementations/phi3/model.py, deepspeed/inference/v2/model_implementations/phi/model.py. Pair on, review, or document these before any departure."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"b7c3dc7af4389e7a0d8744af67e681e8e4badd8ea5ad3504a9c8056626df0f51"}},{"ruleId":"D16","level":"note","message":{"text":"Off-boarding risk: anonymized user #2: If anonymized user #2 becomes unavailable, 5 significant file(s) lose their only recent owner: deepspeed/module_inject/auto_ep_comm.py, deepspeed/ops/triton_ops/fused_rotary_pos_emb.py, deepspeed/ops/triton_ops/fused_rms_norm.py, deepspeed/runtime/chunked_cross_entropy.py, deepspeed/runtime/python_gc.py. Pair on, review, or document these before any departure."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"dc7f345c73353ae97fcd10b5952392117c8e068d46bb2841183b13484490fa63"}},{"ruleId":"D16","level":"note","message":{"text":"Off-boarding risk: anonymized user #3: If anonymized user #3 becomes unavailable, 4 significant file(s) lose their only recent owner: op_builder/npu/inference.py, op_builder/npu/quantizer.py, op_builder/npu/fused_lamb.py, op_builder/npu/fused_lion.py. Pair on, review, or document these before any departure."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"edd4e2becf2a8f26022b8b6fdbb28783e40d7ac01829007fe7499c2d065d1b42"}},{"ruleId":"D16","level":"note","message":{"text":"Off-boarding risk: anonymized user #4: If anonymized user #4 becomes unavailable, 4 significant file(s) lose their only recent owner: deepspeed/ops/transformer/inference/op_binding/workspace.py, deepspeed/inference/v2/model_implementations/inference_model_base.py, deepspeed/runtime/rollout/opsd.py, deepspeed/runtime/rollout/continuous_batching.py. Pair on, review, or document these before any departure."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"026e30595f0a7dae2eee0a27a8cf682e71392a35419fa7efb7d7c0fc4bc3a3ed"}},{"ruleId":"D16","level":"note","message":{"text":"Off-boarding risk: anonymized user #5: If anonymized user #5 becomes unavailable, 3 significant file(s) lose their only recent owner: deepspeed/runtime/tensor_parallel/init_utils.py, deepspeed/checkpoint/zero_checkpoint.py, deepspeed/runtime/torch_autocast.py. Pair on, review, or document these before any departure."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"bba97f295ae1d32a4f56c7ea4e4dd4f5122aab8d1bd13b27d2feaaaeef374a4d"}},{"ruleId":"D16","level":"note","message":{"text":"Further sole-owners (lower concentration): 9 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 (34 single-owned of 422 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; 422 of the 794 production source files in this repository met that bar). They are anonymized user #6 (2 file(s)), anonymized user #7 (2 file(s)), anonymized user #8 (1 file(s)), anonymized user #9 (1 file(s)), anonymized user #10 (1 file(s)), anonymized user #11 (1 file(s)) (\u002B3 more) \u2014 spread or document their files in the same way, at lower priority than the named off-boarding risks above. The files folded here: deepspeed/runtime/keep_in_fp32.py, deepspeed/module_inject/auto_ep_presets/minimax_m3.py, deepspeed/runtime/tensor_parallel/tp_manager.py, deepspeed/utils/zero_to_torch.py, deepspeed/runtime/activation_checkpointing/offload_activations.py, deepspeed/checkpoint/autoep_affine.py, deepspeed/ops/transformer/inference/triton/triton_matmul_kernel.py, deepspeed/io/fast_file_writer.py (\u002B3 more)."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"6eac528f2429e724e1a97ed868f79eefbcf1888dab4af9a9e673429369bb5b2f"}},{"ruleId":"D17","level":"warning","message":{"text":"XxxComment: # XXX: ideally refactor with the 2_param_group test as 75% is the same \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/unit/v1/zero/test_zero.py"},"region":{"startLine":433}}}],"partialFingerprints":{"codehealthFindingId/v1":"9264c2fef2b99a696a648bbbb63aaf8c036a8e451136dec03a45a7a310041525"}},{"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/unit/v1/zero/test_zero.py"},"region":{"startLine":525}}}],"partialFingerprints":{"codehealthFindingId/v1":"977fe86ce397d901ebaa87658366320055263650335e184b8277c7476b2f139a"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO. add testing for this - for now we just call it to make sure 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/unit/v1/zero/test_zero.py"},"region":{"startLine":1162}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef60bf98f030b53d33274ed585a764e15bcd95fc73e62aa0f3ee82f89bd55d0e"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO. add testing for this - for now we just call it to make sure 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/unit/v1/zero/test_zero.py"},"region":{"startLine":1551}}}],"partialFingerprints":{"codehealthFindingId/v1":"576aa797b1c5c0e222f3d6df41335d08b5b03f64e03aaaf30b1d4807f54760e3"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO. finish writing 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/unit/v1/zero/test_zero.py"},"region":{"startLine":1324}}}],"partialFingerprints":{"codehealthFindingId/v1":"06f9e79073dce12d6e2911a1670b0af13153402e76c2fdc3a9ee39928f02689d"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: replace this with a true parallel mlp 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/unit/v1/moe/test_moe_tp.py"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8b2b6619e9eee989326ebec977bcd6c3b14eb1219e22ac95dc0e0a7b8c9f495"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: integrated testing of TP and ZeRO 1/2/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/unit/v1/autotp/test_configurable_parallel_mp.py"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"d335c469586c88555679e8d56a8f6ac580819f159fc549de216ed70d23fe8b01"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: no way to set DeepSpeedEngine.deepspeed_io params, need to 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/unit/runtime/test_data.py"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"618a0f83e3715387b90056d6028339ecd4255ad51894dbc2dc354756648ba3d8"}},{"ruleId":"D17","level":"warning","message":{"text":"XxxComment: # XXX: the bf16 path w/ no optimizer needs to be 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/unit/runtime/test_ds_config_dict.py"},"region":{"startLine":510}}}],"partialFingerprints":{"codehealthFindingId/v1":"04d5cdcb70f0f79c40e8c2c1b49f052ca9d96a33d90f85a9513653a0b30dac88"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: Combination of shared_loss==True and bf16.immediate_grad_update==False is currently broken \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/unit/runtime/test_multiple_models.py"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2db016f82d0c81b67a4477e1af15886d5987436cb5b6fc4fceb4576a442587e"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: This should be on the engine? There needs to be a better way. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/unit/runtime/zero/test_nvme_checkpointing.py"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1863b7cab56b9bb14cd34021d6a346104f3b0b51a451ef058e836cd3641d149"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: add tests with model parallelism for activation partitioning and other features. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/unit/runtime/activation_checkpointing/test_activation_checkpointing.py"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"fcde03a062980e37219354b99743c44f8c44c6a5bc6346bfc8825645e88d079c"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: add tests with model parallelism for activation partitioning and other features. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/unit/runtime/activation_checkpointing/test_activation_checkpointing_non_reentrant.py"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b5a564656a8bc5cd130909b4c9f368298f0c380019a73f03c3af1bac6cafbf0"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # of the reference to match our kernel implementation (TODO(cmikeh2)) \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/unit/ops/transformer/inference/test_residual_add.py"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"3eadd4b11be09b41b9c69e3a11a38a7eba9b5ff8dae20f0a0e91f91252972469"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: remove this when neox issues 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/unit/inference/test_inference.py"},"region":{"startLine":282}}}],"partialFingerprints":{"codehealthFindingId/v1":"904013142cf263b82fff461da94cc0c8fa943072f962833f95c27e0b08efc8a8"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: clean-up this requirement, the unique name should not be required 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/unit/checkpoint/test_moe_checkpoint.py"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"865f5f1e0a055daca4c66c4d75ceb7cccd82e47dd1f90010d2fa495a319eb12c"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # NOTE: TODO if lr is updated every step, then we need to convert it as tensor 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":"op_builder/hpu/fused_adam.py"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"733dbc5d0375ba028aba28a4a98cb0d26e3e0b43f79a59045550f22969c9710d"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: add soft compatibility check for private binary release. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"op_builder/cpu/comm.py"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"a82b89db143813deb96de0947a02c1c06f1612deb3d3fd2728ffbc5f58b0fc57"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: Move tensor fragment and mixed precision to zero utils \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"deepspeed/utils/__init__.py"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"4cb8c8ed182fbf87ed76979275a6ec2a2bdb4c59e5f3fc383c3fc33bf67ac63a"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: Add to tensorboard \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"deepspeed/utils/comms_logging.py"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"9bb26da024200edde569f3b13a30492614d7a833fd109423ca42ee4a3ad462d5"}},{"ruleId":"D17","level":"warning","message":{"text":"XxxComment: # XXX: can probably make a map of param2module and vice-versa \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"deepspeed/utils/debug.py"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5affe33c479a300d2d2202268dd0faa8ef8529b57d9fae16dc1b54a0cd5818e"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: Figure out the correct return 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":"deepspeed/utils/tensor_fragment.py"},"region":{"startLine":207}}}],"partialFingerprints":{"codehealthFindingId/v1":"94cd61b1d9e99f245b29d4b15a3bea7f39b05ef4ed06d7063e77d50a9869125a"}},{"ruleId":"D17","level":"warning","message":{"text":"XxxComment: # XXX: need to test that this simple glob rule works for multi-node setup 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":"deepspeed/utils/zero_to_fp32.py"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1d10f5bd4e50d5d815d0ff4a72633c36f43d202b1ec9e06cae6a7634b74ccee"}},{"ruleId":"D17","level":"warning","message":{"text":"XxxComment: # XXX: document 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":"deepspeed/utils/zero_to_fp32.py"},"region":{"startLine":316}}}],"partialFingerprints":{"codehealthFindingId/v1":"86c2c234401d63aa24e21c3128ef51d29198972902c17e159cdee27f1cc3a166"}},{"ruleId":"D17","level":"warning","message":{"text":"XxxComment: # XXX: memory usage doubles here (zero2) \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"deepspeed/utils/zero_to_fp32.py"},"region":{"startLine":323}}}],"partialFingerprints":{"codehealthFindingId/v1":"1861589ffcfbfe6a3a09fe0e054dce48de41fb76bcfc1e2e360d58262ddbdf3d"}},{"ruleId":"D17","level":"warning","message":{"text":"XxxComment: # XXX: for huge models that can\u0027t fit into the host\u0027s RAM we will have to recode this 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":"deepspeed/utils/zero_to_fp32.py"},"region":{"startLine":341}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e140fedbf85a4d8d4d7c408422d457b200f82e40b6f15d3c1815ef62f542ce0"}},{"ruleId":"D17","level":"warning","message":{"text":"XxxComment: # XXX: for huge models that can\u0027t fit into the host\u0027s RAM we will have to recode this 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":"deepspeed/utils/zero_to_fp32.py"},"region":{"startLine":532}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2d1f82b44a969beac64685e552888e79e6e2d9c8b6796d39f97f5d19659ca0d"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO Merge three alltoall calls into 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":"deepspeed/sequence/layer.py"},"region":{"startLine":566}}}],"partialFingerprints":{"codehealthFindingId/v1":"efba5cc778047705293f78d2ff550881bb5334cb77bb8b91af6b9ba223e019a9"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO (Reza): change the api on the megatron-deepspeed side so that we only receive all data (q,k, and v) together! \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"deepspeed/sequence/layer.py"},"region":{"startLine":567}}}],"partialFingerprints":{"codehealthFindingId/v1":"73b13809199aad6c4ea4a8924f5a1e37e06d07eb127b9ddcf73ca7e73c9a0d58"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: Allreduce/average them across ranks for more accurate timing. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"deepspeed/runtime/engine.py"},"region":{"startLine":3137}}}],"partialFingerprints":{"codehealthFindingId/v1":"8fe21d74271079127f9f2c8ffbe38da17363d1b04d6a592da858e3ba3f3c4c3a"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: handle these scaling with direct calls to loss.backward() \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"deepspeed/runtime/engine.py"},"region":{"startLine":3499}}}],"partialFingerprints":{"codehealthFindingId/v1":"3857f2a51024213aa7f139dd5b2b497d318d62e53cdb8e5acefa6f6016efa5f3"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: Temporary until bf16_optimizer and zero_optimizer are integrated \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"deepspeed/runtime/engine.py"},"region":{"startLine":3607}}}],"partialFingerprints":{"codehealthFindingId/v1":"36fbd9650eac3f8d4a96a32dd125e0bd10e85f0ec4d8eb026d58b63b84e8c740"}},{"ruleId":"D17","level":"warning","message":{"text":"XxxComment: # XXX Hack to work with Megatron 2.0 and DeepSpeed pipelines. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"deepspeed/runtime/engine.py"},"region":{"startLine":3630}}}],"partialFingerprints":{"codehealthFindingId/v1":"7cb199d3a049c81c71c7a61f46ca69c0b697c66bc36526f84ba66b882265a48e"}},{"ruleId":"D17","level":"warning","message":{"text":"XxxComment: # XXX Hack to work with Megatron 2.0 and DeepSpeed pipelines. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"deepspeed/runtime/zenflow/engine.py"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"94c2b849d3f8d16969efba1d715d5606b74c36077e27d2d066c190ed94c3afd9"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: Delay self.global_steps increment until very end of 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":"deepspeed/runtime/engine.py"},"region":{"startLine":3665}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec2b2e8ca594c8f2e391ca8e3d002d9fd28ab0066587d6ef8d87f3b68e1aa4fc"}},{"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":"deepspeed/runtime/engine.py"},"region":{"startLine":4375}}}],"partialFingerprints":{"codehealthFindingId/v1":"ccd3a2ffaf1a3112ba7fce2c51fa15ac317a4c9cfa3268c47ddf3f13129791bb"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: why use BufferedWriter not the 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":"deepspeed/runtime/engine.py"},"region":{"startLine":5387}}}],"partialFingerprints":{"codehealthFindingId/v1":"4eaacb6e697ffd1b33e26127a9fc4b87b861a61c8d77407900d247b66acf65ca"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(cmikeh2) Evaluate if this can be deferred when release_inference_cache \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"deepspeed/runtime/hybrid_engine.py"},"region":{"startLine":275}}}],"partialFingerprints":{"codehealthFindingId/v1":"39711a0b7df0b41c3f395ea26b998d7964e372f2f86f3aec0010e4b6aa691d45"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: Avoid using global variables \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"deepspeed/runtime/torch_autocast.py"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"eabae81916156fc23a3cff9c932c0e827690a4a89d37cc725c276341c5b11fae"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: I don\u0027t think reduce_overflow is needed if mpu is 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":"deepspeed/runtime/utils.py"},"region":{"startLine":260}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b7fba8c598393f2c876af075c1295e3adfdc488c3ca85f74ee3cb31d013a2ba"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: support shuffle between different partition granularities \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"deepspeed/runtime/utils.py"},"region":{"startLine":775}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f721bd0553813d2b17695430b6fe36da5257089be705370ec0ac5f642bcef85"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO Delay error checking for dangling partitioned parameters to post module 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":"deepspeed/runtime/zero/partition_parameters.py"},"region":{"startLine":450}}}],"partialFingerprints":{"codehealthFindingId/v1":"381e628fece411f017cebfad3edd5aa3556351666040d9c495b00bfdfb19ce3b"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: This is a temporary fix to avoid the issue that 2nd tensor all-gather happens before 2nd tensor partition is done \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"deepspeed/runtime/zero/partition_parameters.py"},"region":{"startLine":1931}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c0cf29ed3c1b5e28633c1939367c809fc4f7285cdd787ca478a477adea9de9e"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO. make this configurable via JSON \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"deepspeed/runtime/zero/partitioned_param_coordinator.py"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"225595e82526b7624d4c21b1f4964df344c3535baf11bea1ff5cef001a0ff9e2"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO. make this configurable via JSON \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"deepspeed/runtime/zero/stage3.py"},"region":{"startLine":473}}}],"partialFingerprints":{"codehealthFindingId/v1":"9dcdc8fcf68c5d38c3bdd9b19cb34d07bb6fef904222c7c26607b3f7939c5a7d"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO. make this throw if there are still active submodules. 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":"deepspeed/runtime/zero/partitioned_param_coordinator.py"},"region":{"startLine":543}}}],"partialFingerprints":{"codehealthFindingId/v1":"1eab187ed26d0d8011fd550130f092a0969f8acbc915d73b98bc4ac847f12bf6"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # - flat by groups, not keeping state. TODO: remove state explicitly? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"deepspeed/runtime/zero/stage3.py"},"region":{"startLine":223}}}],"partialFingerprints":{"codehealthFindingId/v1":"c67a56b902334be403e985404bd06f68fda058ff6dded6863f1aabc65c75a663"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # - flat by groups, not keeping state. TODO: remove state explicitly? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"deepspeed/runtime/zero/stage_1_and_2.py"},"region":{"startLine":258}}}],"partialFingerprints":{"codehealthFindingId/v1":"a42a20e1a33aaaaf8ff344fed6d776fcce3e1077b9a8cbe6f68e5c985936c075"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # - master grad and unflat master weight never exist. TODO: a way to save out unflat master? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"deepspeed/runtime/zero/stage3.py"},"region":{"startLine":224}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e3a57e4087b9f47f7281e0d8afbd9eab6419d50887174691b93fda555491c28"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # - master grad and unflat master weight never exist. TODO: a way to save out unflat master? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"deepspeed/runtime/zero/stage_1_and_2.py"},"region":{"startLine":259}}}],"partialFingerprints":{"codehealthFindingId/v1":"59dd8dde3c51b8cc3f6a193a4462305180ad0114a8499ed6d4d811cd561e0767"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: Support different/changing load/save DP degree. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"deepspeed/runtime/zero/stage3.py"},"region":{"startLine":3805}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0a921a8d929df6c42bb84636a11c482440ebfff5513e92982d5697470bd3ea0"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: Remove zenflow-specific call from vanilla ZeroOptimizer, try to isolate zenflow-specific code into sub-class zenflow_zero_optimizer \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"deepspeed/runtime/zero/stage_1_and_2.py"},"region":{"startLine":229}}}],"partialFingerprints":{"codehealthFindingId/v1":"550e84bda943ec069f4cd28d73aa42bb32f1283d89bd2800f4da213078288b28"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: Explore simplification that avoids the extra book-keeping by pushing the reordered 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":"deepspeed/runtime/zero/stage_1_and_2.py"},"region":{"startLine":429}}}],"partialFingerprints":{"codehealthFindingId/v1":"4023c9c4115cf39d6954f8d86ac38f5af0f7dbf2aea8b6ea92d9b51548c9449f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: copy_grad_stream is disabled because of race with reduce. This hurts perf and should be 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":"deepspeed/runtime/zero/stage_1_and_2.py"},"region":{"startLine":2319}}}],"partialFingerprints":{"codehealthFindingId/v1":"3147042afd3fcdbaa9b53d7f5a57ccf9b735f57017a76a05eab7c3451f229699"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: Remove zenflow-specific call from vanilla ZeroOptimizer \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"deepspeed/runtime/zero/stage_1_and_2.py"},"region":{"startLine":3082}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4c22379156e098d281b7d9aa258dd9d25350ebdbe5c85b1b46b50c4598a91f6"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: we probably don\u0027t need this? just to be safe \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"deepspeed/runtime/zero/stage_1_and_2.py"},"region":{"startLine":3270}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8f49410e28b7696eb5fe3f5d93ed921ee3bdb5891d4aa5de215246550797678"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: we probably don\u0027t need this? just to be safe \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"deepspeed/runtime/zenflow/zenflow_stage_1_and_2.py"},"region":{"startLine":749}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ed57cd52fb9f539b8a7469f168ec6903e563569a618507e058cb0b1f32f17f2"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: we probably don\u0027t need this? just to be safe \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"deepspeed/runtime/fp16/fused_optimizer.py"},"region":{"startLine":198}}}],"partialFingerprints":{"codehealthFindingId/v1":"57381f8e316ee7e6c2860f58e443f2e39c399807e3693f15bcd4a5fb6e473a1d"}},{"ruleId":"D17","level":"warning","message":{"text":"XxxComment: # XXX: could move this somewhere to do it only once per run \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"deepspeed/runtime/sequence_parallel/ulysses_sp.py"},"region":{"startLine":310}}}],"partialFingerprints":{"codehealthFindingId/v1":"27797088f2a688ae235a2707ade20307d2bcd862d6e31d9bec02fe9117cd2a43"}},{"ruleId":"D17","level":"warning","message":{"text":"XxxComment: # XXX: currently hardcodes a causal mask_mod \u2014 models with sliding window or 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":"deepspeed/runtime/sequence_parallel/ulysses_sp.py"},"region":{"startLine":317}}}],"partialFingerprints":{"codehealthFindingId/v1":"87dd5fb792df11c571fbcedb022c6242e41e4ab2cc12a14c107ea521ae75b4dd"}},{"ruleId":"D17","level":"warning","message":{"text":"XxxComment: # XXX: replace with more efficient all-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":"deepspeed/runtime/sequence_parallel/ulysses_sp.py"},"region":{"startLine":654}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4f15fa07152b064492b56eecdbdebbb1eb7f5d704606a89b54978587ca12d3b"}},{"ruleId":"D17","level":"warning","message":{"text":"XxxComment: # XXX: DDP, FSDP will need something similar to make it 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":"deepspeed/runtime/sequence_parallel/ulysses_sp.py"},"region":{"startLine":1046}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb549bbf8a301e3f29d400546b5930b7d24e4e3e621a0c854097d6944301b478"}},{"ruleId":"D17","level":"warning","message":{"text":"XxxComment: # XXX: DDP, FSDP will need something similar to make it 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":"deepspeed/runtime/sequence_parallel/ulysses_sp.py"},"region":{"startLine":1177}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a45ff20201b2a3c05b6edf133a46be9d5b9427b568a7168adb8b79bd7706c65"}},{"ruleId":"D17","level":"warning","message":{"text":"XxxComment: # XXX: deal with the use case of running in inference mode, where we don\u0027t need backward \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"deepspeed/runtime/sequence_parallel/ulysses_sp.py"},"region":{"startLine":1167}}}],"partialFingerprints":{"codehealthFindingId/v1":"20424a75a06aba88298aaee20debe65ac235bd9a386a40b03de8ce05a070689d"}},{"ruleId":"D17","level":"warning","message":{"text":"XxxComment: # XXX temporarily disable while I revert some partition hacks. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"deepspeed/runtime/pipe/engine.py"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"685083b005757c9db1e7682414bef730b563486dd8778d6f3278e51f0854993a"}},{"ruleId":"D17","level":"warning","message":{"text":"XxxComment: # XXX look into timer reporting timing \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"deepspeed/runtime/pipe/engine.py"},"region":{"startLine":237}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab728e722732cf80bc572f5e52944eefd77718ef0d052a193284d0691d281b7e"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: should return precisely what loss returned and allow others to be queried? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"deepspeed/runtime/pipe/engine.py"},"region":{"startLine":406}}}],"partialFingerprints":{"codehealthFindingId/v1":"92fe4af0bd1f8778a9e9f2fab399ab031c485faf82f29d7a430fe577a819fc86"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: Improve pipe partitioning to pass multiple tensors that require grads \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"deepspeed/runtime/pipe/engine.py"},"region":{"startLine":734}}}],"partialFingerprints":{"codehealthFindingId/v1":"1136f36b809468d403da466c512dd06dd343bcdde88767d743ce92774ec097b5"}},{"ruleId":"D17","level":"warning","message":{"text":"XxxComment: # XXX: torch 1.6.0 DataLoader will auto convert tuple to 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":"deepspeed/runtime/pipe/engine.py"},"region":{"startLine":916}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc01533312af05132c20af9e18e42bc85c38ca337de1ee1621a2526c09fe9719"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # messages (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":"deepspeed/runtime/pipe/engine.py"},"region":{"startLine":1023}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9e92c9c14a3be1986ab184e4266b1db32f2bb48b2f5fd821d8889a646347fb6"}},{"ruleId":"D17","level":"warning","message":{"text":"XxxComment: # XXX Terrible hack \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"deepspeed/runtime/pipe/engine.py"},"region":{"startLine":1073}}}],"partialFingerprints":{"codehealthFindingId/v1":"064424332b8efb9b3b180850a4d585d401736885e4c5b308c49eca2c5064f7e1"}},{"ruleId":"D17","level":"warning","message":{"text":"XxxComment: # XXX terrible hacky branch \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"deepspeed/runtime/pipe/engine.py"},"region":{"startLine":1087}}}],"partialFingerprints":{"codehealthFindingId/v1":"2db30b4d43ddba8175e4a9ec648829ab61061867aa3428aa70692c21ade3a4b6"}},{"ruleId":"D17","level":"warning","message":{"text":"XxxComment: # XXX hardcode meta 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":"deepspeed/runtime/pipe/engine.py"},"region":{"startLine":1126}}}],"partialFingerprints":{"codehealthFindingId/v1":"21cb2282ce4067b710b4810361104def8404a3ea25f3b50bbc58b3d3815d8c0f"}},{"ruleId":"D17","level":"warning","message":{"text":"XxxComment: # XXX these shapes are hardcoded for Megatron \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"deepspeed/runtime/pipe/engine.py"},"region":{"startLine":1155}}}],"partialFingerprints":{"codehealthFindingId/v1":"e05ff20d74361f0f215a9c741176859fbbb1bd9cb4ead44a365d6e848ec9d414"}},{"ruleId":"D17","level":"warning","message":{"text":"XxxComment: # XXX This is a HACK \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"deepspeed/runtime/pipe/engine.py"},"region":{"startLine":1173}}}],"partialFingerprints":{"codehealthFindingId/v1":"55c0b318cc04934fbe668e133c217813e9961e40e1b47c7d5a9bafb0690307bc"}},{"ruleId":"D17","level":"warning","message":{"text":"XxxComment: # XXX GPT-2 hack"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"deepspeed/runtime/pipe/engine.py"},"region":{"startLine":1204}}}],"partialFingerprints":{"codehealthFindingId/v1":"03b560210d39a68ae793b1516d0981d2217d854e9c1ad41e9fa487d484775af3"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: Would be nice to remove the nested data/model parallelism loops 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":"deepspeed/runtime/pipe/module.py"},"region":{"startLine":498}}}],"partialFingerprints":{"codehealthFindingId/v1":"a78da7c603cceb8e7b21e850f16d6e69fdca26e1a3dc7298295430a4cca3077d"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: instead generalize in some way, since we really just care about 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":"deepspeed/runtime/pipe/module.py"},"region":{"startLine":499}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c7fafbe3dd151a866b5cce584d09456467c93b39f4b9c31b4878fa8317373f2"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: stage that owns the tied layer. Then loop over each (dp, mp, ...) \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"deepspeed/runtime/pipe/module.py"},"region":{"startLine":500}}}],"partialFingerprints":{"codehealthFindingId/v1":"7632f85183a1cc9950a6970cccdcdc03e81491c9e8a8aec8ba56fdfba9261969"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: fiber to generate process 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":"deepspeed/runtime/pipe/module.py"},"region":{"startLine":501}}}],"partialFingerprints":{"codehealthFindingId/v1":"79e02af5a58c5837f41a39839255f8e93ff70072ea17e8cf9c1726285d0e4fcb"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: Need to validate interaction of checkpoint_parallel_write_pipeline and fastwriter \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"deepspeed/runtime/pipe/module.py"},"region":{"startLine":603}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc06ac0d8b6db878b0405d0ef6e5c2e9ae0253a665a3636577480ebd25a23f23"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO use process_group if provided \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"deepspeed/runtime/pipe/topology.py"},"region":{"startLine":275}}}],"partialFingerprints":{"codehealthFindingId/v1":"7657818fc8284b66859fde44bbeb25240a9d078dd28d75cd6863aec6a57556aa"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: it would be nice if topology had bcast semantics to avoid this branching \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"deepspeed/runtime/pipe/topology.py"},"region":{"startLine":346}}}],"partialFingerprints":{"codehealthFindingId/v1":"f217bae4e88911510782e2b46cbd8a08a6081b8b383b148a581a951b6a2a1e93"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: parse socket number from env. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"deepspeed/runtime/model_checkpointing/utils.py"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"1aa458f8baff984806f4bc51e04bb5715a5a07155bd897ceb7da5390d69ec604"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: Reducing config verbosity by returning None or {} when 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":"deepspeed/runtime/data_pipeline/config.py"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"7de42024a1570b2a2b4033b6f5ffac9e9be6960b9ea5382c2755fd9533565f8a"}},{"ruleId":"D17","level":"warning","message":{"text":"HackComment: # Hack just to make this work, can optimizer later if necessary \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":"deepspeed/runtime/data_pipeline/data_sampling/indexed_dataset.py"},"region":{"startLine":265}}}],"partialFingerprints":{"codehealthFindingId/v1":"bac4aa1feac3a3aa6e57eec2cf06af436295b681686a442ee598911c3ed062ba"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO we are copying all seqlens into memory, we should adapt the code to use an iterative streamer \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"deepspeed/runtime/data_pipeline/data_sampling/variable_batch_size_and_lr.py"},"region":{"startLine":402}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9fcc8dec355bd618945b2d9e2977ae22c60b59d1d44c3ebd3a6896bdd65a5ad"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: Add a more configurable tuning for selecting the best GeMM \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"deepspeed/ops/fp_quantizer/fp8_gemm_triton.py"},"region":{"startLine":159}}}],"partialFingerprints":{"codehealthFindingId/v1":"6fe2eaa96c954ea64598e264e99bee73e35c30fd2a1b176836029cbd5169bd56"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: revisit allreduce for moe.gate... \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"deepspeed/moe/experts.py"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf29982824d0cac11aa006b4912044bd04a506fbcb8b80aff226d75ad4b8fb9a"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: Create param groups to handle expert \u002B data case (e.g. param.group = moe_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":"deepspeed/moe/experts.py"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd66c1bde8494af1ba3f65a43e6ee2ff86da0ff51d38b078a964ab107249142d"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: consider the timing of deletion \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"deepspeed/module_inject/layers.py"},"region":{"startLine":648}}}],"partialFingerprints":{"codehealthFindingId/v1":"182a86718a83c6abf3bbefeb0e4afa0e7a66fcc94641e1c921c5a55babfb792d"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: Training scenario-related tests, is it necessary to re-implement the vocab parallel 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":"deepspeed/module_inject/layers.py"},"region":{"startLine":1769}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec3e5021b53d3d06b2e171cdbb92331637eb8385a6106d2d19acb12e780d5a27"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO (lekurile): This function exists in megatron feature container as well, consolidate as some point \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"deepspeed/module_inject/policy.py"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff09fd3f6fc7e5f893a9957bb17fd9eb1b19ae5ddee27819ae96bfd09cb66dd8"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # todo: Refactor later. In future, let\u0027s minimize the style used above and use config.** 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":"deepspeed/module_inject/replace_module.py"},"region":{"startLine":203}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f0812657d25f0241837a6c4d705027e86613a5717614570af05096ac4a44f67"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(cmikeh2): Re-enable this once verified \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"deepspeed/module_inject/containers/base.py"},"region":{"startLine":235}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb286f62d171808a8afc550c5c80407f8d9c4f5853d4a6fa03dff7ea265a4841"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(cmikeh2): Re-enable this once verified \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"deepspeed/module_inject/containers/features/hybrid_engine.py"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a09c3d430241e4358cbb1dd39f779098508d13bad921c1fbb92c855d258e1ed"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: Investigate root-cause and fix meta tensor loading \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"deepspeed/module_inject/containers/llama.py"},"region":{"startLine":161}}}],"partialFingerprints":{"codehealthFindingId/v1":"1415bce63be40fbc7303bd832a4ca13df4af249d10b9f76b74bf05040d15e78b"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: Megatron GPT MoE inherits from Megatron policy and replaces mlp \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"deepspeed/module_inject/containers/megatron_gpt.py"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5c825a8341c695f4f932d3e21ae802bea1440ace8a98f4ade6669fde905fed0"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: Megatron GPT MoE inherits from Megatron policy and replaces mlp \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"deepspeed/module_inject/containers/megatron_gpt_moe.py"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"1dc290255ba06d3f52503bf3d6bbab53e9d810ec489a05eaab24d5eef4ed767a"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: Generalize MoE overall goal, expand beyond Megatron \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"deepspeed/module_inject/containers/megatron_gpt.py"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba6a85158a22816131de08f8819c3cb98c9e9be0c75a73b205f7f08c4ac1eeff"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: Generalize MoE overall goal, expand beyond Megatron \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"deepspeed/module_inject/containers/megatron_gpt_moe.py"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b1f441dca692175b2a153369c8238a77f6cb5d038857fd489400acffd5ede22"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # todo: think and refactor this to be more 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":"deepspeed/module_inject/containers/megatron_gpt_moe.py"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"8af576351314fb010a568e055ce707ad3317c34a7b8dd13a275c4bb01e2fe652"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(cmikeh2): Enable cuda graph should be an inference configuration \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"deepspeed/module_inject/containers/unet.py"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ec3bfb7aa75c6e664dbaa2c03c36e3fee6002d06c68abf9b23a364e154e1120"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(cmikeh2): Enable cuda graph should be an inference configuration \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"deepspeed/module_inject/containers/vae.py"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad38fa82fffe209e506ab2610fc14099dfe380b7b809131bbb976a2efee3912c"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(arashb): \u0027layer_head_mask\u0027 and \u0027past_key_value\u0027 are only added to satisfy the OPT models 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":"deepspeed/model_implementations/transformers/ds_transformer.py"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"80fc4efcafc47ab471684d86673fecd359778b7c9e7ba6de93de9f1f7a7afba4"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: Need to eliminate this 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":"deepspeed/io/fast_file_writer.py"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"662e62719ed72e46ba97533c1b0470ef37d92464b2a3d78b11fcb16f895c94c1"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # todo: brainstorm on how to do ckpt loading for DS 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":"deepspeed/inference/config.py"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e0548c09fe67716241cf2ab4fb9d61598c7f22b54cc2799dd722ad804fb2ea2"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # todo: really no need for this field if we can refactor \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"deepspeed/inference/config.py"},"region":{"startLine":259}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8994a7ba210020f32cd43a016b25f7031b0ea776f97a2a28bf510204e19dce1"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # todo: keep this self.injection_dict because we don\u0027t use to change config.injection_policy 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":"deepspeed/inference/engine.py"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa79968ddde121a74b811b7d4fe08e75c898a74fd055f1f60e6419f2a67678ff"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # todo: this will get changed when Molly\u0027s PR on auto injection dict is merged \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"deepspeed/inference/engine.py"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c1c9442116dc5510f0fa1a5657456a8c2180e66b866af6a9c48a6effd9fc4d3"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # todo: refactor the mp_group and mp_size related in the next refactor \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"deepspeed/inference/engine.py"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2f740e7871f21d0364b153ac9d2d3e46dc87b7737bf6de0f2481ae2011a0ea5"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # todo: update with the new quant config for weight quant \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"deepspeed/inference/engine.py"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc057378cff1967325d80fc1f1fac909250aa9a40bf3ee53beccd37459f0dea0"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # todo: remove this once all the config dicts are centralized from top level pydantic 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":"deepspeed/inference/engine.py"},"region":{"startLine":207}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f22397ad171343fcee4d210f4acdd653507428a43698d23b8284b827fdf9a9c"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: generalize this to other models \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"deepspeed/inference/v2/engine_factory.py"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"c41e1955b593e3544f916de2b8497c9de77aa4a9cf4b567fcacb6f6d18dc2e3f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(cmikeh2): Change the weighting based on the type of the KV-cache \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"deepspeed/inference/v2/ragged/kv_cache.py"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8708380a6e63b239b6219a41805963a18d418790788c928d103f3a030fd83ea"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(cmikeh2): Debug call here might be unnecessary and is potentially on critical 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":"deepspeed/inference/v2/ragged/ragged_manager.py"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8c365cf59ae2e52a8489f541fea5ad57667ca2cd4205c327b8c585eeeb79efd"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(cmikeh2): Tune this approach. This is mainly a placeholder 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":"deepspeed/inference/v2/ragged/ragged_wrapper.py"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa5ad450585cc5d3cfe96ec45feb7107d86b8bed3a24775a4186770784a84d58"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: Get this off an engine 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":"deepspeed/inference/v2/modules/heuristics.py"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"c19d31d3985cf2bbf65c392852535f5428d012e762d01bf82752f58d19d56899"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(cmikeh2): How do we want to avoid the int32 vs int64 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":"deepspeed/inference/v2/modules/implementations/embedding/ragged_embedding.py"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"7dd4133d79afa6fda7f4c05f039e5b60f061e613ed0cd3078fc026ef9771c546"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(cmikeh2): Attention kernel gets created 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":"deepspeed/inference/v2/modules/implementations/attention/dense_blocked_attention.py"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"201d01ad7e2c9baab08813cdeae016d420cc00774740123acd79ae69ba743706"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(cmikeh2): Pre-allocate storage buffer for the attention atoms. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"deepspeed/inference/v2/modules/implementations/attention/dense_blocked_attention.py"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a4e0bb486edad983a21bc14bd61ce138e366d5fff060f8f0d55b76a6cf34492"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(cmikeh2): Kind of a hack right now, but this is too verbose to use 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":"deepspeed/inference/v2/model_implementations/inference_model_base.py"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0dc3436a13e17398d5e0df15f3ca64045d6b3d037e16eaf7202345b5f9d5777"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(cmikeh2): Kind of a hack right now, but this is too verbose to use 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":"deepspeed/inference/v2/model_implementations/inference_model_base.py"},"region":{"startLine":148}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f8b64fd8c8e9e7aa115a20b02b68a71bcbc665dcd3809eae19b5a1a803bbc9c"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(cmikeh2): SPLIT, error if more than 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":"deepspeed/inference/v2/model_implementations/layer_container_base.py"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"391ff075aede8e0314b53411459260ff3f7a5ec4b5d9ee6036e46dfe38b4aa45"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(cmikeh2): Do we want to make this a 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":"deepspeed/inference/v2/model_implementations/layer_container_base.py"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"45709fe6d9d80f7d14365feab053e675881d77ec41e576fae8148b5b276aeb8b"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: Refactor this with the help of cmikeh2 \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"deepspeed/inference/v2/model_implementations/layer_container_base.py"},"region":{"startLine":339}}}],"partialFingerprints":{"codehealthFindingId/v1":"38f405f6f50fa60ab3a4b01b42bd7520a826e8306b2acd8859b4097f860196a6"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(ZonePG): bf16 inference results may be different from huggingface 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":"deepspeed/inference/v2/model_implementations/qwen_v2_moe/model.py"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"0443871d4fac3b3bdd96e1721802d66ebabc67364a55494fc845eb53abdab083"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(ZonePG): bf16 inference results may be different from huggingface 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":"deepspeed/inference/v2/model_implementations/qwen_v2/model.py"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"30a4d12f8a64e4c445c73a96de2d2563a505e14b3fd90f717e7dadd527535788"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(ZonePG): bf16 inference results may be different from huggingface 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":"deepspeed/inference/v2/model_implementations/qwen/model.py"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5d179f118dc509e20f14f9646ef9d495551f1aa94498f9c48b0b9e666ada738"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(cmikeh2): Distribute ragged_batch_info to all 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":"deepspeed/inference/v2/model_implementations/qwen_v2_moe/model.py"},"region":{"startLine":292}}}],"partialFingerprints":{"codehealthFindingId/v1":"65a8902648df8ecaf7c37cac25c370f4533697035b50d2358cdb2780e0762a08"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(cmikeh2): Distribute ragged_batch_info to all 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":"deepspeed/inference/v2/model_implementations/qwen_v2/model.py"},"region":{"startLine":158}}}],"partialFingerprints":{"codehealthFindingId/v1":"bfd7e047a09502116cdbaa1f4aa8c911ae51a7b1ca163125f7326805a50eba28"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(cmikeh2): Distribute ragged_batch_info to all 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":"deepspeed/inference/v2/model_implementations/qwen/model.py"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"78e3e1c2d9a68556cd9a43ee88177fde99c2a3ede54b17df5ea07597ce09436a"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(cmikeh2): Distribute ragged_batch_info to all 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":"deepspeed/inference/v2/model_implementations/opt/model.py"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6ca97a999af254da283f9e6b00a25ceba999c34f58d182fd50a6a221a038c5b"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(cmikeh2): Distribute ragged_batch_info to all 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":"deepspeed/inference/v2/model_implementations/mixtral/model.py"},"region":{"startLine":200}}}],"partialFingerprints":{"codehealthFindingId/v1":"04832e84da78436b550aff7ca1d47378a3644736932ec6b53887cc9b220667a8"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(cmikeh2): Distribute ragged_batch_info to all 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":"deepspeed/inference/v2/model_implementations/mistral/model.py"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"be0a87179a74231ef29c3d3c9a7809a934714f5448f6b8a384e8cc864478fade"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(cmikeh2): Distribute ragged_batch_info to all 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":"deepspeed/inference/v2/model_implementations/llama_v2/model.py"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"90ea1516cbe06dc13c96b4c055cba8eb2ce53e7ad5bfbf208201ca560608a643"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: add a more general heuristic to determine the split-K. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"deepspeed/inference/v2/kernels/core_ops/cuda_linear/cuda_linear.py"},"region":{"startLine":184}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d249896863d8610fc678dee8dc44aa63f6d54737ec6729a10611c8f23313521"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(jeff): for models like llama-2 the user will have to provide an auth \u0060token\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":"deepspeed/inference/v2/checkpoint/huggingface_engine.py"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b2063436035644fa4cc475002f7cac868eab36b0deee0f6240122a056de374c"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: load other ops. Clients including deepspeed itself should use deepspeed.comm 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":"deepspeed/comm/comm.py"},"region":{"startLine":203}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d1a0704e35e9aa0a2ca6feda87dd97417acfab166c9c53f3e8c548aab95b72d"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: create some example to show how this wrapper can help profile communication \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"deepspeed/comm/torch.py"},"region":{"startLine":643}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c4b53b25e996b61829b6a2e2bfd51c9b44564e16a45ff3e4c5aab6e4b1af8b3"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: make sure there is no performance regression with this approach \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"deepspeed/comm/torch.py"},"region":{"startLine":644}}}],"partialFingerprints":{"codehealthFindingId/v1":"425003d847294ac35b76366d99c69f849e0aded20569a124a8e1261b932d533c"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: explore monkey-patching if this does not 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":"deepspeed/comm/torch.py"},"region":{"startLine":645}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d52936fd65f21e2d3996524ecc73d0a3ddc1a572ab13d0fc5d7ad55e72bbe70"}},{"ruleId":"D17","level":"warning","message":{"text":"XxxComment: # XXX: this is not guaranteed \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"deepspeed/checkpoint/deepspeed_checkpoint.py"},"region":{"startLine":304}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3937c5c0b431efdcdd5699041abeb21e6729d4161e4bc55fa6b3a5d459a0cd9"}},{"ruleId":"D17","level":"warning","message":{"text":"XxxComment: # XXX: fix me - isn\u0027t always the 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":"deepspeed/checkpoint/deepspeed_checkpoint.py"},"region":{"startLine":324}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7bfd3632ca5953e4111c64ec93fa6e07d980178bebbb93233a9790dcead9916"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO the current implementation requires that all configs have the same 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":"deepspeed/autotuning/tuner/model_based_tuner.py"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b4de4b9677e55104213ea181f484630983f5f91dd170dd0587468676cca14c9"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO itt is currently not supported 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":"accelerator/cpu_accelerator.py"},"region":{"startLine":353}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0686341679ac25f35e348aa382da346a557da30d7fcfe7657d3f632ddda0c0f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO itt is currently not supported 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":"accelerator/cpu_accelerator.py"},"region":{"startLine":358}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa20173f7b9f501973f35d6c2c71dbb75a3d9edf5e7f5ae99dcf8ac53fefccf8"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO itt is currently not supported 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":"accelerator/xpu_accelerator.py"},"region":{"startLine":317}}}],"partialFingerprints":{"codehealthFindingId/v1":"f145cb82c8c49bcb92546b0f16790e1028fe0971a1b85e1ed61db763a9528cc9"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO itt is currently not supported 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":"accelerator/xpu_accelerator.py"},"region":{"startLine":322}}}],"partialFingerprints":{"codehealthFindingId/v1":"1164d162f37d8c098a1a9a1f99294df53df8cafa6bfd54e09d600d46c66b25f4"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: cpu\u0027s visible envs is confirmed, keep as CUDA_VISIBLE_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":"accelerator/cpu_accelerator.py"},"region":{"startLine":510}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3a0da90f1297b42c1ec21e6bf75d3d39d751867986ba8bfb30076dd06935a2f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: remove this WA when memory mapping break 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":"accelerator/hpu_accelerator.py"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"94d36ceaac0fd3f8e7e1b3de746204413ce03cb518ed014bd6828f45b15595c6"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: mpu\u0027s visible envs is confirmed, keep as CUDA_VISIBLE_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":"accelerator/mps_accelerator.py"},"region":{"startLine":296}}}],"partialFingerprints":{"codehealthFindingId/v1":"8bdbeb6e14ed65f02d2e85130df09cb041a62fcdc15db74255e4e9bbea85d052"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: could not find visible devices env for mps \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"accelerator/mps_accelerator.py"},"region":{"startLine":298}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a5e71c6234c8260979a6c497e7fcd832a77f9205f6c5aa53417ae3e7faeedc2"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: Remove logger dependency on torch. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"accelerator/real_accelerator.py"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"d19cd4a43d6726940eacb0bdd6b1d5b1ef3328315a297debac012272e7137cf6"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: turn off is_available test since this breaks 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":"accelerator/real_accelerator.py"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"be5e27f572cf9abd84db4a28a10ed5f2e274a6e31ff19a1428341c5352569009"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO need a more decent way to detect which accelerator to use, consider using nvidia-smi command for detection \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"accelerator/real_accelerator.py"},"region":{"startLine":208}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7aefc4a5430d1ae91a01186c646f78d413e795bda71952a4ef057949e4fb230"}},{"ruleId":"D20","level":"note","message":{"text":"No ADRs found: No ADRs found. No recognised ADR directory (\u0060docs/adr/\u0060, \u0060docs/decisions/\u0060, \u0060adr/\u0060, \u0060docs/rfcs/\u0060, an \u0060ADR0001/\u0060 folder, or their siblings) exists anywhere in this tree. What was searched, so you can tell an empty log from a search that missed one: every directory under the tree (build output, dependencies and VCS metadata excepted), for a document that is either any non-index page inside a recognised ADR directory, whatever its name and however deeply nested (\u0060docs/adr/use-postgres.md\u0060, \u0060docs/adr/2024/0001-x.md\u0060); or a file anywhere whose name is ADR-shaped (\u00600001-use-postgres.md\u0060, \u0060adr-012-caching.md\u0060); or, when neither turned anything up, a document carrying the decision-record signature (an \u0022Architecture Decision Record\u0022 heading, or Status / Context / Decision / Consequences as section headings). A decision log that clears none of these \u2014 unnumbered files outside any recognised directory, without those headings \u2014 is not seen by this check and this row is then wrong. If that is your case, say so rather than renaming anything; otherwise, consider recording architectural decisions in \u0060docs/adr/\u0060. ADRs are expected here because \u0060setup.py\u0060 makes this repository a deployable product (line 293)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"setup.py"},"region":{"startLine":293}}}],"partialFingerprints":{"codehealthFindingId/v1":"592d3b527192dcc635e0d3620b5ab85e733e86a8c73dc2514871cd852d17c732"}},{"ruleId":"D26","level":"note","message":{"text":"Projects may be oversized for their cohesion: 1 of 2 project(s) overshoot their size bounds, lowering Project Cohesion to 0.0/10. The most over is \u0060(repository root)\u0060 (122826 LoC, 1242 module-visible types across 126 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":"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":"8da67a0ba33ae98a273f8dba1a2aedc54f0d352eb4923323d534573678775aad"},"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":"13f99272bee6715020dc85b50ef51187c202cdd317abd8ef8cb5439152f22cb8"},"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":"c9db3325f26e39f9d4a214645f4e767be2b303ebddd363e40079cae2c2eff7cc"},"taxa":[{"id":"CWE-522","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A06:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},{"id":"CICD-SEC-6","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"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":"94b5553526fd6cd8d3795007879064bef9247780c96469dd03e31534ce254c11"},"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":"2f471013dcafb35ff9a96e896a7335bdc598a1e590e0bbbdb9c1c47595ce1d3b"},"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":"8e50b0220f8ce6394f15c202a8aacc9393f4d7480b353cb68973f52e561badde"},"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":"32c0c40ebbd89f8597e05891483de46b37a091536308c448535c15e2a7e5a9e4"},"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":"51d5c0e32127530c7565cbb48edb1d0d06677cf00e3a0944469e7d7ab1b2aea3"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-829","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":"e22230e90712e2077f352fb637ee66822e6498190f9856558649a62d8959e2c6"},"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":"358f64e0b5e8a9397747ea6f735c3d613c5440b326868dbd3b82389284bb3714"},"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":"94d65e7070e6b33f809fc90bb9ccdaead5eb4c3c866641c13ee675816088db9d"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-829","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":"9ec93843e60d3f18f7522a8721641e2b62df6a54d6bceed5aba007ae030202fd"},"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":"37f7d733a14337d72f60b30d2de95b1301c9279ed3bea3ce080c55e325909add"},"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":"6acafaf386445b0df81a5eed7960625e102d8ff4976b4c9039dc708d2d2af54b"},"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":"f5e7e94b72e1add1744a4e98c1785ca85951553a4ea6c5af4dc2f138ce815a15"},"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":"0fedb8d31b13963ba1a4874ab7dfeaf254dc06e66ca5bdc3f10b1c4580394a4f"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-829","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":"616ea5ab053f1915333ce3b659599611c8c2a6b16199d51427f6ca8be8bc0cc5"},"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":"12f36068d6ef3b35f671b266d498b6bb6c1164cacda7f80046d62d22b2bb91db"},"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":"49ac629e0f1fc0cf09b9e80d81678d986cceed4a257df4b895cdc223cdecde7f"},"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":"6963525c5b6b81020e88e5454dcebe449dd477a254ea55b392783caa97c53df8"},"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":"2b14fc9a79d126cd54abecf910eea1f6395e6eb1dd353adb5d27f31e7bba6228"},"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":"8a548de1639c4dcea3cae35d5ae158c4b3ba78c97141b2038caafb2b90fd9360"},"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":"d59c4c0356d2eda10693bc67f4bca33e4883994acbcc8d740169734f7b041e57"},"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":"2819397e0da81d825ea5419dd205f56adf093ca4b4378c31541858e2fbf54d73"},"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":"9c7d729a49f43f99bd588f53338de2c6d2967a0727c4b78f382ea0c9459ee8ea"},"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":"78f086e9d41ed6fa72fbfd3d58c28851612c1f8707c3bdf799263dff8f5389f9"},"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":"c51eff310c7258262587cb07c28490877b757da5c9bdc8ec54ed8eb306457705"},"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":"ce3df81f2a11a57521860b8984739a04d270423e11166eafa04f5ba7149af8c6"},"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":"9a4302f058f237b76e3d020e8671b3f793ae513c46317d372624d21459a973c1"},"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":"d150d0fffbeb74292ddfb63cd9e20118a8748e3a56a7c0bb3e2d6d1c15247f55"},"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":"484dbf843048797dfbd3adde9553e4ef0a00def8a465656b107788dc784c6b2c"},"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":"36a2feb65d03fb3da9842f0ba24135997cc13d439a3fe8e6478bd356077260a5"},"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":"919f18f4635458feb80c76979b4fcff345f8581b9637774cbc6200a204795a8d"},"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":"2aa81e947a9d09fd7051aba4b60ad3272d412675509084f5fd8c8b17571bdedf"},"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":"d5a93bb85f6b4c01ac38b161831c2c4ac76440e3bdf1c5dac42c83352ceb3fac"},"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":"c91bd0f3dfbc60aa18bafa352f6b646334980cf1dc3f8cd3683442ff982efd78"},"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":"2f8cfee3ca31afc026197a0c4d89a65d24998f89c911560c4e9eaab6850ababc"},"taxa":[{"id":"CWE-269","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A06:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},{"id":"CICD-SEC-4","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"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":"027ce97e83266fc56f1ec20d945aae47860f9ee5600aa1c5af7068a71e7d9c30"},"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":"4b58534a68e1e7207eccf4f7df0e6c8a174e709e76c42089350b0fcc37223959"},"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":"cece9ffa7a15d3457c9c979e64a2603b8804fe0ad713f25092929e49276e8531"},"taxa":[{"id":"CWE-522","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A06:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},{"id":"CICD-SEC-6","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"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":"be30f2f0abaf7d740294cf0c66a1002f9b60a7d43d30cb6d0fb570fbe116878e"},"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":"054fb3763f13e54ee459992589df2c39b895c083a78d577922690fc7ac6f4351"},"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":"281b7504d7183ed5d2107a8b2972727ba2cd4fd4caab7901147c17144cdb2e19"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-829","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":"16f499c6d746f9cb3eafacd56688161ea8227ccd564b251f6c62fe588188088e"},"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":"588052c4504901fdd8dc92eb84807964db4def1e7575a511cce409e9d78cbcc5"},"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":"ddf267ee1a68f94c2c85ec6972e9d5503d79b865c4cb956358ef324d571144c7"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-829","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":"af8ed1580ac583425f52ba623d5be779a105d5c693e2d177565e5fe017e12c31"},"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":"6c45459398deb2d620bda9781ace969196dfc9d04a49063bec2ac863e7b552e3"},"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":"446846cb183b4c1db0166f61c903ebd0bfb861126acfc76af91a40836f048913"},"taxa":[{"id":"CWE-829","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":"bd58a32ad2a43c69e503f852860a768bd1e729cd0984c1c482cb5a00b13a3cc3"},"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":"0a99eaa85063dc644891f9aff3657ebe05f0fd0d4bbd057b7a17472868d5cf95"},"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":"748efc3ce1149334b34b99ef8dce00b6439cab804fcf03e7a0acce7241cf54a5"},"taxa":[{"id":"CWE-829","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":"f549a0f14ad4d74d6fc40cab345ee9ceee833b3bf7ea811ac68d7bda847de562"},"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":"3a685a623fcde5875523251f177501fbaa0ca29b469636932f730fb2d94e6ba7"},"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":"2fce11e492bb56c09510ad39d2f6b8cc1c5516f9277aeec1ea5570457169a2a6"},"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":"051c4076d28f717305b10fe5c7895714f8cfc6b59fcb24d9c07fcd3ef2852a4c"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-829","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":"c5fc2b21af1511b7d34d644a1a65e8cf1e0a91c09703c2c783c8d4f8d67efe8f"},"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":"4f53c3c87d0d7f7dfeaa7f5c75bf2d685fefbdd5d663d60fb31bf1ec40c86919"},"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":"624993d758f22e415b360067652cfb47ec6b34baf196e6f1bac29155e0197c90"},"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":"2d7729724928f44f0e77c435b3d6a2154362b15e1223deaa6a92715ed8907094"},"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":"aae559b9dcfb69c95efa7a30acf65f0a8a854492eb0780c774f3be1d9c6b4981"},"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":"6b83fe0be3d6b7fe0b948cb60fa434bf514d72ff9102bb47293623abfb2be0a6"},"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":"2984366d7090be1ada0156c48e8858fe932e330ccee6b5f49b2c0a966c058198"},"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":"e17ff337f4eb269b0bc7488b1a28b502a975abc79c33dca417f329d6c6b7d74a"},"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":"816a89e31293ce392b27ddce579448231bcb9e83d8fad47e3888e1aea082aec5"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-829","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":"062c8fca874e99ec140ab2b49a5dbf12d2c28292500289de0b62e87aa0531022"},"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":"921c42a503cb5e7b0b95db64561d58db795b25405291841b2303d0d64fe2789b"},"taxa":[{"id":"CWE-522","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A06:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},{"id":"CICD-SEC-6","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"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":"aa3c9f4e73a58fa3a0a104a0bc377ae0992f899a451b6f6545a379a4adffad5a"},"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":"437386c13315684974a4d6e1778e7de1f976e75a15a77e580d6ac502e7c18d89"},"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":"f494ebac9ba0c8600c62ab0fa3bb099385dfab171888131a4cd4a14282de33b4"},"taxa":[{"id":"CWE-78","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":"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":"4bb1700b80e413ba9753fd84aa8c8ec06219ccc5d14bb9b4a61c36ace1bfd7a3"},"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":"da74c3cdcc1330cd69fd04733d62b2515bf2cc55223298f841ab1087d6ea29ac"},"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":"8e332633383b0984038e5ca86a32e13149cc3318f0f6c1506506384d845b3ebb"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-829","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":"e7d89318a81d41d12a3724665ad14e540caa0a02bfe42e1cbbbdfd14494fed13"},"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":"e932f44a3e9dcbe88f1360f1336bdb0e51fe33727ebafcfd5ccb935055a50513"},"taxa":[{"id":"CWE-522","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A06:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},{"id":"CICD-SEC-6","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"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":"0a018d47a1e6a5ed89be52393dcbff5f8de5b964b451b0543312a95c55c67158"},"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":"0446e765b0fb063969807976f717997c3dda0e4d15d4a6196964051ae3d70799"},"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":"9f1af1904c614e6f6365b4c019079172c33df10365fdd0ba004242f3aca1521c"},"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":"06e2a3e05faa9020b54d20feef754c5e362f833ab13275f6f882a60bbce6f175"},"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":"0c68de8f45f3852c9bc2a047d7208c51ac2895dca9c50bba95968771bb7a58c7"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-829","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":"b3531c44a684117da5d277e11f6607a37a69f08bceade14b8f8b27aea715726a"},"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":"7ccdf1cafd7e688572fdbc629691be680f37c663a75d9e2e01525389ea5f126b"},"taxa":[{"id":"CWE-522","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A06:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},{"id":"CICD-SEC-6","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"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":"5c6f9e38a81d341b7085cfc70434f42de2ca655c503a6110a102e6f227e5ca2b"},"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":"db361b8271f6bea31626919fea6313004db426c234927f6ec5f405bfa3f8038b"},"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":"440e5cace23c87b0c5536014492969a0e288526595b54ccfaa8fe21accd48044"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-829","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":"693249723480b7d3690fbc9002e4acaa2fd5c4f5277d52948268b51530c89d1e"},"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":"f307d6496d08c80b33871c9436924e8766f4af021a2b2f019d2aa1160821f49b"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-829","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":"205cd1bc8d8b598eeee2f6a6dd49111ea47138dde5415a41e8ea4732e181146f"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-829","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":"c5d8a56b8d1ed3c94f6a1089b91c17fea9d362e6b2b0b35ffeeeac8f84ea5eb4"},"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":"0179e0aeeff6b6f120b0ba3ebf309f797f560814af2e30937d6e18d215766476"},"taxa":[{"id":"CWE-522","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A06:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},{"id":"CICD-SEC-6","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"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":"da926e28ccb253c6ad642101aab960e232beb61dd8fa615bb22bba6a29f4fee8"},"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":"195668d3d3dd364382e6bb6e7c033149bb8dc0c026ca2a818a93a112a1abc8e5"},"taxa":[{"id":"CWE-522","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A06:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},{"id":"CICD-SEC-6","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"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":"c2f462b7e7afa0915142dc4d05d5af7dfd59a716fc4c3afcb73185aa80d63577"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-829","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":"e3307c8062c41da7e995198b19ee8c69c78a38ea8b6fc371db67304b3618ac62"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-829","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":"2f75e1f2ea23965f796d429fa537a8e6a9ae784a0352d57c8710668af7faa723"},"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":"22a753d17721e25d51d97d41f148cc6c516e2db4ba4075cc155306bd97406f40"},"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":"3597e7147f7d3de8a68479ddb8d9ade25ab9f0bc9b25eb49bb4b3698192aef25"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-829","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":"6776afeb0c484f03023a72746915c44d09c6d8afff57d7a5ea7927714ccdf427"},"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":"2fedce49dd4794bd9554c191a240dcfc2894c1270fec3d803f6b7b8b2a2dcbc2"},"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":"2f9e5c50af50423e0b8d2c31b1aaadc54140848d7a4dc29b5060146b67da3c03"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-829","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":"198ed046a193dfa280a5c339e5ea5d5a5c7f36e11f072e6268dfad53d1a54c4e"},"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":"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":"905d232f663574080262bb8e0b05c112ed0622c643e69d00823e78e353e1ef2a"},"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":"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":"ea376c62bfd1ef98a71d29747dcf681fa3e0927793206697b9a0fba76e606821"},"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":"e96a2b1125501b76ab87c43fd7533cf9516e4775fd5fd6633bbd5f4fe997d256"},"taxa":[{"id":"CWE-913","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"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":"1f5ee35b3ec2e1fd522e2202059276dfdd3cf427eb9df7e4c97c9fdba220e48c"},"taxa":[{"id":"CWE-913","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"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":"3aa0e2a59998c2a8f62045be7068c6670caaab662b36de2d54cea42b58548691"},"taxa":[{"id":"CWE-913","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"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":"ee99d6f940dfd1602c904baeaa292dea5b898278bb8525398e0c5c6a7c6df7eb"},"taxa":[{"id":"CWE-913","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"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":"6893f1118c086d84e444c5cd27d523ed32070b4201624d0c9d658f927282f48a"},"taxa":[{"id":"CWE-913","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"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":"cd944449c0a499d86b054d1414816d17a3aaacf9c70000a45bc733f1c305952d"},"taxa":[{"id":"CWE-913","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"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":"96a5413cb4375d36fa623efad53b09e222a19feaa9b426651e0e83b1bbf95299"},"taxa":[{"id":"CWE-913","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"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":"3c9ead4c18ecdf2bbf4dcb62f6da5048f4dcb89b2922788d495c538705af6dd3"},"taxa":[{"id":"CWE-913","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"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":"b8691b22c2bb4c562e3484c0048e92b314a633777174a24a507e9bbf5a772e99"},"taxa":[{"id":"CWE-913","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"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":"4261c1da707533029d5f16712367a4b6088bca17f897da6b95b4cdbed58f2547"},"taxa":[{"id":"CWE-913","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"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":"cbc11bab68500e58c475cecaf8f8f17c96548b8c63e0e5b7339c130335c84963"},"taxa":[{"id":"CWE-913","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"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":"fcb73d3f9ea34a1bcc2d105477914be5d9e7044a2aeb8e409b6d04212201bbbe"},"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":"b81735ec296fcf8b26367fffc8ac84f8e72c6b3fe16f69b82e6a8cace488c252"},"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":"08b7bacc81de979addde75850afba9d397c1cb726f4641f5bf9d042f7f986fba"},"taxa":[{"id":"CWE-78","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":"b4d2d5a2fd4858c4e9186491629aef8d21d00f0f2f35646547033ed940215497"},"taxa":[{"id":"CWE-78","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":"0507d5c12ca9c6d7254dd6d4caed8a1e0621105a7f642fbee5d0f1528f757a31"},"taxa":[{"id":"CWE-78","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":"a95637cde05a72ea6518a238f3e1e1927e310c4bd42c51cd37a61f005e7b801e"},"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":"60e19061df19afbfb2cd9267f53a37bfd4bdbfd9bc380279413772c1c3f868b3"},"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":"de7cb9aa44e2c7cd4e31a5ecd50c64f677576f29d81d8f1f351e2e7b577f61db"},"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":"D30","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":"5e3b77d17e4ab71f097de754b42dbda6d5f8c633ec57c7db0580893a4d29f125"},"properties":{"dependency":{"package":"transformers","version":"4.51.3","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","PYSEC-2025-211","PYSEC-2025-212","PYSEC-2025-213","PYSEC-2025-214","PYSEC-2025-215","PYSEC-2025-216","PYSEC-2025-217","PYSEC-2025-218","PYSEC-2026-2290","PYSEC-2026-4174"],"reachability":{"kind":"unknown"}}}},{"ruleId":"D30","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":"064dadcb4ba96698ffde72793988476aeb560f354481d61b4c051ae1c657a04f"},"properties":{"dependency":{"package":"transformers","version":"4.32.1","advisory":"PYSEC-2025-211","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","PYSEC-2025-212","PYSEC-2025-213","PYSEC-2025-214","PYSEC-2025-215","PYSEC-2025-216","PYSEC-2025-217","PYSEC-2025-218","PYSEC-2026-2290"],"reachability":{"kind":"unknown"}}}},{"ruleId":"D30","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":"2c6632a0a57c82fa95e77aa62f188c5b153ab033d798c7553eb36271fc8e15f0"},"properties":{"dependency":{"package":"torch","version":"2.0.0","advisory":"[GHSA redacted]","aliases":["BIT-pytorch-2025-2148","BIT-pytorch-2025-2149","BIT-pytorch-2025-2953","BIT-pytorch-2025-2998","BIT-pytorch-2026-4538","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","PYSEC-2025-189","PYSEC-2025-190","PYSEC-2025-191","PYSEC-2025-192","PYSEC-2026-139"],"reachability":{"kind":"unknown"}}}},{"ruleId":"D30","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":"1c7e7920be740336313e100c0d1babe63fc62c3c688dc6c485aad4771994826f"},"properties":{"dependency":{"package":"torch","version":"2.0.0","advisory":"[GHSA redacted]","aliases":["BIT-pytorch-2025-2148","BIT-pytorch-2025-2149","BIT-pytorch-2025-2953","BIT-pytorch-2025-2998","BIT-pytorch-2026-4538","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","PYSEC-2025-189","PYSEC-2025-190","PYSEC-2025-191","PYSEC-2025-192","PYSEC-2026-139"],"reachability":{"kind":"unknown"}}}},{"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":"fcad8728c4e5e1cb792fa1dc1b4ac24760cea06017d2e53a0c748f06311ceb45"}},{"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":"facb8be794e285a46747b51897aa2ee49de66866587836bfbdf129176a571f91"}},{"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":"576b5fd96f4f9ad48ed830dd59914d2e52013be7ae593e581fbcbf4fcab4cc7d"},"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"}},{"id":"CICD-SEC-3","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"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":"558dba3ae70f1f78b14cb036c82db667f75c9b54f6250242ed351baed1250b61"}},{"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":"8c3b26b7a81955e8f4fda388ca1e64ba5e50cb48cba197f2bc8ac92ec0934716"},"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"}},{"id":"CICD-SEC-3","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"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":"d24eed4aadd2119aa4d45aa99b004ea3a7eb511eed477989a2ef37964ca97351"}},{"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":"2b6f01463d5871ded4fd5bd806d740f1db27371ae6c472a3b861dabd1b251e6e"},"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"}},{"id":"CICD-SEC-3","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"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":"f108ea20b8ff4cb29cc21fe5e9507e4b6e9b47c9849bf8ad1eaf5c6859e856f5"}},{"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":"37825a9f9be53dfb5f03f0cd5b3e0839fc8bd2652ad343cd7d9b17d9032cfed8"}},{"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":"fd7fc87d03fe0f1235709535bdfd35a91ec79420c6180496bfb942b1d89143b6"},"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"}},{"id":"CICD-SEC-3","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"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":"0ead5ed5df19824ddcd70c0cd3e7f816b359acb6faf5c7dfc6740aea301471d6"}},{"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":"4f12e1f508b0269ef024a75736195edbb87c4e2a9ad6b7bd96f90d4296f9dd7a"}},{"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":"5ee53b5e53d4339da98608a803a9def1185eef6ee32dfa5643f85fa7b76578ba"},"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"}},{"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":"456d2c3f511799653c765ed1632fec68481d07b1aa9db4d76a6f5dab8c714fd8"},"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":"16109452fc9244ec9a1364bb4ca23fb8c5693c4095002a3eb2deeffa5394ceeb"}},{"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":"bf8517d2af42db21902db6fd8ac1a7cfa146b7a3c7827986c52d7b2723f50a92"}},{"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":"6d75600c25635bab74015d0e9375bb8b08dc1fdbe382c8555befb9dfe579780e"}},{"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":"877181cfa77197d0608cdfc1e4106c8c1aec1ac15c480c5612f63fb054231023"},"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":"1c596302d3dc744679024557e4e7639220e0779ccdc2854ab28879c3bd7981e7"}},{"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":"44dc94a2bf20ce280fbe8aa32ed4e4dea66e2cdb9c091a765060f58df6509e01"},"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":"f7cf20dc9ce8e66b918100e0f5f21f51eb4d1ff08d790e659d4ccf3659c8a6a1"},"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":"b20c29740d0fcc748bc9d67255a5b61316603b8b250d40511579d787a01d7f39"},"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":"2f0903528551289e9f250b9dad056ca570f67ccf58f0d9d2c308bcc4de123474"},"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":"06f970d88c9605b5960e4d593488bf4f642c50a4d127db1d1ef473c8bce62f26"}},{"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":"c68fa6ca5c4652cf8e93987cbb3349258bad723c0a3dd6a55bf320127403c8a0"},"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":"462d1c2338871297a9ca357cf9d6f62e7fb04c97960639bf49fb9cc1a9f93800"}},{"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":"a52c9fe568f408e8bf3c53fb9da2f24978494cd9e809629f07d55ea7740ae19b"},"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":"c0984f80703be014b5960179ab3d14d2004b61141687b542cbfcfab2d661d488"}},{"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":"119f05e992ad977d4d2523a1fa72f930008c276810700bc92a1bf637b45299c9"},"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":"ea2ee05333de31d0ba58b5213d88fd78c2aab0e63698fd45b53287594d54ea26"}},{"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":"b36d030911c8d6080dedc99d261af323b8641c98d7bd3f71806f591d727e3e63"}},{"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":"9b89672589ce58bdfdf5d022de245302e1dc7125082ad130555c21d61de74293"},"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":"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":"f3e6442422daa3be1876f2b7734efcff1685cf0ba5aa62c89ec119a423fb1dcd"}},{"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":"42d1b20007ee4acc3f7d198058212ef528057a9804c1330a3515cabe047a036c"}},{"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":"deepspeed/runtime/data_pipeline/data_sampling/indexed_dataset.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f77947c9a9855db57aac726b150882ba4e286c3cd90fdd6ee0d6af0f5d61fb3"}},{"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":"deepspeed/runtime/data_pipeline/data_sampling/data_sampler.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"307eeedbef21a9fd8cde7aef9388ce6c663a0fc4fdf9c3aa7348903fda1e3a2c"}},{"ruleId":"D34","level":"note","message":{"text":"Further orphaned files (smaller): 119 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: op_builder/supa/inference.py, deepspeed/runtime/state_dict_factory.py, deepspeed/runtime/pipe/topology.py, deepspeed/inference/v2/model_implementations/layer_container_base.py, deepspeed/inference/v2/ragged/ragged_wrapper.py, deepspeed/inference/v2/modules/implementations/moe/cutlass_multi_gemm.py, deepspeed/inference/v2/ragged/sequence_descriptor.py, deepspeed/runtime/zero/contiguous_memory_allocator.py (and 111 more) (121 orphaned of 422 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; 422 of the 794 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":"op_builder/supa/inference.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"adf5c047bc5ff430e3df7f5b82d384469366572f53effc304b27f9f628bd8a46"}},{"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":"deepspeed/runtime/state_dict_factory.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4fc27d95d1474f8226cb26a7e9e7cec0a564a9a141793512e55eecd45a574df"}},{"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":"deepspeed/runtime/pipe/topology.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"701e099ecc55ebcde7f5444c9919392e1a497a964da17bfa282b373b06e72efb"}},{"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":"deepspeed/inference/v2/model_implementations/layer_container_base.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa2d69540df7b9e9579997f52108ba6b3921269b84b7021b97e7be560759aaa9"}},{"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":"deepspeed/inference/v2/ragged/ragged_wrapper.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"887857866df0acfbf4b9d1c61b9979dffde51fa11a5a76e26f3b31138ff27b87"}},{"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":"deepspeed/inference/v2/modules/implementations/moe/cutlass_multi_gemm.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d2c7313a44c1bc50d605733a50fe07096241c4702580ab7998bf0fb92385db9"}},{"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":"deepspeed/inference/v2/ragged/sequence_descriptor.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"151d2c1f649502a8af12878881535b54421fbbcfbae4cf4a5e9b825a197eb649"}},{"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":"deepspeed/runtime/zero/contiguous_memory_allocator.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"436e58f75b35f20377b369ed4e952cc39bf033ed827d135a8181469b91d75c3e"}},{"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":"deepspeed/inference/v2/engine_v2.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"116cd351772a6cfc7b37fa2422b69d8cd6004f610c7d91dd690fd1ad773cdb0b"}},{"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":"deepspeed/inference/v2/model_implementations/flat_model_helpers.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"21326ab7aef3bd49e63d1be71765f23089c808d5465a7d413f3f9bcab5bff662"}},{"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":"deepspeed/inference/v2/model_implementations/inference_policy_base.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b98a8f490b1073e85e6835f757d01cd0e6e7ea93fa66182d48fac2e059abf538"}},{"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":"deepspeed/inference/v2/model_implementations/parameter_base.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3fbde45f273816af87c935ddad1bd938647ba423b7bdc1451c03d1bc951c238"}},{"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":"deepspeed/ops/fp_quantizer/fp8_gemm_triton.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"08443b32cfab472a552efd2ca5229019a88dcccec1c7a33798ffa524e28ed09a"}},{"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":"deepspeed/comm/mori.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f3caf6b9050d13d469cd692eb1a31e0db914504ce4b77e7fc10ef2ed2caee63"}},{"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":"deepspeed/inference/v2/model_implementations/exaone4_5/model.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a5234e3882102b1003f52ca3fb3c9879a231d1187fa41b4ec55ddbce04eb3e6"}},{"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":"csrc/aio/py_test/ds_aio_args.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1647b960ee5742cc61267c97f31e89d020e6b54797146769784f5f28c65da58e"}},{"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":"deepspeed/module_inject/containers/features/hybrid_engine.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"96e371275a09665348f1778dddfaaf7f67b29fc782ec8e1f4cbe3bc442d90c64"}},{"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":"deepspeed/runtime/zenflow/zenflow_utils.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5999dac7f064173971e8f4d3baad3dd741e8949a28865e2b121ebb6c6045941b"}},{"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":"deepspeed/inference/v2/ragged/kv_cache.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c08df1576d93605f08c742d53256e7d34283feff2c4ad2c31517fe310051f1d"}},{"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":"scripts/replace_copyright.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e2de454e789464313d9099cba083fdb21f43e72c4740e76ea13da566ce543b5"}},{"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":"deepspeed/inference/v2/model_implementations/qwen/model.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7003c1ac8aeb1177c875bfd8b9d6430559c05aac1802e1469747194023c350d8"}},{"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":"deepspeed/inference/v2/modules/heuristics.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"684a5f40600eb8767f4abc47ba77f78f90006bd406520d45ebd4a3b1f8287165"}},{"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":"deepspeed/module_inject/policy.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8de5ac3a5ccc6be3e863e4f67637ec5e54bc0905f856b65aa72e861392e5e419"}},{"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":"deepspeed/inference/v2/model_implementations/falcon/model.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"99b21cecaa1d7a4cfb304fee570eb148d7724c45b2aea48955475b7b9dfa37b0"}},{"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":"deepspeed/module_inject/containers/internlm.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0fe9316191db9e450470176b784979027a3a4af20ba3e249b559727f4033342f"}},{"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":"deepspeed/inference/v2/modules/implementations/attention/dense_blocked_attention.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"eadd58efdd25fe669c5bbafa2e0046e6a7ddd8aee78d93ad9bad8c79243e6df6"}},{"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":"deepspeed/inference/v2/model_implementations/sharding/qkv.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b95fc680706905990ce520c0384331ac7e0b97614f3d2f180dadd141973c5d2a"}},{"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":"deepspeed/ops/transformer/inference/triton/layer_norm.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1c0880f9546d70f3f1b97e3af8645142e7deb7d155165898f512068db03d04a"}},{"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":"deepspeed/inference/v2/model_implementations/opt/model.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"64b7a57c69eda89bfe60e6bc89aafbb1dfbce0253951f734e7e2a228a6ef0750"}},{"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":"deepspeed/inference/v2/ragged/ragged_manager.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"72e8d50c32ba8ad63405c948ce4fa6162bdf351865cf7b767e59ae335dd3121a"}},{"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":"deepspeed/module_inject/containers/features/split_qkv.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"227577428dd9ac13e6179139099802408d8f0d093b350872ad145d8165de708a"}},{"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":"deepspeed/runtime/data_pipeline/config.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f0840a68b1ecfb84fde53a1670c0a4c6dc0b22d3b9a825d91e430569965ea84"}},{"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":"deepspeed/runtime/weight_quantizer.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d33552ae03b2c510262058d9d9aabbb0c9a0b61956214dd864f226716147768f"}},{"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":"deepspeed/module_inject/containers/opt.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9fef490f9c852d35b9cebb905a8503d630dd8471a7ca0388e795e47c867c1a74"}},{"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":"deepspeed/moe/layer.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb23027f2f2f3e0f27ca8b2612f0f9f401013b963c11ddd315c5e9e0c1cdb4c3"}},{"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":"deepspeed/module_inject/containers/llama2.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6a013fa2b2200befb9d71f677552edea51c6cb8e6826f06e5cca4630346bcb4"}},{"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":"deepspeed/model_implementations/diffusers/vae.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c26480753ed05f8dcbd189b0a7b7358555eb425655c054b084fc3514981f304f"}},{"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":"deepspeed/module_inject/containers/bloom.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f75c419f7f89019954778e04f7c595153347e718cdea284c64a62e7d3c99866f"}},{"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":"deepspeed/inference/v2/checkpoint/huggingface_engine.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"206fb5d9c7e238473d95d8cd993f66644721613b4278c560fe57fddc92dfa2c2"}},{"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":"deepspeed/ops/transformer/inference/config.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b32f77af9daa5356cd0898243e48327334badfec46b11e5de49f633284c4543"}},{"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":"deepspeed/inference/v2/ragged/manager_configs.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec59f6cfcffaec5c7140e71187f28879888dbf942ec16ecf794120d9275d2ec6"}},{"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":"deepspeed/runtime/zenflow/engine.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"abe80796a37b33cbfadcb88aefda06dc138083d281ed1bd36bf5d47ce4976e37"}},{"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":"deepspeed/module_inject/containers/gptneox.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"efec43455b6656010f31e4de665bb5d47b187893c602a1ced17f6145558b48bd"}},{"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":"deepspeed/autotuning/constants.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f101e29436baa78c77d48929aa293d4e3f3badf18a903849f455921dc12b2b9d"}},{"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":"deepspeed/module_inject/containers/gptneo.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"89a38aedfabadfe6e9addaeb38c802eacd794ebeeec7b39b8d57a2b759d09d7b"}},{"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":"deepspeed/module_inject/containers/base_moe.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"bbc9dc9e8df1f87aca18bc7d811f1408a6481df07a6a69c5a0c819a9f93410f6"}},{"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":"deepspeed/runtime/data_pipeline/data_routing/basic_layer.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c85eaf70352aeb60db9f072b913698ccccaa9b9a0d17b3314dc5869871c0f49f"}},{"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":"deepspeed/ops/lion/fused_lion.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"56fac85424ae4e7041c01acf8d14e505e724d9a2431d01f8ba7cd30f781204ac"}},{"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":"deepspeed/autotuning/tuner/model_based_tuner.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7e1e365c5a1ca3fedeed49aa3f0b9f555d94c098fab4156e78ff53ab4791745"}},{"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":"deepspeed/module_inject/containers/megatron_gpt.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a06bcc66aff9e5b67b4417d8551017b87600cad4aef588922acdff4932d1e74"}},{"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":"deepspeed/runtime/data_pipeline/constants.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f015fac991e3117062394b4b11302fab9aeeebf3194c20155d61bd1545b448b5"}},{"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":"deepspeed/module_inject/containers/features/gated_mlp.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0f6713db677e3f498748135c7e81622f1d47b70f0bb7cf8163ac96ac117d340"}},{"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":"deepspeed/monitor/config.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd35326495866568cb160bd654f98c30d84be7efde5cb23e9342edbc5c917c1f"}},{"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":"deepspeed/module_inject/containers/gptj.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"cbb7a5333405df997df6511fb96d398c4894184e6b9ef0efaf4ceb4abf92fa20"}},{"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":"deepspeed/inference/v2/model_implementations/sharding/utils.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d086bdb6e540c82399abc2519e59a5bec92d147ce45891126704e006cca640df"}},{"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":"deepspeed/inference/v2/modules/implementations/unembed/ragged_unembed.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c1a9d0010d4f0f4ff6cedf7b00b0575561f92551d91d98b443b538eddb7f449"}},{"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":"deepspeed/inference/v2/model_implementations/sharding/attn_out.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a7ebdb157378acda6c91db8f71733cc7ff55903050f053044c3862b271fe0d1"}},{"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":"deepspeed/ops/random_ltd/dropping_utils.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a762d71dddedddb4f1b88b97ccc5733ef8aa5bb8455196d22f945b3683503e4a"}},{"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":"deepspeed/runtime/data_pipeline/data_routing/scheduler.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c8b9922bff2ba37ff5ad5d27f52ec8a204ef054d74e01ad57cf71f9fe849fa5"}},{"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":"deepspeed/inference/v2/model_implementations/falcon/container.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a926f7c1710fd06c8752f75fd507f59af684675446444ce8c7d319414017b91d"}},{"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":"deepspeed/ops/transformer/inference/triton/mlp.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b27cfecc6dfddf30137281e4eb6d8b502f6a12381ce1b78b9b290a4db4526251"}},{"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":"deepspeed/comm/utils.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"66f08c79a09587ef51891a5eac0debba9e85dfa7213d7d3968fd28ddf5578660"}},{"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":"deepspeed/ops/deepspeed4science/evoformer_attn.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"22acad9dde9b110a501acd5b69ccd79c6c4b7f663fe63d373111b99ebd4c6997"}},{"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":"deepspeed/runtime/zero/offload_config.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c38c5a6cb6df9ff5d8568402fdeecb6da2e58df081992ed13eb8b8ed5413d9f"}},{"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":"deepspeed/moe/mappings.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5574af7f7cae274abbdbc3a1509bc83259f0f2a1e0be00debc2a30f39b966ab"}},{"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":"deepspeed/inference/v2/model_implementations/qwen_v2_moe/container.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec631a09675c3c89c51045fa965a6edeebf54bbcb1aafba6996de301fb92ed91"}},{"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":"deepspeed/inference/v2/model_implementations/common_parameters/qkv_parameters.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4527ec8cf1019a760d7e2a619c85159d28222586badf134fadadaebb2842e86"}},{"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":"deepspeed/compile/passes/long_context_checkpointing.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5542ed9fbe040ca0b5f22c4bdf1e1fc1c4b0ca29bfa1ac3ed71e9ec9b89ca446"}},{"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":"deepspeed/utils/bwc.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c11365fc42405f53e87588f75239d688bfb6ed65b0beca59c70dbab5e27a5aa"}},{"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":"deepspeed/launcher/launcher_helper.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"70a95237e958a8cca9a60e2e60ca5cb292b2070e6a9c0830a84cbb0d070ec074"}},{"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":"op_builder/cpu/async_io.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e8ed31104000c1e21d2f1ce59b1056c6a13c21b7c4b8e0567f727885f8a756f"}},{"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":"deepspeed/inference/v2/kernels/ragged_ops/blocked_flash/blocked_flash.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5c9f54dbd39a8e2de613a988158ada8359fef8aaf8651f501dd611e0f8fdb5a"}},{"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":"deepspeed/module_inject/containers/megatron_gpt_moe.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5ec48f4067f32a6da6e287704e5cab698693cdde52f8dd0ff795eb6338efcf4"}},{"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":"deepspeed/ops/transformer/inference/triton/ops.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2dabb30a41cd4eb1ca5b224247d10ff7774798d6d7f41046fb25f4818b841b0"}},{"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":"deepspeed/module_inject/containers/bert.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7fcc1249b9803df9a6e73478c0b5ee647a0f1527cc413b195defd520c462894e"}},{"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":"deepspeed/inference/v2/ragged/blocked_allocator.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d6a213b348571908bded6b5a4bb8de6b39e0ffc27cf44aeee96a3f7176aecc0"}},{"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":"deepspeed/inference/v2/modules/implementations/linear/blas_fp_linear.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4764d8e67f9f4831bbf73c16abf0417b09cb10eb3b187e9d610ced111a69e318"}},{"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":"deepspeed/inference/v2/modules/interfaces/attention_base.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7163d0e16b414b5cf6775e2a09d446984dc1b6e835dc8f8a431c5ca4df4b06a0"}},{"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":"op_builder/hpu/fused_adam.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"00e6b5e503d08c9f0fe833b98f055a9ca7916ac3894b141e2f21523d6467dbdd"}},{"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":"op_builder/supa/fused_adam.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce54a24b4e0e8156296cf3f749d65680d7fac45e57d1bcf0d6ca58da05eb09b8"}},{"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":"deepspeed/inference/v2/model_implementations/opt/container.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"75bbaf3b9956ce2f4299adac31d7bd2b41c76b8cfc2df4f94401f69fbed34f89"}},{"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":"deepspeed/inference/v2/kernels/ragged_ops/linear_blocked_kv_rotary/blocked_trained_kv_rotary.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"57c0d6bb54a897eba5fa34fbee65c4b80a93457ae25c58c57ebfa73afa36adee"}},{"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":"deepspeed/inference/v2/model_implementations/common_parameters/mlp_parameters.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1cae88f699ec28480fc800260ad8dc89023800038014e3707ce20cf1ae9ff1c0"}},{"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":"deepspeed/inference/v2/modules/implementations/pre_norm/cuda_pre_rms.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"00b1b1f8dbd75d7b93a05f762791560edec8539bbbc79d91fbbbc487345483f3"}},{"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":"deepspeed/module_inject/containers/distil_bert.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab7b143f2ccd488e28a899f42d75b5bc2512c8d36a330721f69192783768e8cc"}},{"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":"deepspeed/inference/v2/model_implementations/phi/containers.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce5aa8c71b5095c3f28728c6c9329de12517d93beb439b6546e193fb1ae350a8"}},{"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":"deepspeed/ops/transformer/inference/triton/residual_add.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"cab97f299b6b51d3cddb0262a80e4b29b0cc682411bd89c6e37205aca16de8b7"}},{"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":"deepspeed/inference/v2/kernels/ragged_ops/linear_blocked_kv_rotary/blocked_kv_rotary.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6ca3988978b5ac2c70d7e5e75ff593c6c8c1cff819f55c822f22cea81caa2c3"}},{"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":"deepspeed/inference/v2/modules/interfaces/embedding_base.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2aa7f1a05fad3991d9ee41356a653ad28a686844242f56fea6a489e084b289fb"}},{"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":"deepspeed/inference/v2/kernels/ragged_ops/embed/embed.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"519a2f5ac42203932ca55fd583d9c10e788eef9266be588b44e0ef1a82b93ac1"}},{"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":"deepspeed/utils/init_on_device.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9cd92689d1dc8a16143dad8dcdc84ef1b69c3caea328a9aa324668ec517e04b6"}},{"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":"deepspeed/inference/v2/kernels/cutlass_ops/moe_gemm/mixed_moe_gemm.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc8548c260d1404336b874ec4bea5e5375baabbb41c0fa244e8fe12a08161f7f"}},{"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":"deepspeed/inference/v2/kernels/ragged_ops/linear_blocked_kv_rotary/linear_blocked_kv_copy.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8a7394383a47c2c9406d00934a82ac296c640e8fa85729c3793388c65785e4b"}},{"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":"op_builder/hpu/fp_quantizer.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3712c63b28ccc760802c0852979c711067a45dcdfafbc873e0355e2e33ef133"}},{"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":"deepspeed/ops/adam/zenflow_cpu_adam.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1e1157fa9b2c92c630898d5cbb294f04ae819276a6f1a27a3ec356e95b8ffb4"}},{"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":"deepspeed/module_inject/containers/features/meta_tensor.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d72950b20234a8b48623478f5bf6ceb870edb8c64452c5fd8d0bbbbb493e40bd"}},{"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":"deepspeed/monitor/csv_monitor.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"986aea392e5bf2197b010417c8e3c5bf614c50b202be431b64f1b2a7b4e0b6e0"}},{"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":"deepspeed/monitor/comet.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd1c84f6ca47a15b2fcbeee1def08851f8da653fb6d9ef769b5a6fd268504bcc"}},{"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":"deepspeed/inference/v2/model_implementations/sharding/mlp.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"791625a105688de3d0f78393647b10f850f1fe85487b4358bd8fbfb3095e6a21"}},{"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":"deepspeed/module_inject/containers/clip.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a29240f4473d575a454fb931c188fc81d835300073c74be873f67182f8132e6c"}},{"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":"deepspeed/inference/v2/modules/interfaces/moe_base.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"36d220e74036332b4b30598c628a5d18a1119d9b0fafdd4684017b0498435af8"}},{"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":"deepspeed/inference/v2/modules/configs/attention_configs.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a48dc8149ed993a4f4e3785eca39f80e13c05c1cd54f0e34dbd37cb6d68abd9"}},{"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":"deepspeed/inference/v2/inference_parameter.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a53431c243b3ca3bc3d1b4150863d3b6bfaf28387f8a1674ab80e0e60e9ae3ba"}},{"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":"deepspeed/inference/v2/model_implementations/qwen_v2/container.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6aca5b0050a3bc9051f34e0f2be17b6f694c17a627c6e9cd8b6b9c936a1186e"}},{"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":"op_builder/sdaa/builder.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1856b8f95aaf93cded2793f0468952c07f0cb681a5967ac983da4c6d782967f1"}},{"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":"deepspeed/inference/v2/model_implementations/mistral/container.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e3aa900a552aa64c83cd33f56fb8218b28c930bf7523c2cfd902682bd1761b9"}},{"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":"deepspeed/inference/v2/kernels/core_ops/gated_activations/gated_activation.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"134071dab6d9cb766937af3006b6ab49c76dedbfa608a1528cc098733cc53adf"}},{"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":"deepspeed/inference/v2/modules/implementations/pre_norm/cuda_pre_ln.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ff70b90ed49f48f435039a50fcb2fe73bdeb2288fbb2a5cff593d3879cd78f4"}},{"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":"deepspeed/inference/v2/modules/implementations/embedding/ragged_embedding.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"961cc775ae42910c426b0739333bb266ede1c77850a430faba806b8830277a98"}},{"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":"deepspeed/autotuning/tuner/base_tuner.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ebd41d4e04b5ef3b62d661478f690e189e07db2d933e6e1dd9d05b00cd0a92a3"}},{"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":"deepspeed/inference/v2/kernels/cutlass_ops/mixed_gemm/mixed_gemm.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea69afc5c1404fb4db7d79493104172dcf6c57d66895199044e91709d07c7e0f"}},{"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":"deepspeed/inference/v2/model_implementations/llama_v2/container.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d25d13cb921db608a0062f9f551af64cbf28fc449d13f72264ac45dccfe95415"}},{"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":"op_builder/sdaa/fused_adam.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"037e164eef3c70fd83602ee3375d35ef7d6b67ecbcd25117047cf3a84401d746"}},{"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":"deepspeed/inference/v2/kernels/cutlass_ops/moe_gemm/moe_gemm.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"803c6cf759255bd042c50aaa241acfc7294a3eb80068ac72ca229bb767a10d8e"}},{"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":"deepspeed/inference/v2/kernels/ragged_ops/top_k_gating/top_k_gating.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"636a0b9c2208f7f09967f33ad06e049fa27de9ef393ead80bbf5f1519dd4bcf2"}},{"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":"deepspeed/inference/v2/model_implementations/common_parameters/moe_parameters.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8238037213292c5228bcb320e0717f1576bd87e79fe9c568561f49af0247d82"}},{"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":"deepspeed/inference/v2/kernels/ragged_ops/moe_scatter/moe_scatter.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc7ed364ad403e44b6789e8639cf8251a23c7e7911f198c6f66bfc0460f54db5"}},{"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":"deepspeed/inference/v2/kernels/core_ops/bias_activations/bias_activation.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ac18be5f7cefa6a79ca1ec03e8263fedd68339063ac962b057c3383a5a5126f"}},{"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":"op_builder/supa/fused_lamb.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d56e2970858bb1fce95e135470c31bef7cba0d6356be13206a7c91959b7ba17d"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: universal_checkpoint.py \u2194 bf16_optimizer.py: \u0060deepspeed/checkpoint/universal_checkpoint.py\u0060 and \u0060deepspeed/runtime/bf16_optimizer.py\u0060 change together 58% of the time (7 of the 12 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well \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 7 shared commits counted here, the most recent 3 are \u00608af59b2e\u0060 Restore fp32 masters for ZeRO-3 and the ZeRO-1 BF16 optimizer (#8892); \u00602dd22dc1\u0060 Keep fp32 masters on ZeRO-1 and ZeRO-2 when a resume skips optimizer \u2026; \u0060f2bb1ec6\u0060 Add Feature Universal Checkpoint for AutoTP (#7908) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"deepspeed/checkpoint/universal_checkpoint.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"33c103a146f9d54ff69bb2042dda5f387802dc2263c010b84e99df1d5aa4a4a1"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: unfused_optimizer.py \u2194 stage_1_and_2.py: \u0060deepspeed/runtime/fp16/unfused_optimizer.py\u0060 and \u0060deepspeed/runtime/zero/stage_1_and_2.py\u0060 change together 50% of the time (12 of the 24 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well \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 12 shared commits counted here, the most recent 3 are \u0060991ccf0f\u0060 Keep invalid group-norm sentinels from becoming a finite 1.0 step (#8\u2026; \u0060ca7455ef\u0060 A zero-element parameter loses its shape when it is bound to a flat b\u2026; \u0060c56a4b9e\u0060 Improve universal checkpoint (#5289) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"deepspeed/runtime/fp16/unfused_optimizer.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ae4db7ef42a327712e640646b67f94c5d87a15bbeb2abc661e929303ad59ddc"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: launch.py \u2194 runner.py: \u0060deepspeed/launcher/launch.py\u0060 and \u0060deepspeed/launcher/runner.py\u0060 change together 50% of the time (10 of the 20 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well \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 10 shared commits counted here, the most recent 3 are \u0060066d9120\u0060 [logging] less startup noise (#7526); \u00600b5252bb\u0060 [CPU support] Optionally bind each rank to different cores on host (#\u2026; \u0060e669aaf5\u0060 Trajepl/nebula ckpt engine (#2085) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"deepspeed/launcher/launch.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"023b37920346d8dca82755a00f123e28f3e83add79031d9edbdfaef8f71fc33f"}},{"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":"90f83b4fa27db32740afe9540c905f3c0499caed87f61049a8a903ecc95b41c3"},"taxa":[{"id":"CICD-SEC-8","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D36","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":"a20e8e9f7b30bde35e9d51a3ab876ba393fc8789477f1daa1528678aada1bef3"}},{"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":"7ad4701c91f7eaa24aa7b7536975da3068c18dd1ab098025ae5c285286432c8e"},"taxa":[{"id":"CICD-SEC-6","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":"c4cf10a4b885fb0ffff90f275cf7ba1b95599245e46ff08b3753c8d172e2ce07"},"taxa":[{"id":"CICD-SEC-4","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":"dc5eb6d5700f1296d1b1ad364ea95d63be1b10cd2f64f0566933736af5644df0"},"taxa":[{"id":"CICD-SEC-4","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":"4cf7f420345cfaca5f89d309dd8474df0ac15bff8d1a72f52c7dba963eea5cc9"},"taxa":[{"id":"CICD-SEC-4","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":"e66a901d33bda61d32c82a17657400bcac50df514cc79f458f1434f90586a709"},"taxa":[{"id":"CICD-SEC-4","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":"e8d17ea2297e30a396191f2cdb1346669ef9d759a57f4c2465203a0ed20c4d21"},"taxa":[{"id":"CICD-SEC-4","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":"4988100bb4b1e120de1d9bc5c4556b5d547035194c508922ce25ab5331721520"},"taxa":[{"id":"CICD-SEC-4","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":"1480e175f9778f29d2af34d03fa232dc6b22644dce186d53daca744d9902c1ac"},"taxa":[{"id":"CICD-SEC-4","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":"bfffe1edae4a8c12c4370e233c30b76a5caba21f69430ee521a0532f2f5ea963"},"taxa":[{"id":"CICD-SEC-4","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":"473a10847e2cccf2234a7e2afa1095136fc6cad592d4184b8be0f2dcf4c538e4"},"taxa":[{"id":"CICD-SEC-4","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":"cfe49d422d01ee696ca65f47f9cc1c547aede3c7e5536229e5de4a078ae351cb"},"taxa":[{"id":"CICD-SEC-4","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":"9bba1d4c09500a6163b5abfd2e0a224c38c02fbf1cc1bbf464d518ea02bc1118"},"taxa":[{"id":"CICD-SEC-5","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":"f6b4c9d2959cc5ef8da1c45cba644150b383cce639b3a2dca0f3a54bf3b7b6ff"},"taxa":[{"id":"CICD-SEC-5","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":"14ef760a7202968ca2bf59efaa440209b087e3306ebe3cff89a4c3298258cf0b"},"taxa":[{"id":"CICD-SEC-5","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":"5d400f6bb8c6fd1bd4aff6c73b6bd61133420b8da46451c355dbd098797b6755"},"taxa":[{"id":"CICD-SEC-5","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":"d657599f6f99da1927d3377533dfc0888b34c4d84aa7d5579841fd72d0e39bce"},"taxa":[{"id":"CICD-SEC-6","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":"ace515990e7ee0f17b5c17e44dd168a5bdecf90804a3a3dd845cf05540978013"},"taxa":[{"id":"CICD-SEC-3","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"M2","level":"note","message":{"text":"No ADRs: No Architecture Decision Records found \u2014 no conventional ADR directory, no numbered \u0060NNNN-title\u0060 documents in any markup this check reads, and nothing ADR-shaped by content. Design rationale recorded elsewhere (a design-notes tree, a mailing list, pull-request discussion) is not visible to this check and is not re-findable per decision, so a future maintainer cannot ask why one choice was made and get an answer."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"670b3d6e36a756d63097d0dfbf90afd5fc761308800b9354894a07c3f4e4aa14"}},{"ruleId":"P1","level":"warning","message":{"text":"CI formatting step cannot fail: \u0060grep -E \u0022clang-format|pre-commit\u0022 requirements/requirements-dev.txt | xargs pip install\u0060 invokes clang-format in the mode that REWRITES the files it reformats and exits 0 whatever it changed. The rewrite happens inside the runner\u0027s throwaway checkout and is then discarded, so the step passes on a badly-formatted change exactly as it passes on a clean one \u2014 it enforces nothing, and no other step in this file reads the result. \u0060--dry-run --Werror\u0060 is the flag that turns the same invocation into a gate: it leaves the files alone and exits non-zero when anything would have been reformatted."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".github/workflows/formatting.yml"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3f066d5f784214ece6171a662f36abadd124d6d6755b753a36f33ee1dfb614a"}},{"ruleId":"P1","level":"warning","message":{"text":"CI formatting step cannot fail: \u0060pip show pre-commit clang-format\u0060 invokes clang-format in the mode that REWRITES the files it reformats and exits 0 whatever it changed. The rewrite happens inside the runner\u0027s throwaway checkout and is then discarded, so the step passes on a badly-formatted change exactly as it passes on a clean one \u2014 it enforces nothing, and no other step in this file reads the result. \u0060--dry-run --Werror\u0060 is the flag that turns the same invocation into a gate: it leaves the files alone and exits non-zero when anything would have been reformatted."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".github/workflows/formatting.yml"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"cca9b233419c00a4b259eb5747a39b73b71d2c334f6047816aa4965eafaf6e0a"}},{"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 28 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/amd-mi200.yml"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e54424179c892f03ef2fd003130ac4bd43f39bbf3b1ca0a0143e25acb80ec87"}},{"ruleId":"P6","level":"note","message":{"text":"No changelog: No CHANGELOG/HISTORY/RELEASES file \u2014 what shipped when isn\u0027t easy to reconstruct for support or audit. (Versioning/tagging makes releases traceable, but a changelog records the what.)"},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"dda5aa5aed8cbb292c3ef2b733bc138f614293ae6426c85e98bf31ef330d9415"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060\u0022ASCEND_HOME_PATH\u0022 in os.environ or os.path.exists(os.environ[\u0022ASCEND_HOME_PATH\u0022])\u0060 appears character-identically in 2 files \u2014 deepspeed/env_report.py, op_builder/npu/builder.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":"deepspeed/env_report.py"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ffb2cbef3418b0aff4b17b247d94a821929eef7f1569536b5a83d585f91a80e"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060\u0022word_embeddings.\u0022 in n or \u0022embed_tokens.\u0022 in n or \u0022wte.\u0022 in n\u0060 appears character-identically in 2 files \u2014 deepspeed/inference/engine.py, deepspeed/module_inject/replace_module.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":"deepspeed/inference/engine.py"},"region":{"startLine":405}}}],"partialFingerprints":{"codehealthFindingId/v1":"a03d7bbeb8551e1eec15557ed258bd0504d429491bfb992fbe7184880f9e0076"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060(self.config.dtype in [torch.float16, torch.bfloat16, torch.int8]) and input.dtype == torch.float\u0060 appears character-identically in 2 files \u2014 deepspeed/model_implementations/transformers/ds_llama2.py, deepspeed/model_implementations/transformers/ds_transformer.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":"deepspeed/model_implementations/transformers/ds_llama2.py"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"da63060376bb03ae4dae84b81cc3edbac26c4bca3c504cf4c0713c8b787e265a"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060(stable_interval \u003E 0) and (stable_interval % self.loss_scale_config.scale_window == 0)\u0060 appears character-identically in 2 files \u2014 deepspeed/runtime/fp16/fused_optimizer.py, deepspeed/runtime/fp16/unfused_optimizer.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":"deepspeed/runtime/fp16/fused_optimizer.py"},"region":{"startLine":428}}}],"partialFingerprints":{"codehealthFindingId/v1":"5bb702685616b1a16f69aca40ceaa4737a2697f259fa89342693326e9d2498c7"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060_TRITON_AVAILABLE and not _IS_ROCM_PYTORCH\u0060 appears character-identically in 4 files \u2014 deepspeed/ops/triton_ops/autoep_fused_token_ops.py, deepspeed/ops/triton_ops/fused_rms_norm.py, deepspeed/ops/triton_ops/fused_rotary_pos_emb.py, deepspeed/runtime/chunked_cross_entropy.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":"deepspeed/ops/triton_ops/autoep_fused_token_ops.py"},"region":{"startLine":227}}}],"partialFingerprints":{"codehealthFindingId/v1":"14bff092f2cbbe98c62e913339a6888e0b1031d945677be7aaa4ab70332f5415"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060buffer in getattr(fp32_partition, \u0027overlap_grad\u0027, None) or []\u0060 appears character-identically in 2 files \u2014 deepspeed/runtime/zenflow/zenflow_stage_1_and_2.py, deepspeed/runtime/zero/stage3.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":"deepspeed/runtime/zenflow/zenflow_stage_1_and_2.py"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad081d0e9670b6ab0f32946fea5b1fb7fb2c20051022bba636b0b8a3ae467faa"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060communication_data_type != tensor.dtype and tensor is not tensor_to_allreduce\u0060 appears character-identically in 2 files \u2014 deepspeed/runtime/zero/stage3.py, deepspeed/runtime/zero/stage_1_and_2.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":"deepspeed/runtime/zero/stage3.py"},"region":{"startLine":2383}}}],"partialFingerprints":{"codehealthFindingId/v1":"c35b57f1a550cccdb43a222aae667e9fb896f6b63a527783c8f1a73d602aa937"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060config.input_dtype != torch.float16 and config.input_dtype != torch.bfloat16\u0060 appears character-identically in 2 files \u2014 deepspeed/inference/v2/modules/implementations/linear/blas_fp_linear.py, deepspeed/inference/v2/modules/implementations/moe/cutlass_multi_gemm.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":"deepspeed/inference/v2/modules/implementations/linear/blas_fp_linear.py"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"49c865a101b56c2f070cb6c26d52df702146532517914c4ced309b2926cb3c95"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060config.triton_autotune and config.layer_id == 0\u0060 appears character-identically in 3 files \u2014 deepspeed/ops/transformer/inference/op_binding/linear.py, deepspeed/ops/transformer/inference/op_binding/qkv_gemm.py, deepspeed/ops/transformer/inference/op_binding/vector_matmul.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":"deepspeed/ops/transformer/inference/op_binding/linear.py"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"0900dc2f00028c9a5811b06620f7079cba9a0c9869e883f0ae76c11f6c29d685"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060cuda_capability is not None and cuda_capability \u003C 6\u0060 appears character-identically in 5 files \u2014 op_builder/inference_core_ops.py, op_builder/inference_cutlass_builder.py, op_builder/ragged_ops.py, op_builder/ragged_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":"op_builder/inference_core_ops.py"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"29c2fbf8a68d597858a0acbf8325402a232ebe4b4589ffe430c1b02a57fe3539"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060cuda_capability is not None and cuda_capability \u003E= 8\u0060 appears character-identically in 7 files \u2014 op_builder/fp_quantizer.py, op_builder/inference_core_ops.py, op_builder/inference_cutlass_builder.py, op_builder/ragged_ops.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":"op_builder/fp_quantizer.py"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"0940f5a07109fc497034dd04e26cc90c576d1a00a5e2543bb91bb02150b6510e"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060deepspeed.HAS_TRITON and self.config.use_triton and self.config.dtype == torch.float16\u0060 appears character-identically in 3 files \u2014 deepspeed/ops/transformer/inference/op_binding/gelu_gemm.py, deepspeed/ops/transformer/inference/op_binding/linear.py, deepspeed/ops/transformer/inference/op_binding/qkv_gemm.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":"deepspeed/ops/transformer/inference/op_binding/gelu_gemm.py"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4aa9838ca6d53991fecb2b35366b2c4ae0a778ed0248c604c62bbfe6f2f3914"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060folding_spec is None or folding_spec.tp_size \u003C= 1\u0060 appears character-identically in 3 files \u2014 deepspeed/runtime/bf16_optimizer.py, deepspeed/runtime/zero/stage3.py, deepspeed/runtime/zero/stage_1_and_2.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":"deepspeed/runtime/bf16_optimizer.py"},"region":{"startLine":307}}}],"partialFingerprints":{"codehealthFindingId/v1":"2794ee21c43d55f612c2d7bc773ebe14ddac2fd596ca08c051109e383a7f0dd8"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060get_present or get_key_value or use_cache\u0060 appears character-identically in 2 files \u2014 deepspeed/model_implementations/transformers/ds_transformer.py, deepspeed/ops/transformer/inference/moe_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":"deepspeed/model_implementations/transformers/ds_transformer.py"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"02ab9822693d4fede01f5b7772055f7efc6531cdcd50b1c6f4abd33e2b5fe8bf"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060group_routing.num_expert_groups or getattr(model_config, \u0027n_group\u0027, None)\u0060 appears character-identically in 2 files \u2014 deepspeed/module_inject/auto_ep_presets/deepseek_v2.py, deepspeed/module_inject/auto_ep_presets/deepseek_v3.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":"deepspeed/module_inject/auto_ep_presets/deepseek_v2.py"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"549863c272402320f2b7a20db0f4e55751d8c8dcbac89bfebc3a3ab45321cb6a"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060group_routing.num_limited_groups or getattr(model_config, \u0027topk_group\u0027, None)\u0060 appears character-identically in 2 files \u2014 deepspeed/module_inject/auto_ep_presets/deepseek_v2.py, deepspeed/module_inject/auto_ep_presets/deepseek_v3.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":"deepspeed/module_inject/auto_ep_presets/deepseek_v2.py"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2d59202ad1d3a10a9383d28af289f95d693fd14988087f8798f0bab7765c1fd"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060hasattr(p, PIPE_REPLICATED) and p.ds_pipe_replicated\u0060 appears character-identically in 3 files \u2014 deepspeed/runtime/fp16/fused_optimizer.py, deepspeed/runtime/utils.py, deepspeed/runtime/zero/stage_1_and_2.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":"deepspeed/runtime/fp16/fused_optimizer.py"},"region":{"startLine":224}}}],"partialFingerprints":{"codehealthFindingId/v1":"1710210ea303ffb69d5df26b4163a069c49fc555c719ff546241d7f7be104170"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060hasattr(param, \u0022allreduce\u0022) and not param.allreduce\u0060 appears character-identically in 2 files \u2014 deepspeed/module_inject/auto_ep_folding.py, deepspeed/moe/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":"deepspeed/module_inject/auto_ep_folding.py"},"region":{"startLine":325}}}],"partialFingerprints":{"codehealthFindingId/v1":"aeaa34a0c50b05b6db7aea0c3291e2454e2c6a98095fc2701b11b56bac759a8e"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060hasattr(param, \u0027ds_id\u0027) and param.ds_status == ZeroParamStatus.NOT_AVAILABLE\u0060 appears character-identically in 2 files \u2014 deepspeed/module_inject/containers/features/hybrid_megatron.py, deepspeed/runtime/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":"deepspeed/module_inject/containers/features/hybrid_megatron.py"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f78083ad3757289904ad73d0c12f157c7dc4660dd76e084d91e7382904593b1"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060hasattr(torch.backends, \u0022mps\u0022) and torch.backends.mps.is_available()\u0060 appears character-identically in 2 files \u2014 accelerator/mps_accelerator.py, op_builder/mps/builder.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":"accelerator/mps_accelerator.py"},"region":{"startLine":182}}}],"partialFingerprints":{"codehealthFindingId/v1":"50b86311cff82c7fdb85f1dc76c63854e6e61ae775bb33781f7796e1b8619a37"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060hasattr(torch.version, \u0027hip\u0027) and torch.version.hip is not None\u0060 appears character-identically in 3 files \u2014 deepspeed/__init__.py, deepspeed/inference/v2/modules/heuristics.py, op_builder/builder.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":"deepspeed/__init__.py"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6d13c9f582446afe8279c0968e4328d07f110565c6f6de28b5d4aca33043aba"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060installed_ops.get(self.name, False) and accelerator_name == get_accelerator()._name\u0060 appears character-identically in 2 files \u2014 op_builder/builder.py, op_builder/xpu/builder.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":"op_builder/builder.py"},"region":{"startLine":603}}}],"partialFingerprints":{"codehealthFindingId/v1":"27b765f4c323078ac7955c8bc63df841f368e76c46ea2c373ab7b1555f1e0ea6"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060isinstance(entry, dict) and entry.get(AUTOEP_ZERO3_EXPERT_STATE_FORMAT_KEY) == AUTOEP_ZERO3_PARTITIONED_EXPERT_STATE_FORMAT\u0060 appears character-identically in 2 files \u2014 deepspeed/checkpoint/autoep_zero3_metadata.py, deepspeed/utils/zero_to_fp32.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":"deepspeed/checkpoint/autoep_zero3_metadata.py"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"0aaad2abac81a393169ecf65d09e6e9d2dd9e8bd44abb13d87a8848b668562b0"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060isinstance(params, Iterable) and not isinstance(params, torch.Tensor)\u0060 appears character-identically in 2 files \u2014 deepspeed/module_inject/layers.py, deepspeed/runtime/zero/partition_parameters.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":"deepspeed/module_inject/layers.py"},"region":{"startLine":846}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f214b3e601bba1d580542168ee8adef4a015e3525961e17423221f935e01712"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060isinstance(value, bool) or not isinstance(value, int) or value \u003C 1\u0060 appears character-identically in 2 files \u2014 deepspeed/checkpoint/autoep_universal.py, deepspeed/checkpoint/reshape_3d_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":"deepspeed/checkpoint/autoep_universal.py"},"region":{"startLine":179}}}],"partialFingerprints":{"codehealthFindingId/v1":"36ce528c78f29d68819167f081ea873048eaadfd1e75d0ed64084bdacc1346b3"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060kwargs[\u0027config\u0027].use_triton and deepspeed.HAS_TRITON\u0060 appears character-identically in 2 files \u2014 deepspeed/module_inject/containers/bert.py, deepspeed/module_inject/containers/distil_bert.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":"deepspeed/module_inject/containers/bert.py"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"93eae5d55c2705f076cb8d57b9c67a34060620c2a50b010a7ee9beb8028131d5"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060len(src_shape) == 2 and len(dst_shape) == 2\u0060 appears character-identically in 2 files \u2014 deepspeed/module_inject/auto_tp.py, deepspeed/module_inject/load_checkpoint.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":"deepspeed/module_inject/auto_tp.py"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"78eee92440af173dfe73d46619298d1ae05d3d12fcbf5d8e6dc7739eec159d64"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060local_sub_group_size \u003E= sub_group_size or id(param) == id(params_group[-1])\u0060 appears character-identically in 2 files \u2014 deepspeed/runtime/superoffload/superoffload_stage3.py, deepspeed/runtime/zero/stage3.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":"deepspeed/runtime/superoffload/superoffload_stage3.py"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"88b21ca323a1e0bd0372b7d54c53434ebfcf7d0bbb07cf7cab912f0f17fa7dae"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060module_name != \u0027all_ops\u0027 and module_name != \u0027builder\u0027\u0060 appears character-identically in 2 files \u2014 op_builder/__init__.py, op_builder/all_ops.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":"op_builder/__init__.py"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a8b2d97b0c3e9bc8284058d81291a982013f5a96602f077d90cb4a6d837da0d"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060module_name != \u0027all_ops\u0027 and module_name != \u0027builder\u0027 and not os.path.isdir( os.path.join(op_builder_absolute_path, module_name))\u0060 appears character-identically in 2 files \u2014 accelerator/cuda_accelerator.py, accelerator/hpu_accelerator.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":"accelerator/cuda_accelerator.py"},"region":{"startLine":380}}}],"partialFingerprints":{"codehealthFindingId/v1":"aebb4fee44ba36570797f8580fecc2b19cd8cf9357a8d23f9a76c3ed02a7a442"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060n_heads_kv \u003C num_shards and num_shards % n_heads_kv != 0\u0060 appears character-identically in 2 files \u2014 deepspeed/inference/v2/model_implementations/sharding/attn.py, deepspeed/inference/v2/model_implementations/sharding/qkv.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":"deepspeed/inference/v2/model_implementations/sharding/attn.py"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ba20a69ba0ac85f3a4a3c47ca730adf4b4d46e0b4efe8d62b1ed4592d2a8063"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060n_heads_kv \u003E= num_shards and n_heads_kv % num_shards != 0\u0060 appears character-identically in 2 files \u2014 deepspeed/inference/v2/model_implementations/sharding/attn.py, deepspeed/inference/v2/model_implementations/sharding/qkv.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":"deepspeed/inference/v2/model_implementations/sharding/attn.py"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"edcb8dc2ad90e570598d9644df18ab2ee618417d66e1ba246fd3dfc8d04a7f6a"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060n_heads_kv is None or n_heads_q == n_heads_kv\u0060 appears character-identically in 2 files \u2014 deepspeed/inference/v2/model_implementations/sharding/attn_out.py, deepspeed/inference/v2/model_implementations/sharding/qkv.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":"deepspeed/inference/v2/model_implementations/sharding/attn_out.py"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"2bcda819c3d7ab690955251b25825db18d75e483883a29f93d260a2239efe3ca"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060not dist.is_initialized() or dist.get_rank() == 0\u0060 appears character-identically in 4 files \u2014 deepspeed/compile/passes/offload_activation.py, deepspeed/inference/engine.py, deepspeed/module_inject/replace_module.py, deepspeed/runtime/hybrid_engine.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":"deepspeed/compile/passes/offload_activation.py"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"63b3739aae8e4a1456fec3d9a8adebfd034a0522d0efc9fef0406a06951e0e3e"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060not hasattr(torch.ops, \u0027deepspeed\u0027) or not hasattr(torch.ops.deepspeed, name)\u0060 appears character-identically in 2 files \u2014 op_builder/supa/inference.py, op_builder/supa/quantizer.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":"op_builder/supa/inference.py"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"344296e6f7c53421540bdcb3c48940e16641c72fd860f314e1d384e4deb2c161"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060not isinstance(prefix, str) or not prefix\u0060 appears character-identically in 2 files \u2014 deepspeed/checkpoint/autoep_universal.py, deepspeed/checkpoint/ds_to_universal.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":"deepspeed/checkpoint/autoep_universal.py"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc9506a713b849ad80ec22e561b661abb84a7e11e37e2e91bb092f0f1cd0da6b"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060not self.is_rocm_pytorch() and torch.cuda.is_available()\u0060 appears character-identically in 8 files \u2014 op_builder/evoformer_attn.py, op_builder/fp_quantizer.py, op_builder/inference_core_ops.py, op_builder/inference_cutlass_builder.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":"op_builder/evoformer_attn.py"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ab3e24871dfcf2b6091963e1804b169081ed7b386c10c931731a248a196f24e"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060offload_optimizer_config is not None and offload_optimizer_config.device != OffloadDeviceEnum.none\u0060 appears character-identically in 2 files \u2014 deepspeed/runtime/zero/stage3.py, deepspeed/runtime/zero/stage_1_and_2.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":"deepspeed/runtime/zero/stage3.py"},"region":{"startLine":857}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb239b923fd182c5dfe6fff099aca2224b9b342bb094264909a8af11b3dbe599"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060offload_param_config is not None and offload_param_config.device != OffloadDeviceEnum.none\u0060 appears character-identically in 2 files \u2014 deepspeed/runtime/zero/parameter_offload.py, deepspeed/runtime/zero/stage3.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":"deepspeed/runtime/zero/parameter_offload.py"},"region":{"startLine":176}}}],"partialFingerprints":{"codehealthFindingId/v1":"98adb56e1a4ef0f95446f689effe498c3bf5cc03ee5a75aba473999d8911e8c1"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060os.path.isfile(filename) and os.path.getsize(filename) == args.io_size\u0060 appears character-identically in 3 files \u2014 deepspeed/nvme/ds_aio_basic.py, deepspeed/nvme/torch_fastio_engine.py, deepspeed/nvme/torch_io.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":"deepspeed/nvme/ds_aio_basic.py"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9bc367eb5c0327d9d3630fb60cf9c7e6385b9afd976d8632a0e061c1b0c5dc4"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060p.grad is not None and self._has_inf_or_nan(p.grad.data)\u0060 appears character-identically in 2 files \u2014 deepspeed/runtime/fp16/loss_scaler.py, deepspeed/runtime/zero/stage3.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":"deepspeed/runtime/fp16/loss_scaler.py"},"region":{"startLine":250}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3cb08bef3053262831b16c24a17b6c2bc4f5261ad0e7c07c54ad18dbe2cf37b"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060proc is not None and not proc.is_alive()\u0060 appears character-identically in 2 files \u2014 deepspeed/runtime/zenflow/engine_stage3.py, deepspeed/runtime/zenflow/zenflow_stage_1_and_2.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":"deepspeed/runtime/zenflow/engine_stage3.py"},"region":{"startLine":575}}}],"partialFingerprints":{"codehealthFindingId/v1":"562a6dded9f6fd8df2fc4cc48bc67264490b3a19f5de5d4daf0c4ee7f638a47c"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060self._muon_allgather_buffers and self._muon_allgather_buffer_bytes \u002B cache_bytes \u003E self._muon_allgather_max_cached_bytes\u0060 appears character-identically in 2 files \u2014 deepspeed/runtime/zero/stage3.py, deepspeed/runtime/zero/stage_1_and_2.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":"deepspeed/runtime/zero/stage3.py"},"region":{"startLine":2206}}}],"partialFingerprints":{"codehealthFindingId/v1":"3adc838b0a3d53be6c188d1a5c1af40135acd06d164c171ba33335900aae5186"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060self.config.mlp_after_attn and pg_utils.is_parallel(self.mp_group)\u0060 appears character-identically in 2 files \u2014 deepspeed/ops/transformer/inference/ds_attention.py, deepspeed/ops/transformer/inference/triton/attention.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":"deepspeed/ops/transformer/inference/ds_attention.py"},"region":{"startLine":180}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6846bb70ae7bd6122291215a244559d0d52167be64d1e54c4773f8c03416b8f"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060self.cpu_offload and self.cpu_offload_pin_memory\u0060 appears character-identically in 2 files \u2014 deepspeed/runtime/zenflow/zenflow_stage_1_and_2.py, deepspeed/runtime/zero/stage_1_and_2.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":"deepspeed/runtime/zenflow/zenflow_stage_1_and_2.py"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"76ca6cb52df4f6514de14793fbe6e840250ae46040865b3c121ec97c89354e64"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060self.dtype != torch.bfloat16 or self.check_grad_overflow\u0060 appears character-identically in 2 files \u2014 deepspeed/runtime/zenflow/zenflow_stage_1_and_2.py, deepspeed/runtime/zero/stage_1_and_2.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":"deepspeed/runtime/zenflow/zenflow_stage_1_and_2.py"},"region":{"startLine":796}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3f100713046d840842fbfd09a1ac9877720753eb9184399c7160077a0801c7e"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060self.has_attention_mask or self.has_bool_tensors\u0060 appears character-identically in 2 files \u2014 deepspeed/runtime/pipe/dualpipev.py, deepspeed/runtime/pipe/engine.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":"deepspeed/runtime/pipe/dualpipev.py"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"9fd6f62c0d7255a489f5110593de321b4a500d9a1785faff1dea7655ede6a49f"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060self.has_moe_layers and is_moe_param_group(param_group)\u0060 appears character-identically in 2 files \u2014 deepspeed/runtime/bf16_optimizer.py, deepspeed/runtime/fp16/fused_optimizer.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":"deepspeed/runtime/bf16_optimizer.py"},"region":{"startLine":197}}}],"partialFingerprints":{"codehealthFindingId/v1":"6dc4cc4a7af0a78f320d0004894a896e873860ae04205ade8433b5de469d67ef"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060self.zenflow and self.micro_step \u003E= self.full_warm_up_rounds\u0060 appears character-identically in 2 files \u2014 deepspeed/runtime/zenflow/zenflow_stage_1_and_2.py, deepspeed/runtime/zero/stage3.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":"deepspeed/runtime/zenflow/zenflow_stage_1_and_2.py"},"region":{"startLine":566}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3f8a0da280a55c2048ff920e630f85032a6ae88698dd21e78ced5e3888d8eb0"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060source_offset == 0 and num_elements == tensor.numel()\u0060 appears character-identically in 2 files \u2014 deepspeed/compile/init_z1_and_2.py, deepspeed/runtime/zero/stage_1_and_2.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":"deepspeed/compile/init_z1_and_2.py"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f273b046c659f398853abb53bb690dd3a64297f7372fa71ad22f66c6b6882e2"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060sub_group_size is None or sub_group_size \u003E= params_group_numel\u0060 appears character-identically in 2 files \u2014 deepspeed/runtime/superoffload/superoffload_stage3.py, deepspeed/runtime/zero/stage3.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":"deepspeed/runtime/superoffload/superoffload_stage3.py"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ce90187301b2a34b93e34c19ba1416203b3d5ddcaabbb14448d5df74d57eae7"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060super().is_compatible(verbose) and aio_compatible\u0060 appears character-identically in 6 files \u2014 op_builder/async_io.py, op_builder/cpu/async_io.py, op_builder/klxpu/async_io.py, op_builder/npu/async_io.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":"op_builder/async_io.py"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"85418bda4b9dac2a01e9c32dc9c74e000f9a41d99dc822dd43f6d65e8be25449"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060super().is_compatible(verbose) and cuda_okay\u0060 appears character-identically in 8 files \u2014 op_builder/evoformer_attn.py, op_builder/fp_quantizer.py, op_builder/inference_core_ops.py, op_builder/inference_cutlass_builder.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":"op_builder/evoformer_attn.py"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5576e61093fd6693b554a005024a6769455645cbb97d70e027affd2f5b31c06"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060tensor_offset \u003E 0 or num_elements \u003C tensor.numel()\u0060 appears character-identically in 2 files \u2014 deepspeed/runtime/zero/stage3.py, deepspeed/runtime/zero/stage_1_and_2.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":"deepspeed/runtime/zero/stage3.py"},"region":{"startLine":2610}}}],"partialFingerprints":{"codehealthFindingId/v1":"43ecd0745749ffc827751c0aca2028cca3dfad5df4ba07de284885361f508922"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060torch_cuda_major \u003C 11 or sys_cuda_major \u003C 11\u0060 appears character-identically in 8 files \u2014 op_builder/evoformer_attn.py, op_builder/fp_quantizer.py, op_builder/inference_core_ops.py, op_builder/inference_cutlass_builder.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":"op_builder/evoformer_attn.py"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"0acea270bde4b4a5836c0cfa3f34247f9013acbc1e5b24efc23f53ba665507ba"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060total_norm == float(\u0027inf\u0027) or total_norm == -float(\u0027inf\u0027) or total_norm != total_norm\u0060 appears character-identically in 2 files \u2014 deepspeed/runtime/utils.py, deepspeed/runtime/zero/stage_1_and_2.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":"deepspeed/runtime/utils.py"},"region":{"startLine":566}}}],"partialFingerprints":{"codehealthFindingId/v1":"5cb4976f7da14a1a63ddf2335c38d34bffebdd6b29b25f951021f1cb90a1c88d"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060put\u0060 is public, takes a document from its caller (line 154) and hands it to \u0060_store_value\u0060, which calls itself at line 73 (\u0060self._store_value\u0060) with a piece of \u0060value\u0060 (and at line 76) \u2014 and nowhere in \u0060_store_value\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_store_value\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"deepspeed/compile/input_storage.py"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"95e9cbaf304c1bbe0fa321fc99de8b10452854a9442b6ac7e7c889280175a407"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060get_val_by_key\u0060 is public and takes \u0060d: dict\u0060 from its caller, and it calls itself at line 138 (\u0060get_val_by_key\u0060) with a piece of \u0060d\u0060 \u2014 and nowhere in \u0060get_val_by_key\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 \u0060get_val_by_key\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"deepspeed/autotuning/utils.py"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a5a9754411885c5ec786042cce4c021e13c1ad491b1c0d5cdddb96ea347dc9c"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060set_val_by_key\u0060 is public and takes \u0060d: dict\u0060 from its caller, and it calls itself at line 149 (\u0060set_val_by_key\u0060) with a piece of \u0060d\u0060 \u2014 and nowhere in \u0060set_val_by_key\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 \u0060set_val_by_key\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"deepspeed/autotuning/utils.py"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ff594a420fc76534bd75020ffcf09dd77601510099d98073096a1edfe909b8e"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060get_tuning_keys\u0060 is public and takes \u0060tuning_space: dict\u0060 from its caller, and it calls itself at line 284 (\u0060get_tuning_keys\u0060) with a piece of \u0060tuning_space\u0060 \u2014 and nowhere in \u0060get_tuning_keys\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 \u0060get_tuning_keys\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"deepspeed/autotuning/utils.py"},"region":{"startLine":284}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8136c909f8dad358b2a9fa1f609325656672ffb3351dc17ad17ac7aea408c7c"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060get_all_configs\u0060 is public, takes a document from its caller (line 290) and hands it to \u0060gen_combinations\u0060, which calls itself at line 302 (\u0060gen_combinations\u0060) with a piece of \u0060d\u0060 \u2014 and nowhere in \u0060gen_combinations\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 \u0060gen_combinations\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"deepspeed/autotuning/utils.py"},"region":{"startLine":302}}}],"partialFingerprints":{"codehealthFindingId/v1":"8eb0e9e6e8632e16bc322a3db5c7523720738f2bc8dbf058e15833d6d708e104"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060canonical_name\u0060 is public, takes a document from its caller (line 317) and hands it to \u0060get_name_by_keys\u0060, which calls itself at line 364 (\u0060get_name_by_keys\u0060) with a piece of \u0060config\u0060 \u2014 and nowhere in \u0060get_name_by_keys\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 \u0060get_name_by_keys\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"deepspeed/autotuning/utils.py"},"region":{"startLine":364}}}],"partialFingerprints":{"codehealthFindingId/v1":"13ea4d2d5b23d0333975972d70c0c052cef8a2aef9980cbc7149ba8efd2571d8"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060get_first_config\u0060 is public and takes \u0060config: dict\u0060 from its caller, and it calls itself at line 399 (\u0060get_first_config\u0060) with a piece of \u0060config\u0060 \u2014 and nowhere in \u0060get_first_config\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 \u0060get_first_config\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"deepspeed/autotuning/utils.py"},"region":{"startLine":399}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc2c0609ed1249db01a1fc8d658a7849e6287afeddeba49e6d7ed1e93f81ee43"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060gen_combinations\u0060 is public and takes \u0060d: dict\u0060 from its caller, and it calls itself at line 50 (\u0060gen_combinations\u0060) with a piece of \u0060d\u0060 \u2014 and nowhere in \u0060gen_combinations\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 \u0060gen_combinations\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"deepspeed/autotuning/tuner/utils.py"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"679227bd762adffe9ccf5f075747ae2b5f1fbfd9b84f724f4f5e8e5ae5909266"}},{"ruleId":"X19","level":"warning","message":{"text":"Process-global state is restored only on the happy path: \u0060print_model_profile\u0060 changes state that belongs to the whole PROCESS and changes it back at the end of the same body \u2014 \u0060sys.stdout\u0060 (replaced at line 308, put back at line 454) \u2014 which says the change was meant to last no longer than this call. But the restore is an ordinary statement on the straight-line path, not a \u0060finally\u0060, so it is skipped by any exception raised in between: the process then keeps the overwritten value for the rest of its life, and every later relative path, \u0060subprocess\u0060 launch, \u0060os.environ\u0060 read or \u0060print\u0060 in ANY module sees it. That failure is silent and remote from its cause \u2014 the function that breaks is not the function that moved the value. The window is not private while it is open either: the working directory, the environment, the umask and \u0060sys.stdout\u0060 are per-process, not per-thread, so a concurrent thread sees the moved value too. The durable fix is not to widen the restore but to stop mutating the global: pass the value to the operation that needs it \u2014 the \u0060cwd=\u0060 and \u0060env=\u0060 arguments of \u0060subprocess.run\u0060/\u0060Popen\u0060 scope both to the CHILD, absolute paths built with \u0060os.path.join\u0060 or \u0060pathlib\u0060 need no working directory, and a stream handed to the code that writes needs no \u0060sys.stdout\u0060. Where the global genuinely must move, \u0060contextlib.chdir\u0060 (3.11\u002B), \u0060contextlib.redirect_stdout\u0060 or a \u0060try\u0060/\u0060finally\u0060 makes the restore run on every path."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"deepspeed/profiling/flops_profiler/profiler.py"},"region":{"startLine":286}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a55283128a003effa2f31a4ec411ec7d2fae1a2c6e38a72ef3a22ecebe89544"}},{"ruleId":"X23","level":"note","message":{"text":"Diagnostic log message is built whether or not it is wanted: \u0060debug\u0060 at line 361 is called with an argument built by \u0060json.dumps(tuning_space)\u0060 (line 361), 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":"deepspeed/autotuning/autotuner.py"},"region":{"startLine":361}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe97c91223e491d2d8929862ee1c9c626d2365239c578e823beeb2d589181d0f"}},{"ruleId":"X23","level":"note","message":{"text":"Diagnostic log message is built whether or not it is wanted: \u0060debug\u0060 at line 421 is called with an argument built by \u0060\u0022\u2026\u0022.join(cmd)\u0060 (line 421), 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":"deepspeed/autotuning/scheduler.py"},"region":{"startLine":421}}}],"partialFingerprints":{"codehealthFindingId/v1":"93546161b88f05aa8a396c5ceaf4a1eb5b6413de59eb87aedbb57f3d019f67ba"}},{"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":"op_builder/builder.py"},"region":{"startLine":229}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b6e4c68bccb4c687aadd5bc0e47bfd1dc8e51efcd60ebac47f7d67ea7155284"}},{"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":"op_builder/builder.py"},"region":{"startLine":408}}}],"partialFingerprints":{"codehealthFindingId/v1":"efd98dc9102559fde6e90969902feca10529cbe516f5bc79bf7a75429b111b3b"}},{"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":"op_builder/supa/fused_adam.py"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c1bfe08a6d95ab80ca7fc723a42e785238a00fb0c0c736bb72ab0c459bd34c6"}},{"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":"op_builder/supa/fused_lamb.py"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa3ec0305f181cc9526ee2bd5c483ac67d6f7c3456550091d7ff06352b59312b"}},{"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":"op_builder/supa/fused_lion.py"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"723812770249025236856003bdb44a4cd6963df62908229db0961d7e145aad8a"}},{"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":"op_builder/npu/quantizer.py"},"region":{"startLine":298}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ebd584c028044391ba0abba20206e506ea47b2a85dd78db02b2b36f48f1bd49"}},{"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":"op_builder/npu/quantizer.py"},"region":{"startLine":310}}}],"partialFingerprints":{"codehealthFindingId/v1":"7aa4b7009f11b7423bc1f3166c5bfe7c6a09ba1961dc702b7f9c76892dcd78bb"}},{"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":"op_builder/klxpu/fused_adam.py"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa2a6bb1dca681470b0ec2d028ca6910959060a090a342106e163bbbb5a1397a"}},{"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":"deepspeed/ops/triton_ops/_triton.py"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"19d43872a9f03bcc1c73936dd7131af1e2cb23fbbec1cc395ac2981228862df4"}},{"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":"deepspeed/moe/ep_tp_dispatch.py"},"region":{"startLine":195}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a7ea19221cc25186b981a7d418bd88b3eeb70b9c59981ebaff1abd216438321"}},{"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":"deepspeed/module_inject/auto_ep.py"},"region":{"startLine":228}}}],"partialFingerprints":{"codehealthFindingId/v1":"afd8df2c8d12c5bab1bb372cf9917652873cdabf538fe6e14a2a6e4bb556540f"}},{"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":"deepspeed/compile/profilers/graph_profile.py"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4f72236a158eccc8ac6851f90e289344d51a28dc58f9d5497bd8c515c4b7dfa"}},{"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":"deepspeed/compile/passes/offload_activation.py"},"region":{"startLine":285}}}],"partialFingerprints":{"codehealthFindingId/v1":"da42e033d24471461e395b747204f1528a643ae7c3a3bcf6956e5a1e26c0dd45"}},{"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":"deepspeed/compile/passes/offload_activation.py"},"region":{"startLine":514}}}],"partialFingerprints":{"codehealthFindingId/v1":"54d688683fc99ec29ffc8b79ea11af2b2042d86f636d0e22bd7aeed949da2328"}},{"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":"deepspeed/comm/torch.py"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8f44ce2b2fe02bf0984e768e70e433c4fc35141d351d0f0b13a42cc8f7111ce"}},{"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":"deepspeed/comm/torch.py"},"region":{"startLine":281}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c66085ddbe0d2797ccc744655b2858d176c6b0481866be2dd24a745318b1d39"}},{"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":"deepspeed/autotuning/autotuner.py"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"8374d9df615bd1492e72d6112cbd191f80137836a3224437dae699942c354c36"}},{"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":"accelerator/cpu_accelerator.py"},"region":{"startLine":379}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6777525e21ad0aabd7f915f7facae55f1056abb61185285b831811602849199"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info\u0060 at line 814 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":"deepspeed/runtime/engine.py"},"region":{"startLine":814}}}],"partialFingerprints":{"codehealthFindingId/v1":"52092b0aeca5b4de6bc0e8de4c5232f46e362013c359282a42d059f98fc70cbc"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info\u0060 at line 917 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":"deepspeed/runtime/engine.py"},"region":{"startLine":917}}}],"partialFingerprints":{"codehealthFindingId/v1":"c57ed55506e17541d180dd348e62e1ffc7e748625824965fe8eb626a69d071f3"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info\u0060 at line 1335 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":"deepspeed/runtime/engine.py"},"region":{"startLine":1335}}}],"partialFingerprints":{"codehealthFindingId/v1":"b53f2a243a568b7958c42f0a8b45d0f320d116215641a31f7ad7de0dd0f3a357"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warning\u0060 at line 2985 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":"deepspeed/runtime/engine.py"},"region":{"startLine":2985}}}],"partialFingerprints":{"codehealthFindingId/v1":"d22eac8ee01845e0fe7c01e99434e1a54bc98579aa6a1eb255328b067a5dffa3"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warning\u0060 at line 4523 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":"deepspeed/runtime/engine.py"},"region":{"startLine":4523}}}],"partialFingerprints":{"codehealthFindingId/v1":"cbd37a2ebc4a1e86c789682a3ff59a780d6716544c7c5cc55d5c28bb7be48aa3"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info\u0060 at line 4558 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":"deepspeed/runtime/engine.py"},"region":{"startLine":4558}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc55213426cb76847a3e76e0c7043ebb8ade24a0a28009d5d4aa4144766801de"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info\u0060 at line 4567 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":"deepspeed/runtime/engine.py"},"region":{"startLine":4567}}}],"partialFingerprints":{"codehealthFindingId/v1":"b06fd89cf088f85e2007f1c2800f06b41a5aee1d3a88a3899eab2fa1c3c95ec9"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info\u0060 at line 4870 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":"deepspeed/runtime/engine.py"},"region":{"startLine":4870}}}],"partialFingerprints":{"codehealthFindingId/v1":"1bfff654d52bb6993e54025bb79158747ab31c4ccdc79cf5848d09bea85fc17a"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info\u0060 at line 4872 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":"deepspeed/runtime/engine.py"},"region":{"startLine":4872}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d4264440c9e89ebbe50afed05aee4c5ab449701c6e4dc80e995dc3a34995759"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info\u0060 at line 4942 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":"deepspeed/runtime/engine.py"},"region":{"startLine":4942}}}],"partialFingerprints":{"codehealthFindingId/v1":"46f0dc993fe60ce1dcb5be9d27087a89ef7b6891736ffdc08211cda96540f5b3"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warning\u0060 at line 4953 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":"deepspeed/runtime/engine.py"},"region":{"startLine":4953}}}],"partialFingerprints":{"codehealthFindingId/v1":"3047c458c72c8f01f5f3c64e84a4c9fdb983c9308635a1e221d29a438aaf56a5"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info\u0060 at line 5049 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":"deepspeed/runtime/engine.py"},"region":{"startLine":5049}}}],"partialFingerprints":{"codehealthFindingId/v1":"aef06b87b004de102c3ed4d4e7fd7102ec34be1e20e0eb8ab2a4394d165c4f2c"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info\u0060 at line 5057 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":"deepspeed/runtime/engine.py"},"region":{"startLine":5057}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2c4623f1b0426164134034afa3e7190822a7bb0ec36794bd1afc256dd8b0a39"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warning\u0060 at line 5216 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":"deepspeed/runtime/engine.py"},"region":{"startLine":5216}}}],"partialFingerprints":{"codehealthFindingId/v1":"70ed132e4641bdbbfeb32114f0e8e7af2768e9cab776968e59de861965b3ae90"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info\u0060 at line 5453 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":"deepspeed/runtime/engine.py"},"region":{"startLine":5453}}}],"partialFingerprints":{"codehealthFindingId/v1":"2bd719fd3f96124d7d6cb6dc85f27404f898a7c63ff7ce4e23d8734831209ba7"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error\u0060 at line 5466 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":"deepspeed/runtime/engine.py"},"region":{"startLine":5466}}}],"partialFingerprints":{"codehealthFindingId/v1":"05b4bf03c270044c978a384ecd547f2bce6e2d6e5839efd39a4b18c9ee6596f1"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info\u0060 at line 5642 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":"deepspeed/runtime/engine.py"},"region":{"startLine":5642}}}],"partialFingerprints":{"codehealthFindingId/v1":"36e9dd0d800b1d8441d2149e5ce52679f6026321ecc43bf2cb53d4f034cac7bf"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info\u0060 at line 5829 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":"deepspeed/runtime/engine.py"},"region":{"startLine":5829}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ed9f2b1da54dd1396aafb06bcd1c89864eaab15bb1a37a7c8f1e1430edff315"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info\u0060 at line 5842 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":"deepspeed/runtime/engine.py"},"region":{"startLine":5842}}}],"partialFingerprints":{"codehealthFindingId/v1":"56c4ff81c3e1ff1d47e3d44ec8a2f42b35cc2ee432350149da4b08bf800dc4bd"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info\u0060 at line 5897 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":"deepspeed/runtime/engine.py"},"region":{"startLine":5897}}}],"partialFingerprints":{"codehealthFindingId/v1":"31b9084617fd2b9494a4ed916eb67c5b7b1805ec58e9f506ca907a903d8b1557"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info\u0060 at line 5978 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":"deepspeed/runtime/engine.py"},"region":{"startLine":5978}}}],"partialFingerprints":{"codehealthFindingId/v1":"b05a8c440cc0fbc9cfbbe1f2a4955549849f3e1480652a473f3876b1391fcb9e"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info\u0060 at line 381 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":"deepspeed/runtime/zero/partition_parameters.py"},"region":{"startLine":381}}}],"partialFingerprints":{"codehealthFindingId/v1":"c773184ec40c7b7628cb1767ebe4987748745cf4423e13b37850b49564f3692b"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info\u0060 at line 1181 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":"deepspeed/runtime/zero/partition_parameters.py"},"region":{"startLine":1181}}}],"partialFingerprints":{"codehealthFindingId/v1":"6978ae0fe3c058a3417d999099b06488c0f1974ab3076799a8b8090ac6e141be"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warning\u0060 at line 1265 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":"deepspeed/runtime/zero/partition_parameters.py"},"region":{"startLine":1265}}}],"partialFingerprints":{"codehealthFindingId/v1":"090d4e623a050629ccc7181f2fb8dd38bf735dc1e5f2103dab00d427389c7426"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warning\u0060 at line 2067 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":"deepspeed/runtime/zero/partition_parameters.py"},"region":{"startLine":2067}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa926c8fa190024a8c380da4be675a293c2cdf96ddc639cbb3656c39ee911760"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on parse failure: \u0060op_builder_dir\u0060 returns \u0060\u0027deepspeed.ops.op_builder.cpu\u0027\u0060 when \u0060ImportError\u0060 is raised, with no log or raise \u2014 a malformed value silently becomes that default. Log the input or fail validation. 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":"accelerator/cpu_accelerator.py"},"region":{"startLine":455}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a73efdc719a984adeb07c1e0ef532d47134d156e9df1166e358b2f7c6046bc4"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on parse failure: \u0060op_builder_dir\u0060 returns \u0060\u0027deepspeed.ops.op_builder\u0027\u0060 when \u0060ImportError\u0060 is raised, with no log or raise \u2014 a malformed value silently becomes that default. Log the input or fail validation. 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":"accelerator/cuda_accelerator.py"},"region":{"startLine":359}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b6181e301a930fd7a98e53d2defc946890cc503d6d3d8b63cc7d2f9af9e7e7e"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on parse failure: \u0060op_builder_dir\u0060 returns \u0060\u0027deepspeed.ops.op_builder.hpu\u0027\u0060 when \u0060ImportError\u0060 is raised, with no log or raise \u2014 a malformed value silently becomes that default. Log the input or fail validation. 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":"accelerator/hpu_accelerator.py"},"region":{"startLine":255}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8a1b46bd51a8ae44e70850d1bac16367cc141f2fd0ca446955c7d2d84f513bb"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on parse failure: \u0060op_builder_dir\u0060 returns \u0060\u0027deepspeed.ops.op_builder.klxpu\u0027\u0060 when \u0060ImportError\u0060 is raised, with no log or raise \u2014 a malformed value silently becomes that default. Log the input or fail validation. 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":"accelerator/klxpu_accelerator.py"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"17766a8c6de368d30315e5741764f993e9830ac3d7d14589f48b880c96ac18d1"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on parse failure: \u0060op_builder_dir\u0060 returns \u0060\u0027deepspeed.ops.op_builder.mlu\u0027\u0060 when \u0060ImportError\u0060 is raised, with no log or raise \u2014 a malformed value silently becomes that default. Log the input or fail validation. 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":"accelerator/mlu_accelerator.py"},"region":{"startLine":239}}}],"partialFingerprints":{"codehealthFindingId/v1":"4520515fb2547738682ad88b734133df4a4cd4496140df9470acf76aa4eeb38a"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on parse failure: \u0060op_builder_dir\u0060 returns \u0060\u0027deepspeed.ops.op_builder.mps\u0027\u0060 when \u0060ImportError\u0060 is raised, with no log or raise \u2014 a malformed value silently becomes that default. Log the input or fail validation. 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":"accelerator/mps_accelerator.py"},"region":{"startLine":261}}}],"partialFingerprints":{"codehealthFindingId/v1":"21343d2f0a9d598bbc9f2edbc038f125edc81c73b6febba4921c9a66f9885248"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on parse failure: \u0060op_builder_dir\u0060 returns \u0060\u0027deepspeed.ops.op_builder.npu\u0027\u0060 when \u0060ImportError\u0060 is raised, with no log or raise \u2014 a malformed value silently becomes that default. Log the input or fail validation. 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":"accelerator/npu_accelerator.py"},"region":{"startLine":308}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e65a65d99539e349b8b9633b7419d300b47755ea5c48abb01767874e92288ac"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on parse failure: \u0060op_builder_dir\u0060 returns \u0060\u0027deepspeed.ops.op_builder.sdaa\u0027\u0060 when \u0060ImportError\u0060 is raised, with no log or raise \u2014 a malformed value silently becomes that default. Log the input or fail validation. 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":"accelerator/sdaa_accelerator.py"},"region":{"startLine":267}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d6baddfd3d07edcdc246d2021b37dca46d28d60f23a0ab5a848b4bedacd09a0"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on parse failure: \u0060op_builder_dir\u0060 returns \u0060\u0027deepspeed.ops.op_builder.supa\u0027\u0060 when \u0060ImportError\u0060 is raised, with no log or raise \u2014 a malformed value silently becomes that default. Log the input or fail validation. 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":"accelerator/supa_accelerator.py"},"region":{"startLine":235}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f78b12b7ccf288f757d13562dc1b77fcfd70e01b762053ccd64e2187d0e8e19"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on parse failure: \u0060op_builder_dir\u0060 returns \u0060\u0027deepspeed.ops.op_builder.xpu\u0027\u0060 when \u0060ImportError\u0060 is raised, with no log or raise \u2014 a malformed value silently becomes that default. Log the input or fail validation. 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":"accelerator/xpu_accelerator.py"},"region":{"startLine":455}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e7c50a990cec532f13a0b923fe0922d3aee0741216e8afaae1eed492870f665"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060_skip_bytes\u0060 swallows every exception into \u0060return 0\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":"deepspeed/compile/passes/offload_activation.py"},"region":{"startLine":285}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2df3fc21beec7fb355364f0197407325b360dd7e3dbdb2e41f34ed5ca0200a9"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060_bytes\u0060 (in \u0060_report_partitioner_split\u0060) swallows every exception into \u0060return 0\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":"deepspeed/compile/passes/offload_activation.py"},"region":{"startLine":514}}}],"partialFingerprints":{"codehealthFindingId/v1":"573986c247b046fa2d1bf8e5a0189f8c532c556fb2748c3014733268ac02a2aa"}}],"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-1059","guid":"a2381a08-60f6-9554-a8b8-f3018cfaaca5","name":"Insufficient Technical Documentation","shortDescription":{"text":"Insufficient Technical Documentation"},"helpUri":"https://cwe.mitre.org/data/definitions/1059.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-269","guid":"70e1f5f6-81e5-4e5a-ba40-b541c3a346e2","name":"Improper Privilege Management","shortDescription":{"text":"Improper Privilege Management"},"helpUri":"https://cwe.mitre.org/data/definitions/269.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-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-522","guid":"71fb233e-ce6a-ae57-9419-ef8373540b09","name":"Insufficiently Protected Credentials","shortDescription":{"text":"Insufficiently Protected Credentials"},"helpUri":"https://cwe.mitre.org/data/definitions/522.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-829","guid":"13c33925-97fb-5a5e-b40c-56d328b8a4d7","name":"Inclusion of Functionality from Untrusted Control Sphere","shortDescription":{"text":"Inclusion of Functionality from Untrusted Control Sphere"},"helpUri":"https://cwe.mitre.org/data/definitions/829.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-913","guid":"062167e8-5db3-0857-a865-a1fc4aad34bc","name":"CWE-913","shortDescription":{"text":"CWE-913"},"helpUri":"https://cwe.mitre.org/data/definitions/913.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-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":"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":"A06:2025","guid":"491554d7-b8e4-9652-91a9-53700dc92ece","name":"Insecure Design","shortDescription":{"text":"Insecure Design"},"helpUri":"https://top10.owasp.org/2025/A06_2025-Insecure_Design/"},{"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-4","guid":"c859d8ea-8b24-a157-9406-94929c10397a","name":"Poisoned Pipeline Execution (PPE)","shortDescription":{"text":"Poisoned Pipeline Execution (PPE)"},"helpUri":"https://owasp.github.io/www-project-top-10-ci-cd-security-risks/CICD-SEC-04-Poisoned-Pipeline-Execution"},{"id":"CICD-SEC-5","guid":"cc7f4610-8859-e654-9029-d5f97d992220","name":"Insufficient PBAC (Pipeline-Based Access Controls)","shortDescription":{"text":"Insufficient PBAC (Pipeline-Based Access Controls)"},"helpUri":"https://owasp.github.io/www-project-top-10-ci-cd-security-risks/CICD-SEC-05-Insufficient-PBAC"},{"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-8","guid":"b6b2dacf-a168-4957-876e-a8c73ee00eb0","name":"Ungoverned Usage of 3rd Party Services","shortDescription":{"text":"Ungoverned Usage of 3rd Party Services"},"helpUri":"https://owasp.github.io/www-project-top-10-ci-cd-security-risks/CICD-SEC-08-Ungoverned-Usage-of-3rd-Party-Services"},{"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":180,"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."]}]}