HomeSort by relevance Sort by last modified time
    Searched full:texes (Results 1 - 2 of 2) sorted by null

  /external/chromium_org/third_party/mesa/src/src/gallium/drivers/nvc0/codegen/
nv50_ir_lowering_nvc0.cpp 224 // if (!isTextureOp(insn->op)) // TODO: are TEXes always ordered ?
269 // 1. obtain a list of TEXes and their outputs' first use(s)
270 // 2. calculate the barrier level of each first use (minimal number of TEXes,
278 std::vector<Instruction *> texes; local
302 texes.push_back(tex);
304 bbFirstTex[tex->bb->getId()] = texes.size() - 1;
309 if (texes.empty())
311 uses = new std::list<TexUse>[texes.size()];
314 for (size_t i = 0; i < texes.size(); ++i)
315 findFirstUses(texes[i], texes[i], uses[i])
    [all...]
  /external/mesa3d/src/gallium/drivers/nvc0/codegen/
nv50_ir_lowering_nvc0.cpp 224 // if (!isTextureOp(insn->op)) // TODO: are TEXes always ordered ?
269 // 1. obtain a list of TEXes and their outputs' first use(s)
270 // 2. calculate the barrier level of each first use (minimal number of TEXes,
278 std::vector<Instruction *> texes; local
302 texes.push_back(tex);
304 bbFirstTex[tex->bb->getId()] = texes.size() - 1;
309 if (texes.empty())
311 uses = new std::list<TexUse>[texes.size()];
314 for (size_t i = 0; i < texes.size(); ++i)
315 findFirstUses(texes[i], texes[i], uses[i])
    [all...]

Completed in 3220 milliseconds