Searched refs:bb_node (Results 1 - 22 of 22) sorted by relevance

/xsrc/external/mit/MesaLib.old/dist/src/gallium/drivers/r600/sb/
H A Dsb_pass.cpp83 bool vpass::visit(bb_node& n, bool enter) { return true; }
H A Dsb_gcm.cpp115 o.top_bb = o.bottom_bb = static_cast<bb_node*>(c);
148 bb_node* bb = static_cast<bb_node*>(*I);
161 void gcm::td_schedule(bb_node *bb, node *n) {
175 void gcm::td_sched_bb(bb_node* bb) {
262 bb_node* bb = static_cast<bb_node*>(*I);
285 void gcm::bu_sched_bb(bb_node* bb) {
601 bb_node* best_bb = bu_bb;
602 bb_node* top_b
[all...]
H A Dsb_pass.h70 virtual bool visit(bb_node &n, bool enter);
188 virtual bool visit(bb_node &n, bool enter);
230 bb_node* top_bb;
231 bb_node* bottom_bb;
247 bb_node * bu_bb;
279 void td_sched_bb(bb_node *bb);
283 void td_schedule(bb_node *bb, node *n);
286 void bu_sched_bb(bb_node *bb);
373 virtual bool visit(bb_node &n, bool enter);
H A Dsb_sched.h257 bb_node *cur_bb;
276 bool schedule_bb(bb_node *bb);
H A Dsb_shader.cpp334 bb_node* shader::create_bb(unsigned id, unsigned loop_level) {
335 bb_node* n = new (pool.allocate(sizeof(bb_node))) bb_node(id, loop_level);
538 bb_node *bb = create_bb(bbs.size(), loop_level);
564 bb_node *bb = create_bb(bbs.size(), loop_level);
575 bb_node *bb = create_bb(bbs.size(), loop_level);
585 bb_node *b = *I;
H A Dsb_liveness.cpp51 bool liveness::visit(bb_node& n, bool enter) {
H A Dsb_shader.h370 bb_node* create_bb(unsigned id, unsigned loop_level);
H A Dsb_ir.h1161 class bb_node : public container_node { class in namespace:r600_sb
1163 bb_node(unsigned id, unsigned loop_level) function in class:r600_sb::bb_node
1176 typedef std::vector<bb_node*> bbs_vec;
H A Dsb_dump.cpp86 bool dump::visit(bb_node& n, bool enter) {
H A Dsb_sched.cpp729 bb_node* bb = static_cast<bb_node*>(*I);
770 bool post_scheduler::schedule_bb(bb_node* bb) {
H A Dsb_ir.cpp49 bool bb_node::accept(vpass& p, bool enter) { return p.visit(*this, enter); }
/xsrc/external/mit/MesaLib/dist/src/gallium/drivers/r600/sb/
H A Dsb_pass.cpp83 bool vpass::visit(bb_node& n, bool enter) { return true; }
H A Dsb_gcm.cpp115 o.top_bb = o.bottom_bb = static_cast<bb_node*>(c);
148 bb_node* bb = static_cast<bb_node*>(*I);
161 void gcm::td_schedule(bb_node *bb, node *n) {
175 void gcm::td_sched_bb(bb_node* bb) {
262 bb_node* bb = static_cast<bb_node*>(*I);
285 void gcm::bu_sched_bb(bb_node* bb) {
601 bb_node* best_bb = bu_bb;
602 bb_node* top_b
[all...]
H A Dsb_pass.h70 virtual bool visit(bb_node &n, bool enter);
188 virtual bool visit(bb_node &n, bool enter);
230 bb_node* top_bb;
231 bb_node* bottom_bb;
247 bb_node * bu_bb;
279 void td_sched_bb(bb_node *bb);
283 void td_schedule(bb_node *bb, node *n);
286 void bu_sched_bb(bb_node *bb);
373 virtual bool visit(bb_node &n, bool enter);
H A Dsb_sched.h257 bb_node *cur_bb;
276 bool schedule_bb(bb_node *bb);
H A Dsb_shader.cpp334 bb_node* shader::create_bb(unsigned id, unsigned loop_level) {
335 bb_node* n = new (pool.allocate(sizeof(bb_node))) bb_node(id, loop_level);
538 bb_node *bb = create_bb(bbs.size(), loop_level);
564 bb_node *bb = create_bb(bbs.size(), loop_level);
575 bb_node *bb = create_bb(bbs.size(), loop_level);
585 bb_node *b = *I;
H A Dsb_liveness.cpp51 bool liveness::visit(bb_node& n, bool enter) {
H A Dsb_shader.h370 bb_node* create_bb(unsigned id, unsigned loop_level);
H A Dsb_ir.h1163 class bb_node : public container_node { class in namespace:r600_sb
1165 bb_node(unsigned id, unsigned loop_level) function in class:r600_sb::bb_node
1178 typedef std::vector<bb_node*> bbs_vec;
H A Dsb_dump.cpp86 bool dump::visit(bb_node& n, bool enter) {
H A Dsb_sched.cpp729 bb_node* bb = static_cast<bb_node*>(*I);
770 bool post_scheduler::schedule_bb(bb_node* bb) {
H A Dsb_ir.cpp49 bool bb_node::accept(vpass& p, bool enter) { return p.visit(*this, enter); }

Completed in 25 milliseconds