blob: cd3cd8868c7f9dafa1321a1b8eb7ee2d02e52eba [file] [log] [blame]
/*
* Copyright (c) 2011-2016 The Linux Foundation. All rights reserved.
*
* Previously licensed under the ISC license by Qualcomm Atheros, Inc.
*
*
* Permission to use, copy, modify, and/or distribute this software for
* any purpose with or without fee is hereby granted, provided that the
* above copyright notice and this permission notice appear in all
* copies.
*
* THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL
* WARRANTIES WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED
* WARRANTIES OF MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE
* AUTHOR BE LIABLE FOR ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL
* DAMAGES OR ANY DAMAGES WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR
* PROFITS, WHETHER IN AN ACTION OF CONTRACT, NEGLIGENCE OR OTHER
* TORTIOUS ACTION, ARISING OUT OF OR IN CONNECTION WITH THE USE OR
* PERFORMANCE OF THIS SOFTWARE.
*/
/*
* This file was originally distributed by Qualcomm Atheros, Inc.
* under proprietary terms before Copyright ownership was assigned
* to the Linux Foundation.
*/
#include <qdf_atomic.h> /* qdf_atomic_inc, etc. */
#include <qdf_lock.h> /* qdf_os_spinlock */
#include <qdf_time.h> /* qdf_system_ticks, etc. */
#include <qdf_nbuf.h> /* qdf_nbuf_t */
#include <qdf_net_types.h> /* QDF_NBUF_TX_EXT_TID_INVALID */
#include <cds_queue.h> /* TAILQ */
#ifdef QCA_COMPUTE_TX_DELAY
#include <ieee80211.h> /* ieee80211_frame, etc. */
#include <enet.h> /* ethernet_hdr_t, etc. */
#include <ipv6_defs.h> /* ipv6_traffic_class */
#endif
#include <ol_txrx_api.h> /* ol_txrx_vdev_handle, etc. */
#include <ol_htt_tx_api.h> /* htt_tx_compl_desc_id */
#include <ol_txrx_htt_api.h> /* htt_tx_status */
#include <ol_ctrl_txrx_api.h>
#include <ol_tx_desc.h> /* ol_tx_desc_find, ol_tx_desc_frame_free */
#ifdef QCA_COMPUTE_TX_DELAY
#endif
#include <ol_txrx_internal.h> /* OL_TX_DESC_NO_REFS, etc. */
#include <ol_osif_txrx_api.h>
#include <ol_tx.h> /* ol_tx_reinject */
#include <ol_cfg.h> /* ol_cfg_is_high_latency */
#ifdef QCA_SUPPORT_SW_TXRX_ENCAP
#include <ol_txrx_encap.h> /* OL_TX_RESTORE_HDR, etc */
#endif
#ifdef TX_CREDIT_RECLAIM_SUPPORT
#define OL_TX_CREDIT_RECLAIM(pdev) \
do { \
if (qdf_atomic_read(&pdev->target_tx_credit) < \
ol_cfg_tx_credit_lwm(pdev->ctrl_pdev)) { \
ol_osif_ath_tasklet(pdev->osdev); \
} \
} while (0)
#else
#define OL_TX_CREDIT_RECLAIM(pdev)
#endif /* TX_CREDIT_RECLAIM_SUPPORT */
#if defined(TX_CREDIT_RECLAIM_SUPPORT)
/*
* HL needs to keep track of the amount of credit available to download
* tx frames to the target - the download scheduler decides when to
* download frames, and which frames to download, based on the credit
* availability.
* LL systems that use TX_CREDIT_RECLAIM_SUPPORT also need to keep track
* of the target_tx_credit, to determine when to poll for tx completion
* messages.
*/
#define OL_TX_TARGET_CREDIT_ADJUST(factor, pdev, msdu) \
qdf_atomic_add( \
factor * htt_tx_msdu_credit(msdu), &pdev->target_tx_credit)
#define OL_TX_TARGET_CREDIT_DECR(pdev, msdu) \
OL_TX_TARGET_CREDIT_ADJUST(-1, pdev, msdu)
#define OL_TX_TARGET_CREDIT_INCR(pdev, msdu) \
OL_TX_TARGET_CREDIT_ADJUST(1, pdev, msdu)
#define OL_TX_TARGET_CREDIT_DECR_INT(pdev, delta) \
qdf_atomic_add(-1 * delta, &pdev->target_tx_credit)
#define OL_TX_TARGET_CREDIT_INCR_INT(pdev, delta) \
qdf_atomic_add(delta, &pdev->target_tx_credit)
#else
/*
* LL does not need to keep track of target credit.
* Since the host tx descriptor pool size matches the target's,
* we know the target has space for the new tx frame if the host's
* tx descriptor allocation succeeded.
*/
#define OL_TX_TARGET_CREDIT_ADJUST(factor, pdev, msdu) /* no-op */
#define OL_TX_TARGET_CREDIT_DECR(pdev, msdu) /* no-op */
#define OL_TX_TARGET_CREDIT_INCR(pdev, msdu) /* no-op */
#define OL_TX_TARGET_CREDIT_DECR_INT(pdev, delta) /* no-op */
#define OL_TX_TARGET_CREDIT_INCR_INT(pdev, delta) /* no-op */
#endif
#ifdef QCA_LL_LEGACY_TX_FLOW_CONTROL
#define OL_TX_FLOW_CT_UNPAUSE_OS_Q(pdev) \
do { \
struct ol_txrx_vdev_t *vdev; \
TAILQ_FOREACH(vdev, &pdev->vdev_list, vdev_list_elem) { \
if (qdf_atomic_read(&vdev->os_q_paused) && \
(vdev->tx_fl_hwm != 0)) { \
qdf_spin_lock(&pdev->tx_mutex); \
if (pdev->tx_desc.num_free > \
vdev->tx_fl_hwm) { \
qdf_atomic_set(&vdev->os_q_paused, 0); \
qdf_spin_unlock(&pdev->tx_mutex); \
ol_txrx_flow_control_cb(vdev, true);\
} \
else { \
qdf_spin_unlock(&pdev->tx_mutex); \
} \
} \
} \
} while (0)
#else
#define OL_TX_FLOW_CT_UNPAUSE_OS_Q(pdev)
#endif /* QCA_LL_LEGACY_TX_FLOW_CONTROL */
static inline uint16_t
ol_tx_send_base(struct ol_txrx_pdev_t *pdev,
struct ol_tx_desc_t *tx_desc, qdf_nbuf_t msdu)
{
int msdu_credit_consumed;
TX_CREDIT_DEBUG_PRINT("TX %d bytes\n", qdf_nbuf_len(msdu));
TX_CREDIT_DEBUG_PRINT(" <HTT> Decrease credit %d - 1 = %d, len:%d.\n",
qdf_atomic_read(&pdev->target_tx_credit),
qdf_atomic_read(&pdev->target_tx_credit) - 1,
qdf_nbuf_len(msdu));
msdu_credit_consumed = htt_tx_msdu_credit(msdu);
OL_TX_TARGET_CREDIT_DECR_INT(pdev, msdu_credit_consumed);
OL_TX_CREDIT_RECLAIM(pdev);
/*
* When the tx frame is downloaded to the target, there are two
* outstanding references:
* 1. The host download SW (HTT, HTC, HIF)
* This reference is cleared by the ol_tx_send_done callback
* functions.
* 2. The target FW
* This reference is cleared by the ol_tx_completion_handler
* function.
* It is extremely probable that the download completion is processed
* before the tx completion message. However, under exceptional
* conditions the tx completion may be processed first. Thus, rather
* that assuming that reference (1) is done before reference (2),
* explicit reference tracking is needed.
* Double-increment the ref count to account for both references
* described above.
*/
OL_TX_DESC_REF_INIT(tx_desc);
OL_TX_DESC_REF_INC(tx_desc);
OL_TX_DESC_REF_INC(tx_desc);
return msdu_credit_consumed;
}
void
ol_tx_send(struct ol_txrx_pdev_t *pdev,
struct ol_tx_desc_t *tx_desc, qdf_nbuf_t msdu)
{
int msdu_credit_consumed;
uint16_t id;
int failed;
msdu_credit_consumed = ol_tx_send_base(pdev, tx_desc, msdu);
id = ol_tx_desc_id(pdev, tx_desc);
QDF_NBUF_UPDATE_TX_PKT_COUNT(msdu, QDF_NBUF_TX_PKT_TXRX);
DPTRACE(qdf_dp_trace(msdu, QDF_DP_TRACE_TXRX_PACKET_PTR_RECORD,
(uint8_t *)(qdf_nbuf_data(msdu)),
sizeof(qdf_nbuf_data(msdu))));
failed = htt_tx_send_std(pdev->htt_pdev, msdu, id);
if (qdf_unlikely(failed)) {
OL_TX_TARGET_CREDIT_INCR_INT(pdev, msdu_credit_consumed);
ol_tx_desc_frame_free_nonstd(pdev, tx_desc, 1 /* had error */);
}
}
void
ol_tx_send_batch(struct ol_txrx_pdev_t *pdev,
qdf_nbuf_t head_msdu, int num_msdus)
{
qdf_nbuf_t rejected;
OL_TX_CREDIT_RECLAIM(pdev);
rejected = htt_tx_send_batch(pdev->htt_pdev, head_msdu, num_msdus);
while (qdf_unlikely(rejected)) {
struct ol_tx_desc_t *tx_desc;
uint16_t *msdu_id_storage;
qdf_nbuf_t next;
next = qdf_nbuf_next(rejected);
msdu_id_storage = ol_tx_msdu_id_storage(rejected);
tx_desc = ol_tx_desc_find(pdev, *msdu_id_storage);
OL_TX_TARGET_CREDIT_INCR(pdev, rejected);
ol_tx_desc_frame_free_nonstd(pdev, tx_desc, 1 /* had error */);
rejected = next;
}
}
void
ol_tx_send_nonstd(struct ol_txrx_pdev_t *pdev,
struct ol_tx_desc_t *tx_desc,
qdf_nbuf_t msdu, enum htt_pkt_type pkt_type)
{
int msdu_credit_consumed;
uint16_t id;
int failed;
msdu_credit_consumed = ol_tx_send_base(pdev, tx_desc, msdu);
id = ol_tx_desc_id(pdev, tx_desc);
QDF_NBUF_UPDATE_TX_PKT_COUNT(msdu, QDF_NBUF_TX_PKT_TXRX);
failed = htt_tx_send_nonstd(pdev->htt_pdev, msdu, id, pkt_type);
if (failed) {
TXRX_PRINT(TXRX_PRINT_LEVEL_ERR,
"Error: freeing tx frame after htt_tx failed");
OL_TX_TARGET_CREDIT_INCR_INT(pdev, msdu_credit_consumed);
ol_tx_desc_frame_free_nonstd(pdev, tx_desc, 1 /* had error */);
}
}
static inline void
ol_tx_download_done_base(struct ol_txrx_pdev_t *pdev,
A_STATUS status, qdf_nbuf_t msdu, uint16_t msdu_id)
{
struct ol_tx_desc_t *tx_desc;
tx_desc = ol_tx_desc_find(pdev, msdu_id);
qdf_assert(tx_desc);
/*
* If the download is done for
* the Management frame then
* call the download callback if registered
*/
if (tx_desc->pkt_type >= OL_TXRX_MGMT_TYPE_BASE) {
int tx_mgmt_index = tx_desc->pkt_type - OL_TXRX_MGMT_TYPE_BASE;
ol_txrx_mgmt_tx_cb download_cb =
pdev->tx_mgmt.callbacks[tx_mgmt_index].download_cb;
if (download_cb) {
download_cb(pdev->tx_mgmt.callbacks[tx_mgmt_index].ctxt,
tx_desc->netbuf, status != A_OK);
}
}
if (status != A_OK) {
OL_TX_TARGET_CREDIT_INCR(pdev, msdu);
ol_tx_desc_frame_free_nonstd(pdev, tx_desc,
1 /* download err */);
} else {
if (OL_TX_DESC_NO_REFS(tx_desc)) {
/*
* The decremented value was zero - free the frame.
* Use the tx status recorded previously during
* tx completion handling.
*/
ol_tx_desc_frame_free_nonstd(pdev, tx_desc,
tx_desc->status !=
htt_tx_status_ok);
}
}
}
void
ol_tx_download_done_ll(void *pdev,
A_STATUS status, qdf_nbuf_t msdu, uint16_t msdu_id)
{
ol_tx_download_done_base((struct ol_txrx_pdev_t *)pdev, status, msdu,
msdu_id);
}
void
ol_tx_download_done_hl_retain(void *txrx_pdev,
A_STATUS status,
qdf_nbuf_t msdu, uint16_t msdu_id)
{
struct ol_txrx_pdev_t *pdev = txrx_pdev;
ol_tx_download_done_base(pdev, status, msdu, msdu_id);
}
void
ol_tx_download_done_hl_free(void *txrx_pdev,
A_STATUS status, qdf_nbuf_t msdu, uint16_t msdu_id)
{
struct ol_txrx_pdev_t *pdev = txrx_pdev;
struct ol_tx_desc_t *tx_desc;
tx_desc = ol_tx_desc_find(pdev, msdu_id);
qdf_assert(tx_desc);
ol_tx_download_done_base(pdev, status, msdu, msdu_id);
if ((tx_desc->pkt_type != ol_tx_frm_no_free) &&
(tx_desc->pkt_type < OL_TXRX_MGMT_TYPE_BASE)) {
qdf_atomic_add(1, &pdev->tx_queue.rsrc_cnt);
ol_tx_desc_frame_free_nonstd(pdev, tx_desc, status != A_OK);
}
}
void ol_tx_target_credit_init(struct ol_txrx_pdev_t *pdev, int credit_delta)
{
qdf_atomic_add(credit_delta, &pdev->orig_target_tx_credit);
}
void ol_tx_target_credit_update(struct ol_txrx_pdev_t *pdev, int credit_delta)
{
TX_CREDIT_DEBUG_PRINT(" <HTT> Increase credit %d + %d = %d\n",
qdf_atomic_read(&pdev->target_tx_credit),
credit_delta,
qdf_atomic_read(&pdev->target_tx_credit) +
credit_delta);
qdf_atomic_add(credit_delta, &pdev->target_tx_credit);
}
#ifdef QCA_COMPUTE_TX_DELAY
static void
ol_tx_delay_compute(struct ol_txrx_pdev_t *pdev,
enum htt_tx_status status,
uint16_t *desc_ids, int num_msdus);
#define OL_TX_DELAY_COMPUTE ol_tx_delay_compute
#else
#define OL_TX_DELAY_COMPUTE(pdev, status, desc_ids, num_msdus) /* no-op */
#endif /* QCA_COMPUTE_TX_DELAY */
#ifndef OL_TX_RESTORE_HDR
#define OL_TX_RESTORE_HDR(__tx_desc, __msdu)
#endif
/*
* The following macros could have been inline functions too.
* The only rationale for choosing macros, is to force the compiler to inline
* the implementation, which cannot be controlled for actual "inline" functions,
* since "inline" is only a hint to the compiler.
* In the performance path, we choose to force the inlining, in preference to
* type-checking offered by the actual inlined functions.
*/
#define ol_tx_msdu_complete_batch(_pdev, _tx_desc, _tx_descs, _status) \
TAILQ_INSERT_TAIL(&(_tx_descs), (_tx_desc), tx_desc_list_elem)
#ifndef ATH_11AC_TXCOMPACT
#define ol_tx_msdu_complete_single(_pdev, _tx_desc, _netbuf,\
_lcl_freelist, _tx_desc_last) \
do { \
qdf_atomic_init(&(_tx_desc)->ref_cnt); \
/* restore orginal hdr offset */ \
OL_TX_RESTORE_HDR((_tx_desc), (_netbuf)); \
qdf_nbuf_unmap((_pdev)->osdev, (_netbuf), QDF_DMA_TO_DEVICE); \
qdf_nbuf_free((_netbuf)); \
((union ol_tx_desc_list_elem_t *)(_tx_desc))->next = \
(_lcl_freelist); \
if (qdf_unlikely(!lcl_freelist)) { \
(_tx_desc_last) = (union ol_tx_desc_list_elem_t *)\
(_tx_desc); \
} \
(_lcl_freelist) = (union ol_tx_desc_list_elem_t *)(_tx_desc); \
} while (0)
#else /*!ATH_11AC_TXCOMPACT */
#define ol_tx_msdu_complete_single(_pdev, _tx_desc, _netbuf,\
_lcl_freelist, _tx_desc_last) \
do { \
/* restore orginal hdr offset */ \
OL_TX_RESTORE_HDR((_tx_desc), (_netbuf)); \
qdf_nbuf_unmap((_pdev)->osdev, (_netbuf), QDF_DMA_TO_DEVICE); \
qdf_nbuf_free((_netbuf)); \
((union ol_tx_desc_list_elem_t *)(_tx_desc))->next = \
(_lcl_freelist); \
if (qdf_unlikely(!lcl_freelist)) { \
(_tx_desc_last) = (union ol_tx_desc_list_elem_t *)\
(_tx_desc); \
} \
(_lcl_freelist) = (union ol_tx_desc_list_elem_t *)(_tx_desc); \
} while (0)
#endif /*!ATH_11AC_TXCOMPACT */
#ifdef QCA_TX_SINGLE_COMPLETIONS
#ifdef QCA_TX_STD_PATH_ONLY
#define ol_tx_msdu_complete(_pdev, _tx_desc, _tx_descs, \
_netbuf, _lcl_freelist, \
_tx_desc_last, _status) \
ol_tx_msdu_complete_single((_pdev), (_tx_desc), \
(_netbuf), (_lcl_freelist), \
_tx_desc_last)
#else /* !QCA_TX_STD_PATH_ONLY */
#define ol_tx_msdu_complete(_pdev, _tx_desc, _tx_descs, \
_netbuf, _lcl_freelist, \
_tx_desc_last, _status) \
do { \
if (qdf_likely((_tx_desc)->pkt_type == ol_tx_frm_std)) { \
ol_tx_msdu_complete_single((_pdev), (_tx_desc),\
(_netbuf), (_lcl_freelist), \
(_tx_desc_last)); \
} else { \
ol_tx_desc_frame_free_nonstd( \
(_pdev), (_tx_desc), \
(_status) != htt_tx_status_ok); \
} \
} while (0)
#endif /* !QCA_TX_STD_PATH_ONLY */
#else /* !QCA_TX_SINGLE_COMPLETIONS */
#ifdef QCA_TX_STD_PATH_ONLY
#define ol_tx_msdu_complete(_pdev, _tx_desc, _tx_descs, \
_netbuf, _lcl_freelist, \
_tx_desc_last, _status) \
ol_tx_msdus_complete_batch((_pdev), (_tx_desc), (_tx_descs), (_status))
#else /* !QCA_TX_STD_PATH_ONLY */
#define ol_tx_msdu_complete(_pdev, _tx_desc, _tx_descs, \
_netbuf, _lcl_freelist, \
_tx_desc_last, _status) \
do { \
if (qdf_likely((_tx_desc)->pkt_type == ol_tx_frm_std)) { \
ol_tx_msdu_complete_batch((_pdev), (_tx_desc), \
(_tx_descs), (_status)); \
} else { \
ol_tx_desc_frame_free_nonstd((_pdev), (_tx_desc), \
(_status) != \
htt_tx_status_ok); \
} \
} while (0)
#endif /* !QCA_TX_STD_PATH_ONLY */
#endif /* QCA_TX_SINGLE_COMPLETIONS */
void ol_tx_discard_target_frms(ol_txrx_pdev_handle pdev)
{
int i = 0;
struct ol_tx_desc_t *tx_desc;
for (i = 0; i < pdev->tx_desc.pool_size; i++) {
tx_desc = ol_tx_desc_find(pdev, i);
/*
* Confirm that each tx descriptor is "empty", i.e. it has
* no tx frame attached.
* In particular, check that there are no frames that have
* been given to the target to transmit, for which the
* target has never provided a response.
*/
if (qdf_atomic_read(&tx_desc->ref_cnt)) {
TXRX_PRINT(TXRX_PRINT_LEVEL_WARN,
"Warning: freeing tx frame "
"(no tx completion from the target)\n");
ol_tx_desc_frame_free_nonstd(pdev,
tx_desc, 1);
}
}
}
void ol_tx_credit_completion_handler(ol_txrx_pdev_handle pdev, int credits)
{
ol_tx_target_credit_update(pdev, credits);
/* UNPAUSE OS Q */
OL_TX_FLOW_CT_UNPAUSE_OS_Q(pdev);
}
/* WARNING: ol_tx_inspect_handler()'s bahavior is similar to that of
ol_tx_completion_handler().
* any change in ol_tx_completion_handler() must be mirrored in
ol_tx_inspect_handler().
*/
void
ol_tx_completion_handler(ol_txrx_pdev_handle pdev,
int num_msdus,
enum htt_tx_status status, void *tx_desc_id_iterator)
{
int i;
uint16_t *desc_ids = (uint16_t *) tx_desc_id_iterator;
uint16_t tx_desc_id;
struct ol_tx_desc_t *tx_desc;
char *trace_str;
uint32_t byte_cnt = 0;
qdf_nbuf_t netbuf;
union ol_tx_desc_list_elem_t *lcl_freelist = NULL;
union ol_tx_desc_list_elem_t *tx_desc_last = NULL;
ol_tx_desc_list tx_descs;
TAILQ_INIT(&tx_descs);
OL_TX_DELAY_COMPUTE(pdev, status, desc_ids, num_msdus);
trace_str = (status) ? "OT:C:F:" : "OT:C:S:";
for (i = 0; i < num_msdus; i++) {
tx_desc_id = desc_ids[i];
tx_desc = ol_tx_desc_find(pdev, tx_desc_id);
tx_desc->status = status;
netbuf = tx_desc->netbuf;
qdf_runtime_pm_put();
qdf_nbuf_trace_update(netbuf, trace_str);
/* Per SDU update of byte count */
byte_cnt += qdf_nbuf_len(netbuf);
if (OL_TX_DESC_NO_REFS(tx_desc)) {
ol_tx_statistics(
pdev->ctrl_pdev,
HTT_TX_DESC_VDEV_ID_GET(*((uint32_t *)
(tx_desc->
htt_tx_desc))),
status != htt_tx_status_ok);
ol_tx_msdu_complete(pdev, tx_desc, tx_descs, netbuf,
lcl_freelist, tx_desc_last, status);
}
QDF_NBUF_UPDATE_TX_PKT_COUNT(netbuf, QDF_NBUF_TX_PKT_FREE);
#ifdef QCA_SUPPORT_TXDESC_SANITY_CHECKS
tx_desc->pkt_type = 0xff;
#ifdef QCA_COMPUTE_TX_DELAY
tx_desc->entry_timestamp_ticks = 0xffffffff;
#endif
#endif
}
/* One shot protected access to pdev freelist, when setup */
if (lcl_freelist) {
qdf_spin_lock(&pdev->tx_mutex);
tx_desc_last->next = pdev->tx_desc.freelist;
pdev->tx_desc.freelist = lcl_freelist;
pdev->tx_desc.num_free += (uint16_t) num_msdus;
qdf_spin_unlock(&pdev->tx_mutex);
} else {
ol_tx_desc_frame_list_free(pdev, &tx_descs,
status != htt_tx_status_ok);
}
OL_TX_TARGET_CREDIT_ADJUST(num_msdus, pdev, NULL);
/* UNPAUSE OS Q */
OL_TX_FLOW_CT_UNPAUSE_OS_Q(pdev);
/* Do one shot statistics */
TXRX_STATS_UPDATE_TX_STATS(pdev, status, num_msdus, byte_cnt);
}
/*
* ol_tx_single_completion_handler performs the same tx completion
* processing as ol_tx_completion_handler, but for a single frame.
* ol_tx_completion_handler is optimized to handle batch completions
* as efficiently as possible; in contrast ol_tx_single_completion_handler
* handles single frames as simply and generally as possible.
* Thus, this ol_tx_single_completion_handler function is suitable for
* intermittent usage, such as for tx mgmt frames.
*/
void
ol_tx_single_completion_handler(ol_txrx_pdev_handle pdev,
enum htt_tx_status status, uint16_t tx_desc_id)
{
struct ol_tx_desc_t *tx_desc;
qdf_nbuf_t netbuf;
tx_desc = ol_tx_desc_find(pdev, tx_desc_id);
tx_desc->status = status;
netbuf = tx_desc->netbuf;
QDF_NBUF_UPDATE_TX_PKT_COUNT(netbuf, QDF_NBUF_TX_PKT_FREE);
/* Do one shot statistics */
TXRX_STATS_UPDATE_TX_STATS(pdev, status, 1, qdf_nbuf_len(netbuf));
if (OL_TX_DESC_NO_REFS(tx_desc)) {
ol_tx_desc_frame_free_nonstd(pdev, tx_desc,
status != htt_tx_status_ok);
}
TX_CREDIT_DEBUG_PRINT(" <HTT> Increase credit %d + %d = %d\n",
qdf_atomic_read(&pdev->target_tx_credit),
1, qdf_atomic_read(&pdev->target_tx_credit) + 1);
qdf_atomic_add(1, &pdev->target_tx_credit);
}
/* WARNING: ol_tx_inspect_handler()'s bahavior is similar to that of
ol_tx_completion_handler().
* any change in ol_tx_completion_handler() must be mirrored here.
*/
void
ol_tx_inspect_handler(ol_txrx_pdev_handle pdev,
int num_msdus, void *tx_desc_id_iterator)
{
uint16_t vdev_id, i;
struct ol_txrx_vdev_t *vdev;
uint16_t *desc_ids = (uint16_t *) tx_desc_id_iterator;
uint16_t tx_desc_id;
struct ol_tx_desc_t *tx_desc;
union ol_tx_desc_list_elem_t *lcl_freelist = NULL;
union ol_tx_desc_list_elem_t *tx_desc_last = NULL;
qdf_nbuf_t netbuf;
ol_tx_desc_list tx_descs;
TAILQ_INIT(&tx_descs);
for (i = 0; i < num_msdus; i++) {
tx_desc_id = desc_ids[i];
tx_desc = ol_tx_desc_find(pdev, tx_desc_id);
netbuf = tx_desc->netbuf;
/* find the "vdev" this tx_desc belongs to */
vdev_id = HTT_TX_DESC_VDEV_ID_GET(*((uint32_t *)
(tx_desc->htt_tx_desc)));
TAILQ_FOREACH(vdev, &pdev->vdev_list, vdev_list_elem) {
if (vdev->vdev_id == vdev_id)
break;
}
/* vdev now points to the vdev for this descriptor. */
#ifndef ATH_11AC_TXCOMPACT
/* save this multicast packet to local free list */
if (qdf_atomic_dec_and_test(&tx_desc->ref_cnt))
#endif
{
/* for this function only, force htt status to be
"htt_tx_status_ok"
* for graceful freeing of this multicast frame
*/
ol_tx_msdu_complete(pdev, tx_desc, tx_descs, netbuf,
lcl_freelist, tx_desc_last,
htt_tx_status_ok);
}
}
if (lcl_freelist) {
qdf_spin_lock(&pdev->tx_mutex);
tx_desc_last->next = pdev->tx_desc.freelist;
pdev->tx_desc.freelist = lcl_freelist;
qdf_spin_unlock(&pdev->tx_mutex);
} else {
ol_tx_desc_frame_list_free(pdev, &tx_descs,
htt_tx_status_discard);
}
TX_CREDIT_DEBUG_PRINT(" <HTT> Increase HTT credit %d + %d = %d..\n",
qdf_atomic_read(&pdev->target_tx_credit),
num_msdus,
qdf_atomic_read(&pdev->target_tx_credit) +
num_msdus);
OL_TX_TARGET_CREDIT_ADJUST(num_msdus, pdev, NULL);
}
#ifdef QCA_COMPUTE_TX_DELAY
void ol_tx_set_compute_interval(ol_txrx_pdev_handle pdev, uint32_t interval)
{
pdev->tx_delay.avg_period_ticks = qdf_system_msecs_to_ticks(interval);
}
void
ol_tx_packet_count(ol_txrx_pdev_handle pdev,
uint16_t *out_packet_count,
uint16_t *out_packet_loss_count, int category)
{
*out_packet_count = pdev->packet_count[category];
*out_packet_loss_count = pdev->packet_loss_count[category];
pdev->packet_count[category] = 0;
pdev->packet_loss_count[category] = 0;
}
uint32_t ol_tx_delay_avg(uint64_t sum, uint32_t num)
{
uint32_t sum32;
int shift = 0;
/*
* To avoid doing a 64-bit divide, shift the sum down until it is
* no more than 32 bits (and shift the denominator to match).
*/
while ((sum >> 32) != 0) {
sum >>= 1;
shift++;
}
sum32 = (uint32_t) sum;
num >>= shift;
return (sum32 + (num >> 1)) / num; /* round to nearest */
}
void
ol_tx_delay(ol_txrx_pdev_handle pdev,
uint32_t *queue_delay_microsec,
uint32_t *tx_delay_microsec, int category)
{
int index;
uint32_t avg_delay_ticks;
struct ol_tx_delay_data *data;
qdf_assert(category >= 0 && category < QCA_TX_DELAY_NUM_CATEGORIES);
qdf_spin_lock_bh(&pdev->tx_delay.mutex);
index = 1 - pdev->tx_delay.cats[category].in_progress_idx;
data = &pdev->tx_delay.cats[category].copies[index];
if (data->avgs.transmit_num > 0) {
avg_delay_ticks =
ol_tx_delay_avg(data->avgs.transmit_sum_ticks,
data->avgs.transmit_num);
*tx_delay_microsec =
qdf_system_ticks_to_msecs(avg_delay_ticks * 1000);
} else {
/*
* This case should only happen if there's a query
* within 5 sec after the first tx data frame.
*/
*tx_delay_microsec = 0;
}
if (data->avgs.queue_num > 0) {
avg_delay_ticks =
ol_tx_delay_avg(data->avgs.queue_sum_ticks,
data->avgs.queue_num);
*queue_delay_microsec =
qdf_system_ticks_to_msecs(avg_delay_ticks * 1000);
} else {
/*
* This case should only happen if there's a query
* within 5 sec after the first tx data frame.
*/
*queue_delay_microsec = 0;
}
qdf_spin_unlock_bh(&pdev->tx_delay.mutex);
}
void
ol_tx_delay_hist(ol_txrx_pdev_handle pdev,
uint16_t *report_bin_values, int category)
{
int index, i, j;
struct ol_tx_delay_data *data;
qdf_assert(category >= 0 && category < QCA_TX_DELAY_NUM_CATEGORIES);
qdf_spin_lock_bh(&pdev->tx_delay.mutex);
index = 1 - pdev->tx_delay.cats[category].in_progress_idx;
data = &pdev->tx_delay.cats[category].copies[index];
for (i = 0, j = 0; i < QCA_TX_DELAY_HIST_REPORT_BINS - 1; i++) {
uint16_t internal_bin_sum = 0;
while (j < (1 << i))
internal_bin_sum += data->hist_bins_queue[j++];
report_bin_values[i] = internal_bin_sum;
}
report_bin_values[i] = data->hist_bins_queue[j]; /* overflow */
qdf_spin_unlock_bh(&pdev->tx_delay.mutex);
}
#ifdef QCA_COMPUTE_TX_DELAY_PER_TID
static inline uint8_t *ol_tx_dest_addr_find(struct ol_txrx_pdev_t *pdev,
qdf_nbuf_t tx_nbuf)
{
uint8_t *hdr_ptr;
void *datap = qdf_nbuf_data(tx_nbuf);
if (pdev->frame_format == wlan_frm_fmt_raw) {
/* adjust hdr_ptr to RA */
struct ieee80211_frame *wh = (struct ieee80211_frame *)datap;
hdr_ptr = wh->i_addr1;
} else if (pdev->frame_format == wlan_frm_fmt_native_wifi) {
/* adjust hdr_ptr to RA */
struct ieee80211_frame *wh = (struct ieee80211_frame *)datap;
hdr_ptr = wh->i_addr1;
} else if (pdev->frame_format == wlan_frm_fmt_802_3) {
hdr_ptr = datap;
} else {
QDF_TRACE(QDF_MODULE_ID_TXRX, QDF_TRACE_LEVEL_ERROR,
"Invalid standard frame type: %d",
pdev->frame_format);
qdf_assert(0);
hdr_ptr = NULL;
}
return hdr_ptr;
}
static uint8_t
ol_tx_delay_tid_from_l3_hdr(struct ol_txrx_pdev_t *pdev,
qdf_nbuf_t msdu, struct ol_tx_desc_t *tx_desc)
{
uint16_t ethertype;
uint8_t *dest_addr, *l3_hdr;
int is_mgmt, is_mcast;
int l2_hdr_size;
dest_addr = ol_tx_dest_addr_find(pdev, msdu);
if (NULL == dest_addr)
return QDF_NBUF_TX_EXT_TID_INVALID;
is_mcast = IEEE80211_IS_MULTICAST(dest_addr);
is_mgmt = tx_desc->pkt_type >= OL_TXRX_MGMT_TYPE_BASE;
if (is_mgmt) {
return (is_mcast) ?
OL_TX_NUM_TIDS + OL_TX_VDEV_DEFAULT_MGMT :
HTT_TX_EXT_TID_MGMT;
}
if (is_mcast)
return OL_TX_NUM_TIDS + OL_TX_VDEV_MCAST_BCAST;
if (pdev->frame_format == wlan_frm_fmt_802_3) {
struct ethernet_hdr_t *enet_hdr;
enet_hdr = (struct ethernet_hdr_t *)qdf_nbuf_data(msdu);
l2_hdr_size = sizeof(struct ethernet_hdr_t);
ethertype =
(enet_hdr->ethertype[0] << 8) | enet_hdr->ethertype[1];
if (!IS_ETHERTYPE(ethertype)) {
struct llc_snap_hdr_t *llc_hdr;
llc_hdr = (struct llc_snap_hdr_t *)
(qdf_nbuf_data(msdu) + l2_hdr_size);
l2_hdr_size += sizeof(struct llc_snap_hdr_t);
ethertype =
(llc_hdr->ethertype[0] << 8) | llc_hdr->
ethertype[1];
}
} else {
struct llc_snap_hdr_t *llc_hdr;
l2_hdr_size = sizeof(struct ieee80211_frame);
llc_hdr = (struct llc_snap_hdr_t *)(qdf_nbuf_data(msdu)
+ l2_hdr_size);
l2_hdr_size += sizeof(struct llc_snap_hdr_t);
ethertype =
(llc_hdr->ethertype[0] << 8) | llc_hdr->ethertype[1];
}
l3_hdr = qdf_nbuf_data(msdu) + l2_hdr_size;
if (ETHERTYPE_IPV4 == ethertype) {
return (((struct ipv4_hdr_t *)l3_hdr)->tos >> 5) & 0x7;
} else if (ETHERTYPE_IPV6 == ethertype) {
return (ipv6_traffic_class((struct ipv6_hdr_t *)l3_hdr) >> 5) &
0x7;
} else {
return QDF_NBUF_TX_EXT_TID_INVALID;
}
}
#endif
static int ol_tx_delay_category(struct ol_txrx_pdev_t *pdev, uint16_t msdu_id)
{
#ifdef QCA_COMPUTE_TX_DELAY_PER_TID
struct ol_tx_desc_t *tx_desc = ol_tx_desc_find(pdev, msdu_id);
uint8_t tid;
qdf_nbuf_t msdu = tx_desc->netbuf;
tid = qdf_nbuf_get_tid(msdu);
if (tid == QDF_NBUF_TX_EXT_TID_INVALID) {
tid = ol_tx_delay_tid_from_l3_hdr(pdev, msdu, tx_desc);
if (tid == QDF_NBUF_TX_EXT_TID_INVALID) {
/* TID could not be determined
(this is not an IP frame?) */
return -EINVAL;
}
}
return tid;
#else
return 0;
#endif
}
static inline int
ol_tx_delay_hist_bin(struct ol_txrx_pdev_t *pdev, uint32_t delay_ticks)
{
int bin;
/*
* For speed, multiply and shift to approximate a divide. This causes
* a small error, but the approximation error should be much less
* than the other uncertainties in the tx delay computation.
*/
bin = (delay_ticks * pdev->tx_delay.hist_internal_bin_width_mult) >>
pdev->tx_delay.hist_internal_bin_width_shift;
if (bin >= QCA_TX_DELAY_HIST_INTERNAL_BINS)
bin = QCA_TX_DELAY_HIST_INTERNAL_BINS - 1;
return bin;
}
static void
ol_tx_delay_compute(struct ol_txrx_pdev_t *pdev,
enum htt_tx_status status,
uint16_t *desc_ids, int num_msdus)
{
int i, index, cat;
uint32_t now_ticks = qdf_system_ticks();
uint32_t tx_delay_transmit_ticks, tx_delay_queue_ticks;
uint32_t avg_time_ticks;
struct ol_tx_delay_data *data;
qdf_assert(num_msdus > 0);
/*
* keep static counters for total packet and lost packets
* reset them in ol_tx_delay(), function used to fetch the stats
*/
cat = ol_tx_delay_category(pdev, desc_ids[0]);
if (cat < 0 || cat >= QCA_TX_DELAY_NUM_CATEGORIES)
return;
pdev->packet_count[cat] = pdev->packet_count[cat] + num_msdus;
if (status != htt_tx_status_ok) {
for (i = 0; i < num_msdus; i++) {
cat = ol_tx_delay_category(pdev, desc_ids[i]);
if (cat < 0 || cat >= QCA_TX_DELAY_NUM_CATEGORIES)
return;
pdev->packet_loss_count[cat]++;
}
return;
}
/* since we may switch the ping-pong index, provide mutex w. readers */
qdf_spin_lock_bh(&pdev->tx_delay.mutex);
index = pdev->tx_delay.cats[cat].in_progress_idx;
data = &pdev->tx_delay.cats[cat].copies[index];
if (pdev->tx_delay.tx_compl_timestamp_ticks != 0) {
tx_delay_transmit_ticks =
now_ticks - pdev->tx_delay.tx_compl_timestamp_ticks;
/*
* We'd like to account for the number of MSDUs that were
* transmitted together, but we don't know this. All we know
* is the number of MSDUs that were acked together.
* Since the frame error rate is small, this is nearly the same
* as the number of frames transmitted together.
*/
data->avgs.transmit_sum_ticks += tx_delay_transmit_ticks;
data->avgs.transmit_num += num_msdus;
}
pdev->tx_delay.tx_compl_timestamp_ticks = now_ticks;
for (i = 0; i < num_msdus; i++) {
int bin;
uint16_t id = desc_ids[i];
struct ol_tx_desc_t *tx_desc = ol_tx_desc_find(pdev, id);
tx_delay_queue_ticks =
now_ticks - tx_desc->entry_timestamp_ticks;
data->avgs.queue_sum_ticks += tx_delay_queue_ticks;
data->avgs.queue_num++;
bin = ol_tx_delay_hist_bin(pdev, tx_delay_queue_ticks);
data->hist_bins_queue[bin]++;
}
/* check if it's time to start a new average */
avg_time_ticks =
now_ticks - pdev->tx_delay.cats[cat].avg_start_time_ticks;
if (avg_time_ticks > pdev->tx_delay.avg_period_ticks) {
pdev->tx_delay.cats[cat].avg_start_time_ticks = now_ticks;
index = 1 - index;
pdev->tx_delay.cats[cat].in_progress_idx = index;
qdf_mem_zero(&pdev->tx_delay.cats[cat].copies[index],
sizeof(pdev->tx_delay.cats[cat].copies[index]));
}
qdf_spin_unlock_bh(&pdev->tx_delay.mutex);
}
#endif /* QCA_COMPUTE_TX_DELAY */