HomeSort by: relevance | last modified time | path
    Searched refs:num_vals (Results 1 - 18 of 18) sorted by relevancy

  /xsrc/external/mit/xf86-input-synaptics/dist/src/
synproto.c 30 int num_vals; local
38 num_vals = 2; /* x and y */
39 num_vals += 2; /* scroll axes */
40 num_vals += priv->num_mt_axes;
43 hw->mt_mask[i] = valuator_mask_new(num_vals);
  /xsrc/external/mit/libSM/dist/src/
sm_misc.c 55 for (i = 0; i < prop->num_vals; i++)
SMlibint.h 148 for (_j = 0; _j < _props[_i]->num_vals; _j++) \
175 STORE_CARD32 (_pBuf, _props[_i]->num_vals); \
177 for (_j = 0; _j < _props[_i]->num_vals; _j++) \
sm_process.c 114 EXTRACT_CARD32 (pBuf, swap, props[i]->num_vals);
115 if (props[i]->num_vals < 0)
118 props[i]->vals = calloc (props[i]->num_vals, sizeof (SmPropValue));
122 for (j = 0; j < props[i]->num_vals; j++)
143 for (j = 0; j < props[i]->num_vals; j++)
  /xsrc/external/mit/MesaLib/dist/src/compiler/nir/
nir_from_ssa.c 710 int num_vals = 0; local
717 for (int i = 0; i < num_vals; ++i) {
722 src_idx = num_vals++;
729 for (int i = 0; i < num_vals; ++i) {
741 dest_idx = num_vals++;
759 for (int i = 0; i < num_vals; i++) {
808 assert(num_vals < num_copies * 2);
819 values[num_vals].is_ssa = false;
820 values[num_vals].reg.reg = reg;
822 emit_copy(&state->builder, values[b], values[num_vals]);
    [all...]
  /xsrc/external/mit/MesaLib.old/dist/src/compiler/nir/
nir_from_ssa.c 623 int num_vals = 0; local
630 for (int i = 0; i < num_vals; ++i) {
635 src_idx = num_vals++;
642 for (int i = 0; i < num_vals; ++i) {
654 dest_idx = num_vals++;
672 for (int i = 0; i < num_vals; i++) {
706 assert(num_vals < num_copies * 2);
717 values[num_vals].is_ssa = false;
718 values[num_vals].reg.reg = reg;
720 emit_copy(&state->builder, values[b], values[num_vals]);
    [all...]
  /xsrc/external/mit/smproxy/dist/
smproxy.c 266 prop1.num_vals = 1;
274 prop2.num_vals = 1;
288 prop3.num_vals = 1;
304 prop1.num_vals = winInfo->wm_command_count;
322 prop2.num_vals = winInfo->wm_command_count;
925 prop1.num_vals = 1;
933 prop2.num_vals = 1;
940 prop3.num_vals = 1;
999 prop1.num_vals = numVals;
1008 prop2.num_vals = 1
    [all...]
  /xsrc/external/mit/MesaLib/dist/src/gallium/drivers/llvmpipe/
lp_test_arit.c 452 int num_vals = ((j + 1) * length <= test->num_values) ? length : local
455 for (i = 0; i < num_vals; ++i) {
460 for (i = 0; i < num_vals; ++i) {
  /xsrc/external/mit/MesaLib.old/dist/src/gallium/drivers/llvmpipe/
lp_test_arit.c 431 int num_vals = ((j + 1) * length <= test->num_values) ? length : local
434 for (i = 0; i < num_vals; ++i) {
439 for (i = 0; i < num_vals; ++i) {
  /xsrc/external/mit/xsm/dist/
prop.c 166 for (i = 0; i < theProp->num_vals; i++)
369 propRet->num_vals = ListCount (pprop->values);
371 propRet->num_vals * sizeof (SmPropValue));
info.c 655 prop.num_vals = 1;
  /xsrc/external/mit/libSM/dist/include/X11/SM/
SMlib.h 65 int num_vals; /* number of values in property */ member in struct:__anon5509
  /xsrc/external/mit/ctwm/dist/
session.c 907 prop1.num_vals = 1;
915 prop2.num_vals = 1;
922 prop3.num_vals = 1;
1026 prop1.num_vals = numVals;
1031 prop2.num_vals = 1;
  /xsrc/external/mit/twm/dist/src/
session.c 695 props[0]->num_vals = 1;
705 props[1]->num_vals = 1;
716 props[2]->num_vals = 1;
809 props[3]->num_vals = numVals;
816 props[4]->num_vals = 1;
  /xsrc/external/mit/xorg-server.old/dist/test/
input.c 1084 int first_val, num_vals; local
1123 num_vals = 6;
1125 valuator_mask_set_range(mask, first_val, num_vals, valuators);
1126 g_assert(valuator_mask_size(mask) == first_val + num_vals);
1127 g_assert(valuator_mask_num_valuators(mask) == num_vals);
1130 if (i < first_val || i >= first_val + num_vals)
  /xsrc/external/mit/xorg-server/dist/test/
input.c 1247 int first_val, num_vals; local
1287 num_vals = 6;
1289 valuator_mask_set_range(mask, first_val, num_vals, val_ranged);
1290 assert(valuator_mask_size(mask) == first_val + num_vals);
1291 assert(valuator_mask_num_valuators(mask) == num_vals);
1295 if (i < first_val || i >= first_val + num_vals) {
  /xsrc/external/mit/libXt/dist/src/
Shell.c 3006 p->num_vals = 1;
3022 p->num_vals = 1;
3045 p->num_vals = n;
  /xsrc/external/mit/MesaLib/dist/src/amd/compiler/
aco_instruction_selection.cpp 3666 unsigned num_vals = 0;
3782 assert(num_vals == 0);
3818 vals[num_vals++] = val;
3825 for (unsigned i = 0; i < num_vals;) {
3826 Temp* const tmp = (Temp*)alloca(num_vals * sizeof(Temp));
3830 while ((!tmp_size || (tmp_size % component_size)) && i < num_vals) {
3848 assert(i == num_vals);
10268 unsigned num_vals = ctx->cf_info.has_branch ? 1 : (ctx->block->index - loop_header_idx + 1);
10269 Operand* const vals = (Operand*)alloca(num_vals * sizeof(Operand));

Completed in 27 milliseconds