HomeSort by relevance Sort by last modified time
    Searched refs:EDGE (Results 1 - 10 of 10) sorted by null

  /external/opencv/cvaux/include/
cvaux.h     [all...]
  /external/opencv/cvaux/src/
cvlcm.cpp 68 CvVoronoiEdge2D* edge; member in struct:CvLCMComplexNodeData
91 #define _CV_IS_EDGE_REFLEX( EDGE ) (( (EDGE)->site[0]->node[0] == (EDGE)->site[0]->node[0] ) || \
92 ( (EDGE)->site[1]->node[0] == (EDGE)->site[1]->node[0] ) )
94 #define _CV_INITIALIZE_CVLCMDATA(STRUCT,SITE,EDGE,NODE)\
95 { (STRUCT)->psite = SITE ; (STRUCT)->pedge = EDGE; (STRUCT)->pnode = NODE;}
117 // pLCMEdge: in, input edge of hybrid model
134 // pLCMEdge: in, input edge of hybrid mode
    [all...]
  /prebuilts/gcc/darwin-x86/arm/arm-eabi-4.6/lib/gcc/arm-eabi/4.6.x-google/plugin/include/
ipa-prop.h 336 node/edge. */
339 #define IPA_EDGE_REF(EDGE) (VEC_index (ipa_edge_args_t, \
340 ipa_edge_args_vector, (EDGE)->uid))
373 /* This function ensures the array of edge arguments infos is big enough to
389 /* Returns true if the array of edge infos is large enough to accommodate an
390 info for EDGE. The main purpose of this function is that debug dumping
394 ipa_edge_args_info_available_for_edge_p (struct cgraph_edge *edge)
396 return ((unsigned) edge->uid < VEC_length (ipa_edge_args_t,
432 /* Indirect edge and binfo processing. */
basic-block.h 35 /* Control flow edge information. */
37 /* The two blocks at the ends of the edge. */
41 /* Instructions queued on the edge. */
50 /* Location of any goto implicit in the edge and associated BLOCK. */
54 /* The index number corresponding to this edge in the edge vector
64 DEF_VEC_P(edge); variable
65 DEF_VEC_ALLOC_P(edge,gc);
66 DEF_VEC_ALLOC_P(edge,heap);
74 #define EDGE_FAKE 16 /* Not a real edge (profile.c) *
    [all...]
  /prebuilts/gcc/darwin-x86/arm/arm-linux-androideabi-4.6/lib/gcc/arm-linux-androideabi/4.6.x-google/plugin/include/
ipa-prop.h 336 node/edge. */
339 #define IPA_EDGE_REF(EDGE) (VEC_index (ipa_edge_args_t, \
340 ipa_edge_args_vector, (EDGE)->uid))
373 /* This function ensures the array of edge arguments infos is big enough to
389 /* Returns true if the array of edge infos is large enough to accommodate an
390 info for EDGE. The main purpose of this function is that debug dumping
394 ipa_edge_args_info_available_for_edge_p (struct cgraph_edge *edge)
396 return ((unsigned) edge->uid < VEC_length (ipa_edge_args_t,
432 /* Indirect edge and binfo processing. */
basic-block.h 35 /* Control flow edge information. */
37 /* The two blocks at the ends of the edge. */
41 /* Instructions queued on the edge. */
50 /* Location of any goto implicit in the edge and associated BLOCK. */
54 /* The index number corresponding to this edge in the edge vector
64 DEF_VEC_P(edge); variable
65 DEF_VEC_ALLOC_P(edge,gc);
66 DEF_VEC_ALLOC_P(edge,heap);
74 #define EDGE_FAKE 16 /* Not a real edge (profile.c) *
    [all...]
  /prebuilts/gcc/linux-x86/arm/arm-eabi-4.6/lib/gcc/arm-eabi/4.6.x-google/plugin/include/
ipa-prop.h 336 node/edge. */
339 #define IPA_EDGE_REF(EDGE) (VEC_index (ipa_edge_args_t, \
340 ipa_edge_args_vector, (EDGE)->uid))
373 /* This function ensures the array of edge arguments infos is big enough to
389 /* Returns true if the array of edge infos is large enough to accommodate an
390 info for EDGE. The main purpose of this function is that debug dumping
394 ipa_edge_args_info_available_for_edge_p (struct cgraph_edge *edge)
396 return ((unsigned) edge->uid < VEC_length (ipa_edge_args_t,
432 /* Indirect edge and binfo processing. */
basic-block.h 35 /* Control flow edge information. */
37 /* The two blocks at the ends of the edge. */
41 /* Instructions queued on the edge. */
50 /* Location of any goto implicit in the edge and associated BLOCK. */
54 /* The index number corresponding to this edge in the edge vector
64 DEF_VEC_P(edge); variable
65 DEF_VEC_ALLOC_P(edge,gc);
66 DEF_VEC_ALLOC_P(edge,heap);
74 #define EDGE_FAKE 16 /* Not a real edge (profile.c) *
    [all...]
  /prebuilts/gcc/linux-x86/arm/arm-linux-androideabi-4.6/lib/gcc/arm-linux-androideabi/4.6.x-google/plugin/include/
ipa-prop.h 336 node/edge. */
339 #define IPA_EDGE_REF(EDGE) (VEC_index (ipa_edge_args_t, \
340 ipa_edge_args_vector, (EDGE)->uid))
373 /* This function ensures the array of edge arguments infos is big enough to
389 /* Returns true if the array of edge infos is large enough to accommodate an
390 info for EDGE. The main purpose of this function is that debug dumping
394 ipa_edge_args_info_available_for_edge_p (struct cgraph_edge *edge)
396 return ((unsigned) edge->uid < VEC_length (ipa_edge_args_t,
432 /* Indirect edge and binfo processing. */
basic-block.h 35 /* Control flow edge information. */
37 /* The two blocks at the ends of the edge. */
41 /* Instructions queued on the edge. */
50 /* Location of any goto implicit in the edge and associated BLOCK. */
54 /* The index number corresponding to this edge in the edge vector
64 DEF_VEC_P(edge); variable
65 DEF_VEC_ALLOC_P(edge,gc);
66 DEF_VEC_ALLOC_P(edge,heap);
74 #define EDGE_FAKE 16 /* Not a real edge (profile.c) *
    [all...]

Completed in 1096 milliseconds