netlabel_domainhash.c 12 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446
  1. /*
  2. * NetLabel Domain Hash Table
  3. *
  4. * This file manages the domain hash table that NetLabel uses to determine
  5. * which network labeling protocol to use for a given domain. The NetLabel
  6. * system manages static and dynamic label mappings for network protocols such
  7. * as CIPSO and RIPSO.
  8. *
  9. * Author: Paul Moore <paul.moore@hp.com>
  10. *
  11. */
  12. /*
  13. * (c) Copyright Hewlett-Packard Development Company, L.P., 2006
  14. *
  15. * This program is free software; you can redistribute it and/or modify
  16. * it under the terms of the GNU General Public License as published by
  17. * the Free Software Foundation; either version 2 of the License, or
  18. * (at your option) any later version.
  19. *
  20. * This program is distributed in the hope that it will be useful,
  21. * but WITHOUT ANY WARRANTY; without even the implied warranty of
  22. * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See
  23. * the GNU General Public License for more details.
  24. *
  25. * You should have received a copy of the GNU General Public License
  26. * along with this program; if not, write to the Free Software
  27. * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
  28. *
  29. */
  30. #include <linux/types.h>
  31. #include <linux/rcupdate.h>
  32. #include <linux/list.h>
  33. #include <linux/skbuff.h>
  34. #include <linux/spinlock.h>
  35. #include <linux/string.h>
  36. #include <linux/audit.h>
  37. #include <net/netlabel.h>
  38. #include <net/cipso_ipv4.h>
  39. #include <asm/bug.h>
  40. #include "netlabel_mgmt.h"
  41. #include "netlabel_domainhash.h"
  42. #include "netlabel_user.h"
  43. struct netlbl_domhsh_tbl {
  44. struct list_head *tbl;
  45. u32 size;
  46. };
  47. /* Domain hash table */
  48. /* XXX - updates should be so rare that having one spinlock for the entire
  49. * hash table should be okay */
  50. static DEFINE_SPINLOCK(netlbl_domhsh_lock);
  51. static struct netlbl_domhsh_tbl *netlbl_domhsh = NULL;
  52. /* Default domain mapping */
  53. static DEFINE_SPINLOCK(netlbl_domhsh_def_lock);
  54. static struct netlbl_dom_map *netlbl_domhsh_def = NULL;
  55. /*
  56. * Domain Hash Table Helper Functions
  57. */
  58. /**
  59. * netlbl_domhsh_free_entry - Frees a domain hash table entry
  60. * @entry: the entry's RCU field
  61. *
  62. * Description:
  63. * This function is designed to be used as a callback to the call_rcu()
  64. * function so that the memory allocated to a hash table entry can be released
  65. * safely.
  66. *
  67. */
  68. static void netlbl_domhsh_free_entry(struct rcu_head *entry)
  69. {
  70. struct netlbl_dom_map *ptr;
  71. ptr = container_of(entry, struct netlbl_dom_map, rcu);
  72. kfree(ptr->domain);
  73. kfree(ptr);
  74. }
  75. /**
  76. * netlbl_domhsh_hash - Hashing function for the domain hash table
  77. * @domain: the domain name to hash
  78. *
  79. * Description:
  80. * This is the hashing function for the domain hash table, it returns the
  81. * correct bucket number for the domain. The caller is responsibile for
  82. * calling the rcu_read_[un]lock() functions.
  83. *
  84. */
  85. static u32 netlbl_domhsh_hash(const char *key)
  86. {
  87. u32 iter;
  88. u32 val;
  89. u32 len;
  90. /* This is taken (with slight modification) from
  91. * security/selinux/ss/symtab.c:symhash() */
  92. for (iter = 0, val = 0, len = strlen(key); iter < len; iter++)
  93. val = (val << 4 | (val >> (8 * sizeof(u32) - 4))) ^ key[iter];
  94. return val & (rcu_dereference(netlbl_domhsh)->size - 1);
  95. }
  96. /**
  97. * netlbl_domhsh_search - Search for a domain entry
  98. * @domain: the domain
  99. * @def: return default if no match is found
  100. *
  101. * Description:
  102. * Searches the domain hash table and returns a pointer to the hash table
  103. * entry if found, otherwise NULL is returned. If @def is non-zero and a
  104. * match is not found in the domain hash table the default mapping is returned
  105. * if it exists. The caller is responsibile for the rcu hash table locks
  106. * (i.e. the caller much call rcu_read_[un]lock()).
  107. *
  108. */
  109. static struct netlbl_dom_map *netlbl_domhsh_search(const char *domain, u32 def)
  110. {
  111. u32 bkt;
  112. struct netlbl_dom_map *iter;
  113. if (domain != NULL) {
  114. bkt = netlbl_domhsh_hash(domain);
  115. list_for_each_entry_rcu(iter,
  116. &rcu_dereference(netlbl_domhsh)->tbl[bkt],
  117. list)
  118. if (iter->valid && strcmp(iter->domain, domain) == 0)
  119. return iter;
  120. }
  121. if (def != 0) {
  122. iter = rcu_dereference(netlbl_domhsh_def);
  123. if (iter != NULL && iter->valid)
  124. return iter;
  125. }
  126. return NULL;
  127. }
  128. /*
  129. * Domain Hash Table Functions
  130. */
  131. /**
  132. * netlbl_domhsh_init - Init for the domain hash
  133. * @size: the number of bits to use for the hash buckets
  134. *
  135. * Description:
  136. * Initializes the domain hash table, should be called only by
  137. * netlbl_user_init() during initialization. Returns zero on success, non-zero
  138. * values on error.
  139. *
  140. */
  141. int netlbl_domhsh_init(u32 size)
  142. {
  143. u32 iter;
  144. struct netlbl_domhsh_tbl *hsh_tbl;
  145. if (size == 0)
  146. return -EINVAL;
  147. hsh_tbl = kmalloc(sizeof(*hsh_tbl), GFP_KERNEL);
  148. if (hsh_tbl == NULL)
  149. return -ENOMEM;
  150. hsh_tbl->size = 1 << size;
  151. hsh_tbl->tbl = kcalloc(hsh_tbl->size,
  152. sizeof(struct list_head),
  153. GFP_KERNEL);
  154. if (hsh_tbl->tbl == NULL) {
  155. kfree(hsh_tbl);
  156. return -ENOMEM;
  157. }
  158. for (iter = 0; iter < hsh_tbl->size; iter++)
  159. INIT_LIST_HEAD(&hsh_tbl->tbl[iter]);
  160. rcu_read_lock();
  161. spin_lock(&netlbl_domhsh_lock);
  162. rcu_assign_pointer(netlbl_domhsh, hsh_tbl);
  163. spin_unlock(&netlbl_domhsh_lock);
  164. rcu_read_unlock();
  165. return 0;
  166. }
  167. /**
  168. * netlbl_domhsh_add - Adds a entry to the domain hash table
  169. * @entry: the entry to add
  170. * @audit_info: NetLabel audit information
  171. *
  172. * Description:
  173. * Adds a new entry to the domain hash table and handles any updates to the
  174. * lower level protocol handler (i.e. CIPSO). Returns zero on success,
  175. * negative on failure.
  176. *
  177. */
  178. int netlbl_domhsh_add(struct netlbl_dom_map *entry,
  179. struct netlbl_audit *audit_info)
  180. {
  181. int ret_val;
  182. u32 bkt;
  183. struct audit_buffer *audit_buf;
  184. switch (entry->type) {
  185. case NETLBL_NLTYPE_UNLABELED:
  186. ret_val = 0;
  187. break;
  188. case NETLBL_NLTYPE_CIPSOV4:
  189. ret_val = cipso_v4_doi_domhsh_add(entry->type_def.cipsov4,
  190. entry->domain);
  191. break;
  192. default:
  193. return -EINVAL;
  194. }
  195. if (ret_val != 0)
  196. return ret_val;
  197. entry->valid = 1;
  198. INIT_RCU_HEAD(&entry->rcu);
  199. ret_val = 0;
  200. rcu_read_lock();
  201. if (entry->domain != NULL) {
  202. bkt = netlbl_domhsh_hash(entry->domain);
  203. spin_lock(&netlbl_domhsh_lock);
  204. if (netlbl_domhsh_search(entry->domain, 0) == NULL)
  205. list_add_tail_rcu(&entry->list,
  206. &rcu_dereference(netlbl_domhsh)->tbl[bkt]);
  207. else
  208. ret_val = -EEXIST;
  209. spin_unlock(&netlbl_domhsh_lock);
  210. } else if (entry->domain == NULL) {
  211. INIT_LIST_HEAD(&entry->list);
  212. spin_lock(&netlbl_domhsh_def_lock);
  213. if (rcu_dereference(netlbl_domhsh_def) == NULL)
  214. rcu_assign_pointer(netlbl_domhsh_def, entry);
  215. else
  216. ret_val = -EEXIST;
  217. spin_unlock(&netlbl_domhsh_def_lock);
  218. } else
  219. ret_val = -EINVAL;
  220. audit_buf = netlbl_audit_start_common(AUDIT_MAC_MAP_ADD, audit_info);
  221. if (audit_buf != NULL) {
  222. audit_log_format(audit_buf,
  223. " nlbl_domain=%s",
  224. entry->domain ? entry->domain : "(default)");
  225. switch (entry->type) {
  226. case NETLBL_NLTYPE_UNLABELED:
  227. audit_log_format(audit_buf, " nlbl_protocol=unlbl");
  228. break;
  229. case NETLBL_NLTYPE_CIPSOV4:
  230. audit_log_format(audit_buf,
  231. " nlbl_protocol=cipsov4 cipso_doi=%u",
  232. entry->type_def.cipsov4->doi);
  233. break;
  234. }
  235. audit_log_format(audit_buf, " res=%u", ret_val == 0 ? 1 : 0);
  236. audit_log_end(audit_buf);
  237. }
  238. rcu_read_unlock();
  239. if (ret_val != 0) {
  240. switch (entry->type) {
  241. case NETLBL_NLTYPE_CIPSOV4:
  242. if (cipso_v4_doi_domhsh_remove(entry->type_def.cipsov4,
  243. entry->domain) != 0)
  244. BUG();
  245. break;
  246. }
  247. }
  248. return ret_val;
  249. }
  250. /**
  251. * netlbl_domhsh_add_default - Adds the default entry to the domain hash table
  252. * @entry: the entry to add
  253. * @audit_info: NetLabel audit information
  254. *
  255. * Description:
  256. * Adds a new default entry to the domain hash table and handles any updates
  257. * to the lower level protocol handler (i.e. CIPSO). Returns zero on success,
  258. * negative on failure.
  259. *
  260. */
  261. int netlbl_domhsh_add_default(struct netlbl_dom_map *entry,
  262. struct netlbl_audit *audit_info)
  263. {
  264. return netlbl_domhsh_add(entry, audit_info);
  265. }
  266. /**
  267. * netlbl_domhsh_remove - Removes an entry from the domain hash table
  268. * @domain: the domain to remove
  269. * @audit_info: NetLabel audit information
  270. *
  271. * Description:
  272. * Removes an entry from the domain hash table and handles any updates to the
  273. * lower level protocol handler (i.e. CIPSO). Returns zero on success,
  274. * negative on failure.
  275. *
  276. */
  277. int netlbl_domhsh_remove(const char *domain, struct netlbl_audit *audit_info)
  278. {
  279. int ret_val = -ENOENT;
  280. struct netlbl_dom_map *entry;
  281. struct audit_buffer *audit_buf;
  282. rcu_read_lock();
  283. if (domain != NULL)
  284. entry = netlbl_domhsh_search(domain, 0);
  285. else
  286. entry = netlbl_domhsh_search(domain, 1);
  287. if (entry == NULL)
  288. goto remove_return;
  289. switch (entry->type) {
  290. case NETLBL_NLTYPE_UNLABELED:
  291. break;
  292. case NETLBL_NLTYPE_CIPSOV4:
  293. ret_val = cipso_v4_doi_domhsh_remove(entry->type_def.cipsov4,
  294. entry->domain);
  295. if (ret_val != 0)
  296. goto remove_return;
  297. break;
  298. }
  299. ret_val = 0;
  300. if (entry != rcu_dereference(netlbl_domhsh_def)) {
  301. spin_lock(&netlbl_domhsh_lock);
  302. if (entry->valid) {
  303. entry->valid = 0;
  304. list_del_rcu(&entry->list);
  305. } else
  306. ret_val = -ENOENT;
  307. spin_unlock(&netlbl_domhsh_lock);
  308. } else {
  309. spin_lock(&netlbl_domhsh_def_lock);
  310. if (entry->valid) {
  311. entry->valid = 0;
  312. rcu_assign_pointer(netlbl_domhsh_def, NULL);
  313. } else
  314. ret_val = -ENOENT;
  315. spin_unlock(&netlbl_domhsh_def_lock);
  316. }
  317. audit_buf = netlbl_audit_start_common(AUDIT_MAC_MAP_DEL, audit_info);
  318. if (audit_buf != NULL) {
  319. audit_log_format(audit_buf,
  320. " nlbl_domain=%s res=%u",
  321. entry->domain ? entry->domain : "(default)",
  322. ret_val == 0 ? 1 : 0);
  323. audit_log_end(audit_buf);
  324. }
  325. if (ret_val == 0)
  326. call_rcu(&entry->rcu, netlbl_domhsh_free_entry);
  327. remove_return:
  328. rcu_read_unlock();
  329. return ret_val;
  330. }
  331. /**
  332. * netlbl_domhsh_remove_default - Removes the default entry from the table
  333. * @audit_info: NetLabel audit information
  334. *
  335. * Description:
  336. * Removes/resets the default entry for the domain hash table and handles any
  337. * updates to the lower level protocol handler (i.e. CIPSO). Returns zero on
  338. * success, non-zero on failure.
  339. *
  340. */
  341. int netlbl_domhsh_remove_default(struct netlbl_audit *audit_info)
  342. {
  343. return netlbl_domhsh_remove(NULL, audit_info);
  344. }
  345. /**
  346. * netlbl_domhsh_getentry - Get an entry from the domain hash table
  347. * @domain: the domain name to search for
  348. *
  349. * Description:
  350. * Look through the domain hash table searching for an entry to match @domain,
  351. * return a pointer to a copy of the entry or NULL. The caller is responsibile
  352. * for ensuring that rcu_read_[un]lock() is called.
  353. *
  354. */
  355. struct netlbl_dom_map *netlbl_domhsh_getentry(const char *domain)
  356. {
  357. return netlbl_domhsh_search(domain, 1);
  358. }
  359. /**
  360. * netlbl_domhsh_walk - Iterate through the domain mapping hash table
  361. * @skip_bkt: the number of buckets to skip at the start
  362. * @skip_chain: the number of entries to skip in the first iterated bucket
  363. * @callback: callback for each entry
  364. * @cb_arg: argument for the callback function
  365. *
  366. * Description:
  367. * Interate over the domain mapping hash table, skipping the first @skip_bkt
  368. * buckets and @skip_chain entries. For each entry in the table call
  369. * @callback, if @callback returns a negative value stop 'walking' through the
  370. * table and return. Updates the values in @skip_bkt and @skip_chain on
  371. * return. Returns zero on succcess, negative values on failure.
  372. *
  373. */
  374. int netlbl_domhsh_walk(u32 *skip_bkt,
  375. u32 *skip_chain,
  376. int (*callback) (struct netlbl_dom_map *entry, void *arg),
  377. void *cb_arg)
  378. {
  379. int ret_val = -ENOENT;
  380. u32 iter_bkt;
  381. struct netlbl_dom_map *iter_entry;
  382. u32 chain_cnt = 0;
  383. rcu_read_lock();
  384. for (iter_bkt = *skip_bkt;
  385. iter_bkt < rcu_dereference(netlbl_domhsh)->size;
  386. iter_bkt++, chain_cnt = 0) {
  387. list_for_each_entry_rcu(iter_entry,
  388. &rcu_dereference(netlbl_domhsh)->tbl[iter_bkt],
  389. list)
  390. if (iter_entry->valid) {
  391. if (chain_cnt++ < *skip_chain)
  392. continue;
  393. ret_val = callback(iter_entry, cb_arg);
  394. if (ret_val < 0) {
  395. chain_cnt--;
  396. goto walk_return;
  397. }
  398. }
  399. }
  400. walk_return:
  401. rcu_read_unlock();
  402. *skip_bkt = iter_bkt;
  403. *skip_chain = chain_cnt;
  404. return ret_val;
  405. }