python-code-analysis/__main__.py at main · sdardew/python-code-analysis · GitHub

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
import ast
import re


# 나중에 dfs로 변경
def is_recursive(ast_tree):
    """ Returns
    Args:
        tree (ast.Module): ast tree

    Returns:
        bool: return recursive or not
    """
    for child in ast.iter_child_nodes(ast_tree):
        if isinstance(child, ast.FunctionDef):
            function_name = child.name # function name
            for c in ast.iter_child_nodes(child):
                if ('Call(func=Name(id=\'' + function_name) in ast.dump(c):
                    return True
    return False

# binary search를 사용하는지 확인
# import한 라이브러리를 알 수 있음
# 수정 => body 안에서 타고 내려갈 수 있도록
def get_libraries(ast_tree):
    dump_ast_tree = ast.dump(ast_tree, indent=0).split()
    # code = code.split()
    libraries = []
    import_pattern = re.compile('name=[a-z\']+')
    import_from_pattern = re.compile('module=[a-z\']+')

    for i in range(len(dump_ast_tree)):
        if dump_ast_tree[i][:-1] == 'Import':
            libraries.append(import_pattern.search(dump_ast_tree[i+2]).group()[6:-1])
        elif dump_ast_tree[i][:-1] == 'ImportFrom':
            libraries.append(import_pattern.search(dump_ast_tree[i+3]).group()[6:-1] + ' from ' + import_from_pattern.search(dump_ast_tree[i+1]).group()[8:-1])

    return libraries

# list, dictionary, set, deque
# queue 1. Collection 모듈의 deque, 2. queue 모듈의 Queue
# flattening한 ast_tree필요 -> ast.dump(ast_tree)
# return : dictionary로 변환 -> json형태를 위해
def get_data_structure(ast_tree):
    return_list = []

    t = ast.dump(ast_tree)
    # print(t)

    # count set
    if 'Call(func=Name(id=\'set\'' in t:
        return_list.append(('set', t.count('Call(func=Name(id=\'set\'')))

    # count deque
    if 'value=Call(func=Name(id=\'deque\'' in t:
        return_list.append(('deque', t.count('value=Call(func=Name(id=\'deque\'')))

    # count list
    value = 0
    value += t.count('Call(func=Name(id=\'list\'')
    value += t.count('value=List')

    if value:
        return_list.append(('list', value))

    value = 0
    value += t.count('value=Dict')
    value += t.count('Call(func=Name(id=\'dict\'')

    if value:
        return_list.append(('dictionary', value))


    return return_list

# binary search를 사용하고 있는지 검사
# ast.dump(ast_tree)
def is_bisect(ast_tree):
    dump_ast_tree = ast.dump(ast_tree)
    if 'Call(func=Name(id=\'bisect_left\'' in dump_ast_tree or 'Call(func=Name(id=\'bisect_right\'' in dump_ast_tree:
        return True
    return False

def get_func(ast_tree):
    # print(ast.dump(ast_tree))
    def_pattern = re.compile(r'FunctionDef\(name=\'[A-Za-z0-9\_]+\'')
    find_defs = def_pattern.findall(ast.dump(ast_tree))
    defs = []

    for f in find_defs:
        defs.append(f.split('\'')[1])

    call_pattern1 = re.compile(r'Call\(func=Name\(id=\'[A-Za-z0-9\_]+\'')
    call_pattern2 = re.compile(r'Call\(func=Attribute\(value=Name\(id=\'[A-Za-z0-9\_]+\'\, ctx=Load\(\)\)\, attr=\'[A-Za-z0-9\_]+\'')


    find_calls = call_pattern1.findall(ast.dump(ast_tree))
    calls=[]
    for f in find_calls:
        cname = f.split('\'')[1]
        if cname not in defs:
            calls.append(cname)

    find_calls = call_pattern2.findall(ast.dump(ast_tree))
    for f in find_calls:
        cname = f.split('\'')[-2]
        if cname not in defs:
            calls.append(cname)

    print(calls)
    return calls


def main(code):
    ast_tree = ast.parse(code)
    # print(ast.dump(ast_tree, indent=4))

    print("<library>")
    print(get_libraries(ast_tree))

    print("<recursion>")
    print(is_recursive(ast_tree))

    print("<data structure>")
    print(get_data_structure(ast_tree))

    print("<binary search>")
    print(is_bisect(ast_tree))

    print('<functions>')
    get_func(ast_tree)

# binary search
# 중첩 for문
if __name__ == "__main__":
    f = open("test/test_function.py", 'r')
    try:
        main(f.read())
    finally:
        f.close()