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

12

/xsrc/external/mit/MesaLib.old/dist/src/gallium/drivers/nouveau/codegen/
H A Dnv50_ir_graph.cpp131 EdgeIterator ei = this->outgoing(); local in function:nv50_ir::Graph::Node::detach
132 for (; !ei.end(); ei.next())
133 if (ei.getNode() == node)
135 if (ei.end()) {
139 delete ei.getEdge();
186 for (EdgeIterator ei = pos->outgoing(); !ei.end(); ei.next()) { local in function:nv50_ir::Graph::Node::reachableBy
187 if (ei
225 for (Graph::EdgeIterator ei = node->outgoing(); !ei.end(); ei.next()) local in function:nv50_ir::DFSIterator::search
300 for (Graph::EdgeIterator ei = node->outgoing(); !ei.end(); ei.next()) { local in function:nv50_ir::CFGIterator::search
418 for (EdgeIterator ei = c->outgoing(); !ei.end(); ei.next()) { local in function:nv50_ir::Graph::findLightestPathWeight
[all...]
H A Dnv50_ir_ssa.cpp102 for (Graph::EdgeIterator ei = node->outgoing(); !ei.end(); ei.next()) { local in function:nv50_ir::DominatorTree::buildDFS
103 if (SEMI(ei.getNode()->tag) < 0) {
104 buildDFS(ei.getNode());
105 PARENT(ei.getNode()->tag) = node->tag;
145 for (Graph::EdgeIterator ei = nw->incident(); !ei.end(); ei.next()) { local in function:nv50_ir::DominatorTree::build
146 nv = ei
230 for (Graph::EdgeIterator ei = bb->cfg.outgoing(); !ei.end(); ei.next()) { local in function:nv50_ir::Function::buildLiveSetsPreSSA
271 for (Graph::EdgeIterator ei = bb->cfg.incident(); !ei.end(); ei.next()) { local in function:nv50_ir::Function::buildDefSetsPreSSA
503 for (Graph::EdgeIterator ei = bb->cfg.outgoing(); !ei.end(); ei.next()) { local in function:nv50_ir::RenamePass::search
509 for (Graph::EdgeIterator ei = sb->cfg.incident(); !ei.end(); ei.next()) { local in function:nv50_ir::RenamePass::search
525 for (Graph::EdgeIterator ei = bb->dom.outgoing(); !ei.end(); ei.next()) local in function:nv50_ir::RenamePass::search
[all...]
H A Dnv50_ir_graph.h220 for (EdgeIterator ei = incident(); !ei.end(); ei.next()) local in function:nv50_ir::Graph::Node::incidentCountFwd
221 if (ei.getType() != Edge::BACK)
H A Dnv50_ir_ra.cpp359 for (Graph::EdgeIterator ei = p->cfg.outgoing(); !ei.end(); ei.next()) local in function:nv50_ir::RegAlloc::PhiMovesPass::needNewElseBlock
360 if (ei.getType() == Graph::Edge::TREE ||
361 ei.getType() == Graph::Edge::FORWARD)
388 Graph::EdgeIterator ei; local in function:nv50_ir::RegAlloc::PhiMovesPass::splitEdges
392 for (ei = bb->cfg.incident(); !ei.end(); ei.next()) {
393 pb = BasicBlock::get(ei
466 for (Graph::EdgeIterator ei = bb->cfg.incident(); !ei.end(); ei.next()) { local in function:nv50_ir::RegAlloc::PhiMovesPass::visit
568 for (Graph::EdgeIterator ei = bb->cfg.outgoing(); !ei.end(); ei.next()) { local in function:nv50_ir::RegAlloc::buildLiveSets
626 for (Graph::EdgeIterator ei = bb->cfg.outgoing(); !ei.end(); ei.next()) { local in function:nv50_ir::RegAlloc::BuildIntervalsPass::collectLiveValues
653 for (Graph::EdgeIterator ei = bb->cfg.outgoing(); !ei.end(); ei.next()) { local in function:nv50_ir::RegAlloc::BuildIntervalsPass::visit
742 get(const Graph::EdgeIterator & ei) argument
851 for (Graph::EdgeIterator ei = nodes[i].outgoing(); !ei.end(); ei.next()) local in function:nv50_ir::GCRA::printNodeInfo
853 for (Graph::EdgeIterator ei = nodes[i].incident(); !ei.end(); ei.next()) local in function:nv50_ir::GCRA::printNodeInfo
1309 for (Graph::EdgeIterator ei = node->outgoing(); !ei.end(); ei.next()) local in function:nv50_ir::GCRA::simplifyNode
1312 for (Graph::EdgeIterator ei = node->incident(); !ei.end(); ei.next()) local in function:nv50_ir::GCRA::simplifyNode
1362 checkInterference(const RIG_Node * node,Graph::EdgeIterator & ei) argument
1427 for (Graph::EdgeIterator ei = node->outgoing(); !ei.end(); ei.next()) local in function:nv50_ir::GCRA::selectRegisters
1429 for (Graph::EdgeIterator ei = node->incident(); !ei.end(); ei.next()) local in function:nv50_ir::GCRA::selectRegisters
[all...]
H A Dnv50_ir_print.cpp789 for (Graph::EdgeIterator ei = bb->cfg.incident(); !ei.end(); ei.next())
791 BasicBlock::get(ei.getNode())->getId(),
792 ei.getEdge()->typeStr());
805 for (Graph::EdgeIterator ei = bb->cfg.outgoing(); !ei.end(); ei.next()) local in function:nv50_ir::PrintPass::visit
807 BasicBlock::get(ei.getNode())->getId(),
808 ei
[all...]
H A Dnv50_ir_bb.cpp378 for (Graph::EdgeIterator ei = cfg.outgoing(); !ei.end(); ei.next()) local in function:nv50_ir::BasicBlock::initiatesSimpleConditional
379 out[n++] = ei.getNode();
524 for (Graph::EdgeIterator ei = bb->cfg.outgoing(); !ei.end(); ei.next()) { local in function:nv50_ir::Function::printCFGraph
525 int idB = BasicBlock::get(ei.getNode())->getId();
526 switch (ei.getType()) {
H A Dnv50_ir_lowering_nvc0.cpp476 for (Graph::EdgeIterator ei = bb->cfg.outgoing(); !ei.end(); ei.next()) { local in function:nv50_ir::NVC0LegalizePostRA::findFirstUsesBB
477 findFirstUsesBB(minGPR, maxGPR, BasicBlock::get(ei.getNode())->getEntry(),
625 for (Graph::EdgeIterator ei = n->incident(); !ei.end(); ei.next()) { local in function:nv50_ir::NVC0LegalizePostRA::insertTextureBarriers
626 BasicBlock *in = BasicBlock::get(ei.getNode());
720 Graph::EdgeIterator ei = bb->cfg.incident(); local in function:nv50_ir::NVC0LegalizePostRA::tryReplaceContWithBra
721 if (ei
744 for (Graph::EdgeIterator ei = bb->cfg.incident(); !ei.end(); ei.next()) { local in function:nv50_ir::NVC0LegalizePostRA::propagateJoin
[all...]
H A Dnv50_ir_emit_gm107.cpp4420 for (Graph::EdgeIterator ei = bb->cfg.incident(); !ei.end(); ei.next()) { local in function:nv50_ir::SchedDataCalculatorGM107::visit
4422 if (ei.getType() == Graph::Edge::BACK) // sched would be uninitialized
4424 BasicBlock *in = BasicBlock::get(ei.getNode());
4478 for (Graph::EdgeIterator ei = bb->cfg.outgoing(); !ei.end(); ei.next()) { local in function:nv50_ir::SchedDataCalculatorGM107::visit
4479 BasicBlock *out = BasicBlock::get(ei.getNode());
4481 if (ei
[all...]
/xsrc/external/mit/MesaLib/dist/src/gallium/drivers/nouveau/codegen/
H A Dnv50_ir_graph.cpp131 EdgeIterator ei = this->outgoing(); local in function:nv50_ir::Graph::Node::detach
132 for (; !ei.end(); ei.next())
133 if (ei.getNode() == node)
135 if (ei.end()) {
139 delete ei.getEdge();
186 for (EdgeIterator ei = pos->outgoing(); !ei.end(); ei.next()) { local in function:nv50_ir::Graph::Node::reachableBy
187 if (ei
225 for (Graph::EdgeIterator ei = node->outgoing(); !ei.end(); ei.next()) local in function:nv50_ir::DFSIterator::search
300 for (Graph::EdgeIterator ei = node->outgoing(); !ei.end(); ei.next()) { local in function:nv50_ir::CFGIterator::search
413 for (EdgeIterator ei = c->outgoing(); !ei.end(); ei.next()) { local in function:nv50_ir::Graph::findLightestPathWeight
[all...]
H A Dnv50_ir_ssa.cpp102 for (Graph::EdgeIterator ei = node->outgoing(); !ei.end(); ei.next()) { local in function:nv50_ir::DominatorTree::buildDFS
103 if (SEMI(ei.getNode()->tag) < 0) {
104 buildDFS(ei.getNode());
105 PARENT(ei.getNode()->tag) = node->tag;
145 for (Graph::EdgeIterator ei = nw->incident(); !ei.end(); ei.next()) { local in function:nv50_ir::DominatorTree::build
146 nv = ei
230 for (Graph::EdgeIterator ei = bb->cfg.outgoing(); !ei.end(); ei.next()) { local in function:nv50_ir::Function::buildLiveSetsPreSSA
271 for (Graph::EdgeIterator ei = bb->cfg.incident(); !ei.end(); ei.next()) { local in function:nv50_ir::Function::buildDefSetsPreSSA
503 for (Graph::EdgeIterator ei = bb->cfg.outgoing(); !ei.end(); ei.next()) { local in function:nv50_ir::RenamePass::search
509 for (Graph::EdgeIterator ei = sb->cfg.incident(); !ei.end(); ei.next()) { local in function:nv50_ir::RenamePass::search
525 for (Graph::EdgeIterator ei = bb->dom.outgoing(); !ei.end(); ei.next()) local in function:nv50_ir::RenamePass::search
[all...]
H A Dnv50_ir_graph.h219 for (EdgeIterator ei = incident(); !ei.end(); ei.next()) local in function:nv50_ir::Graph::Node::incidentCountFwd
220 if (ei.getType() != Edge::BACK)
H A Dnv50_ir_ra.cpp404 for (Graph::EdgeIterator ei = p->cfg.outgoing(); !ei.end(); ei.next()) local in function:nv50_ir::RegAlloc::PhiMovesPass::needNewElseBlock
405 if (ei.getType() == Graph::Edge::TREE ||
406 ei.getType() == Graph::Edge::FORWARD)
433 Graph::EdgeIterator ei; local in function:nv50_ir::RegAlloc::PhiMovesPass::splitEdges
437 for (ei = bb->cfg.incident(); !ei.end(); ei.next()) {
438 pb = BasicBlock::get(ei
511 for (Graph::EdgeIterator ei = bb->cfg.incident(); !ei.end(); ei.next()) { local in function:nv50_ir::RegAlloc::PhiMovesPass::visit
613 for (Graph::EdgeIterator ei = bb->cfg.outgoing(); !ei.end(); ei.next()) { local in function:nv50_ir::RegAlloc::buildLiveSets
671 for (Graph::EdgeIterator ei = bb->cfg.outgoing(); !ei.end(); ei.next()) { local in function:nv50_ir::RegAlloc::BuildIntervalsPass::collectLiveValues
696 for (Graph::EdgeIterator ei = bb->cfg.outgoing(); !ei.end(); ei.next()) { local in function:nv50_ir::RegAlloc::BuildIntervalsPass::visit
785 get(const Graph::EdgeIterator & ei) argument
896 for (Graph::EdgeIterator ei = nodes[i].outgoing(); !ei.end(); ei.next()) local in function:nv50_ir::GCRA::printNodeInfo
898 for (Graph::EdgeIterator ei = nodes[i].incident(); !ei.end(); ei.next()) local in function:nv50_ir::GCRA::printNodeInfo
1358 for (Graph::EdgeIterator ei = node->outgoing(); !ei.end(); ei.next()) local in function:nv50_ir::GCRA::simplifyNode
1361 for (Graph::EdgeIterator ei = node->incident(); !ei.end(); ei.next()) local in function:nv50_ir::GCRA::simplifyNode
1411 checkInterference(const RIG_Node * node,Graph::EdgeIterator & ei) argument
1476 for (Graph::EdgeIterator ei = node->outgoing(); !ei.end(); ei.next()) local in function:nv50_ir::GCRA::selectRegisters
1478 for (Graph::EdgeIterator ei = node->incident(); !ei.end(); ei.next()) local in function:nv50_ir::GCRA::selectRegisters
[all...]
H A Dnv50_ir_bb.cpp378 for (Graph::EdgeIterator ei = cfg.outgoing(); !ei.end(); ei.next()) local in function:nv50_ir::BasicBlock::initiatesSimpleConditional
379 out[n++] = ei.getNode();
524 for (Graph::EdgeIterator ei = bb->cfg.outgoing(); !ei.end(); ei.next()) { local in function:nv50_ir::Function::printCFGraph
525 int idB = BasicBlock::get(ei.getNode())->getId();
526 switch (ei.getType()) {
H A Dnv50_ir_print.cpp829 for (Graph::EdgeIterator ei = bb->cfg.incident(); !ei.end(); ei.next())
831 BasicBlock::get(ei.getNode())->getId(),
832 ei.getEdge()->typeStr());
845 for (Graph::EdgeIterator ei = bb->cfg.outgoing(); !ei.end(); ei.next()) local in function:nv50_ir::PrintPass::visit
847 BasicBlock::get(ei.getNode())->getId(),
848 ei
[all...]
H A Dnv50_ir_lowering_nvc0.cpp487 for (Graph::EdgeIterator ei = bb->cfg.outgoing(); !ei.end(); ei.next()) { local in function:nv50_ir::NVC0LegalizePostRA::findFirstUsesBB
488 findFirstUsesBB(minGPR, maxGPR, BasicBlock::get(ei.getNode())->getEntry(),
636 for (Graph::EdgeIterator ei = n->incident(); !ei.end(); ei.next()) { local in function:nv50_ir::NVC0LegalizePostRA::insertTextureBarriers
637 BasicBlock *in = BasicBlock::get(ei.getNode());
731 Graph::EdgeIterator ei = bb->cfg.incident(); local in function:nv50_ir::NVC0LegalizePostRA::tryReplaceContWithBra
732 if (ei
755 for (Graph::EdgeIterator ei = bb->cfg.incident(); !ei.end(); ei.next()) { local in function:nv50_ir::NVC0LegalizePostRA::propagateJoin
[all...]
/xsrc/external/mit/MesaLib.old/dist/src/gallium/auxiliary/draw/
H A Ddraw_pt_fetch.c67 unsigned i, nr = 0, ei = 0; local in function:draw_pt_fetch_prepare
97 key.element[nr].input_format = draw->pt.vertex_element[ei].src_format;
98 key.element[nr].input_buffer = draw->pt.vertex_element[ei].vertex_buffer_index;
99 key.element[nr].input_offset = draw->pt.vertex_element[ei].src_offset;
100 key.element[nr].instance_divisor = draw->pt.vertex_element[ei].instance_divisor;
104 ei++;
108 key.element[nr].input_format = draw->pt.vertex_element[ei].src_format;
109 key.element[nr].input_buffer = draw->pt.vertex_element[ei].vertex_buffer_index;
110 key.element[nr].input_offset = draw->pt.vertex_element[ei].src_offset;
111 key.element[nr].instance_divisor = draw->pt.vertex_element[ei]
[all...]
/xsrc/external/mit/MesaLib/dist/src/gallium/auxiliary/draw/
H A Ddraw_pt_fetch.c62 unsigned i, nr = 0, ei = 0; local in function:draw_pt_fetch_prepare
92 key.element[nr].input_format = draw->pt.vertex_element[ei].src_format;
93 key.element[nr].input_buffer = draw->pt.vertex_element[ei].vertex_buffer_index;
94 key.element[nr].input_offset = draw->pt.vertex_element[ei].src_offset;
95 key.element[nr].instance_divisor = draw->pt.vertex_element[ei].instance_divisor;
99 ei++;
103 key.element[nr].input_format = draw->pt.vertex_element[ei].src_format;
104 key.element[nr].input_buffer = draw->pt.vertex_element[ei].vertex_buffer_index;
105 key.element[nr].input_offset = draw->pt.vertex_element[ei].src_offset;
106 key.element[nr].instance_divisor = draw->pt.vertex_element[ei]
[all...]
/xsrc/external/mit/MesaLib/dist/src/gallium/drivers/etnaviv/
H A Detnaviv_compiler_nir_emit.c129 struct etna_op_info ei = etna_ops[op]; local in function:etna_emit_alu
132 if (ei.opcode == 0xff)
136 .opcode = ei.opcode,
137 .type = ei.type,
138 .cond = ei.cond,
186 unsigned i = ((ei.src >> j*2) & 3);
/xsrc/external/mit/MesaLib.old/dist/src/gallium/drivers/llvmpipe/
H A Dlp_rast_tri_tmp.h92 const int32_t ei = (dcdy + dcdx - cox) << 2; local in function:TAG
96 cdiff = ei - cox_s + ((int32_t)((c[j] - 1) >> (int64_t)FIXED_ORDER) -
104 const int32_t ei = plane[j].dcdy - plane[j].dcdx - (int64_t)plane[j].eo;
105 const int64_t cio = IMUL64(ei, 4) - 1;
219 const int32_t ei = (dcdy + dcdx - cox) << 4; local in function:TAG
248 cdiff = ei - cox_s + ((int32_t)((c[j] - 1) >> (int64_t)FIXED_ORDER) -
256 const int32_t ei = plane[j].dcdy - plane[j].dcdx - (int32_t)plane[j].eo;
257 const int32_t cio = (ei << 4) - 1;
H A Dlp_setup_tri.c467 /* ei = _mm_sub_epi32(_mm_sub_epi32(dcdy, dcdx), eo); */
568 /* ei = _mm_sub_epi32(_mm_sub_epi32(dcdy, dcdx), eo); */
871 int64_t ei[MAX_PLANES]; local in function:lp_setup_bin_triangle
888 ei[i] = (plane[i].dcdy -
919 int64_t planepartial = cx[i] + ei[i] - 1;
/xsrc/external/mit/MesaLib/dist/src/gallium/drivers/llvmpipe/
H A Dlp_rast_tri_tmp.h113 const int32_t ei = (dcdy + dcdx - cox) << 2; local in function:TAG
117 cdiff = ei - cox_s + ((int32_t)((c[j] - 1) >> (int64_t)FIXED_ORDER) -
125 const int32_t ei = plane[j].dcdy - plane[j].dcdx - (int64_t)plane[j].eo;
126 const int64_t cio = IMUL64(ei, 4) - 1;
240 const int32_t ei = (dcdy + dcdx - cox) << 4; local in function:TAG
269 cdiff = ei - cox_s + ((int32_t)((c[j] - 1) >> (int64_t)FIXED_ORDER) -
277 const int32_t ei = plane[j].dcdy - plane[j].dcdx - (int32_t)plane[j].eo;
278 const int32_t cio = (ei << 4) - 1;
/xsrc/external/mit/xf86-video-r128/dist/src/
H A Dr128_output.c304 struct wsdisplayio_edid_info ei; local in function:R128DisplayDDCConnected
309 ei.edid_data = buffer;
310 ei.buffer_size = 1024;
311 if (ioctl(xf86Info.consoleFd, WSDISPLAYIO_GET_EDID, &ei) != -1) {
313 ei.data_size);
/xsrc/external/mit/xf86-video-nv/dist/src/
H A Dnv_setup.c248 struct wsdisplayio_edid_info ei; local in function:NVProbeDDC
253 ei.edid_data = buffer;
254 ei.buffer_size = 1024;
255 if (ioctl(xf86Info.consoleFd, WSDISPLAYIO_GET_EDID, &ei) != -1) {
257 ei.data_size);
/xsrc/external/mit/fontconfig/dist/src/
H A Dfcname.c375 int si, ei; local in function:FcNameConvert
382 FcNameConstantWithObjectCheck ((const FcChar8 *) ec, object, &ei))
383 v.u.r = FcRangeCreateDouble (si, ei);
/xsrc/external/mit/xf86-video-mach64/dist/src/
H A Datipreinit.c712 struct wsdisplayio_edid_info ei; local in function:ATIPreInit
716 ei.edid_data = buffer;
717 ei.buffer_size = 1024;
718 if (ioctl(xf86Info.consoleFd, WSDISPLAYIO_GET_EDID, &ei) != -1) {
719 xf86Msg(X_INFO, "got %d bytes worth of EDID from wsdisplay\n", ei.data_size);

Completed in 29 milliseconds

12