search for: op_xor

...50_ir_lowering_nv50.cpp @@ -1094,8 +1094,9 @@ NV50LoweringPreSSA::handleRDSV(Instruction *i) case SV_FACE: bld.mkInterp(NV50_IR_INTERP_FLAT, def, addr, NULL); if (i->dType == TYPE_F32) { - bld.mkOp2(OP_AND, TYPE_U32, def, def, bld.mkImm(0x80000000)); - bld.mkOp2(OP_XOR, TYPE_U32, def, def, bld.mkImm(0xbf800000)); + bld.mkOp2(OP_OR, TYPE_U32, def, def, bld.mkImm(0x00000001)); + bld.mkOp1(OP_NEG, TYPE_S32, def, def); + bld.mkCvt(OP_CVT, TYPE_F32, def, TYPE_S32, def); } break; case SV_NCTAID: diff --git a/src/gallium/drivers...

...as additional codes for the Norwegian stemmer. * Xapian::QueryParser now correctly parses a wildcarded term in between two other terms (ticket#484). Matcher: * OP_OR could skip a matching document if it decayed to OP_AND or OP_AND_MAYBE during the match in some cases. Fixes ticket#476. * OP_XOR with non-leaf subqueries could skip matching documents in some cases, and OP_XOR of three or more sub-queries could return incorrect weights. Fixes ticket#475. * OP_OR is now more efficient if a subquery is potentially expensive (e.g. OP_VALUE_RANGE, OP_NEAR, OP_PHRASE, PostingSource). A 10...

...str->op_end(); I!=E;++I){ std::cerr<<*I; } From either a or b, I could get each element of Global Variable. Supposedly, I will use my arithmetic like XOR etc to encode/hide the string. But I cannot use XOR, I mean I tried (*I)^0x33, it doesn't work. I tried op_xor, but I don't know how to use it. For C level, it is really staightforward. But here, I don't know how to do it. It should be easy way to do it. But I spent several hours on it. For simplifing prolem, I also tried to do the way like a[i]=a[i]+1; but I failed. Shy. > 2. Construct...

...eld inconsistent results. What I am trying to point out is that we need start to think about using natural language processing when placing infrastructure for Xapian. So far we have the following OP_AND, OP_AND_MAYBE, OP_AND_NOT, OP_ELITE_SET, OP_FILTER, OP_NEAR, OP_OR, OP_PHRASE, OP_VALUE_RANGE, OP_XOR search operators and we could add one more OP_NLP. What we can do now is to implement OP_NLP to tagged nouns, adjectives, adverbs, punctuations, foreign words etc. Calculate relation between them and assign boost value to the most occurred terms in query for example noun. Search query example: W...

...* predicate/cc ******************************************************************************/ +void +CodeEmitterGM107::emitPSETP() +{ + + emitInsn(0x50900000); + + switch (insn->op) { + case OP_AND: emitField(0x18, 3, 0); break; + case OP_OR: emitField(0x18, 3, 1); break; + case OP_XOR: emitField(0x18, 3, 2); break; + default: + assert(!"unexpected operation"); + break; + } + + // emitINV (0x2a); + emitPRED(0x27); // TODO: support 3-arg + emitINV (0x20, insn->src(1)); + emitPRED(0x1d, insn->src(1)); + emitINV (0x0f, insn->src(0)); + em...

...+ + // NOTE: this logic uses predicates because splitting basic blocks is + // ~impossible during the SSA phase. The RA relies on a correlation + // between edge order and phi node sources. + + // Set the sign of the result based on the inputs + bld->mkOp2(OP_XOR, fTy, NULL, mul->getSrc(0), mul->getSrc(1)) + ->setFlagsDef(0, (cc[0] = bld->getSSA(1, FILE_FLAGS))); + + // 1s complement of 64-bit value + bld->mkOp1(OP_NOT, fTy, rr[0], r[4]) + ->setPredicate(CC_S, cc[0]); + bld->mkOp1(OP_NOT, fT...

...qs.begin(); sq != subqs.end(); sq++) + delete *sq; + subqs.clear(); + op = OP_MATCH_NOTHING; + return; + } + } + break; + case OP_ELITE_SET: + case OP_OR: + case OP_XOR: + // Doing an "OR" type operation - if we've got any MATCH_NOTHING + // subnodes, drop them; except that we mustn't become an empty + // node due to this, so we never drop a MATCH_NOTHING subnode + // if it's the only subnode. +...