Searched refs:dfs (Results 1 - 7 of 7) sorted by relevance
/freebsd-9.3-release/sys/net80211/ |
H A D | ieee80211_dfs.c | 55 static MALLOC_DEFINE(M_80211_DFS, "80211dfs", "802.11 DFS state"); 70 struct ieee80211_dfs_state *dfs = &ic->ic_dfs; local 72 callout_init_mtx(&dfs->nol_timer, IEEE80211_LOCK_OBJ(ic), 0); 73 callout_init_mtx(&dfs->cac_timer, IEEE80211_LOCK_OBJ(ic), 0); 86 struct ieee80211_dfs_state *dfs = &ic->ic_dfs; local 91 callout_drain(&dfs->nol_timer); 94 dfs->lastchan = NULL; 102 struct ieee80211_dfs_state *dfs = &ic->ic_dfs; local 123 /* NB: dfs->newchan may be NULL, that's ok */ 124 vap->iv_des_chan = dfs 157 struct ieee80211_dfs_state *dfs = &ic->ic_dfs; local 175 struct ieee80211_dfs_state *dfs = &ic->ic_dfs; local 206 struct ieee80211_dfs_state *dfs = &ic->ic_dfs; local 267 struct ieee80211_dfs_state *dfs = &ic->ic_dfs; local [all...] |
/freebsd-9.3-release/sys/modules/cpufreq/ |
H A D | Makefile | 23 SRCS+= dfs.c
|
/freebsd-9.3-release/contrib/gcc/config/soft-fp/ |
H A D | op-common.h | 1151 #define FP_EXTEND(dfs,sfs,dwc,swc,D,S) \ 1153 if (_FP_FRACBITS_##dfs < _FP_FRACBITS_##sfs \ 1154 || (_FP_EXPMAX_##dfs - _FP_EXPBIAS_##dfs \ 1156 || (_FP_EXPBIAS_##dfs < _FP_EXPBIAS_##sfs + _FP_FRACBITS_##sfs - 1 \ 1157 && _FP_EXPBIAS_##dfs != _FP_EXPBIAS_##sfs)) \ 1163 D##_e = S##_e + _FP_EXPBIAS_##dfs - _FP_EXPBIAS_##sfs; \ 1164 _FP_FRAC_SLL_##dwc(D, (_FP_FRACBITS_##dfs - _FP_FRACBITS_##sfs)); \ 1172 else if (_FP_EXPBIAS_##dfs \ 1176 _FP_FRAC_SLL_##dwc(D, (_FP_FRACBITS_##dfs \ [all...] |
/freebsd-9.3-release/contrib/gcc/ |
H A D | tree-into-ssa.c | 783 in the dfs numbering of the dominance tree. */ 790 /* The dfs number of this node. */ 870 To quickly locate the nearest def that dominates use, we use dfs numbering 872 queries). For each def, we have the interval given by the dfs number on 875 that contains entry and exit dfs numbers for the basic block with the use. 899 dfs number corresponds. Change them to the number of basic block that 900 corresponds to the interval following the dfs number. Also, for the 901 dfs_out numbers, increase the dfs number by one (so that it corresponds 1008 find_idf (bitmap def_blocks, bitmap *dfs) argument 1042 EXECUTE_IF_AND_COMPL_IN_BITMAP (dfs[bb_inde 1199 insert_phi_nodes(bitmap *dfs) argument 2085 bitmap *dfs; local 2732 insert_updated_phi_nodes_for(tree var, bitmap *dfs, bitmap blocks, unsigned update_flags) argument 3054 bitmap *dfs; local 3075 insert_updated_phi_nodes_for (ssa_name (i), dfs, blocks_to_update, local 3081 insert_updated_phi_nodes_for (referenced_var (i), dfs, local [all...] |
H A D | cfgloopanal.c | 69 int component; /* Number of dfs restarts before reaching the 142 /* Runs dfs search over vertices of G, from NQ vertices in queue QS. 144 backward dfs is run. */ 147 dfs (struct graph *g, int *qs, int nq, int *qt, bool forward) function 334 first determine the postorder dfs numbering in reversed graph, then 335 run the dfs on the original graph in the order given by decreasing 345 dfs (g, queue1, nq, queue2, false); 348 dfs (g, queue1, nq, NULL, true);
|
H A D | tree-ssa-structalias.c | 1103 unsigned int *dfs; member in struct:scc_info 1129 si->dfs[n] = si->current_index ++; 1130 my_dfs = si->dfs[n]; 1151 if (si->dfs[t] < si->dfs[nnode]) 1152 si->dfs[n] = si->dfs[t]; 1157 if (si->dfs[n] == my_dfs) 1160 && si->dfs[VEC_last (unsigned, si->scc_stack)] >= my_dfs) 1170 && si->dfs[VEC_las [all...] |
/freebsd-9.3-release/sys/powerpc/cpufreq/ |
H A D | dfs.c | 68 "dfs", 74 DRIVER_MODULE(dfs, cpu, dfs_driver, dfs_devclass, 0, 0); 100 if (device_find_child(parent, "dfs", -1) != NULL) 107 if (BUS_ADD_CHILD(parent, 10, "dfs", -1) == NULL) 108 device_printf(parent, "add dfs child failed\n"); 114 if (resource_disabled("dfs", 0))
|
Completed in 132 milliseconds