use crate::cfg_builder;
use crate::parse::traits::calculate_complexity;
use crate::parse::traits::clean_call_text;
use crate::parse::traits::{Block, Edge, EdgeType, Parameter, Visibility};
use crate::parse::traits::{
CodeIntelligence, ComplexityMetrics, Error, Graph, ImportInfo, Result, SignatureInfo,
};
use tree_sitter::Parser;
pub struct LuaParser;
impl Default for LuaParser {
fn default() -> Self {
Self::new()
}
}
impl LuaParser {
pub fn new() -> Self {
Self
}
}
impl CodeIntelligence for LuaParser {
fn get_signatures(&self, source: &[u8]) -> Result<Vec<SignatureInfo>> {
let mut parser = Parser::new();
parser
.set_language(&crate::parse::traits::languages::lua::language())
.map_err(|e| Error::ParseFailed(e.to_string()))?;
let tree = parser
.parse(source, None)
.ok_or_else(|| Error::ParseFailed("Failed to parse Lua source".to_string()))?;
let root_node = tree.root_node();
let imports = extract_lua_imports(root_node, source);
let mut signatures = Vec::new();
visit(&root_node, source, &mut signatures, &[]);
for sig in &mut signatures {
sig.imports = imports.clone();
}
Ok(signatures)
}
fn compute_cfg(&self, source: &[u8], node_id: usize) -> Result<Graph<Block, Edge>> {
let mut parser = Parser::new();
parser
.set_language(&crate::parse::traits::languages::lua::language())
.map_err(|e| Error::ParseFailed(e.to_string()))?;
let tree = parser
.parse(source, None)
.ok_or_else(|| Error::ParseFailed("Failed to parse Lua source".to_string()))?;
let root_node = tree.root_node();
let node = crate::parse::traits::find_node_by_id(&root_node, node_id)
.ok_or_else(|| Error::ParseFailed(format!("Node {} not found", node_id)))?;
let mut cfg_builder = CfgBuilder::new(source);
cfg_builder.build_from_node(&node)?;
Ok(cfg_builder.finish())
}
fn extract_complexity(&self, node: &tree_sitter::Node<'_>) -> ComplexityMetrics {
let mut complexity = ComplexityMetrics {
cyclomatic: 1,
nesting_depth: 0,
line_count: 0,
token_count: 0,
};
calculate_complexity(node, &mut complexity, 0, DECISION_KINDS);
complexity
}
}
fn visit(
node: &tree_sitter::Node<'_>,
source: &[u8],
sigs: &mut Vec<SignatureInfo>,
parent_path: &[String],
) {
match node.kind() {
"function_declaration" => {
let name = node
.children(&mut node.walk())
.find(|c| c.kind() == "identifier")
.and_then(|n| n.utf8_text(source).ok())
.map(|s| s.to_string());
if let Some(name) = name {
let parameters = node
.child_by_field_name("parameters")
.map(|params| extract_parameters(¶ms, source))
.unwrap_or_default();
let mut qualified_path = parent_path.to_vec();
qualified_path.push(name.clone());
let qualified_name = qualified_path.join(".");
let calls = extract_lua_calls(node, source);
sigs.push(SignatureInfo {
name: name.clone(),
qualified_name,
parameters,
return_type: None,
visibility: Visibility::Public,
is_async: false,
is_method: !parent_path.is_empty(),
docstring: extract_docstring(node, source),
calls,
imports: vec![],
byte_range: (0, 0),
flow_facts: vec![],
cyclomatic_complexity: 0,
});
}
}
_ => {
let mut c = node.walk();
for ch in node.children(&mut c) {
visit(&ch, source, sigs, parent_path);
}
}
}
}
fn extract_lua_imports(root: tree_sitter::Node<'_>, source: &[u8]) -> Vec<ImportInfo> {
let mut imports = Vec::new();
fn add_import(imports: &mut Vec<ImportInfo>, path: &str) {
let path = path.trim().trim_matches('"').trim_matches('\'').trim();
if path.is_empty() {
return;
}
imports.push(ImportInfo {
path: path.to_string(),
alias: None,
});
}
fn visit(node: &tree_sitter::Node<'_>, source: &[u8], imports: &mut Vec<ImportInfo>) {
if node.kind() == "function_call" || node.kind() == "method_call" {
if let Some(name) = node
.child_by_field_name("name")
.or_else(|| node.child_by_field_name("function"))
.and_then(|n| n.utf8_text(source).ok())
{
if name == "require" {
if let Some(args) = node.child_by_field_name("arguments") {
if let Ok(text) = args.utf8_text(source) {
let cleaned = text.trim().trim_matches('(').trim_matches(')');
add_import(imports, cleaned);
}
}
}
}
}
let mut cursor = node.walk();
for child in node.children(&mut cursor) {
visit(&child, source, imports);
}
}
visit(&root, source, &mut imports);
imports
}
fn extract_lua_calls(node: &tree_sitter::Node<'_>, source: &[u8]) -> Vec<String> {
let mut calls = Vec::new();
fn find_calls(node: &tree_sitter::Node<'_>, source: &[u8], calls: &mut Vec<String>) {
match node.kind() {
"function_call" | "method_call" => {
if let Some(func) = node
.child_by_field_name("name")
.or_else(|| node.child_by_field_name("function"))
{
if let Ok(text) = func.utf8_text(source) {
let name = clean_call_text(text);
if !name.is_empty() {
calls.push(name);
}
}
}
}
_ => {}
}
let mut cursor = node.walk();
for child in node.children(&mut cursor) {
find_calls(&child, source, calls);
}
}
find_calls(node, source, &mut calls);
calls
}
fn extract_parameters(params_node: &tree_sitter::Node<'_>, source: &[u8]) -> Vec<Parameter> {
let mut parameters = Vec::new();
let mut cursor = params_node.walk();
for child in params_node.children(&mut cursor) {
if child.kind() == "identifier" {
if let Ok(name) = child.utf8_text(source) {
parameters.push(Parameter {
name: name.to_string(),
type_annotation: None,
default_value: None,
});
}
}
}
parameters
}
fn extract_docstring(node: &tree_sitter::Node<'_>, source: &[u8]) -> Option<String> {
let mut cursor = node.walk();
for child in node.children(&mut cursor) {
if child.kind() == "comment" {
if let Ok(comment) = child.utf8_text(source) {
let cleaned = comment
.trim_start_matches("--[[")
.trim_start_matches("--[=[")
.trim_start_matches("--")
.trim_end_matches("]]")
.trim_end_matches("]=]")
.trim()
.to_string();
if !cleaned.is_empty() {
return Some(cleaned);
}
}
}
}
None
}
const DECISION_KINDS: &[&str] = &[
"if_statement",
"while_statement",
"for_statement",
"repeat_statement",
"elseif",
];
cfg_builder!();
impl<'a> CfgBuilder<'a> {
fn build_from_node(&mut self, node: &tree_sitter::Node<'_>) -> Result<()> {
let entry_id = self.create_block();
self.build_cfg_recursive(node, entry_id)?;
Ok(())
}
fn build_cfg_recursive(
&mut self,
node: &tree_sitter::Node<'_>,
current_block: usize,
) -> Result<()> {
match node.kind() {
"if_statement" => {
self.handle_if_statement(node, current_block)?;
}
"while_statement" => {
self.handle_while_statement(node, current_block)?;
}
"for_statement" => {
self.handle_for_statement(node, current_block)?;
}
"repeat_statement" => {
self.handle_repeat_statement(node, current_block)?;
}
_ => {
if let Ok(text) = node.utf8_text(self.source) {
self.add_statement_to_block(current_block, text.to_string());
}
let mut cursor = node.walk();
for child in node.children(&mut cursor) {
self.build_cfg_recursive(&child, current_block)?;
}
}
}
Ok(())
}
fn handle_while_statement(
&mut self,
_node: &tree_sitter::Node<'_>,
current_block: usize,
) -> Result<()> {
let body_block = self.create_block();
self.edges.push(Edge {
from: current_block,
to: body_block,
edge_type: EdgeType::TrueBranch,
});
self.edges.push(Edge {
from: body_block,
to: current_block,
edge_type: EdgeType::Loop,
});
Ok(())
}
fn handle_for_statement(
&mut self,
_node: &tree_sitter::Node<'_>,
current_block: usize,
) -> Result<()> {
let body_block = self.create_block();
self.edges.push(Edge {
from: current_block,
to: body_block,
edge_type: EdgeType::Unconditional,
});
self.edges.push(Edge {
from: body_block,
to: current_block,
edge_type: EdgeType::Loop,
});
Ok(())
}
fn handle_repeat_statement(
&mut self,
_node: &tree_sitter::Node<'_>,
current_block: usize,
) -> Result<()> {
let body_block = self.create_block();
self.edges.push(Edge {
from: current_block,
to: body_block,
edge_type: EdgeType::Unconditional,
});
self.edges.push(Edge {
from: body_block,
to: current_block,
edge_type: EdgeType::Loop,
});
Ok(())
}
}
#[cfg(test)]
mod tests {
use super::*;
#[test]
fn test_lua_function() {
let source = b"function greet(name)\n return \"Hello, \" .. name\nend";
let parser = LuaParser::new();
let sigs = parser.get_signatures(source).unwrap();
assert!(!sigs.is_empty());
assert_eq!(sigs[0].name, "greet");
assert_eq!(sigs[0].parameters.len(), 1);
assert_eq!(sigs[0].parameters[0].name, "name");
}
#[test]
fn test_lua_complexity_calculation() {
let source = b"
function complex(x)
if x > 0 then
for i = 1, x do
if i % 2 == 0 then
return i
end
end
end
return x
end";
let mut parser = Parser::new();
parser
.set_language(&crate::parse::traits::languages::lua::language())
.unwrap();
let tree = parser.parse(source, None).unwrap();
let root = tree.root_node();
let lua_parser = LuaParser::new();
let metrics = lua_parser.extract_complexity(&root);
assert!(metrics.cyclomatic > 1);
assert!(metrics.nesting_depth > 0);
}
}