Home
last modified time | relevance | path

Searched refs:class_count (Results 1 – 25 of 487) sorted by relevance

12345678910>>...20

/dports/graphics/libosmesa-gallium/mesa-21.3.6/src/panfrost/util/
H A Dlcra.c44 unsigned node_count, unsigned class_count) in lcra_alloc_equations() argument
49 l->class_count = class_count; in lcra_alloc_equations()
55 l->class_start = calloc(sizeof(l->class_start[0]), class_count); in lcra_alloc_equations()
56 l->class_disjoint = calloc(sizeof(l->class_disjoint[0]), class_count * class_count); in lcra_alloc_equations()
57 l->class_size = calloc(sizeof(l->class_size[0]), class_count); in lcra_alloc_equations()
94 l->class_disjoint[(c1 * l->class_count) + c2] = true; in lcra_set_disjoint_class()
95 l->class_disjoint[(c2 * l->class_count) + c1] = true; in lcra_set_disjoint_class()
115 if (l->class_disjoint[(l->class[i] * l->class_count) + l->class[j]]) in lcra_add_node_interference()
/dports/lang/clover/mesa-21.3.6/src/panfrost/util/
H A Dlcra.c44 unsigned node_count, unsigned class_count) in lcra_alloc_equations() argument
49 l->class_count = class_count; in lcra_alloc_equations()
55 l->class_start = calloc(sizeof(l->class_start[0]), class_count); in lcra_alloc_equations()
56 l->class_disjoint = calloc(sizeof(l->class_disjoint[0]), class_count * class_count); in lcra_alloc_equations()
57 l->class_size = calloc(sizeof(l->class_size[0]), class_count); in lcra_alloc_equations()
94 l->class_disjoint[(c1 * l->class_count) + c2] = true; in lcra_set_disjoint_class()
95 l->class_disjoint[(c2 * l->class_count) + c1] = true; in lcra_set_disjoint_class()
115 if (l->class_disjoint[(l->class[i] * l->class_count) + l->class[j]]) in lcra_add_node_interference()
/dports/graphics/libosmesa/mesa-21.3.6/src/panfrost/util/
H A Dlcra.c44 unsigned node_count, unsigned class_count) in lcra_alloc_equations() argument
49 l->class_count = class_count; in lcra_alloc_equations()
55 l->class_start = calloc(sizeof(l->class_start[0]), class_count); in lcra_alloc_equations()
56 l->class_disjoint = calloc(sizeof(l->class_disjoint[0]), class_count * class_count); in lcra_alloc_equations()
57 l->class_size = calloc(sizeof(l->class_size[0]), class_count); in lcra_alloc_equations()
94 l->class_disjoint[(c1 * l->class_count) + c2] = true; in lcra_set_disjoint_class()
95 l->class_disjoint[(c2 * l->class_count) + c1] = true; in lcra_set_disjoint_class()
115 if (l->class_disjoint[(l->class[i] * l->class_count) + l->class[j]]) in lcra_add_node_interference()
/dports/graphics/mesa-gallium-vdpau/mesa-21.3.6/src/panfrost/util/
H A Dlcra.c44 unsigned node_count, unsigned class_count) in lcra_alloc_equations() argument
49 l->class_count = class_count; in lcra_alloc_equations()
55 l->class_start = calloc(sizeof(l->class_start[0]), class_count); in lcra_alloc_equations()
56 l->class_disjoint = calloc(sizeof(l->class_disjoint[0]), class_count * class_count); in lcra_alloc_equations()
57 l->class_size = calloc(sizeof(l->class_size[0]), class_count); in lcra_alloc_equations()
94 l->class_disjoint[(c1 * l->class_count) + c2] = true; in lcra_set_disjoint_class()
95 l->class_disjoint[(c2 * l->class_count) + c1] = true; in lcra_set_disjoint_class()
115 if (l->class_disjoint[(l->class[i] * l->class_count) + l->class[j]]) in lcra_add_node_interference()
/dports/graphics/mesa-libs/mesa-21.3.6/src/panfrost/util/
H A Dlcra.c44 unsigned node_count, unsigned class_count) in lcra_alloc_equations() argument
49 l->class_count = class_count; in lcra_alloc_equations()
55 l->class_start = calloc(sizeof(l->class_start[0]), class_count); in lcra_alloc_equations()
56 l->class_disjoint = calloc(sizeof(l->class_disjoint[0]), class_count * class_count); in lcra_alloc_equations()
57 l->class_size = calloc(sizeof(l->class_size[0]), class_count); in lcra_alloc_equations()
94 l->class_disjoint[(c1 * l->class_count) + c2] = true; in lcra_set_disjoint_class()
95 l->class_disjoint[(c2 * l->class_count) + c1] = true; in lcra_set_disjoint_class()
115 if (l->class_disjoint[(l->class[i] * l->class_count) + l->class[j]]) in lcra_add_node_interference()
/dports/graphics/mesa-dri-classic/mesa-20.2.3/src/panfrost/util/
H A Dlcra.c44 unsigned node_count, unsigned class_count) in lcra_alloc_equations() argument
49 l->class_count = class_count; in lcra_alloc_equations()
55 l->class_start = calloc(sizeof(l->class_start[0]), class_count); in lcra_alloc_equations()
56 l->class_disjoint = calloc(sizeof(l->class_disjoint[0]), class_count * class_count); in lcra_alloc_equations()
57 l->class_size = calloc(sizeof(l->class_size[0]), class_count); in lcra_alloc_equations()
94 l->class_disjoint[(c1 * l->class_count) + c2] = true; in lcra_set_disjoint_class()
95 l->class_disjoint[(c2 * l->class_count) + c1] = true; in lcra_set_disjoint_class()
115 if (l->class_disjoint[(l->class[i] * l->class_count) + l->class[j]]) in lcra_add_node_interference()
/dports/graphics/mesa-dri-gallium/mesa-21.3.6/src/panfrost/util/
H A Dlcra.c44 unsigned node_count, unsigned class_count) in lcra_alloc_equations() argument
49 l->class_count = class_count; in lcra_alloc_equations()
55 l->class_start = calloc(sizeof(l->class_start[0]), class_count); in lcra_alloc_equations()
56 l->class_disjoint = calloc(sizeof(l->class_disjoint[0]), class_count * class_count); in lcra_alloc_equations()
57 l->class_size = calloc(sizeof(l->class_size[0]), class_count); in lcra_alloc_equations()
94 l->class_disjoint[(c1 * l->class_count) + c2] = true; in lcra_set_disjoint_class()
95 l->class_disjoint[(c2 * l->class_count) + c1] = true; in lcra_set_disjoint_class()
115 if (l->class_disjoint[(l->class[i] * l->class_count) + l->class[j]]) in lcra_add_node_interference()
/dports/graphics/mesa-gallium-va/mesa-21.3.6/src/panfrost/util/
H A Dlcra.c44 unsigned node_count, unsigned class_count) in lcra_alloc_equations() argument
49 l->class_count = class_count; in lcra_alloc_equations()
55 l->class_start = calloc(sizeof(l->class_start[0]), class_count); in lcra_alloc_equations()
56 l->class_disjoint = calloc(sizeof(l->class_disjoint[0]), class_count * class_count); in lcra_alloc_equations()
57 l->class_size = calloc(sizeof(l->class_size[0]), class_count); in lcra_alloc_equations()
94 l->class_disjoint[(c1 * l->class_count) + c2] = true; in lcra_set_disjoint_class()
95 l->class_disjoint[(c2 * l->class_count) + c1] = true; in lcra_set_disjoint_class()
115 if (l->class_disjoint[(l->class[i] * l->class_count) + l->class[j]]) in lcra_add_node_interference()
/dports/graphics/mesa-gallium-xa/mesa-21.3.6/src/panfrost/util/
H A Dlcra.c44 unsigned node_count, unsigned class_count) in lcra_alloc_equations() argument
49 l->class_count = class_count; in lcra_alloc_equations()
55 l->class_start = calloc(sizeof(l->class_start[0]), class_count); in lcra_alloc_equations()
56 l->class_disjoint = calloc(sizeof(l->class_disjoint[0]), class_count * class_count); in lcra_alloc_equations()
57 l->class_size = calloc(sizeof(l->class_size[0]), class_count); in lcra_alloc_equations()
94 l->class_disjoint[(c1 * l->class_count) + c2] = true; in lcra_set_disjoint_class()
95 l->class_disjoint[(c2 * l->class_count) + c1] = true; in lcra_set_disjoint_class()
115 if (l->class_disjoint[(l->class[i] * l->class_count) + l->class[j]]) in lcra_add_node_interference()
/dports/graphics/mesa-devel/mesa-22.0-branchpoint-2059-ge8a63cf61ec/src/panfrost/util/
H A Dlcra.c44 unsigned node_count, unsigned class_count) in lcra_alloc_equations() argument
49 l->class_count = class_count; in lcra_alloc_equations()
55 l->class_start = calloc(sizeof(l->class_start[0]), class_count); in lcra_alloc_equations()
56 l->class_disjoint = calloc(sizeof(l->class_disjoint[0]), class_count * class_count); in lcra_alloc_equations()
57 l->class_size = calloc(sizeof(l->class_size[0]), class_count); in lcra_alloc_equations()
94 l->class_disjoint[(c1 * l->class_count) + c2] = true; in lcra_set_disjoint_class()
95 l->class_disjoint[(c2 * l->class_count) + c1] = true; in lcra_set_disjoint_class()
115 if (l->class_disjoint[(l->class[i] * l->class_count) + l->class[j]]) in lcra_add_node_interference()
/dports/graphics/mesa-dri/mesa-21.3.6/src/panfrost/util/
H A Dlcra.c44 unsigned node_count, unsigned class_count) in lcra_alloc_equations() argument
49 l->class_count = class_count; in lcra_alloc_equations()
55 l->class_start = calloc(sizeof(l->class_start[0]), class_count); in lcra_alloc_equations()
56 l->class_disjoint = calloc(sizeof(l->class_disjoint[0]), class_count * class_count); in lcra_alloc_equations()
57 l->class_size = calloc(sizeof(l->class_size[0]), class_count); in lcra_alloc_equations()
94 l->class_disjoint[(c1 * l->class_count) + c2] = true; in lcra_set_disjoint_class()
95 l->class_disjoint[(c2 * l->class_count) + c1] = true; in lcra_set_disjoint_class()
115 if (l->class_disjoint[(l->class[i] * l->class_count) + l->class[j]]) in lcra_add_node_interference()
/dports/graphics/opencv/opencv-4.5.3/modules/ml/src/
H A Dgbt.cpp51 class_count = 1;
134 class_count = 1;
226 class_count = 0;
233 class_count++;
318 weak = new pCvSeq[class_count];
742 gamma = ((double)(class_count-1)) / (double)class_count * (tmp1/tmp2);
852 if (class_count == 1)
859 if ((k>=0) && (k<class_count))
975 if (class_count == 1)
1164 weak = new pCvSeq[class_count];
[all …]
/dports/devel/tijmp/tijmp-0.7/src/
H A Dwalk_heap.c23 jlong* class_count; member
36 whp->class_count[class_tag]++; in heap_iteration_callback()
104 whp->class_count, 0); in report_walk_heap_data()
116 jint class_count, jclass** classes) { in setup_whp() argument
133 whp->class_count[i] = 0; in setup_whp()
137 for (i = 0; i < class_count; i++) { in setup_whp()
151 err = (*jvmti)->GetLoadedClasses (jvmti, class_count, classes); in tag_classes()
157 for (i = 0; i < *class_count; i++) { in tag_classes()
176 jint class_count; in tag_classes_and_setup_whp() local
179 tag_classes (env, &class_count, classes); in tag_classes_and_setup_whp()
[all …]
/dports/lang/gcc6-aux/gcc-6-20180516/libiberty/
H A Dpartition.c55 part->elements[e].class_count = 1; in partition_new()
91 if (elements[elem1].class_count < elements[elem2].class_count) in partition_union()
103 elements[class_element].class_count in partition_union()
104 += elements[e2->class_element].class_count; in partition_union()
161 int count = elements[elements[e].class_element].class_count; in partition_print()
/dports/lang/gcc12-devel/gcc-12-20211205/libiberty/
H A Dpartition.c55 part->elements[e].class_count = 1; in partition_new()
91 if (elements[elem1].class_count < elements[elem2].class_count) in partition_union()
103 elements[class_element].class_count in partition_union()
104 += elements[e2->class_element].class_count; in partition_union()
161 int count = elements[elements[e].class_element].class_count; in partition_print()
/dports/lang/gcc8/gcc-8.5.0/libiberty/
H A Dpartition.c55 part->elements[e].class_count = 1; in partition_new()
91 if (elements[elem1].class_count < elements[elem2].class_count) in partition_union()
103 elements[class_element].class_count in partition_union()
104 += elements[e2->class_element].class_count; in partition_union()
161 int count = elements[elements[e].class_element].class_count; in partition_print()
/dports/lang/gcc48/gcc-4.8.5/libiberty/
H A Dpartition.c55 part->elements[e].class_count = 1; in partition_new()
91 if (elements[elem1].class_count < elements[elem2].class_count) in partition_union()
103 elements[class_element].class_count in partition_union()
104 += elements[e2->class_element].class_count; in partition_union()
161 int count = elements[elements[e].class_element].class_count; in partition_print()
/dports/lang/gnatdroid-binutils-x86/binutils-2.27/libiberty/
H A Dpartition.c55 part->elements[e].class_count = 1; in partition_new()
91 if (elements[elem1].class_count < elements[elem2].class_count) in partition_union()
103 elements[class_element].class_count in partition_union()
104 += elements[e2->class_element].class_count; in partition_union()
161 int count = elements[elements[e].class_element].class_count; in partition_print()
/dports/devel/riscv64-none-elf-gcc/gcc-8.4.0/libiberty/
H A Dpartition.c55 part->elements[e].class_count = 1; in partition_new()
91 if (elements[elem1].class_count < elements[elem2].class_count) in partition_union()
103 elements[class_element].class_count in partition_union()
104 += elements[e2->class_element].class_count; in partition_union()
161 int count = elements[elements[e].class_element].class_count; in partition_print()
/dports/lang/gcc11/gcc-11.2.0/libiberty/
H A Dpartition.c55 part->elements[e].class_count = 1; in partition_new()
91 if (elements[elem1].class_count < elements[elem2].class_count) in partition_union()
103 elements[class_element].class_count in partition_union()
104 += elements[e2->class_element].class_count; in partition_union()
161 int count = elements[elements[e].class_element].class_count; in partition_print()
/dports/lang/gcc10/gcc-10.3.0/libiberty/
H A Dpartition.c55 part->elements[e].class_count = 1;
91 if (elements[elem1].class_count < elements[elem2].class_count)
103 elements[class_element].class_count
104 += elements[e2->class_element].class_count;
161 int count = elements[elements[e].class_element].class_count;
/dports/lang/gcc11-devel/gcc-11-20211009/libiberty/
H A Dpartition.c55 part->elements[e].class_count = 1; in partition_new()
91 if (elements[elem1].class_count < elements[elem2].class_count) in partition_union()
103 elements[class_element].class_count in partition_union()
104 += elements[e2->class_element].class_count; in partition_union()
161 int count = elements[elements[e].class_element].class_count; in partition_print()
/dports/devel/arm-elf-binutils/binutils-2.37/libiberty/
H A Dpartition.c55 part->elements[e].class_count = 1; in partition_new()
91 if (elements[elem1].class_count < elements[elem2].class_count) in partition_union()
103 elements[class_element].class_count in partition_union()
104 += elements[e2->class_element].class_count; in partition_union()
161 int count = elements[elements[e].class_element].class_count; in partition_print()
/dports/devel/arm-none-eabi-gcc/gcc-8.4.0/libiberty/
H A Dpartition.c55 part->elements[e].class_count = 1; in partition_new()
91 if (elements[elem1].class_count < elements[elem2].class_count) in partition_union()
103 elements[class_element].class_count in partition_union()
104 += elements[e2->class_element].class_count; in partition_union()
161 int count = elements[elements[e].class_element].class_count; in partition_print()
/dports/devel/avr-gcc/gcc-10.2.0/libiberty/
H A Dpartition.c55 part->elements[e].class_count = 1; in partition_new()
91 if (elements[elem1].class_count < elements[elem2].class_count) in partition_union()
103 elements[class_element].class_count in partition_union()
104 += elements[e2->class_element].class_count; in partition_union()
161 int count = elements[elements[e].class_element].class_count; in partition_print()

12345678910>>...20