Searched refs:idx2 (Results 1 - 23 of 23) sorted by relevance

/freebsd-11-stable/sys/cddl/contrib/opensolaris/uts/common/fs/zfs/lua/
H A Dluaconf.h298 #define lua_equal(L,idx1,idx2) lua_compare(L,(idx1),(idx2),LUA_OPEQ)
299 #define lua_lessthan(L,idx1,idx2) lua_compare(L,(idx1),(idx2),LUA_OPLT)
H A Dlua.h197 LUA_API int (lua_rawequal) (lua_State *L, int idx1, int idx2);
198 LUA_API int (lua_compare) (lua_State *L, int idx1, int idx2, int op);
/freebsd-11-stable/libexec/flua/
H A Dluaconf.h390 #define lua_equal(L,idx1,idx2) lua_compare(L,(idx1),(idx2),LUA_OPEQ)
391 #define lua_lessthan(L,idx1,idx2) lua_compare(L,(idx1),(idx2),LUA_OPLT)
/freebsd-11-stable/stand/liblua/
H A Dluaconf.h389 #define lua_equal(L,idx1,idx2) lua_compare(L,(idx1),(idx2),LUA_OPEQ)
390 #define lua_lessthan(L,idx1,idx2) lua_compare(L,(idx1),(idx2),LUA_OPLT)
/freebsd-11-stable/contrib/llvm-project/compiler-rt/lib/sanitizer_common/
H A Dsanitizer_bvgraph.h153 void check(uptr idx1, uptr idx2) const {
155 CHECK_LT(idx2, size());
H A Dsanitizer_bitvector.h147 uptr i2 = idx2(idx);
162 uptr i2 = idx2(idx);
176 uptr i2 = idx2(idx);
338 uptr idx2(uptr idx) const { function
H A Dsanitizer_deadlock_detector.h350 // idx1 and idx2 are raw indices to g_, not lock IDs.
351 bool testOnlyHasEdgeRaw(uptr idx1, uptr idx2) { argument
352 return g_.hasEdge(idx1, idx2);
/freebsd-11-stable/sys/dev/pccard/
H A Dpccardvar.h121 #define pccard_tuple_read_2(tuple, idx2) \
122 (pccard_tuple_read_1((tuple), (idx2)) | \
123 (pccard_tuple_read_1((tuple), (idx2)+1)<<8))
/freebsd-11-stable/usr.sbin/nandsim/
H A Dnandsim.c283 int chip = 0, ctl = 0, err = 0, fd, idx, idx2, start, stop; local
320 for (idx2 = 0; idx2 < MAX_CTRL_CS; idx2++) {
321 chipconf.num = idx2;
1075 int chip = 0, ctl = 0, err = 0, fd, idx, idx2, state; local
1123 for (idx2 = chipstart; idx2 <= chipstop; idx2++) {
1124 err = is_chip_created(idx, idx2,
[all...]
/freebsd-11-stable/contrib/llvm-project/lld/ELF/
H A DSymbolTable.cpp37 int &idx2 = symMap[CachedHashStringRef(real->getName())]; local
40 idx2 = idx1;
/freebsd-11-stable/contrib/ldns/
H A Dutil.c431 size_t idx0, idx1, idx2, idx3, idx4; local
436 idx2 = ((((size_t)(data[2 * i])) & 3) +
440 retval[j++] = vowels[idx2];
454 idx2 = seed / 6;
457 retval[j++] = vowels[idx2];
/freebsd-11-stable/contrib/lua/src/
H A Dlua.h217 LUA_API int (lua_rawequal) (lua_State *L, int idx1, int idx2);
218 LUA_API int (lua_compare) (lua_State *L, int idx1, int idx2, int op);
/freebsd-11-stable/sys/dev/cas/
H A Dif_cas.c1628 u_int idx, idx2, len, off, skip; local
1797 idx2 = 0;
1805 idx2 = CAS_GET(word2, CAS_RC2_NEXT_INDEX);
1808 __func__, idx2);
1810 rxds2 = &sc->sc_rxdsoft[idx2];
1831 (void *)(uintptr_t)idx2,
1867 cas_add_rxdesc(sc, idx2);
/freebsd-11-stable/sys/cam/scsi/
H A Dscsi_xpt.c1817 u_int idx1, idx2, nlun_old, nlun_new; local
1838 for (idx2 = 0; idx2 < nlun_new; idx2++) {
1839 nl = new->luns[idx2].lundata;
1844 if (idx2 < nlun_new) {
/freebsd-11-stable/sys/cddl/contrib/opensolaris/uts/common/fs/zfs/
H A Dzap.c236 uint64_t idx2 = idx * 2; local
237 uint64_t blk2 = idx2 >> (bs-3);
238 uint64_t off2 = idx2 & ((1<<(bs-3))-1);
/freebsd-11-stable/sys/dev/de/
H A Dif_de.c2365 unsigned idx1, idx2, idx3; local
2404 for (idx2 = 0;; idx2++) {
2405 if (tulip_srom_conninfo[idx2].sc_type == sc->tulip_conntype
2406 || tulip_srom_conninfo[idx2].sc_type == TULIP_SROM_CONNTYPE_NOT_USED)
2409 sc->tulip_connidx = idx2;
2413 for (idx2 = 0; idx2 < blocks; idx2++) {
2475 for (idx2
[all...]
/freebsd-11-stable/contrib/gcclibs/libiberty/
H A Dregex.c3423 int32_t idx2 = table[ch];
3424 size_t len = weights[idx2];
3435 == weights[idx2 + 1 + cnt]))
6343 int32_t idx, idx2;
6361 idx2 = 0;
6363 for (i = 0 ; idx2 == 0 && i < WORK_BUFFER_SIZE - 1; i++)
6375 idx2 = findidx ((const wint_t**)&cp);
6392 len = weights[idx2];
6400 if (idx2 != 0 && len == weights[idx])
6404 == weights[idx2
3410 int32_t idx2 = table[ch]; local
6326 int32_t idx, idx2; local
[all...]
/freebsd-11-stable/contrib/binutils/libiberty/
H A Dregex.c3423 int32_t idx2 = table[ch];
3424 size_t len = weights[idx2];
3435 == weights[idx2 + 1 + cnt]))
6343 int32_t idx, idx2;
6361 idx2 = 0;
6363 for (i = 0 ; idx2 == 0 && i < WORK_BUFFER_SIZE - 1; i++)
6375 idx2 = findidx ((const wint_t**)&cp);
6392 len = weights[idx2];
6400 if (idx2 != 0 && len == weights[idx])
6404 == weights[idx2
3410 int32_t idx2 = table[ch]; local
6326 int32_t idx, idx2; local
[all...]
/freebsd-11-stable/contrib/libgnuregex/
H A Dregcomp.c3420 int32_t idx1, idx2;
3445 idx2 = findidx (&cp, 1);
3447 idx2 = table[ch];
3449 if (idx2 == 0)
3454 if (len == weights[idx2 & 0xffffff] && (idx1 >> 24) == (idx2 >> 24))
3460 == weights[(idx2 & 0xffffff) + 1 + cnt])
3411 int32_t idx1, idx2; local
/freebsd-11-stable/crypto/openssh/
H A Dsshkey.c988 u_int idx0, idx1, idx2, idx3, idx4; local
993 idx2 = ((((u_int)(dgst_raw[2 * i])) & 3) +
997 retval[j++] = vowels[idx2];
1011 idx2 = seed / 6;
1014 retval[j++] = vowels[idx2];
/freebsd-11-stable/contrib/gcc/
H A Dreg-stack.c1876 int idx2 = (get_hard_regnum (regstack, *src2)
1882 regstack->reg[regstack->top - idx2] = REGNO (*src1);
1862 int idx2 = (get_hard_regnum (regstack, *src2) local
/freebsd-11-stable/cddl/contrib/opensolaris/cmd/zfs/
H A Dzfs_main.c2758 uu_list_index_t idx2 = 0; local
2912 if (uu_list_find(list, rmnode, NULL, &idx2) == NULL)
2913 uu_list_insert(list, rmnode, idx2);
/freebsd-11-stable/sys/dev/qlnx/qlnxe/
H A Dqlnx_os.c3038 uint16_t idx, idx2; local
3077 idx2 = (txq->sw_tx_cons + 2) & (TX_RING_SIZE - 1);
3079 prefetch(txq->sw_tx_ring[idx2].mp);

Completed in 299 milliseconds