match.h 4.0 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143
  1. /*
  2. * AppArmor security module
  3. *
  4. * This file contains AppArmor policy dfa matching engine definitions.
  5. *
  6. * Copyright (C) 1998-2008 Novell/SUSE
  7. * Copyright 2009-2012 Canonical Ltd.
  8. *
  9. * This program is free software; you can redistribute it and/or
  10. * modify it under the terms of the GNU General Public License as
  11. * published by the Free Software Foundation, version 2 of the
  12. * License.
  13. */
  14. #ifndef __AA_MATCH_H
  15. #define __AA_MATCH_H
  16. #include <linux/kref.h>
  17. #define DFA_NOMATCH 0
  18. #define DFA_START 1
  19. #define DFA_VALID_PERM_MASK 0xffffffff
  20. #define DFA_VALID_PERM2_MASK 0xffffffff
  21. /**
  22. * The format used for transition tables is based on the GNU flex table
  23. * file format (--tables-file option; see Table File Format in the flex
  24. * info pages and the flex sources for documentation). The magic number
  25. * used in the header is 0x1B5E783D instead of 0xF13C57B1 though, because
  26. * new tables have been defined and others YY_ID_CHK (check) and YY_ID_DEF
  27. * (default) tables are used slightly differently (see the apparmor-parser
  28. * package).
  29. *
  30. *
  31. * The data in the packed dfa is stored in network byte order, and the tables
  32. * are arranged for flexibility. We convert the table data to host native
  33. * byte order.
  34. *
  35. * The dfa begins with a table set header, and is followed by the actual
  36. * tables.
  37. */
  38. #define YYTH_MAGIC 0x1B5E783D
  39. struct table_set_header {
  40. u32 th_magic; /* YYTH_MAGIC */
  41. u32 th_hsize;
  42. u32 th_ssize;
  43. u16 th_flags;
  44. char th_version[];
  45. };
  46. /* The YYTD_ID are one less than flex table mappings. The flex id
  47. * has 1 subtracted at table load time, this allows us to directly use the
  48. * ID's as indexes.
  49. */
  50. #define YYTD_ID_ACCEPT 0
  51. #define YYTD_ID_BASE 1
  52. #define YYTD_ID_CHK 2
  53. #define YYTD_ID_DEF 3
  54. #define YYTD_ID_EC 4
  55. #define YYTD_ID_META 5
  56. #define YYTD_ID_ACCEPT2 6
  57. #define YYTD_ID_NXT 7
  58. #define YYTD_ID_TSIZE 8
  59. #define YYTD_DATA8 1
  60. #define YYTD_DATA16 2
  61. #define YYTD_DATA32 4
  62. #define YYTD_DATA64 8
  63. /* ACCEPT & ACCEPT2 tables gets 6 dedicated flags, YYTD_DATAX define the
  64. * first flags
  65. */
  66. #define ACCEPT1_FLAGS(X) ((X) & 0x3f)
  67. #define ACCEPT2_FLAGS(X) ACCEPT1_FLAGS((X) >> YYTD_ID_ACCEPT2)
  68. #define TO_ACCEPT1_FLAG(X) ACCEPT1_FLAGS(X)
  69. #define TO_ACCEPT2_FLAG(X) (ACCEPT1_FLAGS(X) << YYTD_ID_ACCEPT2)
  70. #define DFA_FLAG_VERIFY_STATES 0x1000
  71. struct table_header {
  72. u16 td_id;
  73. u16 td_flags;
  74. u32 td_hilen;
  75. u32 td_lolen;
  76. char td_data[];
  77. };
  78. #define DEFAULT_TABLE(DFA) ((u16 *)((DFA)->tables[YYTD_ID_DEF]->td_data))
  79. #define BASE_TABLE(DFA) ((u32 *)((DFA)->tables[YYTD_ID_BASE]->td_data))
  80. #define NEXT_TABLE(DFA) ((u16 *)((DFA)->tables[YYTD_ID_NXT]->td_data))
  81. #define CHECK_TABLE(DFA) ((u16 *)((DFA)->tables[YYTD_ID_CHK]->td_data))
  82. #define EQUIV_TABLE(DFA) ((u8 *)((DFA)->tables[YYTD_ID_EC]->td_data))
  83. #define ACCEPT_TABLE(DFA) ((u32 *)((DFA)->tables[YYTD_ID_ACCEPT]->td_data))
  84. #define ACCEPT_TABLE2(DFA) ((u32 *)((DFA)->tables[YYTD_ID_ACCEPT2]->td_data))
  85. struct aa_dfa {
  86. struct kref count;
  87. u16 flags;
  88. struct table_header *tables[YYTD_ID_TSIZE];
  89. };
  90. #define byte_to_byte(X) (X)
  91. #define UNPACK_ARRAY(TABLE, BLOB, LEN, TYPE, NTOHX) \
  92. do { \
  93. typeof(LEN) __i; \
  94. TYPE *__t = (TYPE *) TABLE; \
  95. TYPE *__b = (TYPE *) BLOB; \
  96. for (__i = 0; __i < LEN; __i++) { \
  97. __t[__i] = NTOHX(__b[__i]); \
  98. } \
  99. } while (0)
  100. static inline size_t table_size(size_t len, size_t el_size)
  101. {
  102. return ALIGN(sizeof(struct table_header) + len * el_size, 8);
  103. }
  104. struct aa_dfa *aa_dfa_unpack(void *blob, size_t size, int flags);
  105. unsigned int aa_dfa_match_len(struct aa_dfa *dfa, unsigned int start,
  106. const char *str, int len);
  107. unsigned int aa_dfa_match(struct aa_dfa *dfa, unsigned int start,
  108. const char *str);
  109. unsigned int aa_dfa_next(struct aa_dfa *dfa, unsigned int state,
  110. const char c);
  111. void aa_dfa_free_kref(struct kref *kref);
  112. /**
  113. * aa_put_dfa - put a dfa refcount
  114. * @dfa: dfa to put refcount (MAYBE NULL)
  115. *
  116. * Requires: if @dfa != NULL that a valid refcount be held
  117. */
  118. static inline void aa_put_dfa(struct aa_dfa *dfa)
  119. {
  120. if (dfa)
  121. kref_put(&dfa->count, aa_dfa_free_kref);
  122. }
  123. #endif /* __AA_MATCH_H */