Home
last modified time | relevance | path

Searched refs:is_ctl (Results 1 – 2 of 2) sorted by relevance

/openbmc/linux/drivers/net/wireless/ath/ath9k/
H A Ddfs.c77 bool is_ctl, bool is_ext) in ath9k_get_max_index_ht40() argument
81 if (is_ctl && is_ext) { in ath9k_get_max_index_ht40()
83 is_ctl = fft_bitmap_weight(fft->lower_bins) != 0; in ath9k_get_max_index_ht40()
87 if (is_ctl && is_ext) { in ath9k_get_max_index_ht40()
91 is_ctl = false; in ath9k_get_max_index_ht40()
96 if (is_ctl) in ath9k_get_max_index_ht40()
101 int datalen, bool is_ctl, bool is_ext) in ath9k_check_chirping() argument
127 swap(is_ctl, is_ext); in ath9k_check_chirping()
130 max_bin[i] = ath9k_get_max_index_ht40(fft + i, is_ctl, in ath9k_check_chirping()
338 bool is_ctl = !!(ard.pulse_bw_info & PRI_CH_RADAR_FOUND); in ath9k_dfs_process_phyerr() local
[all …]
/openbmc/linux/fs/jfs/
H A Djfs_dmap.c66 static void dbSplit(dmtree_t *tp, int leafno, int splitsz, int newval, bool is_ctl);
67 static int dbBackSplit(dmtree_t *tp, int leafno, bool is_ctl);
68 static int dbJoin(dmtree_t *tp, int leafno, int newval, bool is_ctl);
69 static void dbAdjTree(dmtree_t *tp, int leafno, int newval, bool is_ctl);
90 static int dbFindLeaf(dmtree_t *tp, int l2nb, int *leafidx, bool is_ctl);
2629 static void dbSplit(dmtree_t *tp, int leafno, int splitsz, int newval, bool is_ctl) in dbSplit() argument
2651 dbAdjTree(tp, leafno ^ budsz, cursz, is_ctl); in dbSplit()
2663 dbAdjTree(tp, leafno, newval, is_ctl); in dbSplit()
2694 static int dbBackSplit(dmtree_t *tp, int leafno, bool is_ctl) in dbBackSplit() argument
2745 dbSplit(tp, bud, cursz, cursz, is_ctl); in dbBackSplit()
[all …]