File size: 12,994 Bytes
9abace2 | 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 387 388 389 390 391 392 393 394 395 396 397 398 399 400 401 402 403 404 405 406 407 408 409 410 411 412 413 414 415 416 | """
Dependency Analyzer
Part of SOVEREIGN PYTHON LLM ENGINE
Analyzes dependencies between modules and builds dependency graphs.
"""
from typing import Set
from dataclasses import dataclass, field
from pathlib import Path
from enum import Enum
import re
from ..models.entities import DependencyEdge, DependencyGraph as DependencyGraphEntity
from .ast_analyzer import PythonASTAnalyzer
class DependencyType(Enum):
"""Types of dependencies"""
IMPORT = "import"
FROM_IMPORT = "from_import"
RELATIVE_IMPORT = "relative_import"
DYNAMIC_IMPORT = "dynamic_import"
@dataclass
class ModuleNode:
"""Node in dependency graph"""
module_path: str
imports: Set[str] = field(default_factory=set)
imported_by: Set[str] = field(default_factory=set)
is_external: bool = False
is_stdlib: bool = False
class DependencyAnalyzer:
"""
Analyzes Python module dependencies.
Builds dependency graphs showing:
- What each module imports
- What imports each module
- Circular dependencies
- External vs internal dependencies
"""
STDLIB_MODULES = {
"os", "sys", "re", "json", "math", "datetime", "pathlib",
"asyncio", "typing", "dataclasses", "enum", "abc", "collections",
"functools", "itertools", "operator", "io", "tempfile", "shutil",
"subprocess", "threading", "multiprocessing", "logging", "unittest",
"http", "urllib", "email", "html", "xml", "csv", "sqlite3",
"hashlib", "hmac", "secrets", "random", "time", "calendar",
"contextlib", "copy", "pickle", "struct", "array", "heapq",
"bisect", "queue", "weakref", "gc", "inspect", "ast", "dis",
"importlib", "pkgutil", "zipfile", "tarfile", "gzip", "bz2",
"socket", "ssl", "select", "signal", "errno", "platform",
}
def __init__(self, project_root: Path):
"""
Initialize dependency analyzer.
Args:
project_root: Root directory of project
"""
self.project_root = project_root
self.ast_analyzer = PythonASTAnalyzer()
self.modules: dict[str, ModuleNode] = {}
def analyze_directory(self, directory: Path | None = None) -> DependencyGraphEntity:
"""
Analyze all Python files in directory.
Args:
directory: Directory to analyze (defaults to project_root)
Returns:
DependencyGraph with all relationships
"""
if directory is None:
directory = self.project_root
# Find all Python files
python_files = list(directory.rglob("*.py"))
# Analyze each file
for file_path in python_files:
self._analyze_file(file_path)
# Build graph entity
edges = []
for module_path, node in self.modules.items():
for imported in node.imports:
edges.append(DependencyEdge(
source=module_path,
target=imported,
dependency_type="import"
))
return DependencyGraphEntity(
nodes=list(self.modules.keys()),
edges=edges
)
def _analyze_file(self, file_path: Path) -> None:
"""Analyze single Python file"""
# Get module path relative to project root
try:
rel_path = file_path.relative_to(self.project_root)
except ValueError:
# File outside project root
return
module_path = self._path_to_module(rel_path)
# Create or get module node
if module_path not in self.modules:
self.modules[module_path] = ModuleNode(module_path=module_path)
node = self.modules[module_path]
# Parse AST
file_info = self.ast_analyzer.analyze_file(file_path)
# Extract imports
for import_name in file_info.imports:
# Resolve import
resolved = self._resolve_import(import_name, module_path)
# Add to graph
node.imports.add(resolved)
# Create target node if doesn't exist
if resolved not in self.modules:
is_external = not self._is_internal_module(resolved)
is_stdlib = resolved.split(".")[0] in self.STDLIB_MODULES
self.modules[resolved] = ModuleNode(
module_path=resolved,
is_external=is_external,
is_stdlib=is_stdlib
)
# Add reverse link
self.modules[resolved].imported_by.add(module_path)
def _path_to_module(self, path: Path) -> str:
"""Convert file path to module path"""
# Remove .py extension
parts = list(path.parts)
if parts[-1].endswith(".py"):
parts[-1] = parts[-1][:-3]
# Remove __init__
if parts[-1] == "__init__":
parts = parts[:-1]
return ".".join(parts)
def _resolve_import(self, import_name: str, current_module: str) -> str:
"""Resolve import to canonical module path"""
# Handle relative imports
if import_name.startswith("."):
# Get parent module
parts = current_module.split(".")
level = len(import_name) - len(import_name.lstrip("."))
if level > len(parts):
# Invalid relative import
return import_name
parent_parts = parts[:-level] if level > 0 else parts
rest = import_name.lstrip(".")
if rest:
return ".".join(parent_parts + [rest])
else:
return ".".join(parent_parts)
return import_name
def _is_internal_module(self, module: str) -> bool:
"""Check if module is internal to project"""
# Check if any file in project matches this module
module_file = self.project_root / module.replace(".", "/")
return (
(module_file.with_suffix(".py")).exists() or
(module_file / "__init__.py").exists()
)
def find_circular_dependencies(self) -> list[list[str]]:
"""
Find circular dependencies.
Returns:
List of cycles (each cycle is list of module names)
"""
cycles = []
visited = set()
rec_stack = set()
def dfs(module: str, path: list[str]) -> None:
visited.add(module)
rec_stack.add(module)
path.append(module)
node = self.modules.get(module)
if node:
for imported in node.imports:
if imported not in visited:
dfs(imported, path.copy())
elif imported in rec_stack:
# Found cycle
cycle_start = path.index(imported)
cycle = path[cycle_start:] + [imported]
cycles.append(cycle)
rec_stack.remove(module)
for module in self.modules:
if module not in visited:
dfs(module, [])
return cycles
def get_external_dependencies(self) -> Set[str]:
"""Get all external (non-project) dependencies"""
external = set()
for module, node in self.modules.items():
if node.is_external and not node.is_stdlib:
external.add(module.split(".")[0]) # Top-level package
return external
def get_module_dependents(self, module: str) -> Set[str]:
"""
Get all modules that depend on given module.
Args:
module: Module to check
Returns:
Set of dependent modules
"""
node = self.modules.get(module)
if not node:
return set()
return node.imported_by.copy()
def get_module_dependencies(self, module: str) -> Set[str]:
"""
Get all modules that given module depends on.
Args:
module: Module to check
Returns:
Set of dependencies
"""
node = self.modules.get(module)
if not node:
return set()
return node.imports.copy()
def calculate_coupling(self, module: str) -> dict[str, int]:
"""
Calculate coupling metrics for module.
Args:
module: Module to analyze
Returns:
Dictionary with metrics:
- afferent: Number of modules that depend on this
- efferent: Number of modules this depends on
- instability: Efferent / (Afferent + Efferent)
"""
node = self.modules.get(module)
if not node:
return {"afferent": 0, "efferent": 0, "instability": 0.0}
afferent = len(node.imported_by)
efferent = len(node.imports)
total = afferent + efferent
instability = efferent / total if total > 0 else 0.0
return {
"afferent": afferent,
"efferent": efferent,
"instability": instability
}
def generate_dot_graph(self) -> str:
"""
Generate DOT graph representation.
Returns:
DOT format string for visualization
"""
lines = ["digraph Dependencies {"]
lines.append(" rankdir=LR;")
lines.append(' node [shape=box];')
# Add nodes
for module, node in self.modules.items():
if node.is_stdlib:
color = "lightblue"
elif node.is_external:
color = "lightgray"
else:
color = "lightgreen"
lines.append(f' "{module}" [fillcolor={color}, style=filled];')
# Add edges
for module, node in self.modules.items():
for imported in node.imports:
lines.append(f' "{module}" -> "{imported}";')
lines.append("}")
return "\n".join(lines)
class DependencyGraph:
"""
Wrapper around DependencyAnalyzer with convenience methods.
"""
def __init__(self, project_root: Path):
self.analyzer = DependencyAnalyzer(project_root)
self.graph: DependencyGraphEntity | None = None
def build(self, directory: Path | None = None) -> None:
"""Build dependency graph"""
self.graph = self.analyzer.analyze_directory(directory)
def get_orphaned_modules(self) -> list[str]:
"""
Get modules with no imports and not imported by anyone.
Returns:
List of orphaned module names
"""
orphaned = []
for module, node in self.analyzer.modules.items():
if not node.imports and not node.imported_by:
if not node.is_external:
orphaned.append(module)
return orphaned
def get_most_depended_on(self, limit: int = 10) -> list[tuple[str, int]]:
"""
Get most depended-on modules.
Args:
limit: Number of results
Returns:
List of (module, dependent_count) tuples
"""
modules_with_counts = [
(module, len(node.imported_by))
for module, node in self.analyzer.modules.items()
if not node.is_external
]
return sorted(modules_with_counts, key=lambda x: x[1], reverse=True)[:limit]
def get_most_dependent(self, limit: int = 10) -> list[tuple[str, int]]:
"""
Get modules with most dependencies.
Args:
limit: Number of results
Returns:
List of (module, dependency_count) tuples
"""
modules_with_counts = [
(module, len(node.imports))
for module, node in self.analyzer.modules.items()
if not node.is_external
]
return sorted(modules_with_counts, key=lambda x: x[1], reverse=True)[:limit]
def export_json(self) -> dict:
"""Export graph as JSON"""
if not self.graph:
return {}
return {
"nodes": [
{
"id": module,
"is_external": node.is_external,
"is_stdlib": node.is_stdlib,
"imports_count": len(node.imports),
"imported_by_count": len(node.imported_by),
}
for module, node in self.analyzer.modules.items()
],
"edges": [
{"source": edge.source, "target": edge.target}
for edge in self.graph.edges
]
}
|