| mesh.h (d9a145fb6e5f37b9903dea8371ab5c3e34e8e2d1) | mesh.h (eef35c2d41ddcc653c20d26b977acaa45c811e1f) |
|---|---|
| 1/* 2 * Copyright (c) 2008, 2009 open80211s Ltd. 3 * Authors: Luis Carlos Cobo <luisca@cozybit.com> 4 * Javier Cardona <javier@cozybit.com> 5 * 6 * This program is free software; you can redistribute it and/or modify 7 * it under the terms of the GNU General Public License version 2 as 8 * published by the Free Software Foundation. --- 101 unchanged lines hidden (view full) --- 110 * struct mesh_table 111 * 112 * @hash_buckets: array of hash buckets of the table 113 * @hashwlock: array of locks to protect write operations, one per bucket 114 * @hash_mask: 2^size_order - 1, used to compute hash idx 115 * @hash_rnd: random value used for hash computations 116 * @entries: number of entries in the table 117 * @free_node: function to free nodes of the table | 1/* 2 * Copyright (c) 2008, 2009 open80211s Ltd. 3 * Authors: Luis Carlos Cobo <luisca@cozybit.com> 4 * Javier Cardona <javier@cozybit.com> 5 * 6 * This program is free software; you can redistribute it and/or modify 7 * it under the terms of the GNU General Public License version 2 as 8 * published by the Free Software Foundation. --- 101 unchanged lines hidden (view full) --- 110 * struct mesh_table 111 * 112 * @hash_buckets: array of hash buckets of the table 113 * @hashwlock: array of locks to protect write operations, one per bucket 114 * @hash_mask: 2^size_order - 1, used to compute hash idx 115 * @hash_rnd: random value used for hash computations 116 * @entries: number of entries in the table 117 * @free_node: function to free nodes of the table |
| 118 * @copy_node: fuction to copy nodes of the table | 118 * @copy_node: function to copy nodes of the table |
| 119 * @size_order: determines size of the table, there will be 2^size_order hash 120 * buckets 121 * @mean_chain_len: maximum average length for the hash buckets' list, if it is 122 * reached, the table will grow 123 */ 124struct mesh_table { 125 /* Number of buckets will be 2^N */ 126 struct hlist_head *hash_buckets; --- 217 unchanged lines hidden --- | 119 * @size_order: determines size of the table, there will be 2^size_order hash 120 * buckets 121 * @mean_chain_len: maximum average length for the hash buckets' list, if it is 122 * reached, the table will grow 123 */ 124struct mesh_table { 125 /* Number of buckets will be 2^N */ 126 struct hlist_head *hash_buckets; --- 217 unchanged lines hidden --- |