1 /* 2 * Copyright (c) 2016-2018 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_rx_peer_map_handler(void *soc_handle, uint16_t peer_id, 91 uint16_t hw_peer_id, uint8_t vdev_id, 92 uint8_t *peer_mac_addr, uint16_t ast_hash, 93 uint8_t is_wds); 94 void dp_rx_peer_unmap_handler(void *soc_handle, uint16_t peer_id, 95 uint8_t vdev_id, uint8_t *peer_mac_addr, 96 uint8_t is_wds); 97 void dp_rx_sec_ind_handler(void *soc_handle, uint16_t peer_id, 98 enum htt_sec_type sec_type, int is_unicast, 99 u_int32_t *michael_key, u_int32_t *rx_pn); 100 uint8_t dp_get_peer_mac_addr_frm_id(struct cdp_soc_t *soc_handle, 101 uint16_t peer_id, uint8_t *peer_mac); 102 103 int dp_peer_add_ast(struct dp_soc *soc, struct dp_peer *peer, 104 uint8_t *mac_addr, enum cdp_txrx_ast_entry_type type, 105 uint32_t flags); 106 107 void dp_peer_del_ast(struct dp_soc *soc, struct dp_ast_entry *ast_entry); 108 109 void dp_peer_ast_unmap_handler(struct dp_soc *soc, 110 struct dp_ast_entry *ast_entry); 111 112 int dp_peer_update_ast(struct dp_soc *soc, struct dp_peer *peer, 113 struct dp_ast_entry *ast_entry, uint32_t flags); 114 115 struct dp_ast_entry *dp_peer_ast_hash_find_by_pdevid(struct dp_soc *soc, 116 uint8_t *ast_mac_addr, 117 uint8_t pdev_id); 118 119 struct dp_ast_entry *dp_peer_ast_hash_find(struct dp_soc *soc, 120 uint8_t *ast_mac_addr); 121 122 uint8_t dp_peer_ast_get_pdev_id(struct dp_soc *soc, 123 struct dp_ast_entry *ast_entry); 124 125 126 uint8_t dp_peer_ast_get_next_hop(struct dp_soc *soc, 127 struct dp_ast_entry *ast_entry); 128 129 void dp_peer_ast_set_type(struct dp_soc *soc, 130 struct dp_ast_entry *ast_entry, 131 enum cdp_txrx_ast_entry_type type); 132 133 #if defined(FEATURE_AST) && defined(AST_HKV1_WORKAROUND) 134 void dp_peer_ast_set_cp_ctx(struct dp_soc *soc, 135 struct dp_ast_entry *ast_entry, 136 void *cp_ctx); 137 138 void *dp_peer_ast_get_cp_ctx(struct dp_soc *soc, 139 struct dp_ast_entry *ast_entry); 140 141 void dp_peer_ast_send_wds_del(struct dp_soc *soc, 142 struct dp_ast_entry *ast_entry); 143 144 bool dp_peer_ast_get_wmi_sent(struct dp_soc *soc, 145 struct dp_ast_entry *ast_entry); 146 147 void dp_peer_ast_free_entry(struct dp_soc *soc, 148 struct dp_ast_entry *ast_entry); 149 150 #endif 151 152 /* 153 * dp_get_vdev_from_soc_vdev_id_wifi3() - 154 * Returns vdev object given the vdev id 155 * vdev id is unique across pdev's 156 * 157 * @soc : core DP soc context 158 * @vdev_id : vdev id from vdev object can be retrieved 159 * 160 * Return: struct dp_vdev*: Pointer to DP vdev object 161 */ 162 static inline struct dp_vdev * 163 dp_get_vdev_from_soc_vdev_id_wifi3(struct dp_soc *soc, 164 uint8_t vdev_id) 165 { 166 struct dp_pdev *pdev = NULL; 167 struct dp_vdev *vdev = NULL; 168 int i; 169 170 for (i = 0; i < MAX_PDEV_CNT && soc->pdev_list[i]; i++) { 171 pdev = soc->pdev_list[i]; 172 TAILQ_FOREACH(vdev, &pdev->vdev_list, vdev_list_elem) { 173 if (vdev->vdev_id == vdev_id) { 174 QDF_TRACE(QDF_MODULE_ID_DP, 175 QDF_TRACE_LEVEL_INFO, 176 FL("Found vdev 0x%pK on pdev %d"), 177 vdev, i); 178 return vdev; 179 } 180 } 181 } 182 return NULL; 183 184 } 185 186 /* 187 * dp_peer_find_by_id_exist - check if peer exists for given id 188 * @soc: core DP soc context 189 * @peer_id: peer id from peer object can be retrieved 190 * 191 * Return: true if peer exists of false otherwise 192 */ 193 bool dp_peer_find_by_id_valid(struct dp_soc *soc, uint16_t peer_id); 194 #endif /* _DP_PEER_H_ */ 195