uproctrace

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
/**
 * UProcTrace: User-space Process Tracing
 * Copyright 2020: Stefan Schuermans, Aachen, Germany <stefan@schuermans.info>
 * Copyleft: GNU LESSER GENERAL PUBLIC LICENSE version 3 (see LICENSE)
 */
#include "cleaner.h"
#include "macros.h"
#include <stdlib.h>
struct uptev_cleaner_s {
  unsigned int free_ptr_cnt; /**< number of pointer to be freed */
  void *free_ptrs[64];       /**< pointers to be freed */
  uptev_cleaner_t *next;     /**< next cleaner object, linked list */
};
uptev_cleaner_t *uptev_cleaner_new(void) {
  uptev_cleaner_t *cleaner = malloc(sizeof(uptev_cleaner_t));
  if (!cleaner) {
    return NULL;
  }
  cleaner->free_ptr_cnt = 0;
  cleaner->next = NULL;
  return cleaner;
}
int uptev_cleaner_add_ptr(uptev_cleaner_t *cleaner, void *ptr) {
  /* find last cleaner in chain */
  uptev_cleaner_t *cl = cleaner;
  while (cl->next != NULL) {
    cl = cl->next;
  }
  /* last cleaner full? */
  if (cl->free_ptr_cnt >= countof(cl->free_ptrs)) {
    /* create new one */
    cl->next = uptev_cleaner_new();
    /* error ? */
    if (!cl->next) {
      /* cleanup everything and reutrn error */
      uptev_cleaner_cleanup(cleaner);
      return -1;
    }
    /* go to new cleaner */
    cl = cl->next;
  }
  /* add pointer */
  cl->free_ptrs[cl->free_ptr_cnt++] = ptr;
  return 0;
}
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX