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

1 2

  /xsrc/external/mit/MesaLib/dist/src/gallium/drivers/radeonsi/
si_cp_reg_shadowing.c 36 const struct ac_reg_range *ranges; local
39 type, &num_ranges, &ranges);
63 si_pm4_cmd_add(pm4, (ranges[i].offset - offset) / 4);
64 si_pm4_cmd_add(pm4, ranges[i].size / 4);
  /xsrc/external/mit/MesaLib/dist/src/amd/vulkan/winsys/amdgpu/
radv_amdgpu_bo.h 58 struct radv_amdgpu_map_range *ranges; member in struct:radv_amdgpu_winsys_bo::__anon598::__anon600
radv_amdgpu_bo.c 137 if (bo->ranges[i].bo)
138 bo->bos[temp_bo_count++] = bo->ranges[i].bo;
168 /* We have at most 2 new ranges (1 by the bind, and another one by splitting a range that
172 struct radv_amdgpu_map_range *ranges = local
173 realloc(parent->ranges, range_capacity * sizeof(struct radv_amdgpu_map_range));
174 if (!ranges)
176 parent->ranges = ranges;
181 * [first, last] is exactly the range of ranges that either overlap the
182 * new parent, or are adjacent to it. This corresponds to the bind ranges
403 struct radv_amdgpu_map_range *ranges = NULL; local
    [all...]
  /xsrc/external/mit/MesaLib.old/dist/src/amd/vulkan/winsys/amdgpu/
radv_amdgpu_bo.h 62 struct radv_amdgpu_map_range *ranges; member in struct:radv_amdgpu_winsys_bo::__anon3286::__anon3288
  /xsrc/external/mit/MesaLib.old/dist/src/gallium/auxiliary/util/
u_prim_restart.c 130 struct range *ranges; member in struct:range_info
144 info->ranges = MALLOC(info->max * sizeof(struct range));
145 if (!info->ranges) {
150 /* grow the ranges[] array */
151 info->ranges = REALLOC(info->ranges,
154 if (!info->ranges) {
162 info->ranges[info->count].start = start;
163 info->ranges[info->count].count = count;
181 struct range_info ranges = {0} local
    [all...]
  /xsrc/external/mit/MesaLib/dist/src/gallium/auxiliary/util/
u_prim_restart.c 232 struct range_info ranges = { .min_index = UINT32_MAX, 0 }; local
234 ranges.min_index = UINT32_MAX;
245 if (!add_range(info->mode, &ranges, draw->start + start, count, draw->index_bias)) { \
274 *num_draws = ranges.count;
275 *min_index = ranges.min_index;
276 *max_index = ranges.max_index;
277 *total_index_count = ranges.total_index_count;
278 return ranges.draws;
  /xsrc/external/mit/MesaLib.old/dist/src/util/
xmlconfig.h 54 * For empty ranges (a single value) start == end */
64 driOptionRange *ranges; /**< \brief Array of ranges */ member in struct:driOptionInfo
65 unsigned int nRanges; /**< \brief Number of ranges */
  /xsrc/external/mit/bdftopcf/dist/
fontxlfd.h 81 fsRange *ranges; member in struct:_FontScalable
  /xsrc/external/mit/libXfont/dist/include/X11/fonts/
fontxlfd.h 84 fsRange *ranges; member in struct:_FontScalable
  /xsrc/external/mit/libXfont2/dist/include/X11/fonts/
fontxlfd.h 84 fsRange *ranges; member in struct:_FontScalable
  /xsrc/external/mit/libXtst/dist/include/X11/extensions/
record.h 64 XRecordRange **ranges; member in struct:__anon6059
109 XRecordRange** /* ranges */,
123 XRecordRange** /* ranges */,
  /xsrc/external/mit/MesaLib/dist/src/gallium/drivers/svga/
svga_resource_buffer.h 41 * Maximum number of discontiguous ranges
133 * Dirty ranges.
135 * Ranges that were touched by the application and need to be uploaded to
141 struct svga_buffer_range ranges[SVGA_BUFFER_MAX_RANGES]; member in struct:svga_buffer::__anon1996
  /xsrc/external/mit/MesaLib/dist/src/intel/compiler/
brw_nir_analyze_ubo_ranges.c 41 * ranges. We build a list of these ranges, tracking their "cost" (number
44 * ranges (most benefit for the least cost).
162 * vectors, as it has to shrink ranges for other reasons anyway.
237 /* Find ranges: a block, starting 32-byte offset, and length. */
238 struct util_dynarray ranges; local
239 util_dynarray_init(&ranges, mem_ctx);
268 * bitfield. There are no more ranges to process.
278 util_dynarray_grow(&ranges, struct ubo_range_entry, 1);
291 int nr_entries = ranges.size / sizeof(struct ubo_range_entry)
    [all...]
  /xsrc/external/mit/MesaLib/dist/src/mesa/state_tracker/
st_glsl_to_tgsi_array_merge.cpp 37 * if they have non-overlapping live ranges and equal access masks:
44 * if they have overlapping live ranges use in sum at most four components:
54 * if they have non-overlapping live ranges:
72 * 1. merge live ranges 1 and 2
93 * 3. merge live ranges 3 and 4
442 array_live_range *ranges; member in class:tgsi_array_merge::array_merge_evaluator
450 ranges(_ranges),
460 if (ranges[i].is_mapped())
464 if (!ranges[j].is_mapped()) {
465 ARRAY_MERGE_DUMP("try merge " << i << " id:" << ranges[i].array_id(
    [all...]
  /xsrc/external/mit/MesaLib/dist/src/microsoft/clc/
compute_test.h 80 if(!ranges.empty() &&
81 ranges.back().RangeType == type &&
82 ranges.back().RegisterSpace == spaceid &&
83 ranges.back().BaseShaderRegister + ranges.back().NumDescriptors == resid) {
84 ranges.back().NumDescriptors++;
96 ranges.push_back(range);
99 std::vector<D3D12_DESCRIPTOR_RANGE1> ranges; member in struct:ComputeTest::Resources
  /xsrc/external/mit/MesaLib.old/dist/src/gallium/drivers/svga/
svga_resource_buffer.h 41 * Maximum number of discontiguous ranges
131 * Dirty ranges.
133 * Ranges that were touched by the application and need to be uploaded to
139 struct svga_buffer_range ranges[SVGA_BUFFER_MAX_RANGES]; member in struct:svga_buffer::__anon4421
  /xsrc/external/mit/MesaLib.old/dist/src/intel/compiler/
brw_nir_analyze_ubo_ranges.c 41 * ranges. We build a list of these ranges, tracking their "cost" (number
44 * ranges (most benefit for the least cost).
160 * vectors, as it has to shrink ranges for other reasons anyway.
243 /* Find ranges: a block, starting 32-byte offset, and length. */
244 struct util_dynarray ranges; local
245 util_dynarray_init(&ranges, mem_ctx);
274 * bitfield. There are no more ranges to process.
284 util_dynarray_grow(&ranges, sizeof(struct ubo_range_entry));
297 int nr_entries = ranges.size / sizeof(struct ubo_range_entry)
    [all...]
  /xsrc/external/mit/MesaLib.old/dist/src/mesa/state_tracker/
st_glsl_to_tgsi_array_merge.cpp 37 * if they have non-overlapping live ranges and equal access masks:
44 * if they have overlapping live ranges use in sum at most four components:
54 * if they have non-overlapping live ranges:
72 * 1. merge live ranges 1 and 2
93 * 3. merge live ranges 3 and 4
442 array_live_range *ranges; member in class:tgsi_array_merge::array_merge_evaluator
450 ranges(_ranges),
460 if (ranges[i].is_mapped())
464 if (!ranges[j].is_mapped()) {
465 ARRAY_MERGE_DUMP("try merge " << i << " id:" << ranges[i].array_id(
    [all...]
  /xsrc/external/mit/libXfont/dist/src/fontfile/
fontfile.c 274 fsRange *ranges; local
283 ranges = FontParseRanges(lowerName, &nranges);
318 vals.ranges = ranges;
334 if (ranges) free(ranges);
437 vals.ranges = ranges;
472 ranges = 0;
484 if (ranges)
700 fsRange *ranges; local
860 fsRange *ranges; local
    [all...]
  /xsrc/external/mit/libXfont2/dist/src/fontfile/
fontfile.c 272 fsRange *ranges; local
281 ranges = FontParseRanges(lowerName, &nranges);
316 vals.ranges = ranges;
332 if (ranges) free(ranges);
435 vals.ranges = ranges;
470 ranges = 0;
482 if (ranges)
698 fsRange *ranges; local
858 fsRange *ranges; local
    [all...]
  /xsrc/external/mit/xorg-server.old/dist/hw/xfree86/ddc/
interpret_edid.c 58 find_ranges_section(struct detailed_monitor_section *det, void *ranges)
60 if (det->type == DS_RANGES && det->section.ranges.max_clock)
61 *(struct monitor_ranges **)ranges = &det->section.ranges;
76 struct monitor_ranges *ranges = NULL; local
86 xf86ForEachDetailedBlock(m, find_ranges_section, &ranges);
87 if (ranges && ranges->max_clock) {
90 if (clock && (ranges->max_clock * 1e6 < clock)) {
92 "%dMHz, fixing\n", clock / 1.0e6, ranges->max_clock)
    [all...]
  /xsrc/external/mit/MesaLib/dist/src/gallium/frontends/nine/
nine_shader.h 40 struct nine_range *ranges; /* single MALLOC, but next-pointers valid */ member in struct:nine_lconstf
  /xsrc/external/mit/MesaLib.old/dist/src/gallium/state_trackers/nine/
nine_shader.h 39 struct nine_range *ranges; /* single MALLOC, but next-pointers valid */ member in struct:nine_lconstf
  /xsrc/external/mit/glu/dist/src/libnurbs/nurbtess/
partitionY.cc 333 void findDiagonals(Int total_num_edges, directedLine** sortedVertices, sweepRange** ranges, Int& num_diagonals, directedLine** diagonal_vertices)
355 if(sweepRangeEqual(ranges[i], ranges[j]))
369 if(sweepRangeEqual(ranges[i], ranges[j]))
431 sweepRange** ranges = (sweepRange**) malloc(sizeof(sweepRange*) * total_num_edges); local
432 assert(ranges);
434 sweepY(total_num_edges, array, ranges);
438 findDiagonals(total_num_edges, array, ranges, num_diagonals, diagonal_vertices);
454 sweepRange** ranges = (sweepRange**) malloc(sizeof(sweepRange*) * (total_num_edges)) local
    [all...]
  /xsrc/external/mit/libXtst/dist/src/
XRecord.c 290 XRecordRange **ranges, int nranges)
310 SendRange(dpy, ranges, nranges);
326 XRecordRange **ranges, int nranges)
346 SendRange(dpy, ranges, nranges);
470 XRecordRange *ranges = NULL; local
473 client_inf_str[i].ranges =
475 if (client_inf_str[i].ranges != NULL)
476 ranges =
480 client_inf_str[i].ranges = NULL;
482 if (!client_inf_str[i].ranges || !ranges)
    [all...]

Completed in 31 milliseconds

1 2