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

  /src/external/gpl3/gdb/dist/gdb/
c-varobj.c 584 int kids[3];
586 cplus_class_num_children (type, kids);
587 if (kids[v_public] != 0)
589 if (kids[v_private] != 0)
591 if (kids[v_protected] != 0)
603 int kids[3];
617 cplus_class_num_children (type, kids);
619 children = kids[v_public];
621 children = kids[v_private];
623 children = kids[v_protected]
583 int kids[3]; local
602 int kids[3]; local
    [all...]
  /src/external/gpl3/gdb.old/dist/gdb/
c-varobj.c 584 int kids[3];
586 cplus_class_num_children (type, kids);
587 if (kids[v_public] != 0)
589 if (kids[v_private] != 0)
591 if (kids[v_protected] != 0)
603 int kids[3];
617 cplus_class_num_children (type, kids);
619 children = kids[v_public];
621 children = kids[v_private];
623 children = kids[v_protected]
583 int kids[3]; local
602 int kids[3]; local
    [all...]
  /src/external/gpl3/gcc/dist/gcc/
genmatch.cc 1769 vec<dt_node *> kids; member in class:dt_node
1777 : type (type_), level (0), parent (parent_), kids (vNULL) {}
2003 kid = decision_tree::find_node (kids, n);
2007 kids.safe_push (n);
2052 for (unsigned i = 0; i < kids.length (); ++i)
2053 if ((s2 = dyn_cast <dt_simplify *> (kids[i]))
2096 for (unsigned i = 0; i < kids.length (); ++i)
2098 kids[i]->analyze (map);
2099 num_leafs += kids[i]->num_leafs;
2100 total_size += kids[i]->total_size
    [all...]
  /src/external/gpl3/gcc.old/dist/gcc/
genmatch.cc 1614 vec<dt_node *> kids; member in class:dt_node
1622 : type (type_), level (0), parent (parent_), kids (vNULL) {}
1842 kid = decision_tree::find_node (kids, n);
1846 kids.safe_push (n);
1891 for (unsigned i = 0; i < kids.length (); ++i)
1892 if ((s2 = dyn_cast <dt_simplify *> (kids[i]))
1935 for (unsigned i = 0; i < kids.length (); ++i)
1937 kids[i]->analyze (map);
1938 num_leafs += kids[i]->num_leafs;
1939 total_size += kids[i]->total_size
    [all...]

Completed in 29 milliseconds