HomeSort by: relevance | last modified time | path
    Searched defs:that (Results 1 - 5 of 5) sorted by relevancy

  /xsrc/external/mit/xterm/dist/
precompose.c 1053 unsigned long that = ((unsigned long) precompositions[mid].base << UNICODE_SHIFT) | ((unsigned) precompositions[mid].comb); local
1054 if (that < sought) {
1056 } else if (that > sought) {
  /xsrc/external/mit/MesaLib/dist/src/gallium/drivers/nouveau/codegen/
nv50_ir.cpp 94 // more of a hint; applying a modifier makes use of that hint.
164 // including the source modifiers, i.e. make sure that all uses support
259 LValue *that = new_LValue(pol.context(), reg.file); local
261 pol.set<Value>(this, that);
263 that->reg.size = this->reg.size;
264 that->reg.type = this->reg.type;
265 that->reg.data = this->reg.data;
267 return that;
298 Symbol *that = new_Symbol(prog, reg.file, reg.fileIndex); local
300 pol.set<Value>(this, that);
371 ImmediateValue *that = new_ImmediateValue(prog, 0u); local
    [all...]
nv50_ir_peephole.cpp 127 // For SPLIT / MERGE pairs that operate on the same registers, replace the
208 // arguments as that will confuse the fixup code.
215 // Swap sources to inline the less frequently used source. That way,
722 // the second argument will not be constant, but that can happen.
1305 // sign. The only odd case is MIN_INT, but that should work out
1328 // In this case, we still want the optimized lowering that we get
1337 // TODO: Check that target supports this. In this case, we know that
1362 // If there is a negative modifier, we need to undo that, by flipping
1367 // boolean, i.e. 0/-1. However the rest of the logic assumes that tru
3108 Record that; local
    [all...]
  /xsrc/external/mit/MesaLib.old/dist/src/gallium/drivers/nouveau/codegen/
nv50_ir.cpp 95 // more of a hint; applying a modifier makes use of that hint.
165 // including the source modifiers, i.e. make sure that all uses support
260 LValue *that = new_LValue(pol.context(), reg.file); local
262 pol.set<Value>(this, that);
264 that->reg.size = this->reg.size;
265 that->reg.type = this->reg.type;
266 that->reg.data = this->reg.data;
268 return that;
297 Symbol *that = new_Symbol(prog, reg.file, reg.fileIndex); local
299 pol.set<Value>(this, that);
370 ImmediateValue *that = new_ImmediateValue(prog, 0u); local
    [all...]
nv50_ir_peephole.cpp 127 // For SPLIT / MERGE pairs that operate on the same registers, replace the
208 // arguments as that will confuse the fixup code.
215 // Swap sources to inline the less frequently used source. That way,
706 // the second argument will not be constant, but that can happen.
1269 // sign. The only odd case is MIN_INT, but that should work out
1292 // In this case, we still want the optimized lowering that we get
1301 // TODO: Check that target supports this. In this case, we know that
1326 // If there is a negative modifier, we need to undo that, by flipping
1331 // boolean, i.e. 0/-1. However the rest of the logic assumes that tru
3045 Record that; local
    [all...]

Completed in 13 milliseconds