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

  /src/external/gpl3/gdb/dist/gdb/testsuite/gdb.python/
py-recurse-unwind.c 26 bbb (int arg) function
34 bbb (456);
py-recurse-unwind.c 26 bbb (int arg) function
34 bbb (456);
  /src/external/gpl3/gdb.old/dist/gdb/testsuite/gdb.python/
py-recurse-unwind.c 26 bbb (int arg) function
34 bbb (456);
py-recurse-unwind.c 26 bbb (int arg) function
34 bbb (456);
  /src/external/gpl3/gdb/dist/gdb/testsuite/gdb.dwarf2/
dw2-inline-many-frames.c 19 main -> aaa -> bbb -> ccc -> ddd -> eee -> fff -> ggg -> hhh -> iii -> jjj -> kkk
42 INLINE_FUNCTION int bbb ();
60 return bbb () + 1; /* aaa return */
105 bbb () function
106 { /* bbb prologue */
108 return ccc () + 1; /* bbb return */
109 } /* bbb end */
dw2-inline-many-frames.c 19 main -> aaa -> bbb -> ccc -> ddd -> eee -> fff -> ggg -> hhh -> iii -> jjj -> kkk
42 INLINE_FUNCTION int bbb ();
60 return bbb () + 1; /* aaa return */
105 bbb () function
106 { /* bbb prologue */
108 return ccc () + 1; /* bbb return */
109 } /* bbb end */
  /src/external/gpl3/gdb.old/dist/gdb/testsuite/gdb.dwarf2/
dw2-inline-many-frames.c 19 main -> aaa -> bbb -> ccc -> ddd -> eee -> fff -> ggg -> hhh -> iii -> jjj -> kkk
42 INLINE_FUNCTION int bbb ();
60 return bbb () + 1; /* aaa return */
105 bbb () function
106 { /* bbb prologue */
108 return ccc () + 1; /* bbb return */
109 } /* bbb end */
dw2-inline-many-frames.c 19 main -> aaa -> bbb -> ccc -> ddd -> eee -> fff -> ggg -> hhh -> iii -> jjj -> kkk
42 INLINE_FUNCTION int bbb ();
60 return bbb () + 1; /* aaa return */
105 bbb () function
106 { /* bbb prologue */
108 return ccc () + 1; /* bbb return */
109 } /* bbb end */
  /src/common/lib/libc/arch/powerpc/string/
memcmp.S 197 bbb: label
209 bdnzt eq, bbb
memcmp.S 197 bbb: label
209 bdnzt eq, bbb
  /src/external/bsd/pcc/dist/pcc/mip/
optim2.c 948 struct basicblock *bbb; local
951 DLIST_FOREACH(bbb, &p2e->bblocks, bbelem) {
952 printf("Basic block %d, parents: ", bbb->dfnum);
953 SLIST_FOREACH(ccnode, &bbb->parents, cfgelem) {
957 SLIST_FOREACH(cn, &bbb->child, chld)
1680 struct basicblock *bbb; local
1694 bbb=DLIST_NEXT(&p2e->bblocks, bbelem);
1695 ip=bbb->first;
1712 DLIST_FOREACH(bbb, &p2e->bblocks, bbelem) {
1713 ip=bbb->first
    [all...]
optim2.c 948 struct basicblock *bbb; local
951 DLIST_FOREACH(bbb, &p2e->bblocks, bbelem) {
952 printf("Basic block %d, parents: ", bbb->dfnum);
953 SLIST_FOREACH(ccnode, &bbb->parents, cfgelem) {
957 SLIST_FOREACH(cn, &bbb->child, chld)
1680 struct basicblock *bbb; local
1694 bbb=DLIST_NEXT(&p2e->bblocks, bbelem);
1695 ip=bbb->first;
1712 DLIST_FOREACH(bbb, &p2e->bblocks, bbelem) {
1713 ip=bbb->first
    [all...]
  /src/external/gpl3/gcc.old/dist/gcc/
tree-ssa-reassoc.cc 584 basic_block bbb = gimple_bb (stmtb); local
585 if (bbb != bba)
591 if (!bbb)
594 if (bb_rank[bbb->index] != bb_rank[bba->index])
595 return (bb_rank[bbb->index] >> 16) - (bb_rank[bba->index] >> 16);
tree-ssa-reassoc.cc 584 basic_block bbb = gimple_bb (stmtb); local
585 if (bbb != bba)
591 if (!bbb)
594 if (bb_rank[bbb->index] != bb_rank[bba->index])
595 return (bb_rank[bbb->index] >> 16) - (bb_rank[bba->index] >> 16);
  /src/external/gpl3/gcc/dist/gcc/
tree-ssa-reassoc.cc 585 basic_block bbb = gimple_bb (stmtb); local
586 if (bbb != bba)
592 if (!bbb)
595 if (bb_rank[bbb->index] != bb_rank[bba->index])
596 return (bb_rank[bbb->index] >> 16) - (bb_rank[bba->index] >> 16);
tree-ssa-reassoc.cc 585 basic_block bbb = gimple_bb (stmtb); local
586 if (bbb != bba)
592 if (!bbb)
595 if (bb_rank[bbb->index] != bb_rank[bba->index])
596 return (bb_rank[bbb->index] >> 16) - (bb_rank[bba->index] >> 16);

Completed in 74 milliseconds