util.h 1.8 KB

12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455565758
  1. /* until.h
  2. *
  3. * Wrapper functions and data structures
  4. *
  5. * Slitheen - a decoy routing system for censorship resistance
  6. * Copyright (C) 2017 Cecylia Bocovich (cbocovic@uwaterloo.ca)
  7. *
  8. * This program is free software: you can redistribute it and/or modify
  9. * it under the terms of the GNU General Public License as published by
  10. * the Free Software Foundation, version 3.
  11. *
  12. * This program is distributed in the hope that it will be useful,
  13. * but WITHOUT ANY WARRANTY; without even the implied warranty of
  14. * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
  15. * GNU General Public License for more details.
  16. *
  17. * You should have received a copy of the GNU General Public License
  18. * along with this program. If not, see <http://www.gnu.org/licenses/>.
  19. *
  20. * Additional permission under GNU GPL version 3 section 7
  21. *
  22. * If you modify this Program, or any covered work, by linking or combining
  23. * it with the OpenSSL library (or a modified version of that library),
  24. * containing parts covered by the terms of the OpenSSL Licence and the
  25. * SSLeay license, the licensors of this Program grant you additional
  26. * permission to convey the resulting work. Corresponding Source for a
  27. * non-source form of such a combination shall include the source code
  28. * for the parts of the OpenSSL library used as well as that of the covered
  29. * work.
  30. */
  31. #ifndef _UTIL_H_
  32. #define _UTIL_H_
  33. #include <stddef.h>
  34. #include <stdint.h>
  35. void *emalloc(size_t size);
  36. void *ecalloc(size_t nmemb, size_t size);
  37. //Standard queue data structure
  38. typedef struct element_st {
  39. void *data;
  40. struct element_st *next;
  41. } element;
  42. typedef struct queue_st {
  43. element *first;
  44. element *last;
  45. } queue;
  46. queue *init_queue();
  47. void enqueue(queue *list, void *data);
  48. void *dequeue(queue *list);
  49. void *peek(queue *list, int32_t n);
  50. void remove_queue(queue *list);
  51. #endif /*_UTIL_H_*/