HomeSort by: relevance | last modified time | path
    Searched defs:callees (Results 1 - 25 of 30) sorted by relevancy

1 2

  /src/external/gpl3/gdb.old/dist/gdb/dwarf2/
loc.h 261 /* Initially CALLERS == CALLEES == LENGTH. For partially ambiguous result
262 CALLERS + CALLEES < LENGTH. */
263 int callers, callees, length; member in struct:call_site_chain
266 top (GDB "prev") sites and [LENGTH-CALLEES..LENGTH-1] contain bottom
loc.h 261 /* Initially CALLERS == CALLEES == LENGTH. For partially ambiguous result
262 CALLERS + CALLEES < LENGTH. */
263 int callers, callees, length; member in struct:call_site_chain
266 top (GDB "prev") sites and [LENGTH-CALLEES..LENGTH-1] contain bottom
loc.c 854 only top callers and bottom callees which are present in both. GDBARCH is
866 int callers, callees, idx; local
877 result->callers = result->callees = length;
912 /* Intersect callees. */
914 callees = std::min ((long) (*resultp)->callees, length);
915 for (idx = 0; idx < callees; idx++)
919 (*resultp)->callees = idx;
929 for (idx = 0; idx < (*resultp)->callees; idx++)
932 - (*resultp)->callees + idx])
    [all...]
loc.c 854 only top callers and bottom callees which are present in both. GDBARCH is
866 int callers, callees, idx; local
877 result->callers = result->callees = length;
912 /* Intersect callees. */
914 callees = std::min ((long) (*resultp)->callees, length);
915 for (idx = 0; idx < callees; idx++)
919 (*resultp)->callees = idx;
929 for (idx = 0; idx < (*resultp)->callees; idx++)
932 - (*resultp)->callees + idx])
    [all...]
  /src/external/gpl3/gdb/dist/gdb/dwarf2/
loc.h 243 /* Initially CALLERS == CALLEES == LENGTH. For partially ambiguous result
244 CALLERS + CALLEES < LENGTH. */
245 int callers, callees, length; member in struct:call_site_chain
248 top (GDB "prev") sites and [LENGTH-CALLEES..LENGTH-1] contain bottom
loc.h 243 /* Initially CALLERS == CALLEES == LENGTH. For partially ambiguous result
244 CALLERS + CALLEES < LENGTH. */
245 int callers, callees, length; member in struct:call_site_chain
248 top (GDB "prev") sites and [LENGTH-CALLEES..LENGTH-1] contain bottom
loc.c 854 only top callers and bottom callees which are present in both. GDBARCH is
866 int callers, callees, idx; local
877 result->callers = result->callees = length;
912 /* Intersect callees. */
914 callees = std::min ((long) (*resultp)->callees, length);
915 for (idx = 0; idx < callees; idx++)
919 (*resultp)->callees = idx;
929 for (idx = 0; idx < (*resultp)->callees; idx++)
932 - (*resultp)->callees + idx])
    [all...]
  /src/external/apache2/llvm/dist/clang/include/clang/Analysis/
