This commit is contained in:
hiperiondev
2023-08-22 20:35:22 -03:00
parent d8c6a3ec27
commit 5a851f6fbe
3 changed files with 21 additions and 21 deletions

View File

@@ -13,7 +13,7 @@
#include <stdint.h>
#include <stdbool.h>
#include "utils.h"
#include "disassembler_utils.h"
#include "disassembler.h"
#define SPC(n) printf("%.*s", n, "| | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | |");
@@ -681,7 +681,7 @@ static void dis_read_interpreter_sections(dis_program_t **prg, uint32_t *pc, uin
strcpy(fun->fun, tree_local);
fun->start = fpc_start;
fun->len = fpc_end;
enqueue((void*) fun);
disassembler_enqueue((void*) fun);
}
fcnt++;
@@ -737,13 +737,13 @@ void disassemble(const char *filename, bool alt_fmt) {
if (alt_fmt) {
while (queue_front != NULL) {
fun_code_t *fun = (fun_code_t*) front();
fun_code_t *fun = (fun_code_t*) disassembler_front();
printf("\nFUN_%s:", fun->fun);
free(fun->fun);
dis_disassemble_section(&prg, fun->start, fun->len, 0, true, alt_fmt);
dequeue();
disassembler_dequeue();
printf("\n");
}

View File

@@ -10,14 +10,14 @@
#include "stdio.h"
#include "stdlib.h"
#include "utils.h"
#include "disassembler_utils.h"
struct Node *queue_front, *queue_rear;
struct disassembler_node_s *queue_front, *queue_rear;
void enqueue(void *x) {
struct Node *temp;
void disassembler_enqueue(void *x) {
struct disassembler_node_s *temp;
temp = (struct Node*) malloc(sizeof(struct Node));
temp = (struct disassembler_node_s*) malloc(sizeof(struct disassembler_node_s));
temp->data = x;
temp->next = NULL;
@@ -30,8 +30,8 @@ void enqueue(void *x) {
}
void dequeue(void) {
struct Node *temp = queue_front;
void disassembler_dequeue(void) {
struct disassembler_node_s *temp = queue_front;
if (queue_front == NULL) {
printf("Error : QUEUE is empty!!");
@@ -47,6 +47,6 @@ void dequeue(void) {
free(temp);
}
void* front(void) {
void* disassembler_front(void) {
return queue_front->data;
}

View File

@@ -10,15 +10,15 @@
#ifndef UTILS_H_
#define UTILS_H_
struct Node {
struct disassembler_node_s {
void *data;
struct Node *next;
struct disassembler_node_s *next;
};
extern struct Node *queue_front, *queue_rear;
extern struct disassembler_node_s *queue_front, *queue_rear;
void enqueue(void *x);
void dequeue(void);
void* front(void);
void disassembler_enqueue(void *x);
void disassembler_dequeue(void);
void* disassembler_front(void);
#endif /* UTILS_H_ */