summaryrefslogtreecommitdiff
path: root/main.c
blob: 38cbd42563905eb58f6a94cb1b1f11d496aa3086 (plain)
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
// IMMEDIATE TODO & IDEAS:
//  - Add language specific filter (by default all but it can also passed
//    with -lpy -lc -lrb) which would only parse python, c and ruby files.
//  - By default its case insensitive but with passing -cs it tells that
//    all matching should be done in case sensitive way.
//  - Add pthreads and check how grep does it's magic.
//  - Add Levenshtein distance for matching and expose distance as arg with
//    something like -d5 which would allow distance of 5 on a match.
//  - Allow DEBUG to be provided as environmental variable.

#include <assert.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <pthread.h>

#include <tree_sitter/api.h>

#include "file.h"
#include "list.h"

#define DEBUG 1

typedef struct {
  const char *fname;
  const char *ftype;
  const char *fparams;
  size_t lineno;
} Function;

const char *extract_value(TSNode captured_node, const char *source_code) {
  size_t start = ts_node_start_byte(captured_node);
  size_t end = ts_node_end_byte(captured_node);
  size_t length = end - start;
  char *buffer = malloc(length + 1);  // +1 for the null terminator

  if (buffer != NULL) {
    snprintf(buffer, length + 1, "%.*s", (int)length, &source_code[start]);
    return buffer;
  }

  return NULL;
}

char* remove_newlines(const char* str) {
  size_t length = strlen(str);
  char* result = (char*)malloc(length + 1);  // +1 for the null terminator
  if (result == NULL) {
    fprintf(stderr, "Memory allocation failed\n");
    exit(1);
  }

  size_t j = 0;
  for (size_t i = 0; i < length; i++) {
    if (str[i] != '\n') {
      result[j++] = str[i];
    }
  }

  result[j] = '\0';
  return result;
}

struct ThreadArgs {
  const char* file_path;
  const char* source_code;
  TSLanguage* language;
  const char* cfname;
};

// void parse_source_file(const char *file_path, const char *source_code, TSLanguage *language, const char *cfname) {
void *parse_source_file(void *arg) {
  struct ThreadArgs* args = (struct ThreadArgs*)arg;

  const char *file_path = args->file_path;
  const char *source_code = args->source_code;
  TSLanguage *language = args->language;
  const char *cfname = args->cfname;

  TSParser *parser = ts_parser_new();
  ts_parser_set_language(parser, language);

  TSTree *tree = ts_parser_parse_string(parser, NULL, source_code, strlen(source_code));
  TSNode root_node = ts_tree_root_node(tree);

  const char *query_string = "(function_definition type: (primitive_type) @ftype declarator: (function_declarator declarator: (identifier) @fname parameters: (parameter_list) @fparams))";

  uint32_t error_offset;
  TSQueryError error_type;
  TSQuery *query = ts_query_new(language, query_string, strlen(query_string), &error_offset, &error_type);

  TSQueryCursor *query_cursor = ts_query_cursor_new();
  ts_query_cursor_exec(query_cursor, query, root_node);

  if (query != NULL) {
    TSQueryMatch match;
    while (ts_query_cursor_next_match(query_cursor, &match)) {
      Function fn = {0};

      for (unsigned i = 0; i < match.capture_count; i++) {
        TSQueryCapture capture = match.captures[i];
        TSNode captured_node = capture.node;

        uint32_t capture_name_length;
        const char *capture_name = ts_query_capture_name_for_id(query, capture.index, &capture_name_length);

        if (strcmp(capture_name, "fname") == 0) {
          fn.fname = extract_value(captured_node, source_code);

          TSPoint start_point = ts_node_start_point(captured_node);
          fn.lineno = start_point.row;
        }

        if (strcmp(capture_name, "ftype") == 0) {
          fn.ftype = extract_value(captured_node, source_code);
        }

        if (strcmp(capture_name, "fparams") == 0) {
          fn.fparams = extract_value(captured_node, source_code);
        }
      }

      // Substring matching.
      // FIXME: Add Levenshtein distance.
      char *result = strstr(fn.fname, cfname);
      if (result != NULL) {
        char *fparams_formatted = remove_newlines(fn.fparams);
        printf("%s:%zu:\t%s %s %s\n", file_path, fn.lineno, fn.ftype, fn.fname, fparams_formatted);
      }
    }
  } else {
    if (DEBUG) {
      printf("Query creation failed at offset %u with error type %d\n", error_offset, error_type);
    }
  }

  ts_query_cursor_delete(query_cursor);
  ts_query_delete(query);
  ts_tree_delete(tree);
  ts_parser_delete(parser);

  return NULL;
}

const char *get_file_extension(const char *file_path) {
  const char *extension = strrchr(file_path, '.');
  if (extension != NULL) {
    return extension + 1;
  }
  return NULL;
}

int main(int argc, char *argv[]) {
  if (argc < 3) {
    printf("Usage: %s <search term> <directory>\n", argv[0]);
    return 1;
  }

  char *cfname = argv[1];
  char *directory = argv[2];

  TSLanguage *tree_sitter_c(void);
  TSLanguage *tree_sitter_python(void);

  Node *head = NULL;
  list_files_recursively(directory, &head);
  int list_size = size_of_file_list(head);
  /* pthread_t threads[list_size]; */

  if (DEBUG) {
    printf("Scanning %d files\n", list_size);
  }

  Node *current = head;
  int thread_index = 0;
  while (current != NULL) {
    const char *file_path = current->file_path;
    const char *extension = get_file_extension(file_path);
    struct FileContent source_file = read_entire_file(file_path);

    if (source_file.content != NULL) {
      if (extension != NULL) {
        if (strcmp(extension, "c") == 0 || strcmp(extension, "h") == 0) {
          /* parse_source_file(file_path, source_file.content, tree_sitter_c(), cfname); */

          struct ThreadArgs thread_args;
          thread_args.file_path = file_path;
          thread_args.source_code = source_file.content;
          thread_args.language = tree_sitter_c();
          thread_args.cfname = cfname;

          parse_source_file(&thread_args);

          /* printf("> creating thread #%d\n", thread_index); */
          /* if (pthread_create(&threads[thread_index], NULL, parse_source_file, &thread_args) != 0) { */
          /*   fprintf(stderr, "Error creating thread %d\n", thread_index); */
          /*   return 1; */
          /* } */
        }
      }
      free((void *)source_file.content);
    } else {
      if (DEBUG) {
        fprintf(stderr, "Failed to read file.\n");
      }
    }
    current = current->next;
    thread_index++;
  }

  // Collecting threads.
  /* for (int i = 0; i < list_size; i++) { */
  /*   printf("> collecting thread #%d\n", thread_index); */
  /*   if (pthread_join(threads[i], NULL) != 0) { */
  /*     fprintf(stderr, "Error joining thread %d\n", i); */
  /*     return 1; */
  /*   } */
  /* } */

  free_file_list(head);
  return 0;
}