| /dports/www/chromium-legacy/chromium-88.0.4324.182/ui/accessibility/ |
| H A D | tree_generator.cc | 17 for (int i = 2; i < node_count; ++i) in UniqueTreeCountForNodeCount()
54 for (int node_count = 1; node_count <= max_node_count_; ++node_count) { in IgnoredPermutationCountPerUniqueTree() local
59 return 1 << (node_count - 1); in IgnoredPermutationCountPerUniqueTree()
90 for (int node_count = 1; node_count <= max_node_count_; ++node_count) { in BuildUniqueTreeUpdate() local
102 int node_count, in BuildUniqueTreeUpdateWithSize() argument
112 for (int i = 0; i < node_count; ++i) in BuildUniqueTreeUpdateWithSize()
115 int p = (node_count - i); in BuildUniqueTreeUpdateWithSize()
122 for (int i = 0; i < node_count; ++i) in BuildUniqueTreeUpdateWithSize()
129 out_update->nodes.resize(node_count); in BuildUniqueTreeUpdateWithSize()
131 if (node_count > 1) { in BuildUniqueTreeUpdateWithSize()
[all …]
|
| /dports/devel/godot2/godot-2.1.6-stable/modules/chibi/ |
| H A D | cp_envelope.cpp | 47 node_count = 0; in reset()
52 if (node_count && pos > node[node_count - 1].tick_offset) in get_height_at_pos()
53 return node[node_count - 1].value; in get_height_at_pos()
116 if (node_count && pos > node[node_count - 1].tick_offset) in get_interp_height_at_pos()
147 if (p_node >= node_count) return; in set_position()
178 for (i = 0; i < node_count; i++) in add_position()
186 node_count++; in add_position()
258 if ((node_count < 3) || (p_node <= 0) || (p_node >= node_count)) return; in del_position()
270 node_count--; in del_position()
312 return node_count; in get_node_count()
[all …]
|
| /dports/devel/godot2-tools/godot-2.1.6-stable/modules/chibi/ |
| H A D | cp_envelope.cpp | 47 node_count = 0; in reset()
52 if (node_count && pos > node[node_count - 1].tick_offset) in get_height_at_pos()
53 return node[node_count - 1].value; in get_height_at_pos()
116 if (node_count && pos > node[node_count - 1].tick_offset) in get_interp_height_at_pos()
147 if (p_node >= node_count) return; in set_position()
178 for (i = 0; i < node_count; i++) in add_position()
186 node_count++; in add_position()
258 if ((node_count < 3) || (p_node <= 0) || (p_node >= node_count)) return; in del_position()
270 node_count--; in del_position()
312 return node_count; in get_node_count()
[all …]
|
| /dports/www/qt5-webengine/qtwebengine-everywhere-src-5.15.2/src/3rdparty/chromium/ui/accessibility/ |
| H A D | tree_generator.cc | 12 static int UniqueTreeCountForNodeCount(int node_count, in UniqueTreeCountForNodeCount() argument
17 for (int i = 2; i < node_count; ++i) in UniqueTreeCountForNodeCount()
50 for (int node_count = 1; node_count <= max_node_count_; ++node_count) { in BuildUniqueTree() local
53 BuildUniqueTreeWithSize(node_count, in BuildUniqueTree()
71 for (int i = 0; i < node_count; ++i) in BuildUniqueTreeWithSize()
73 for (int i = 0; i < node_count; ++i) { in BuildUniqueTreeWithSize()
74 int p = (node_count - i); in BuildUniqueTreeWithSize()
81 for (int i = 0; i < node_count; ++i) in BuildUniqueTreeWithSize()
89 update.nodes.resize(node_count); in BuildUniqueTreeWithSize()
91 if (node_count > 1) { in BuildUniqueTreeWithSize()
[all …]
|
| /dports/graphics/libosmesa-gallium/mesa-21.3.6/src/panfrost/util/ |
| H A D | lcra.c | 44 unsigned node_count, unsigned class_count) in lcra_alloc_equations() argument
48 l->node_count = node_count; in lcra_alloc_equations()
52 l->linear = calloc(sizeof(l->linear[0]), node_count * node_count); in lcra_alloc_equations()
54 l->class = calloc(sizeof(l->class[0]), node_count); in lcra_alloc_equations()
101 if (node < l->node_count && l->alignment[node]) { in lcra_restrict_range()
133 l->linear[j * l->node_count + i] |= constraint_fw; in lcra_add_node_interference()
140 unsigned *row = &l->linear[i * l->node_count]; in lcra_test_linear()
143 for (unsigned j = 0; j < l->node_count; ++j) { in lcra_test_linear()
206 if (node < l->node_count) in lcra_set_node_spill_cost()
216 for (unsigned j = 0; j < l->node_count; ++j) in lcra_count_constraints()
[all …]
|
| /dports/lang/clover/mesa-21.3.6/src/panfrost/util/ |
| H A D | lcra.c | 44 unsigned node_count, unsigned class_count) in lcra_alloc_equations() argument
48 l->node_count = node_count; in lcra_alloc_equations()
52 l->linear = calloc(sizeof(l->linear[0]), node_count * node_count); in lcra_alloc_equations()
54 l->class = calloc(sizeof(l->class[0]), node_count); in lcra_alloc_equations()
101 if (node < l->node_count && l->alignment[node]) { in lcra_restrict_range()
133 l->linear[j * l->node_count + i] |= constraint_fw; in lcra_add_node_interference()
140 unsigned *row = &l->linear[i * l->node_count]; in lcra_test_linear()
143 for (unsigned j = 0; j < l->node_count; ++j) { in lcra_test_linear()
206 if (node < l->node_count) in lcra_set_node_spill_cost()
216 for (unsigned j = 0; j < l->node_count; ++j) in lcra_count_constraints()
[all …]
|
| /dports/graphics/libosmesa/mesa-21.3.6/src/panfrost/util/ |
| H A D | lcra.c | 44 unsigned node_count, unsigned class_count) in lcra_alloc_equations() argument
48 l->node_count = node_count; in lcra_alloc_equations()
52 l->linear = calloc(sizeof(l->linear[0]), node_count * node_count); in lcra_alloc_equations()
54 l->class = calloc(sizeof(l->class[0]), node_count); in lcra_alloc_equations()
101 if (node < l->node_count && l->alignment[node]) { in lcra_restrict_range()
133 l->linear[j * l->node_count + i] |= constraint_fw; in lcra_add_node_interference()
140 unsigned *row = &l->linear[i * l->node_count]; in lcra_test_linear()
143 for (unsigned j = 0; j < l->node_count; ++j) { in lcra_test_linear()
206 if (node < l->node_count) in lcra_set_node_spill_cost()
216 for (unsigned j = 0; j < l->node_count; ++j) in lcra_count_constraints()
[all …]
|
| /dports/graphics/mesa-gallium-vdpau/mesa-21.3.6/src/panfrost/util/ |
| H A D | lcra.c | 44 unsigned node_count, unsigned class_count) in lcra_alloc_equations() argument
48 l->node_count = node_count; in lcra_alloc_equations()
52 l->linear = calloc(sizeof(l->linear[0]), node_count * node_count); in lcra_alloc_equations()
54 l->class = calloc(sizeof(l->class[0]), node_count); in lcra_alloc_equations()
101 if (node < l->node_count && l->alignment[node]) { in lcra_restrict_range()
133 l->linear[j * l->node_count + i] |= constraint_fw; in lcra_add_node_interference()
140 unsigned *row = &l->linear[i * l->node_count]; in lcra_test_linear()
143 for (unsigned j = 0; j < l->node_count; ++j) { in lcra_test_linear()
206 if (node < l->node_count) in lcra_set_node_spill_cost()
216 for (unsigned j = 0; j < l->node_count; ++j) in lcra_count_constraints()
[all …]
|
| /dports/graphics/mesa-libs/mesa-21.3.6/src/panfrost/util/ |
| H A D | lcra.c | 44 unsigned node_count, unsigned class_count) in lcra_alloc_equations() argument
48 l->node_count = node_count; in lcra_alloc_equations()
52 l->linear = calloc(sizeof(l->linear[0]), node_count * node_count); in lcra_alloc_equations()
54 l->class = calloc(sizeof(l->class[0]), node_count); in lcra_alloc_equations()
101 if (node < l->node_count && l->alignment[node]) { in lcra_restrict_range()
133 l->linear[j * l->node_count + i] |= constraint_fw; in lcra_add_node_interference()
140 unsigned *row = &l->linear[i * l->node_count]; in lcra_test_linear()
143 for (unsigned j = 0; j < l->node_count; ++j) { in lcra_test_linear()
206 if (node < l->node_count) in lcra_set_node_spill_cost()
216 for (unsigned j = 0; j < l->node_count; ++j) in lcra_count_constraints()
[all …]
|
| /dports/graphics/mesa-dri-gallium/mesa-21.3.6/src/panfrost/util/ |
| H A D | lcra.c | 44 unsigned node_count, unsigned class_count) in lcra_alloc_equations() argument
48 l->node_count = node_count; in lcra_alloc_equations()
52 l->linear = calloc(sizeof(l->linear[0]), node_count * node_count); in lcra_alloc_equations()
54 l->class = calloc(sizeof(l->class[0]), node_count); in lcra_alloc_equations()
101 if (node < l->node_count && l->alignment[node]) { in lcra_restrict_range()
133 l->linear[j * l->node_count + i] |= constraint_fw; in lcra_add_node_interference()
140 unsigned *row = &l->linear[i * l->node_count]; in lcra_test_linear()
143 for (unsigned j = 0; j < l->node_count; ++j) { in lcra_test_linear()
206 if (node < l->node_count) in lcra_set_node_spill_cost()
216 for (unsigned j = 0; j < l->node_count; ++j) in lcra_count_constraints()
[all …]
|
| /dports/graphics/mesa-gallium-va/mesa-21.3.6/src/panfrost/util/ |
| H A D | lcra.c | 44 unsigned node_count, unsigned class_count) in lcra_alloc_equations() argument
48 l->node_count = node_count; in lcra_alloc_equations()
52 l->linear = calloc(sizeof(l->linear[0]), node_count * node_count); in lcra_alloc_equations()
54 l->class = calloc(sizeof(l->class[0]), node_count); in lcra_alloc_equations()
101 if (node < l->node_count && l->alignment[node]) { in lcra_restrict_range()
133 l->linear[j * l->node_count + i] |= constraint_fw; in lcra_add_node_interference()
140 unsigned *row = &l->linear[i * l->node_count]; in lcra_test_linear()
143 for (unsigned j = 0; j < l->node_count; ++j) { in lcra_test_linear()
206 if (node < l->node_count) in lcra_set_node_spill_cost()
216 for (unsigned j = 0; j < l->node_count; ++j) in lcra_count_constraints()
[all …]
|
| /dports/graphics/mesa-gallium-xa/mesa-21.3.6/src/panfrost/util/ |
| H A D | lcra.c | 44 unsigned node_count, unsigned class_count) in lcra_alloc_equations() argument
48 l->node_count = node_count; in lcra_alloc_equations()
52 l->linear = calloc(sizeof(l->linear[0]), node_count * node_count); in lcra_alloc_equations()
54 l->class = calloc(sizeof(l->class[0]), node_count); in lcra_alloc_equations()
101 if (node < l->node_count && l->alignment[node]) { in lcra_restrict_range()
133 l->linear[j * l->node_count + i] |= constraint_fw; in lcra_add_node_interference()
140 unsigned *row = &l->linear[i * l->node_count]; in lcra_test_linear()
143 for (unsigned j = 0; j < l->node_count; ++j) { in lcra_test_linear()
206 if (node < l->node_count) in lcra_set_node_spill_cost()
216 for (unsigned j = 0; j < l->node_count; ++j) in lcra_count_constraints()
[all …]
|
| /dports/graphics/mesa-devel/mesa-22.0-branchpoint-2059-ge8a63cf61ec/src/panfrost/util/ |
| H A D | lcra.c | 44 unsigned node_count, unsigned class_count) in lcra_alloc_equations() argument
48 l->node_count = node_count; in lcra_alloc_equations()
52 l->linear = calloc(sizeof(l->linear[0]), node_count * node_count); in lcra_alloc_equations()
54 l->class = calloc(sizeof(l->class[0]), node_count); in lcra_alloc_equations()
101 if (node < l->node_count && l->alignment[node]) { in lcra_restrict_range()
133 l->linear[j * l->node_count + i] |= constraint_fw; in lcra_add_node_interference()
140 unsigned *row = &l->linear[i * l->node_count]; in lcra_test_linear()
143 for (unsigned j = 0; j < l->node_count; ++j) { in lcra_test_linear()
206 if (node < l->node_count) in lcra_set_node_spill_cost()
216 for (unsigned j = 0; j < l->node_count; ++j) in lcra_count_constraints()
[all …]
|
| /dports/graphics/mesa-dri/mesa-21.3.6/src/panfrost/util/ |
| H A D | lcra.c | 44 unsigned node_count, unsigned class_count) in lcra_alloc_equations() argument
48 l->node_count = node_count; in lcra_alloc_equations()
52 l->linear = calloc(sizeof(l->linear[0]), node_count * node_count); in lcra_alloc_equations()
54 l->class = calloc(sizeof(l->class[0]), node_count); in lcra_alloc_equations()
101 if (node < l->node_count && l->alignment[node]) { in lcra_restrict_range()
133 l->linear[j * l->node_count + i] |= constraint_fw; in lcra_add_node_interference()
140 unsigned *row = &l->linear[i * l->node_count]; in lcra_test_linear()
143 for (unsigned j = 0; j < l->node_count; ++j) { in lcra_test_linear()
206 if (node < l->node_count) in lcra_set_node_spill_cost()
216 for (unsigned j = 0; j < l->node_count; ++j) in lcra_count_constraints()
[all …]
|
| /dports/graphics/libosmesa-gallium/mesa-21.3.6/src/panfrost/bifrost/ |
| H A D | bi_ra.c | 32 unsigned node_count; member
60 lcra_alloc_equations(unsigned node_count) in lcra_alloc_equations() argument
64 l->node_count = node_count; in lcra_alloc_equations()
66 l->linear = calloc(sizeof(l->linear[0]), node_count * node_count); in lcra_alloc_equations()
224 if (node >= node_count) in bi_mark_interference()
255 if (node < node_count) in bi_mark_interference()
280 unsigned node_count = bi_max_temp(ctx); in bi_compute_interference() local
299 unsigned node_count = bi_max_temp(ctx); in bi_allocate_registers() local
323 if (dest < node_count) in bi_allocate_registers()
344 unsigned node_count = bi_max_temp(ctx); in bi_reg_from_index() local
[all …]
|
| /dports/lang/clover/mesa-21.3.6/src/panfrost/bifrost/ |
| H A D | bi_ra.c | 32 unsigned node_count; member
60 lcra_alloc_equations(unsigned node_count) in lcra_alloc_equations() argument
64 l->node_count = node_count; in lcra_alloc_equations()
66 l->linear = calloc(sizeof(l->linear[0]), node_count * node_count); in lcra_alloc_equations()
224 if (node >= node_count) in bi_mark_interference()
255 if (node < node_count) in bi_mark_interference()
280 unsigned node_count = bi_max_temp(ctx); in bi_compute_interference() local
299 unsigned node_count = bi_max_temp(ctx); in bi_allocate_registers() local
323 if (dest < node_count) in bi_allocate_registers()
344 unsigned node_count = bi_max_temp(ctx); in bi_reg_from_index() local
[all …]
|
| /dports/graphics/libosmesa/mesa-21.3.6/src/panfrost/bifrost/ |
| H A D | bi_ra.c | 32 unsigned node_count; member
60 lcra_alloc_equations(unsigned node_count) in lcra_alloc_equations() argument
64 l->node_count = node_count; in lcra_alloc_equations()
66 l->linear = calloc(sizeof(l->linear[0]), node_count * node_count); in lcra_alloc_equations()
224 if (node >= node_count) in bi_mark_interference()
255 if (node < node_count) in bi_mark_interference()
280 unsigned node_count = bi_max_temp(ctx); in bi_compute_interference() local
299 unsigned node_count = bi_max_temp(ctx); in bi_allocate_registers() local
323 if (dest < node_count) in bi_allocate_registers()
344 unsigned node_count = bi_max_temp(ctx); in bi_reg_from_index() local
[all …]
|
| /dports/graphics/mesa-libs/mesa-21.3.6/src/panfrost/bifrost/ |
| H A D | bi_ra.c | 32 unsigned node_count; member
60 lcra_alloc_equations(unsigned node_count) in lcra_alloc_equations() argument
64 l->node_count = node_count; in lcra_alloc_equations()
66 l->linear = calloc(sizeof(l->linear[0]), node_count * node_count); in lcra_alloc_equations()
224 if (node >= node_count) in bi_mark_interference()
255 if (node < node_count) in bi_mark_interference()
280 unsigned node_count = bi_max_temp(ctx); in bi_compute_interference() local
299 unsigned node_count = bi_max_temp(ctx); in bi_allocate_registers() local
323 if (dest < node_count) in bi_allocate_registers()
344 unsigned node_count = bi_max_temp(ctx); in bi_reg_from_index() local
[all …]
|
| /dports/graphics/mesa-dri-gallium/mesa-21.3.6/src/panfrost/bifrost/ |
| H A D | bi_ra.c | 32 unsigned node_count; member
60 lcra_alloc_equations(unsigned node_count) in lcra_alloc_equations() argument
64 l->node_count = node_count; in lcra_alloc_equations()
66 l->linear = calloc(sizeof(l->linear[0]), node_count * node_count); in lcra_alloc_equations()
224 if (node >= node_count) in bi_mark_interference()
255 if (node < node_count) in bi_mark_interference()
280 unsigned node_count = bi_max_temp(ctx); in bi_compute_interference() local
299 unsigned node_count = bi_max_temp(ctx); in bi_allocate_registers() local
323 if (dest < node_count) in bi_allocate_registers()
344 unsigned node_count = bi_max_temp(ctx); in bi_reg_from_index() local
[all …]
|
| /dports/graphics/mesa-gallium-va/mesa-21.3.6/src/panfrost/bifrost/ |
| H A D | bi_ra.c | 32 unsigned node_count; member
60 lcra_alloc_equations(unsigned node_count) in lcra_alloc_equations() argument
64 l->node_count = node_count; in lcra_alloc_equations()
66 l->linear = calloc(sizeof(l->linear[0]), node_count * node_count); in lcra_alloc_equations()
224 if (node >= node_count) in bi_mark_interference()
255 if (node < node_count) in bi_mark_interference()
280 unsigned node_count = bi_max_temp(ctx); in bi_compute_interference() local
299 unsigned node_count = bi_max_temp(ctx); in bi_allocate_registers() local
323 if (dest < node_count) in bi_allocate_registers()
344 unsigned node_count = bi_max_temp(ctx); in bi_reg_from_index() local
[all …]
|
| /dports/graphics/mesa-gallium-vdpau/mesa-21.3.6/src/panfrost/bifrost/ |
| H A D | bi_ra.c | 32 unsigned node_count; member
60 lcra_alloc_equations(unsigned node_count) in lcra_alloc_equations() argument
64 l->node_count = node_count; in lcra_alloc_equations()
66 l->linear = calloc(sizeof(l->linear[0]), node_count * node_count); in lcra_alloc_equations()
224 if (node >= node_count) in bi_mark_interference()
255 if (node < node_count) in bi_mark_interference()
280 unsigned node_count = bi_max_temp(ctx); in bi_compute_interference() local
299 unsigned node_count = bi_max_temp(ctx); in bi_allocate_registers() local
323 if (dest < node_count) in bi_allocate_registers()
344 unsigned node_count = bi_max_temp(ctx); in bi_reg_from_index() local
[all …]
|
| /dports/graphics/mesa-gallium-xa/mesa-21.3.6/src/panfrost/bifrost/ |
| H A D | bi_ra.c | 32 unsigned node_count; member
60 lcra_alloc_equations(unsigned node_count) in lcra_alloc_equations() argument
64 l->node_count = node_count; in lcra_alloc_equations()
66 l->linear = calloc(sizeof(l->linear[0]), node_count * node_count); in lcra_alloc_equations()
224 if (node >= node_count) in bi_mark_interference()
255 if (node < node_count) in bi_mark_interference()
280 unsigned node_count = bi_max_temp(ctx); in bi_compute_interference() local
299 unsigned node_count = bi_max_temp(ctx); in bi_allocate_registers() local
323 if (dest < node_count) in bi_allocate_registers()
344 unsigned node_count = bi_max_temp(ctx); in bi_reg_from_index() local
[all …]
|
| /dports/graphics/mesa-dri/mesa-21.3.6/src/panfrost/bifrost/ |
| H A D | bi_ra.c | 32 unsigned node_count; member
60 lcra_alloc_equations(unsigned node_count) in lcra_alloc_equations() argument
64 l->node_count = node_count; in lcra_alloc_equations()
66 l->linear = calloc(sizeof(l->linear[0]), node_count * node_count); in lcra_alloc_equations()
224 if (node >= node_count) in bi_mark_interference()
255 if (node < node_count) in bi_mark_interference()
280 unsigned node_count = bi_max_temp(ctx); in bi_compute_interference() local
299 unsigned node_count = bi_max_temp(ctx); in bi_allocate_registers() local
323 if (dest < node_count) in bi_allocate_registers()
344 unsigned node_count = bi_max_temp(ctx); in bi_reg_from_index() local
[all …]
|
| /dports/graphics/mesa-devel/mesa-22.0-branchpoint-2059-ge8a63cf61ec/src/panfrost/bifrost/ |
| H A D | bi_ra.c | 32 unsigned node_count; member
60 lcra_alloc_equations(unsigned node_count) in lcra_alloc_equations() argument
64 l->node_count = node_count; in lcra_alloc_equations()
66 l->linear = calloc(sizeof(l->linear[0]), node_count * node_count); in lcra_alloc_equations()
224 if (node >= node_count) in bi_mark_interference()
261 if (node < node_count) in bi_mark_interference()
286 unsigned node_count = bi_max_temp(ctx); in bi_compute_interference() local
305 unsigned node_count = bi_max_temp(ctx); in bi_allocate_registers() local
321 if (dest < node_count) in bi_allocate_registers()
334 if (node < node_count) in bi_allocate_registers()
[all …]
|
| /dports/games/simutrans/simutrans-121.0/tpl/ |
| H A D | binary_heap_tpl.h | 35 uint32 node_count;
42 node_count = 0; in binary_heap_tpl()
59 node_count ++; in insert()
62 if(node_count==node_size) { in insert()
71 int gap = node_count; in insert()
93 T item = nodes[node_count--]; in pop()
101 while(child<=node_count) { in pop()
120 if (node_count>0) { in pop()
134 node_count = 0; in clear()
140 return node_count; in get_count()
[all …]
|