CallGraph.h 95 /// are represented as callees of the node.
176 /// Iterators through all the callees/children of the node.
182 /// Iterator access to callees/children of the node.
183 llvm::iterator_range<iterator> callees() { function in class:clang::CallGraphNode
186 llvm::iterator_range<const_iterator> callees() const { function in class:clang::CallGraphNode
CallGraph.h 95 /// are represented as callees of the node.
176 /// Iterators through all the callees/children of the node.
182 /// Iterator access to callees/children of the node.
183 llvm::iterator_range<iterator> callees() { function in class:clang::CallGraphNode
186 llvm::iterator_range<const_iterator> callees() const { function in class:clang::CallGraphNode
  /src/external/gpl3/gcc.old/dist/gcc/
function.h 231 vec<callinfo_callee, va_gc> *callees;
230 vec<callinfo_callee, va_gc> *callees; variable
function.h 231 vec<callinfo_callee, va_gc> *callees;
230 vec<callinfo_callee, va_gc> *callees; variable
ipa-pure-const.cc 1421 for (e = node->callees; e; e = e->next_callee)
1617 of possible interposition when walking callees. */
1633 for (e = w->callees; e && pure_const_state != IPA_NEITHER;
1775 for (e = w->callees; e && !can_free; e = e->next_callee)
1897 for (e = w->callees; e && !can_throw; e = e->next_callee)
2033 auto_vec<cgraph_node *, 16> callees;
2034 for (cgraph_edge *cs = node->callees; cs; cs = cs->next_callee)
2038 callees.safe_push (cs->callee);
2042 for (unsigned j = 0; j < callees.length (); j++)
2044 cgraph_node *callee = callees[j]
2032 auto_vec<cgraph_node *, 16> callees; local
    [all...]
ipa-pure-const.cc 1421 for (e = node->callees; e; e = e->next_callee)
1617 of possible interposition when walking callees. */
1633 for (e = w->callees; e && pure_const_state != IPA_NEITHER;
1775 for (e = w->callees; e && !can_free; e = e->next_callee)
1897 for (e = w->callees; e && !can_throw; e = e->next_callee)
2033 auto_vec<cgraph_node *, 16> callees;
2034 for (cgraph_edge *cs = node->callees; cs; cs = cs->next_callee)
2038 callees.safe_push (cs->callee);
2042 for (unsigned j = 0; j < callees.length (); j++)
2044 cgraph_node *callee = callees[j]
2032 auto_vec<cgraph_node *, 16> callees; local
    [all...]
  /src/external/gpl3/binutils/dist/gprofng/src/
DbeView.h 33 * a second for callers/callees, and a third for dataspace/memoryspace.
607 Hist_data *fitem_data; // func item for callers/callees
609 Hist_data *callees; // callees data member in class:DbeView
DbeView.h 33 * a second for callers/callees, and a third for dataspace/memoryspace.
607 Hist_data *fitem_data; // func item for callers/callees
609 Hist_data *callees; // callees data member in class:DbeView
Print.cc 263 * Return offset of "Name" column (this is needed to print Callers-Callees)
698 Hist_data *callees; local
708 callees = dbev->get_hist_data (mlist, Histable::FUNCTION, 0,
709 Hist_data::CALLEES, obj);
713 callees->update_max (hist_metric);
726 callees->print_content (out_file, hist_metric, callees->size ());
729 delete callees;
940 { // csingle Callers-Callees entry
1017 Hist_data *callees = dbev->get_hist_data (mlist, Histable::FUNCTION, 0 local
1091 Hist_data *callees = dbev->get_hist_data (mlist, Histable::FUNCTION, 0, local
1154 Hist_data *callees = dbev->get_hist_data (mlist, Histable::FUNCTION, 0, local
    [all...]
Print.cc 263 * Return offset of "Name" column (this is needed to print Callers-Callees)
698 Hist_data *callees; local
708 callees = dbev->get_hist_data (mlist, Histable::FUNCTION, 0,
709 Hist_data::CALLEES, obj);
713 callees->update_max (hist_metric);
726 callees->print_content (out_file, hist_metric, callees->size ());
729 delete callees;
940 { // csingle Callers-Callees entry
1017 Hist_data *callees = dbev->get_hist_data (mlist, Histable::FUNCTION, 0 local
1091 Hist_data *callees = dbev->get_hist_data (mlist, Histable::FUNCTION, 0, local
1154 Hist_data *callees = dbev->get_hist_data (mlist, Histable::FUNCTION, 0, local
    [all...]
  /src/external/gpl3/binutils.old/dist/gprofng/src/
DbeView.h 33 * a second for callers/callees, and a third for dataspace/memoryspace.
607 Hist_data *fitem_data; // func item for callers/callees
609 Hist_data *callees; // callees data member in class:DbeView
DbeView.h 33 * a second for callers/callees, and a third for dataspace/memoryspace.
607 Hist_data *fitem_data; // func item for callers/callees
609 Hist_data *callees; // callees data member in class:DbeView
Print.cc 263 * Return offset of "Name" column (this is needed to print Callers-Callees)
698 Hist_data *callees; local
708 callees = dbev->get_hist_data (mlist, Histable::FUNCTION, 0,
709 Hist_data::CALLEES, obj);
713 callees->update_max (hist_metric);
726 callees->print_content (out_file, hist_metric, callees->size ());
729 delete callees;
940 { // csingle Callers-Callees entry
1017 Hist_data *callees = dbev->get_hist_data (mlist, Histable::FUNCTION, 0 local
1091 Hist_data *callees = dbev->get_hist_data (mlist, Histable::FUNCTION, 0, local
1154 Hist_data *callees = dbev->get_hist_data (mlist, Histable::FUNCTION, 0, local
    [all...]
Print.cc 263 * Return offset of "Name" column (this is needed to print Callers-Callees)
698 Hist_data *callees; local
708 callees = dbev->get_hist_data (mlist, Histable::FUNCTION, 0,
709 Hist_data::CALLEES, obj);
713 callees->update_max (hist_metric);
726 callees->print_content (out_file, hist_metric, callees->size ());
729 delete callees;
940 { // csingle Callers-Callees entry
1017 Hist_data *callees = dbev->get_hist_data (mlist, Histable::FUNCTION, 0 local
1091 Hist_data *callees = dbev->get_hist_data (mlist, Histable::FUNCTION, 0, local
1154 Hist_data *callees = dbev->get_hist_data (mlist, Histable::FUNCTION, 0, local
    [all...]
  /src/external/gpl3/gcc/dist/gcc/
function.h 231 vec<callinfo_callee, va_gc> *callees;
230 vec<callinfo_callee, va_gc> *callees; variable
ipa-pure-const.cc 1432 for (e = node->callees; e; e = e->next_callee)
1628 of possible interposition when walking callees. */
1644 for (e = w->callees; e && pure_const_state != IPA_NEITHER;
1786 for (e = w->callees; e && !can_free; e = e->next_callee)
1908 for (e = w->callees; e && !can_throw; e = e->next_callee)
2044 auto_vec<cgraph_node *, 16> callees;
2045 for (cgraph_edge *cs = node->callees; cs; cs = cs->next_callee)
2049 callees.safe_push (cs->callee);
2053 for (unsigned j = 0; j < callees.length (); j++)
2055 cgraph_node *callee = callees[j]
2043 auto_vec<cgraph_node *, 16> callees; local
    [all...]
function.h 231 vec<callinfo_callee, va_gc> *callees;
230 vec<callinfo_callee, va_gc> *callees; variable
ipa-pure-const.cc 1432 for (e = node->callees; e; e = e->next_callee)
1628 of possible interposition when walking callees. */
1644 for (e = w->callees; e && pure_const_state != IPA_NEITHER;
1786 for (e = w->callees; e && !can_free; e = e->next_callee)
1908 for (e = w->callees; e && !can_throw; e = e->next_callee)
2044 auto_vec<cgraph_node *, 16> callees;
2045 for (cgraph_edge *cs = node->callees; cs; cs = cs->next_callee)
2049 callees.safe_push (cs->callee);
2053 for (unsigned j = 0; j < callees.length (); j++)
2055 cgraph_node *callee = callees[j]
2043 auto_vec<cgraph_node *, 16> callees; local
    [all...]

Completed in 67 milliseconds

1 2