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

  /src/sys/arch/sun3/sun3x/
pmap.c 1599 c_tmgr_t **c_tbl, mmu_short_pte_t **pte, int *a_idx, int *b_idx,
1615 *a_idx = MMU_TIA(va);
1616 a_dte = &((*a_tbl)->at_dtbl[*a_idx]);
1653 u_int a_idx, b_idx, pte_idx; /* table indices */ local
1768 a_idx = MMU_TIA(va); /* Calculate the TIA of the VA. */
1769 a_dte = &a_tbl->at_dtbl[a_idx]; /* Retrieve descriptor from table */
1773 * a_idx *
1807 b_tbl->bt_pidx = a_idx;
2256 int a_idx, b_idx, c_idx; local
2304 a_idx = MMU_TIA(startva)
2375 int a_idx, b_idx, c_idx; local
2930 int a_idx, b_idx, pte_idx; local
3596 int a_idx, b_idx; local
    [all...]
  /src/usr.bin/config/
mkmakefile.c 416 a->a_idx = attridx;
460 else if ((*a)->a_idx < (*b)->a_idx)
462 else if ((*a)->a_idx > (*b)->a_idx)
defs.h 211 size_t a_idx; /* index to break sorting ties */ member in struct:attr
  /src/external/gpl3/gcc/dist/gcc/analyzer/
constraint-manager.cc 859 unsigned a_idx = 0; local
861 while (a_idx < a->m_ranges.length ()
864 const bounded_range &r_a = a->m_ranges[a_idx];
874 a_idx++;
879 a_idx++;
  /src/external/gpl3/gcc.old/dist/gcc/analyzer/
constraint-manager.cc 854 unsigned a_idx = 0; local
856 while (a_idx < a->m_ranges.length ()
859 const bounded_range &r_a = a->m_ranges[a_idx];
869 a_idx++;
874 a_idx++;
  /src/external/gpl3/gcc.old/dist/libphobos/src/std/uni/
package.d 2945 size_t a_idx = hint + range[hint..$].lowerBound!(SearchPolicy.gallop)(a).length;
2946 if (a_idx == range.length)
2953 size_t b_idx = range[a_idx .. range.length].lowerBound!(SearchPolicy.gallop)(b).length+a_idx;
2958 writefln("a_idx=%d; b_idx=%d;", a_idx, b_idx);
2964 if (a_idx & 1)// a in positive
2975 pos = genericReplace(data, a_idx, b_idx, buf[0 .. to_insert]);
2983 writefln("a_idx=%d; b_idx=%d;", a_idx, b_idx)
    [all...]

Completed in 73 milliseconds