HomeSort by relevance Sort by last modified time
    Searched defs:idx (Results 226 - 250 of 2369) sorted by null

1 2 3 4 5 6 7 8 91011>>

  /external/iproute2/rdma/
rdma.h 36 uint32_t idx; member in struct:dev_map
  /external/iproute2/tc/
m_mirred.c 160 int idx; local
164 if ((idx = ll_name_to_index(d)) == 0) {
169 p.ifindex = idx;
tc_qdisc.c 181 int idx; local
185 idx = ll_name_to_index(d);
186 if (idx == 0) {
190 req.t.tcm_ifindex = idx;
  /external/jacoco/org.jacoco.report/src/org/jacoco/report/internal/html/table/
SortIndex.java 32 final int idx; field in class:SortIndex.Entry
36 Entry(final int idx, final T item) {
37 this.idx = idx;
69 int idx = 0; local
71 final Entry entry = new Entry(idx++, i);
80 positions[e.idx] = pos++;
88 * @param idx
92 public int getPosition(final int idx) {
93 return positions[idx];
    [all...]
  /external/jacoco/org.jacoco.report.test/src/org/jacoco/report/internal/html/table/
SortIndexTest.java 93 int idx = 0; local
95 assertEquals(i.intValue(), index.getPosition(idx++));
  /external/jdiff/src/jdiff/
ClassDiff.java 100 int idx = Collections.binarySearch(newClass.implements_, oldInterface); local
101 if (idx < 0) {
113 int idx = Collections.binarySearch(oldClass.implements_, newInterface); local
114 if (idx < 0) {
  /external/kmod/tools/
rmmod.c 112 int c, idx = 0; local
113 c = getopt_long(argc, argv, cmdopts_s, cmdopts, &idx);
  /external/libdrm/etnaviv/
etnaviv_cmd_stream.c 132 uint32_t idx; local
134 idx = APPEND(&priv->submit, bos);
135 idx = APPEND(priv, bos);
137 priv->submit.bos[idx].flags = 0;
138 priv->submit.bos[idx].handle = bo->handle;
140 priv->bos[idx] = etna_bo_ref(bo);
142 return idx;
145 /* add (if needed) bo, return idx: */
150 uint32_t idx; local
155 idx = append_bo(stream, bo)
232 uint32_t idx = APPEND(&priv->submit, relocs); local
    [all...]
  /external/libdrm/freedreno/msm/
msm_priv.h 81 uint32_t idx; member in struct:msm_bo
  /external/libevent/
poll.c 70 static int poll_add(struct event_base *, int, short old, short events, void *idx);
71 static int poll_del(struct event_base *, int, short old, short events, void *idx);
106 int i, idx; local
110 idx = pop->idxplus1_by_fd[i]-1;
111 if (idx < 0)
113 EVUTIL_ASSERT(pop->event_set[idx].fd == i);
221 struct pollidx *idx = idx_; local
251 i = idx->idxplus1 - 1;
260 idx->idxplus1 = i + 1;
282 struct pollidx *idx = idx_ local
    [all...]
  /external/libevent/test/
bench.c 76 ev_intptr_t idx = (ev_intptr_t) arg, widx = idx + 1; local
  /external/libopus/silk/fixed/mips/
prefilter_FIX_mipsr1.h 127 opus_int i, idx, LTP_shp_buf_idx; local
142 idx = lag + LTP_shp_buf_idx;
143 n_LTP_Q12 = silk_SMULBB( LTP_shp_buf[ ( idx - HARM_SHAPE_FIR_TAPS / 2 - 1) & LTP_MASK ], HarmShapeFIRPacked_Q12 );
144 n_LTP_Q12 = silk_SMLABT( n_LTP_Q12, LTP_shp_buf[ ( idx - HARM_SHAPE_FIR_TAPS / 2 ) & LTP_MASK ], HarmShapeFIRPacked_Q12 );
145 n_LTP_Q12 = silk_SMLABB( n_LTP_Q12, LTP_shp_buf[ ( idx - HARM_SHAPE_FIR_TAPS / 2 + 1) & LTP_MASK ], HarmShapeFIRPacked_Q12 );
  /external/libvpx/libvpx/vpx_dsp/
quantize.c 228 int idx = 0; local
245 if (coeff >= zbins[rc != 0] || coeff <= nzbins[rc != 0]) idx_arr[idx++] = i;
249 // pre-scan pass. Note: idx can be zero.
250 for (i = 0; i < idx; i++) {
281 int idx = 0; local
298 if (coeff >= zbins[rc != 0] || coeff <= nzbins[rc != 0]) idx_arr[idx++] = i;
302 // pre-scan pass. Note: idx can be zero.
303 for (i = 0; i < idx; i++) {
  /external/libvpx/libvpx/vpx_dsp/x86/
highbd_quantize_intrin_sse2.c 103 int idx = 0; local
132 if (!(test & 0xf)) idx_arr[idx++] = i * 4;
133 if (!(test & 0xf0)) idx_arr[idx++] = i * 4 + 1;
134 if (!(test & 0xf00)) idx_arr[idx++] = i * 4 + 2;
135 if (!(test & 0xf000)) idx_arr[idx++] = i * 4 + 3;
139 // pre-scan pass. Note: idx can be zero.
140 for (i = 0; i < idx; i++) {
  /external/libxaac/decoder/drc_src/
impd_drc_dec.c 204 WORD32 idx = drc_instructions_uni_drc->gain_set_index[0]; local
206 drc_instructions_uni_drc->channel_group_of_ch[c] = (idx >= 0) ? 0 : -1;
  /external/linux-kselftest/tools/testing/selftests/vm/
transhuge-stress.c 117 size_t idx = pfn >> (HPAGE_SHIFT - PAGE_SHIFT); local
120 if (idx >= map_len) {
121 map = realloc(map, idx + 1);
124 memset(map + map_len, 0, idx + 1 - map_len);
125 map_len = idx + 1;
127 if (!map[idx])
129 map[idx] = 1;
  /external/llvm/lib/CodeGen/
ScoreboardHazardRecognizer.cpp 39 for (unsigned idx = 0; ; ++idx) {
40 if (ItinData->isEndMarker(idx))
43 const InstrStage *IS = ItinData->beginStage(idx);
44 const InstrStage *E = ItinData->endStage(idx);
125 unsigned idx = MCID->getSchedClass(); local
126 for (const InstrStage *IS = ItinData->beginStage(idx),
127 *E = ItinData->endStage(idx); IS != E; ++IS) {
185 unsigned idx = MCID->getSchedClass(); local
186 for (const InstrStage *IS = ItinData->beginStage(idx),
    [all...]
  /external/mesa3d/src/compiler/glsl/
ir_array_refcount.cpp 194 const ir_constant *const idx = deref->array_index->as_constant(); local
199 if (idx != NULL) {
200 dr->index = idx->get_int_component(0);
ir_set_program_inouts.cpp 95 int idx = var->data.location + offset + i; local
97 idx != VARYING_SLOT_TESS_LEVEL_INNER &&
98 idx != VARYING_SLOT_TESS_LEVEL_OUTER &&
99 idx != VARYING_SLOT_BOUNDING_BOX0 &&
100 idx != VARYING_SLOT_BOUNDING_BOX1;
104 assert(idx >= VARYING_SLOT_PATCH0 && idx < VARYING_SLOT_TESS_MAX);
105 bitfield = BITFIELD64_BIT(idx - VARYING_SLOT_PATCH0);
108 assert(idx < VARYING_SLOT_MAX);
109 bitfield = BITFIELD64_BIT(idx);
    [all...]
test_optpass.cpp 183 int idx = 0; local
185 while ((c = getopt_long(argc, argv, "", optpass_opts, &idx)) != -1) {
  /external/mesa3d/src/compiler/nir/
nir_gather_info.c 33 int idx = var->data.location + offset + i; local
35 idx != VARYING_SLOT_TESS_LEVEL_INNER &&
36 idx != VARYING_SLOT_TESS_LEVEL_OUTER &&
37 idx != VARYING_SLOT_BOUNDING_BOX0 &&
38 idx != VARYING_SLOT_BOUNDING_BOX1;
42 assert(idx >= VARYING_SLOT_PATCH0 && idx < VARYING_SLOT_TESS_MAX);
43 bitfield = BITFIELD64_BIT(idx - VARYING_SLOT_PATCH0);
46 assert(idx < VARYING_SLOT_MAX);
47 bitfield = BITFIELD64_BIT(idx);
221 int idx = var->data.location + i; local
    [all...]
nir_lower_two_sided_color.c 140 int idx; local
141 for (idx = 0; idx < state->colors_count; idx++) {
143 state->colors[idx].front->data.driver_location;
150 if (idx == state->colors_count)
158 nir_ssa_def *front = load_input(b, state->colors[idx].front);
159 nir_ssa_def *back = load_input(b, state->colors[idx].back);
  /external/mesa3d/src/gallium/drivers/freedreno/ir3/
ir3_group.c 42 struct ir3_instruction *(*get)(void *arr, int idx);
43 void (*insert_mov)(void *arr, int idx, struct ir3_instruction *instr);
46 static struct ir3_instruction *arr_get(void *arr, int idx)
48 return ((struct ir3_instruction **)arr)[idx];
50 static void arr_insert_mov_out(void *arr, int idx, struct ir3_instruction *instr)
52 ((struct ir3_instruction **)arr)[idx] =
55 static void arr_insert_mov_in(void *arr, int idx, struct ir3_instruction *instr)
76 ((struct ir3_instruction **)arr)[idx] = in;
81 static struct ir3_instruction *instr_get(void *arr, int idx)
83 return ssa(((struct ir3_instruction *)arr)->regs[idx+1])
97 int idx = 0; local
    [all...]
ir3_nir_lower_if_else.c 277 unsigned idx = src->pred == then_block ? 1 : 2; local
278 nir_src_copy(&sel->src[idx].src, &src->src, mem_ctx);
  /external/mesa3d/src/gallium/drivers/i915/
i915_fpc_emit.c 286 unsigned reg, idx; local
296 for (idx = 0; idx < 4; idx++) {
297 if (!(ifs->constant_flags[reg] & (1 << idx)) ||
298 ifs->constants[reg][idx] == c0) {
299 ifs->constants[reg][idx] = c0;
300 ifs->constant_flags[reg] |= 1 << idx;
303 return swizzle(UREG(REG_TYPE_CONST, reg), idx, ZERO, ZERO, ONE);
316 unsigned reg, idx; local
    [all...]

Completed in 527 milliseconds

1 2 3 4 5 6 7 8 91011>>