/freebsd-10.1-release/contrib/llvm/tools/clang/lib/Analysis/ |
H A D | CFGReachabilityAnalysis.cpp | 44 llvm::BitVector visited(analyzed.size()); 57 if (visited[block->getBlockID()]) 59 visited[block->getBlockID()] = true;
|
/freebsd-10.1-release/contrib/gcc/ |
H A D | cfganal.c | 168 sbitmap visited; 179 /* Allocate bitmap to track nodes that have been visited. */ 180 visited = sbitmap_alloc (last_basic_block); 182 /* None of the nodes in the CFG have been visited yet. */ 183 sbitmap_zero (visited); 200 /* Check if the edge destination has been visited yet. */ 201 if (dest != EXIT_BLOCK_PTR && ! TEST_BIT (visited, dest->index)) 203 /* Mark that we have visited the destination. */ 204 SET_BIT (visited, dest->index); 209 /* Since the DEST node has been visited fo 166 sbitmap visited; local 657 sbitmap visited; local 738 sbitmap visited; local 946 static sbitmap visited; local [all...] |
H A D | tracer.c | 69 #define seen(bb) (bb->il.rtl->visited || bb->aux) 297 bb2->il.rtl->visited = 1; 338 && !e->dest->il.rtl->visited 345 best->dest->il.rtl->visited = 1; 350 if (!bb->il.rtl->visited) 353 bb->il.rtl->visited = 1;
|
H A D | df-core.c | 524 SET_BIT (dataflow->visited, bb->index); 561 if (!TEST_BIT (dataflow->visited, e->dest->index)) 576 SET_BIT (dataflow->visited, bb->index); 616 if (!TEST_BIT (dataflow->visited, e->src->index)) 637 sbitmap visited = sbitmap_alloc (last_basic_block); 642 dataflow->visited = visited; 646 sbitmap_zero (visited); 681 if (TEST_BIT (pending, idx) && !TEST_BIT (visited, idx)) 691 if (TEST_BIT (pending, idx) && !TEST_BIT (visited, id 636 sbitmap visited = sbitmap_alloc (last_basic_block); local [all...] |
H A D | tree-ssa-copy.c | 506 sbitmap visited; local 513 visited = sbitmap_alloc (num_ssa_names); 514 sbitmap_zero (visited); 515 SET_BIT (visited, SSA_NAME_VERSION (var)); 528 if (TEST_BIT (visited, SSA_NAME_VERSION (val))) 530 SET_BIT (visited, SSA_NAME_VERSION (val)); 541 sbitmap_free (visited);
|
H A D | tree-ssa.c | 101 /* Return true if SSA_NAME is malformed and mark it visited. 377 bitmap visited = BITMAP_ALLOC (NULL); local 392 bitmap_set_bit (visited, DECL_UID (alias)); 410 && !bitmap_bit_p (visited, DECL_UID (var))) 417 BITMAP_FREE (visited); 587 /* Lastly, clear out the visited flags. */ 1029 VISITED is a pointer set used to mark visited SSA_NAMEs to avoid 1031 SSA versions we had visited. But non-sparse bitmaps are way too 1037 visited first and then FN is called with each of the visited 1041 walk_use_def_chains_1(tree var, walk_use_def_chains_fn fn, void *data, struct pointer_set_t *visited, bool is_dfs) argument 1126 struct pointer_set_t *visited = pointer_set_create (); local [all...] |
H A D | tree-stdarg.c | 53 sbitmap visited; local 65 visited = sbitmap_alloc (last_basic_block); 66 sbitmap_zero (visited); 98 if (! TEST_BIT (visited, src->index)) 100 SET_BIT (visited, src->index); 107 sbitmap_free (visited);
|
H A D | predict.c | 903 expr_expected_value (tree expr, bitmap visited) 912 if (bitmap_bit_p (visited, SSA_NAME_VERSION (expr))) 914 bitmap_set_bit (visited, SSA_NAME_VERSION (expr)); 936 new_val = expr_expected_value (arg, visited); 948 return expr_expected_value (TREE_OPERAND (def, 1), visited); 973 op0 = expr_expected_value (TREE_OPERAND (expr, 0), visited); 976 op1 = expr_expected_value (TREE_OPERAND (expr, 1), visited); 987 op0 = expr_expected_value (TREE_OPERAND (expr, 0), visited); 1039 bitmap visited; 1052 visited 902 expr_expected_value(tree expr, bitmap visited) argument 1036 bitmap visited; local [all...] |
H A D | tree-if-conv.c | 1036 /* Return TRUE iff, all pred blocks of BB are visited. 1037 Bitmap VISITED keeps history of visited blocks. */ 1040 pred_blocks_visited_p (basic_block bb, bitmap *visited) argument 1045 if (!bitmap_bit_p (*visited, e->src->index)) 1062 bitmap visited; local 1070 visited = BITMAP_ALLOC (NULL); 1082 BITMAP_FREE (visited); 1086 if (!bitmap_bit_p (visited, bb->index)) 1088 if (pred_blocks_visited_p (bb, &visited) 1091 /* This block is now visited [all...] |
H A D | bb-reorder.c | 40 If the successor has not been visited in this trace it is added to the trace 42 If the successor has been visited in this trace the loop has been found. 302 /* The best edge is preferred when its destination is not visited yet 315 && e->dest->il.rtl->visited != trace_n 322 if (!e->dest->il.rtl->visited 338 if (!e->dest->il.rtl->visited 406 /* This function marks BB that it was visited in trace number TRACE. */ 411 bb->il.rtl->visited = trace; 492 fprintf (dump_file, "Basic block %d was visited in trace %d\n", 505 if (e->dest->il.rtl->visited [all...] |
/freebsd-10.1-release/contrib/llvm/lib/CodeGen/SelectionDAG/ |
H A D | SelectionDAGPrinter.cpp | 218 bool SelectionDAG::setSubgraphColorHelper(SDNode *N, const char *Color, DenseSet<SDNode *> &visited, argument 231 unsigned oldSize = visited.size(); 232 visited.insert(N); 233 if (visited.size() != oldSize) { 238 hit_limit = setSubgraphColorHelper(*i, Color, visited, level+1, printed) || hit_limit; 252 DenseSet<SDNode *> visited; local 254 if (setSubgraphColorHelper(N, Color, visited, 0, printed)) { 257 setSubgraphColorHelper(N, "blue", visited, 0, printed); 259 setSubgraphColorHelper(N, "green", visited, 0, printed);
|
/freebsd-10.1-release/contrib/llvm/tools/clang/lib/StaticAnalyzer/Checkers/ |
H A D | UnreachableCodeChecker.cpp | 10 // path-sensitive analysis. We mark any path visited, and then walk the CFG as a 11 // post-analysis to determine what was never visited. 47 CFGBlocksSet &visited); 56 CFGBlocksSet reachable, visited; local 111 if (!visited.count(CB->getBlockID())) 112 FindUnreachableEntryPoints(CB, reachable, visited); 176 CFGBlocksSet &visited) { 177 visited.insert(CB->getBlockID()); 185 if (!visited.count((*I)->getBlockID())) 186 // If we haven't previously visited th 174 FindUnreachableEntryPoints(const CFGBlock *CB, CFGBlocksSet &reachable, CFGBlocksSet &visited) argument [all...] |
/freebsd-10.1-release/contrib/llvm/lib/Analysis/ |
H A D | DominanceFrontier.cpp | 47 SmallPtrSet<BasicBlock *, 32> visited; local 63 if (visited.count(currentBB) == 0) { 64 visited.insert(currentBB); 83 if (visited.count(childBB) == 0) { 90 // If all children are visited or there is any child then pop this block
|
/freebsd-10.1-release/contrib/apr-util/test/ |
H A D | testdbm.c | 33 int visited; member in struct:__anon165 150 ABTS_INT_EQUAL(tc, 0, table[i].visited); 151 table[i].visited++; 161 ABTS_INT_EQUAL(tc, 1, table[i].visited); 162 table[i].visited = 0;
|
/freebsd-10.1-release/contrib/llvm/lib/CodeGen/ |
H A D | CalcSpillWeights.cpp | 103 SmallPtrSet<MachineInstr*, 8> visited; local 119 if (!visited.insert(mi))
|
/freebsd-10.1-release/contrib/llvm/lib/Target/NVPTX/ |
H A D | NVPTXUtilities.cpp | 464 void llvm::dumpInstRec(Value *v, std::set<Instruction *> *visited) { argument 467 if (visited->find(I) != visited->end()) 470 visited->insert(I); 473 dumpInstRec(I->getOperand(i), visited); 481 std::set<Instruction *> visited; local 485 dumpInstRec(v, &visited);
|
H A D | NVPTXUtilities.h | 86 void dumpInstRec(Value *v, std::set<Instruction *> *visited);
|
/freebsd-10.1-release/sys/amd64/amd64/ |
H A D | minidump_machdep.c | 110 int visited; member in struct:__anon6059 134 if (progress_track[i].visited) 136 progress_track[i].visited = 1; 235 progress_track[i].visited = 0;
|
/freebsd-10.1-release/crypto/heimdal/doc/doxyout/gssapi/html/ |
H A D | tabs.css | 45 DIV.tabs A:link, DIV.tabs A:visited,
|
/freebsd-10.1-release/crypto/heimdal/doc/doxyout/hcrypto/html/ |
H A D | tabs.css | 45 DIV.tabs A:link, DIV.tabs A:visited,
|
/freebsd-10.1-release/crypto/heimdal/doc/doxyout/hdb/html/ |
H A D | tabs.css | 45 DIV.tabs A:link, DIV.tabs A:visited,
|
/freebsd-10.1-release/crypto/heimdal/doc/doxyout/hx509/html/ |
H A D | tabs.css | 45 DIV.tabs A:link, DIV.tabs A:visited,
|
/freebsd-10.1-release/crypto/heimdal/doc/doxyout/krb5/html/ |
H A D | tabs.css | 45 DIV.tabs A:link, DIV.tabs A:visited,
|
/freebsd-10.1-release/crypto/heimdal/doc/doxyout/ntlm/html/ |
H A D | tabs.css | 45 DIV.tabs A:link, DIV.tabs A:visited,
|
/freebsd-10.1-release/crypto/heimdal/doc/doxyout/wind/html/ |
H A D | tabs.css | 45 DIV.tabs A:link, DIV.tabs A:visited,
|