| /src/external/apache2/llvm/dist/llvm/lib/Analysis/ |
| ImportedFunctionsInliningStatistics.cpp | 183 dfs(Node);
187 void ImportedFunctionsInliningStatistics::dfs(InlineGraphNode &GraphNode) { function in class:ImportedFunctionsInliningStatistics
193 dfs(*InlinedFunctionNode);
|
| /src/sys/external/bsd/drm2/dist/drm/i915/ |
| i915_buddy.c | 356 struct list_head dfs = LIST_HEAD_INIT(dfs); local
371 list_add_tail(&mm->roots[i]->tmp_link, &dfs);
379 block = list_first_entry_or_null(&dfs,
415 list_add(&block->right->tmp_link, &dfs);
416 list_add(&block->left->tmp_link, &dfs);
|
| /src/external/gpl3/gcc/dist/gcc/ |
| ipa-cp.h | 90 int dfs = 0; member in class:ipcp_value
|
| cfganal.cc | 52 /* Mark the back edges in DFS traversal.
633 depth_first_search dfs;
634 dfs.add_bb (EXIT_BLOCK_PTR_FOR_FN (cfun));
640 unvisited_block = dfs.execute (unvisited_block);
648 dfs.add_bb (deadend_block);
1182 /* Lazily initialized per-BB data for the two DFS walks below. */
1186 /* First DFS walk, loop discovery according to
1199 /* DFS process DEST. */
1217 /* DFS recurse on DEST. */
1221 /* Return point of DFS recursion. *
630 depth_first_search dfs; local
[all...] |
| ipa-inline.cc | 2090 struct ipa_dfs_info *dfs = (struct ipa_dfs_info *) node->aux; local
2103 if (dfs && dfs->next_cycle)
2106 int id = dfs->scc_no + 1;
|
| tree-into-ssa.cc | 712 in the dfs numbering of the dominance tree. */
719 /* The dfs number of this node. */
798 To quickly locate the nearest def that dominates use, we use dfs numbering
800 queries). For each def, we have the interval given by the dfs number on
803 that contains entry and exit dfs numbers for the basic block with the use.
827 dfs number corresponds. Change them to the number of basic block that
828 corresponds to the interval following the dfs number. Also, for the
829 dfs_out numbers, increase the dfs number by one (so that it corresponds
1075 definitions. DFS contains the dominance frontier information for
1079 insert_phi_nodes (bitmap_head *dfs)
2514 bitmap_head *dfs; local
3555 bitmap_head *dfs; local
3572 insert_updated_phi_nodes_for (ssa_name (i), dfs, update_flags); local
[all...] |
| tree-ssa-structalias.cc | 1449 unsigned int *dfs; member in class:scc_info
1475 si->dfs[n] = si->current_index ++;
1476 my_dfs = si->dfs[n];
1495 if (si->dfs[t] < si->dfs[n])
1496 si->dfs[n] = si->dfs[t];
1500 if (si->dfs[n] == my_dfs)
1503 && si->dfs[si->scc_stack.last ()] >= my_dfs)
1512 && si->dfs[si->scc_stack.last ()] >= my_dfs
[all...] |
| tree-vect-slp.cc | 6397 This is not done in DFS order to allow the refering node
9274 DFS walk we can end up visiting them twice. */
9642 int dfs; member in struct:slp_scc_info
9646 /* Schedule the SLP INSTANCE doing a DFS walk and collecting SCCs. */
9656 info->dfs = maxdfs;
9673 /* DFS recurse. */
9688 info->lowlink = MIN (info->lowlink, child_info->dfs);
9690 if (info->lowlink != info->dfs)
9712 code generated. Then we could re-start the DFS walk until
|
| /src/external/bsd/wpa/dist/src/ap/ |
| hw_features.c | 67 os_snprintf(info, sizeof(info), " (DFS state = %s)", state);
131 int dfs = 0; local
137 * Use radar channels only if the driver supports DFS.
141 dfs = 1;
161 dfs ? dfs_info(&feature->channels[j]) : "");
|
| beacon.c | 33 #include "dfs.h"
132 int dfs; local
138 /* Let host drivers add this IE if DFS support is offloaded */
143 * There is no DFS support and power constraint was not directly
150 /* Check if DFS is required by regulatory. */
151 dfs = hostapd_is_dfs_required(hapd->iface);
152 if (dfs < 0) {
153 wpa_printf(MSG_WARNING, "Failed to check if DFS is required; ret=%d",
154 dfs);
155 dfs = 0
[all...] |
| ieee802_11.c | 51 #include "dfs.h"
284 int dfs; local
287 /* Check if any of configured channels require DFS */
288 dfs = hostapd_is_dfs_required(hapd->iface);
289 if (dfs < 0) {
290 wpa_printf(MSG_WARNING, "Failed to check if DFS is required; ret=%d",
291 dfs);
292 dfs = 0;
327 * running on DFS channel.
332 (hapd->iconf->spectrum_mgmt_required || dfs))
7076 int dfs, i; local
[all...] |
| /src/external/gpl3/gcc/dist/gcc/config/aarch64/ |
| cortex-a57-fma-steering.cc | 217 void dfs (void (*) (fma_forest *), void (*) (fma_forest *, fma_root_node *),
444 pointer type in func_fma_steering::dfs. */
468 type in func_fma_steering::dfs. */
586 type in func_fma_steering::dfs. */
660 type in func_fma_steering::dfs. */
703 pointer type in func_fma_steering::dfs. */
853 same dfs. */
856 func_fma_steering::dfs (void (*process_forest) (fma_forest *), function in class:func_fma_steering
1006 this->dfs (dump_forest_info, dump_tree_root_info, dump_tree_node_info,
1018 this->dfs (dispatch_forest, NULL, rename_fma_node, true)
[all...] |
| /src/external/gpl3/gcc.old/dist/gcc/config/aarch64/ |
| cortex-a57-fma-steering.cc | 217 void dfs (void (*) (fma_forest *), void (*) (fma_forest *, fma_root_node *),
444 pointer type in func_fma_steering::dfs. */
468 type in func_fma_steering::dfs. */
586 type in func_fma_steering::dfs. */
660 type in func_fma_steering::dfs. */
703 pointer type in func_fma_steering::dfs. */
853 same dfs. */
856 func_fma_steering::dfs (void (*process_forest) (fma_forest *), function in class:func_fma_steering
1006 this->dfs (dump_forest_info, dump_tree_root_info, dump_tree_node_info,
1018 this->dfs (dispatch_forest, NULL, rename_fma_node, true)
[all...] |
| /src/external/gpl3/gcc.old/dist/gcc/ |
| cfganal.cc | 52 /* Mark the back edges in DFS traversal.
633 depth_first_search dfs;
634 dfs.add_bb (EXIT_BLOCK_PTR_FOR_FN (cfun));
640 unvisited_block = dfs.execute (unvisited_block);
648 dfs.add_bb (deadend_block);
1179 /* Lazily initialized per-BB data for the two DFS walks below. */
1183 /* First DFS walk, loop discovery according to
1196 /* DFS process DEST. */
1214 /* DFS recurse on DEST. */
1218 /* Return point of DFS recursion. *
630 depth_first_search dfs; local
[all...] |
| ipa-inline.cc | 1980 struct ipa_dfs_info *dfs = (struct ipa_dfs_info *) node->aux; local
1993 if (dfs && dfs->next_cycle)
1996 int id = dfs->scc_no + 1;
|
| tree-into-ssa.cc | 701 in the dfs numbering of the dominance tree. */
708 /* The dfs number of this node. */
787 To quickly locate the nearest def that dominates use, we use dfs numbering
789 queries). For each def, we have the interval given by the dfs number on
792 that contains entry and exit dfs numbers for the basic block with the use.
816 dfs number corresponds. Change them to the number of basic block that
817 corresponds to the interval following the dfs number. Also, for the
818 dfs_out numbers, increase the dfs number by one (so that it corresponds
1064 definitions. DFS contains the dominance frontier information for
1068 insert_phi_nodes (bitmap_head *dfs)
2434 bitmap_head *dfs; local
3472 bitmap_head *dfs; local
3493 insert_updated_phi_nodes_for (ssa_name (i), dfs, blocks_to_update, local
[all...] |
| ipa-cp.cc | 201 int dfs = 0; member in class:ipcp_value
3737 if (cur_val->dfs)
3741 cur_val->dfs = dfs_counter;
3751 if (src->val->dfs == 0)
3758 && src->val->dfs < cur_val->low_link)
3759 cur_val->low_link = src->val->dfs;
3762 if (cur_val->dfs == cur_val->low_link)
3771 v->scc_no = cur_val->dfs;
|
| tree-ssa-structalias.cc | 1433 unsigned int *dfs; member in class:scc_info
1459 si->dfs[n] = si->current_index ++;
1460 my_dfs = si->dfs[n];
1479 if (si->dfs[t] < si->dfs[n])
1480 si->dfs[n] = si->dfs[t];
1484 if (si->dfs[n] == my_dfs)
1487 && si->dfs[si->scc_stack.last ()] >= my_dfs)
1496 && si->dfs[si->scc_stack.last ()] >= my_dfs
[all...] |
| tree-vect-slp.cc | 4771 This is not done in DFS order to allow the refering node
7290 DFS walk we can end up visiting them twice. */
7611 int dfs; member in struct:slp_scc_info
7615 /* Schedule the SLP INSTANCE doing a DFS walk and collecting SCCs. */
7625 info->dfs = maxdfs;
7642 /* DFS recurse. */
7657 info->lowlink = MIN (info->lowlink, child_info->dfs);
7659 if (info->lowlink != info->dfs)
7681 code generated. Then we could re-start the DFS walk until
|
