Home
last modified time | relevance | path

Searched refs:jp (Results 1 - 25 of 25) sorted by relevance

/third_party/musl/src/string/
H A Dwcsstr.c9 size_t l, ip, jp, k, p, ms, p0, mem, mem0; in twoway_wcsstr() local
16 ip = -1; jp = 0; k = p = 1; in twoway_wcsstr()
17 while (jp+k<l) { in twoway_wcsstr()
18 if (n[ip+k] == n[jp+k]) { in twoway_wcsstr()
20 jp += p; in twoway_wcsstr()
23 } else if (n[ip+k] > n[jp+k]) { in twoway_wcsstr()
24 jp += k; in twoway_wcsstr()
26 p = jp - ip; in twoway_wcsstr()
28 ip = jp++; in twoway_wcsstr()
36 ip = -1; jp in twoway_wcsstr()
[all...]
H A Dstrstr.c36 size_t l, ip, jp, k, p, ms, p0, mem, mem0; in twoway_strstr() local
46 ip = -1; jp = 0; k = p = 1; in twoway_strstr()
47 while (jp+k<l) { in twoway_strstr()
48 if (n[ip+k] == n[jp+k]) { in twoway_strstr()
50 jp += p; in twoway_strstr()
53 } else if (n[ip+k] > n[jp+k]) { in twoway_strstr()
54 jp += k; in twoway_strstr()
56 p = jp - ip; in twoway_strstr()
58 ip = jp++; in twoway_strstr()
66 ip = -1; jp in twoway_strstr()
[all...]
H A Dmemmem.c39 size_t i, ip, jp, k, p, ms, p0, mem, mem0; in twoway_memmem() local
48 ip = -1; jp = 0; k = p = 1; in twoway_memmem()
49 while (jp+k<l) { in twoway_memmem()
50 if (n[ip+k] == n[jp+k]) { in twoway_memmem()
52 jp += p; in twoway_memmem()
55 } else if (n[ip+k] > n[jp+k]) { in twoway_memmem()
56 jp += k; in twoway_memmem()
58 p = jp - ip; in twoway_memmem()
60 ip = jp++; in twoway_memmem()
68 ip = -1; jp in twoway_memmem()
[all...]
/third_party/musl/porting/uniproton/kernel/src/string/
H A Dstrstr.c36 size_t l, ip, jp, k, p, ms, p0, mem, mem0; in twoway_strstr() local
46 ip = -1; jp = 0; k = p = 1; in twoway_strstr()
47 while (jp+k<l) { in twoway_strstr()
48 if (n[ip+k] == n[jp+k]) { in twoway_strstr()
50 jp += p; in twoway_strstr()
53 } else if (n[ip+k] > n[jp+k]) { in twoway_strstr()
54 jp += k; in twoway_strstr()
56 p = jp - ip; in twoway_strstr()
58 ip = jp++; in twoway_strstr()
66 ip = -1; jp in twoway_strstr()
[all...]
/third_party/musl/porting/liteos_a/kernel/src/string/
H A Dstrstr.c36 size_t l, ip, jp, k, p, ms, p0, mem, mem0; in twoway_strstr() local
46 ip = -1; jp = 0; k = p = 1; in twoway_strstr()
47 while (jp+k<l) { in twoway_strstr()
48 if (n[ip+k] == n[jp+k]) { in twoway_strstr()
50 jp += p; in twoway_strstr()
53 } else if (n[ip+k] > n[jp+k]) { in twoway_strstr()
54 jp += k; in twoway_strstr()
56 p = jp - ip; in twoway_strstr()
58 ip = jp++; in twoway_strstr()
66 ip = -1; jp in twoway_strstr()
[all...]
/third_party/musl/porting/liteos_m/kernel/src/string/
H A Dstrstr.c36 size_t l, ip, jp, k, p, ms, p0, mem, mem0; in twoway_strstr() local
46 ip = -1; jp = 0; k = p = 1; in twoway_strstr()
47 while (jp+k<l) { in twoway_strstr()
48 if (n[ip+k] == n[jp+k]) { in twoway_strstr()
50 jp += p; in twoway_strstr()
53 } else if (n[ip+k] > n[jp+k]) { in twoway_strstr()
54 jp += k; in twoway_strstr()
56 p = jp - ip; in twoway_strstr()
58 ip = jp++; in twoway_strstr()
66 ip = -1; jp in twoway_strstr()
[all...]
/third_party/mesa3d/src/intel/compiler/
H A Dbrw_fs_scoreboard.cpp183 * instructions only, arbitrarily denoted 'jp' throughout this lowering
198 jp[q] = (p == TGL_PIPE_NONE || (IDX(p) != q && p != TGL_PIPE_ALL) ? in ordered_address()
202 int jp[IDX(TGL_PIPE_ALL)]; member
208 if (jp0.jp[p] != jp1.jp[p]) in operator ==()
221 is_single_pipe(const ordered_address &jp, tgl_pipe p) in is_single_pipe() argument
224 if ((p == TGL_PIPE_NONE || IDX(p) != q) && jp.jp[q] > INT_MIN) in is_single_pipe()
248 ordered_address jp(TGL_PIPE_ALL, 0); in ordered_inst_addresses()
252 jps[ip] = jp; in ordered_inst_addresses()
390 assert(from < n); if (is[from] != from) assign(is[from], to); is[from] = to; } } unsigned *is; unsigned n; }; struct dependency { dependency() : ordered(TGL_REGDIST_NULL), jp(), unordered(TGL_SBID_NULL), id(0), exec_all(false) {} dependency(tgl_regdist_mode mode, const ordered_address &jp, bool exec_all) : ordered(mode), jp(jp), unordered(TGL_SBID_NULL), id(0), exec_all(exec_all) {} dependency(tgl_sbid_mode mode, unsigned id, bool exec_all) : ordered(TGL_REGDIST_NULL), jp(), unordered(mode), id(id), exec_all(exec_all) {} tgl_regdist_mode ordered; ordered_address jp; tgl_sbid_mode unordered; unsigned id; bool exec_all; static const dependency done; friend bool operator==(const dependency &dep0, const dependency &dep1) { return dep0.ordered == dep1.ordered && dep0.jp == dep1.jp && dep0.unordered == dep1.unordered && dep0.id == dep1.id && dep0.exec_all == dep1.exec_all; } friend bool operator!=(const dependency &dep0, const dependency &dep1) { return !(dep0 == dep1); } }; const dependency dependency::done = dependency(TGL_REGDIST_DST, ordered_address(), false); bool is_valid(const dependency &dep) { return dep.ordered || dep.unordered; } dependency merge(equivalence_relation &eq, const dependency &dep0, const dependency &dep1) { dependency dep; if (dep0.ordered || dep1.ordered) { dep.ordered = dep0.ordered | dep1.ordered; for (unsigned p = 0; p < IDX(TGL_PIPE_ALL); p++) dep.jp.jp[p] = MAX2(dep0.jp.jp[p], dep1.jp.jp[p]); } if (dep0.unordered || dep1.unordered) { dep.unordered = dep0.unordered | dep1.unordered; dep.id = eq.link(dep0.unordered ? dep0.id : dep1.id, dep1.unordered ? dep1.id : dep0.id); } dep.exec_all = dep0.exec_all || dep1.exec_all; return dep; } dependency shadow(const dependency &dep0, const dependency &dep1) { if (dep0.ordered == TGL_REGDIST_SRC && is_valid(dep1) && !(dep1.unordered & TGL_SBID_DST) && !(dep1.ordered & TGL_REGDIST_DST)) { dependency dep = dep1; dep.ordered |= dep0.ordered; for (unsigned p = 0; p < IDX(TGL_PIPE_ALL); p++) dep.jp.jp[p] = MAX2(dep.jp.jp[p], dep0.jp.jp[p]); return dep; } else { return is_valid(dep1) ? dep1 : dep0; } } dependency transport(dependency dep, int delta[IDX(TGL_PIPE_ALL)]) { if (dep.ordered) { for (unsigned p = 0; p < IDX(TGL_PIPE_ALL); p++) { if (dep.jp.jp[p] > INT_MIN) dep.jp.jp[p] += delta[p]; } } return dep; } dependency dependency_for_read(dependency dep) { dep.ordered &= TGL_REGDIST_DST; return dep; } dependency dependency_for_write(const struct intel_device_info *devinfo, const fs_inst *inst, dependency dep) { if (!is_unordered(inst) && is_single_pipe(dep.jp, inferred_exec_pipe(devinfo, inst))) dep.ordered &= TGL_REGDIST_DST; return dep; } class scoreboard { public: dependency get(const fs_reg &r) const { if (const dependency *p = const_cast<scoreboard *>(this)->dep(r)) return *p; else return dependency(); } void set(const fs_reg &r, const dependency &d) { if (dependency *p = dep(r)) *p = d; } friend scoreboard merge(equivalence_relation &eq, const scoreboard &sb0, const scoreboard &sb1) { scoreboard sb; for (unsigned i = 0; i < ARRAY_SIZE(sb.grf_deps); i++) sb.grf_deps[i] = merge(eq, sb0.grf_deps[i], sb1.grf_deps[i]); sb.addr_dep = merge(eq, sb0.addr_dep, sb1.addr_dep); sb.accum_dep = merge(eq, sb0.accum_dep, sb1.accum_dep); return sb; } friend scoreboard shadow(const scoreboard &sb0, const scoreboard &sb1) { scoreboard sb; for (unsigned i = 0; i < ARRAY_SIZE(sb.grf_deps); i++) sb.grf_deps[i] = shadow(sb0.grf_deps[i], sb1.grf_deps[i]); sb.addr_dep = shadow(sb0.addr_dep, sb1.addr_dep); sb.accum_dep = shadow(sb0.accum_dep, sb1.accum_dep); return sb; } friend scoreboard transport(const scoreboard &sb0, int delta[IDX(TGL_PIPE_ALL)]) { scoreboard sb; for (unsigned i = 0; i < ARRAY_SIZE(sb.grf_deps); i++) sb.grf_deps[i] = transport(sb0.grf_deps[i], delta); sb.addr_dep = transport(sb0.addr_dep, delta); sb.accum_dep = transport(sb0.accum_dep, delta); return sb; } friend bool operator==(const scoreboard &sb0, const scoreboard &sb1) { for (unsigned i = 0; i < ARRAY_SIZE(sb0.grf_deps); i++) { if (sb0.grf_deps[i] != sb1.grf_deps[i]) return false; } if (sb0.addr_dep != sb1.addr_dep) return false; if (sb0.accum_dep != sb1.accum_dep) return false; return true; } friend bool operator!=(const scoreboard &sb0, const scoreboard &sb1) { return !(sb0 == sb1); } private: dependency grf_deps[BRW_MAX_GRF]; dependency addr_dep; dependency accum_dep; dependency * dep(const fs_reg &r) { const unsigned reg = (r.file == VGRF ? r.nr + r.offset / REG_SIZE : reg_offset(r) / REG_SIZE); return (r.file == VGRF || r.file == FIXED_GRF ? &grf_deps[reg] : r.file == MRF ? &grf_deps[GFX7_MRF_HACK_START + reg] : r.file == ARF && reg >= BRW_ARF_ADDRESS && reg < BRW_ARF_ACCUMULATOR ? &addr_dep : r.file == ARF && reg >= BRW_ARF_ACCUMULATOR && reg < BRW_ARF_FLAG ? &accum_dep : NULL); } }; struct dependency_list { dependency_list() : deps(NULL), n(0) {} ~dependency_list() { free(deps); } void push_back(const dependency &dep) { deps = (dependency *)realloc(deps, (n + 1) * sizeof(*deps)); deps[n++] = dep; } unsigned size() const { return n; } const dependency & operator[](unsigned i) const { assert(i < n); return deps[i]; } dependency & operator[](unsigned i) { assert(i < n); return deps[i]; } private: dependency_list(const dependency_list &); dependency_list & operator=(const dependency_list &); dependency *deps; unsigned n; }; void add_dependency(const unsigned *ids, dependency_list &deps, dependency dep) { if (is_valid(dep)) { if (dep.unordered) dep.id = ids[dep.id]; for (unsigned i = 0; i < deps.size(); i++) { if (deps[i].exec_all != dep.exec_all && (!deps[i].exec_all || (dep.unordered & TGL_SBID_SET)) && (!dep.exec_all || (deps[i].unordered & TGL_SBID_SET))) continue; if (dep.ordered && deps[i].ordered) { for (unsigned p = 0; p < IDX(TGL_PIPE_ALL); p++) deps[i].jp.jp[p] = MAX2(deps[i].jp.jp[p], dep.jp.jp[p]); deps[i].ordered |= dep.ordered; deps[i].exec_all |= dep.exec_all; dep.ordered = TGL_REGDIST_NULL; } if (dep.unordered && deps[i].unordered && deps[i].id == dep.id) { deps[i].unordered |= dep.unordered; deps[i].exec_all |= dep.exec_all; dep.unordered = TGL_SBID_NULL; } } if (is_valid(dep)) deps.push_back(dep); } } tgl_swsb ordered_dependency_swsb(const dependency_list &deps, const ordered_address &jp, bool exec_all) { tgl_pipe p = TGL_PIPE_NONE; unsigned min_dist = ~0u; for (unsigned i = 0; i < deps.size(); i++) { if (deps[i].ordered && exec_all >= deps[i].exec_all) { for (unsigned q = 0; q < IDX(TGL_PIPE_ALL); q++) { const unsigned dist = jp.jp[q] - int64_t(deps[i].jp.jp[q]); const unsigned max_dist = (q == IDX(TGL_PIPE_LONG) ? 14 : 10); assert(jp.jp[q] > deps[i].jp.jp[q]); if (dist <= max_dist) { p = (p && IDX(p) != q ? TGL_PIPE_ALL : tgl_pipe(TGL_PIPE_FLOAT + q)); min_dist = MIN3(min_dist, dist, 7); } } } } return { p ? min_dist : 0, p }; } bool find_ordered_dependency(const dependency_list &deps, const ordered_address &jp, bool exec_all) { return ordered_dependency_swsb(deps, jp, exec_all).regdist; } tgl_sbid_mode find_unordered_dependency(const dependency_list &deps, tgl_sbid_mode unordered, bool exec_all) { if (unordered) { for (unsigned i = 0; i < deps.size(); i++) { if ((unordered & deps[i].unordered) && exec_all >= deps[i].exec_all) return deps[i].unordered; } } return TGL_SBID_NULL; } tgl_sbid_mode baked_unordered_dependency_mode(const struct intel_device_info *devinfo, const fs_inst *inst, const dependency_list &deps, const ordered_address &jp) { const bool exec_all = inst->force_writemask_all; const bool has_ordered = find_ordered_dependency(deps, jp, exec_all); const tgl_pipe ordered_pipe = ordered_dependency_swsb(deps, jp, exec_all).pipe; if (find_unordered_dependency(deps, TGL_SBID_SET, exec_all)) return find_unordered_dependency(deps, TGL_SBID_SET, exec_all); else if (has_ordered && is_unordered(inst)) return TGL_SBID_NULL; else if (find_unordered_dependency(deps, TGL_SBID_DST, exec_all) && (!has_ordered || ordered_pipe == inferred_sync_pipe(devinfo, inst))) return find_unordered_dependency(deps, TGL_SBID_DST, exec_all); else if (!has_ordered) return find_unordered_dependency(deps, TGL_SBID_SRC, exec_all); else return TGL_SBID_NULL; } bool baked_ordered_dependency_mode(const struct intel_device_info *devinfo, const fs_inst *inst, const dependency_list &deps, const ordered_address &jp) { const bool exec_all = inst->force_writemask_all; const bool has_ordered = find_ordered_dependency(deps, jp, exec_all); const tgl_pipe ordered_pipe = ordered_dependency_swsb(deps, jp, exec_all).pipe; const tgl_sbid_mode unordered_mode = baked_unordered_dependency_mode(devinfo, inst, deps, jp); if (!has_ordered) return false; else if (!unordered_mode) return true; else return ordered_pipe == inferred_sync_pipe(devinfo, inst) && unordered_mode == (is_unordered(inst) ? TGL_SBID_SET : TGL_SBID_DST); } void update_inst_scoreboard(const fs_visitor *shader, const ordered_address *jps, const fs_inst *inst, unsigned ip, scoreboard &sb) { const bool exec_all = inst->force_writemask_all; const struct intel_device_info *devinfo = shader->devinfo; const tgl_pipe p = inferred_exec_pipe(devinfo, inst); const ordered_address jp = p ? ordered_address(p, jps[ip].jp[IDX(p)]) : ordered_address(); const bool is_ordered = ordered_unit(devinfo, inst, IDX(TGL_PIPE_ALL)); for (unsigned i = 0; i < inst->sources; i++) { const dependency rd_dep = (inst->is_payload(i) || inst->is_math()) ? dependency(TGL_SBID_SRC, ip, exec_all) : is_ordered ? dependency(TGL_REGDIST_SRC, jp, exec_all) : dependency::done; for (unsigned j = 0; j < regs_read(inst, i); j++) { const fs_reg r = byte_offset(inst->src[i], REG_SIZE * j); sb.set(r, shadow(sb.get(r), rd_dep)); } } if (inst->reads_accumulator_implicitly()) sb.set(brw_acc_reg(8), dependency(TGL_REGDIST_SRC, jp, exec_all)); if (is_send(inst) && inst->base_mrf != -1) { const dependency rd_dep = dependency(TGL_SBID_SRC, ip, exec_all); for (unsigned j = 0; j < inst->mlen; j++) sb.set(brw_uvec_mrf(8, inst->base_mrf + j, 0), rd_dep); } const dependency wr_dep = is_unordered(inst) ? dependency(TGL_SBID_DST, ip, exec_all) : is_ordered ? dependency(TGL_REGDIST_DST, jp, exec_all) : dependency(); if (inst->writes_accumulator_implicitly(devinfo)) sb.set(brw_acc_reg(8), wr_dep); if (is_valid(wr_dep) && inst->dst.file != BAD_FILE && !inst->dst.is_null()) assign() argument
[all...]
/third_party/python/Modules/cjkcodecs/
H A D_codecs_iso2022.c550 /* jp */
612 IMPORT_MAP(jp, jisxcommon, &jisxcommon_encmap, NULL) || in jisx0208_init()
613 IMPORT_MAP(jp, jisx0208, NULL, &jisx0208_decmap))) in jisx0208_init()
653 IMPORT_MAP(jp, jisxcommon, &jisxcommon_encmap, NULL) || in jisx0212_init()
654 IMPORT_MAP(jp, jisx0212, NULL, &jisx0212_decmap))) in jisx0212_init()
691 IMPORT_MAP(jp, jisx0213_bmp, in jisx0213_init()
693 IMPORT_MAP(jp, jisx0213_1_bmp, in jisx0213_init()
695 IMPORT_MAP(jp, jisx0213_2_bmp, in jisx0213_init()
697 IMPORT_MAP(jp, jisx0213_emp, in jisx0213_init()
699 IMPORT_MAP(jp, jisx0213_1_em in jisx0213_init()
[all...]
H A D_codecs_jp.c760 I_AM_A_MODULE_FOR(jp)
/third_party/node/test/parallel/
H A Dtest-stream2-transform.js392 const jp = new Transform({ objectMode: true });
393 jp._transform = function(data, encoding, cb) {
395 jp.push(JSON.parse(data));
412 jp.on('end', function() {
417 jp.write(JSON.stringify(obj));
418 const res = jp.read();
422 jp.end();
424 jp.read();
/third_party/mesa3d/src/freedreno/computerator/examples/
H A Dbranch.asm11 (jp)(rpt5)nop
H A Dearly_preamble.asm20 (jp)nop
/third_party/musl/src/math/i386/
H A Dremquo.s32 jp 1b
/third_party/ffmpeg/libavcodec/arm/
H A Dvideodsp_armv5te.S3 @ Copyright (c) 2004 AGAWA Koji <i (AT) atty (DOT) jp>
H A Didctdsp_arm.S3 @ Copyright (c) 2004 AGAWA Koji <i (AT) atty (DOT) jp>
H A Dhpeldsp_arm.S3 @ Copyright (c) 2004 AGAWA Koji <i (AT) atty (DOT) jp>
/third_party/jerryscript/jerry-libm/
H A Dtrig.c124 * jp jp+1 is the number of terms in PIo2[] needed, jp = jk.
192 int jz, jx, jv, jp, jk, carry, n, iq[20], i, j, k, m, q0, ih; in __kernel_rem_pio2() local
197 jp = jk; in __kernel_rem_pio2()
368 /* compute PIo2[0, ..., jp] * q[jz, ..., 0] */ in __kernel_rem_pio2()
371 for (fw = 0.0, k = 0; k <= jp && k <= jz - i; k++) in __kernel_rem_pio2()
/third_party/musl/porting/liteos_a/kernel/src/math/
H A D__rem_pio2_large.c96 * jp jp+1 is the number of terms in PIo2[] needed, jp = jk.
275 int32_t jz,jx,jv,jp,jk,carry,n,iq[20],i,j,k,m,q0,ih; in __rem_pio2_large() local
280 jp = jk; in __rem_pio2_large()
394 /* compute PIo2[0,...,jp]*q[jz,...,0] */ in __rem_pio2_large()
396 for (fw=0.0,k=0; k<=jp && k<=jz-i; k++) in __rem_pio2_large()
/third_party/musl/src/math/
H A D__rem_pio2_large.c96 * jp jp+1 is the number of terms in PIo2[] needed, jp = jk.
275 int32_t jz,jx,jv,jp,jk,carry,n,iq[20],i,j,k,m,q0,ih; in __rem_pio2_large() local
280 jp = jk; in __rem_pio2_large()
394 /* compute PIo2[0,...,jp]*q[jz,...,0] */ in __rem_pio2_large()
396 for (fw=0.0,k=0; k<=jp && k<=jz-i; k++) in __rem_pio2_large()
/third_party/ffmpeg/libavcodec/
H A Dffv1enc.c824 int jp = 0; in encode_init() local
830 s->initial_states[i][jp][k] = in encode_init()
832 for(jp++; jp<j; jp++) in encode_init()
833 s->initial_states[i][jp][k] = s->initial_states[i][jp-1][k]; in encode_init()
/third_party/icu/icu4c/source/data/mappings/
H A Ducmfiles.mk122 euc-jp-2007.ucm\
/third_party/skia/third_party/externals/icu/source/data/mappings/
H A Ducmfiles.mk122 euc-jp-2007.ucm\
/third_party/node/deps/v8/src/base/
H A Dieee754.cc422 * jp jp+1 is the number of terms in PIo2[] needed, jp = jk.
470 int32_t jz, jx, jv, jp, jk, carry, n, iq[20], i, j, k, m, q0, ih; in __kernel_rem_pio2() local
475 jp = jk; in __kernel_rem_pio2()
599 /* compute PIo2[0,...,jp]*q[jz,...,0] */ in __kernel_rem_pio2()
601 for (fw = 0.0, k = 0; k <= jp && k <= jz - i; k++) fw += PIo2[k] * q[i + k]; in __kernel_rem_pio2()
/third_party/mesa3d/src/mesa/x86/
H A Dassyntax.h493 #define JP(a) CHOICE(jp a, jp a, jp a)
1212 #define JP(a) jp NEAR a
/third_party/ffmpeg/libavutil/x86/
H A Dx86inc.asm696 BRANCH_INSTR jz, je, jnz, jne, jl, jle, jnl, jnle, jg, jge, jng, jnge, ja, jae, jna, jnae, jb, jbe, jnb, jnbe, jc, jnc, js, jns, jo, jno, jp, jnp

Completed in 24 milliseconds