1 /* 2 * Copyright (c) 2016-2019 The Linux Foundation. All rights reserved. 3 * 4 * Permission to use, copy, modify, and/or distribute this software for 5 * any purpose with or without fee is hereby granted, provided that the 6 * above copyright notice and this permission notice appear in all 7 * copies. 8 * 9 * THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL 10 * WARRANTIES WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED 11 * WARRANTIES OF MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE 12 * AUTHOR BE LIABLE FOR ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL 13 * DAMAGES OR ANY DAMAGES WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR 14 * PROFITS, WHETHER IN AN ACTION OF CONTRACT, NEGLIGENCE OR OTHER 15 * TORTIOUS ACTION, ARISING OUT OF OR IN CONNECTION WITH THE USE OR 16 * PERFORMANCE OF THIS SOFTWARE. 17 */ 18 #ifndef _DP_PEER_H_ 19 #define _DP_PEER_H_ 20 21 #include <qdf_types.h> 22 #include <qdf_lock.h> 23 #include "dp_types.h" 24 25 #define DP_INVALID_PEER_ID 0xffff 26 /** 27 * __dp_peer_find_by_id() - Returns peer object given the peer id 28 * 29 * @soc : core DP soc context 30 * @peer_id : peer id from peer object can be retrieved 31 * 32 * Return: struct dp_peer*: Pointer to DP peer object 33 */ 34 static inline struct dp_peer * 35 __dp_peer_find_by_id(struct dp_soc *soc, 36 uint16_t peer_id) 37 { 38 struct dp_peer *peer; 39 40 /* TODO: Hold lock */ 41 peer = (peer_id >= soc->max_peers) ? NULL : 42 soc->peer_id_to_obj_map[peer_id]; 43 44 return peer; 45 } 46 47 #ifdef PEER_PROTECTED_ACCESS 48 /** 49 * dp_peer_find_by_id() - Returns peer object given the peer id 50 * if delete_in_progress in not set for peer 51 * 52 * @soc : core DP soc context 53 * @peer_id : peer id from peer object can be retrieved 54 * 55 * Return: struct dp_peer*: Pointer to DP peer object 56 */ 57 static inline 58 struct dp_peer *dp_peer_find_by_id(struct dp_soc *soc, 59 uint16_t peer_id) 60 { 61 struct dp_peer *peer; 62 63 qdf_spin_lock_bh(&soc->peer_ref_mutex); 64 peer = __dp_peer_find_by_id(soc, peer_id); 65 if (!peer || (peer && peer->delete_in_progress)) { 66 qdf_spin_unlock_bh(&soc->peer_ref_mutex); 67 return NULL; 68 } 69 qdf_atomic_inc(&peer->ref_cnt); 70 qdf_spin_unlock_bh(&soc->peer_ref_mutex); 71 72 return peer; 73 } 74 #else 75 static inline struct dp_peer * 76 dp_peer_find_by_id(struct dp_soc *soc, 77 uint16_t peer_id) 78 { 79 struct dp_peer *peer; 80 81 peer = __dp_peer_find_by_id (soc, peer_id); 82 if (peer && peer->delete_in_progress) { 83 return NULL; 84 } 85 86 return peer; 87 } 88 #endif /* PEER_LOCK_REF_PROTECT */ 89 90 void dp_print_ast_stats(struct dp_soc *soc); 91 void dp_rx_peer_map_handler(void *soc_handle, uint16_t peer_id, 92 uint16_t hw_peer_id, uint8_t vdev_id, 93 uint8_t *peer_mac_addr, uint16_t ast_hash, 94 uint8_t is_wds); 95 void dp_rx_peer_unmap_handler(void *soc_handle, uint16_t peer_id, 96 uint8_t vdev_id, uint8_t *peer_mac_addr, 97 uint8_t is_wds); 98 void dp_rx_sec_ind_handler(void *soc_handle, uint16_t peer_id, 99 enum cdp_sec_type sec_type, int is_unicast, 100 u_int32_t *michael_key, u_int32_t *rx_pn); 101 uint8_t dp_get_peer_mac_addr_frm_id(struct cdp_soc_t *soc_handle, 102 uint16_t peer_id, uint8_t *peer_mac); 103 104 int dp_peer_add_ast(struct dp_soc *soc, struct dp_peer *peer, 105 uint8_t *mac_addr, enum cdp_txrx_ast_entry_type type, 106 uint32_t flags); 107 108 void dp_peer_del_ast(struct dp_soc *soc, struct dp_ast_entry *ast_entry); 109 110 void dp_peer_ast_unmap_handler(struct dp_soc *soc, 111 struct dp_ast_entry *ast_entry); 112 113 int dp_peer_update_ast(struct dp_soc *soc, struct dp_peer *peer, 114 struct dp_ast_entry *ast_entry, uint32_t flags); 115 116 struct dp_ast_entry *dp_peer_ast_hash_find_by_pdevid(struct dp_soc *soc, 117 uint8_t *ast_mac_addr, 118 uint8_t pdev_id); 119 120 struct dp_ast_entry *dp_peer_ast_hash_find_soc(struct dp_soc *soc, 121 uint8_t *ast_mac_addr); 122 123 struct dp_ast_entry *dp_peer_ast_list_find(struct dp_soc *soc, 124 struct dp_peer *peer, 125 uint8_t *ast_mac_addr); 126 127 uint8_t dp_peer_ast_get_pdev_id(struct dp_soc *soc, 128 struct dp_ast_entry *ast_entry); 129 130 131 uint8_t dp_peer_ast_get_next_hop(struct dp_soc *soc, 132 struct dp_ast_entry *ast_entry); 133 134 void dp_peer_ast_set_type(struct dp_soc *soc, 135 struct dp_ast_entry *ast_entry, 136 enum cdp_txrx_ast_entry_type type); 137 138 void dp_peer_ast_send_wds_del(struct dp_soc *soc, 139 struct dp_ast_entry *ast_entry); 140 141 void dp_peer_free_hmwds_cb(void *ctrl_psoc, 142 void *dp_soc, 143 void *cookie, 144 enum cdp_ast_free_status status); 145 146 /* 147 * dp_get_vdev_from_soc_vdev_id_wifi3() - 148 * Returns vdev object given the vdev id 149 * vdev id is unique across pdev's 150 * 151 * @soc : core DP soc context 152 * @vdev_id : vdev id from vdev object can be retrieved 153 * 154 * Return: struct dp_vdev*: Pointer to DP vdev object 155 */ 156 static inline struct dp_vdev * 157 dp_get_vdev_from_soc_vdev_id_wifi3(struct dp_soc *soc, 158 uint8_t vdev_id) 159 { 160 struct dp_pdev *pdev = NULL; 161 struct dp_vdev *vdev = NULL; 162 int i; 163 164 for (i = 0; i < MAX_PDEV_CNT && soc->pdev_list[i]; i++) { 165 pdev = soc->pdev_list[i]; 166 qdf_spin_lock_bh(&pdev->vdev_list_lock); 167 TAILQ_FOREACH(vdev, &pdev->vdev_list, vdev_list_elem) { 168 if (vdev->vdev_id == vdev_id) { 169 QDF_TRACE(QDF_MODULE_ID_DP, 170 QDF_TRACE_LEVEL_INFO, 171 FL("Found vdev 0x%pK on pdev %d"), 172 vdev, i); 173 qdf_spin_unlock_bh(&pdev->vdev_list_lock); 174 return vdev; 175 } 176 } 177 qdf_spin_unlock_bh(&pdev->vdev_list_lock); 178 } 179 return NULL; 180 181 } 182 183 /* 184 * dp_peer_find_by_id_exist - check if peer exists for given id 185 * @soc: core DP soc context 186 * @peer_id: peer id from peer object can be retrieved 187 * 188 * Return: true if peer exists of false otherwise 189 */ 190 bool dp_peer_find_by_id_valid(struct dp_soc *soc, uint16_t peer_id); 191 192 #define DP_AST_ASSERT(_condition) \ 193 do { \ 194 if (!(_condition)) { \ 195 dp_print_ast_stats(soc);\ 196 QDF_BUG(_condition); \ 197 } \ 198 } while (0) 199 200 #endif /* _DP_PEER_H_ */ 201