Home
last modified time | relevance | path

Searched refs:elem2 (Results 1 – 9 of 9) sorted by relevance

/netbsd-src/external/gpl3/binutils.old/dist/libiberty/
H A Dpartition.c75 partition_union (partition part, int elem1, int elem2) in partition_union() argument
86 if (class_element == elements[elem2].class_element) in partition_union()
91 if (elements[elem1].class_count < elements[elem2].class_count) in partition_union()
94 elem1 = elem2; in partition_union()
95 elem2 = temp; in partition_union()
100 e2 = &(elements[elem2]); in partition_union()
124 elem_compare (const void *elem1, const void *elem2) in elem_compare() argument
127 int e2 = * (const int *) elem2; in elem_compare()
/netbsd-src/external/gpl3/binutils/dist/libiberty/
H A Dpartition.c75 partition_union (partition part, int elem1, int elem2) in partition_union() argument
86 if (class_element == elements[elem2].class_element) in partition_union()
91 if (elements[elem1].class_count < elements[elem2].class_count) in partition_union()
94 elem1 = elem2; in partition_union()
95 elem2 = temp; in partition_union()
100 e2 = &(elements[elem2]); in partition_union()
124 elem_compare (const void *elem1, const void *elem2) in elem_compare() argument
127 int e2 = * (const int *) elem2; in elem_compare()
/netbsd-src/external/gpl3/gcc.old/dist/libiberty/
H A Dpartition.c75 partition_union (partition part, int elem1, int elem2) in partition_union() argument
86 if (class_element == elements[elem2].class_element) in partition_union()
91 if (elements[elem1].class_count < elements[elem2].class_count) in partition_union()
94 elem1 = elem2; in partition_union()
95 elem2 = temp; in partition_union()
100 e2 = &(elements[elem2]); in partition_union()
124 elem_compare (const void *elem1, const void *elem2) in elem_compare() argument
127 int e2 = * (const int *) elem2; in elem_compare()
/netbsd-src/external/gpl3/gcc/dist/libiberty/
H A Dpartition.c75 partition_union (partition part, int elem1, int elem2) in partition_union() argument
86 if (class_element == elements[elem2].class_element) in partition_union()
91 if (elements[elem1].class_count < elements[elem2].class_count) in partition_union()
94 elem1 = elem2; in partition_union()
95 elem2 = temp; in partition_union()
100 e2 = &(elements[elem2]); in partition_union()
124 elem_compare (const void *elem1, const void *elem2) in elem_compare() argument
127 int e2 = * (const int *) elem2; in elem_compare()
/netbsd-src/external/gpl2/xcvs/dist/src/
H A Dhash.c438 qsort_comp (const void *elem1, const void *elem2) in qsort_comp() argument
441 Node **node2 = (Node **) elem2; in qsort_comp()
/netbsd-src/external/gpl2/xcvs/dist/lib/
H A Dregex_internal.c903 re_node_set_init_2 (re_node_set *set, Idx elem1, Idx elem2) in re_node_set_init_2() argument
909 if (elem1 == elem2) in re_node_set_init_2()
917 if (elem1 < elem2) in re_node_set_init_2()
920 set->elems[1] = elem2; in re_node_set_init_2()
924 set->elems[0] = elem2; in re_node_set_init_2()
/netbsd-src/external/gpl3/gcc.old/dist/libphobos/src/std/range/
H A Dpackage.d11639 ElementType!Range elem2; in testRange()
11647 elem2 = r.front; in testRange()
11648 assert(elem1 == elem2); in testRange()
/netbsd-src/external/gpl3/gcc.old/dist/gcc/
H A Dfold-const.c1561 tree elem2 = VECTOR_CST_ELT (arg2, i); in const_binop() local
1563 tree elt = const_binop (code, elem1, elem2); in const_binop()
/netbsd-src/external/gpl3/gcc/dist/gcc/
H A Dfold-const.cc1566 tree elem2 = VECTOR_CST_ELT (arg2, i); in const_binop() local
1568 tree elt = const_binop (code, elem1, elem2); in const_binop()