HomeSort by: relevance | last modified time | path
    Searched defs:joiner (Results 1 - 8 of 8) sorted by relevancy

  /src/external/gpl3/gcc/dist/gcc/
tree-ssa-threadupdate.cc 82 Another case this code handles is threading through a "joiner" block. In
83 this case, we do not know the destination of the joiner block, but one
84 of the outgoing edges from the joiner block leads to a threadable path. This
85 case largely works as outlined above, except the duplicate of the joiner
122 The other is a joiner block where we leave the control statement
245 fprintf (dump_file, "joiner");
349 /* When we have multiple paths through a joiner which reach different
671 a joiner, false otherwise.
673 In the non-joiner case, this is straightforward - all the counts
677 In the joiner case, it is very tricky. Some of the counts flowing int
2134 basic_block joiner = e->dest; local
    [all...]
tree-ssa-threadupdate.cc 82 Another case this code handles is threading through a "joiner" block. In
83 this case, we do not know the destination of the joiner block, but one
84 of the outgoing edges from the joiner block leads to a threadable path. This
85 case largely works as outlined above, except the duplicate of the joiner
122 The other is a joiner block where we leave the control statement
245 fprintf (dump_file, "joiner");
349 /* When we have multiple paths through a joiner which reach different
671 a joiner, false otherwise.
673 In the non-joiner case, this is straightforward - all the counts
677 In the joiner case, it is very tricky. Some of the counts flowing int
2134 basic_block joiner = e->dest; local
    [all...]
  /src/external/gpl3/gcc.old/dist/gcc/
tree-ssa-threadupdate.cc 82 Another case this code handles is threading through a "joiner" block. In
83 this case, we do not know the destination of the joiner block, but one
84 of the outgoing edges from the joiner block leads to a threadable path. This
85 case largely works as outlined above, except the duplicate of the joiner
122 The other is a joiner block where we leave the control statement
245 fprintf (dump_file, "joiner");
349 /* When we have multiple paths through a joiner which reach different
696 a joiner, false otherwise.
698 In the non-joiner case, this is straightforward - all the counts
702 In the joiner case, it is very tricky. Some of the counts flowing int
2141 basic_block joiner = e->dest; local
    [all...]
tree-ssa-threadupdate.cc 82 Another case this code handles is threading through a "joiner" block. In
83 this case, we do not know the destination of the joiner block, but one
84 of the outgoing edges from the joiner block leads to a threadable path. This
85 case largely works as outlined above, except the duplicate of the joiner
122 The other is a joiner block where we leave the control statement
245 fprintf (dump_file, "joiner");
349 /* When we have multiple paths through a joiner which reach different
696 a joiner, false otherwise.
698 In the non-joiner case, this is straightforward - all the counts
702 In the joiner case, it is very tricky. Some of the counts flowing int
2141 basic_block joiner = e->dest; local
    [all...]
  /src/external/gpl3/gcc/dist/gcc/cp/
decl2.cc 4052 char joiner = '_';
4053 #ifdef JOINER
4054 joiner = JOINER;
4056 type[len++] = joiner;
4047 char joiner = '_'; local
decl2.cc 4052 char joiner = '_';
4053 #ifdef JOINER
4054 joiner = JOINER;
4056 type[len++] = joiner;
4047 char joiner = '_'; local
  /src/external/gpl3/gcc.old/dist/gcc/cp/
decl2.cc 3871 char joiner = '_';
3872 #ifdef JOINER
3873 joiner = JOINER;
3875 type[len++] = joiner;
3866 char joiner = '_'; local
decl2.cc 3871 char joiner = '_';
3872 #ifdef JOINER
3873 joiner = JOINER;
3875 type[len++] = joiner;
3866 char joiner = '_'; local

Completed in 67 milliseconds