| /external/v8/test/unittests/compiler/ |
| instruction-sequence-unittest.cc | 93 LoopData loop_data = {Rpo::Invalid(), loop_blocks};
423 Rpo rpo = Rpo::FromInt(static_cast<int>(instruction_blocks_.size())); local
424 Rpo loop_header = Rpo::Invalid();
425 Rpo loop_end = Rpo::Invalid();
430 loop_end = Rpo::FromInt(rpo.ToInt() + loop_data.expected_blocks_)
[all...] |
| instruction-sequence-unittest.h | 21 typedef RpoNumber Rpo;
224 Rpo loop_header_;
|
| /prebuilts/go/darwin-x86/pkg/bootstrap/src/bootstrap/compile/internal/gc/ |
| popt.go | 354 * recursively, all preds with a greater rpo number are in the loop
357 r.Rpo = 1
359 if r1 != nil && r1.Rpo == 0 {
363 if r1 != nil && r1.Rpo == 0 {
403 src := r.Rpo
404 if r.P1 != nil && doms(idom, src, r.P1.Rpo) {
408 if doms(idom, src, r.Rpo) {
416 if r.Rpo < head || r.Active == head {
430 g.Rpo = make([]*Flow, g.Num)
437 rpo2r := g.Rpo
[all...] |
| go.go | 705 Rpo int32 // reverse post ordering
716 // After calling flowrpo, rpo lists the flow nodes in reverse postorder,
717 // and each non-dead Flow node f has g->rpo[f->rpo] == f.
718 Rpo []*Flow
|
| /prebuilts/go/darwin-x86/src/cmd/compile/internal/gc/ |
| popt.go | 351 * recursively, all preds with a greater rpo number are in the loop
354 r.Rpo = 1
356 if r1 != nil && r1.Rpo == 0 {
360 if r1 != nil && r1.Rpo == 0 {
400 src := r.Rpo
401 if r.P1 != nil && doms(idom, src, r.P1.Rpo) {
405 if doms(idom, src, r.Rpo) {
413 if r.Rpo < head || r.Active == head {
427 g.Rpo = make([]*Flow, g.Num)
434 rpo2r := g.Rpo
[all...] |
| go.go | 702 Rpo int32 // reverse post ordering
713 // After calling flowrpo, rpo lists the flow nodes in reverse postorder,
714 // and each non-dead Flow node f has g->rpo[f->rpo] == f.
715 Rpo []*Flow
|
| /prebuilts/go/linux-x86/pkg/bootstrap/src/bootstrap/compile/internal/gc/ |
| popt.go | 354 * recursively, all preds with a greater rpo number are in the loop
357 r.Rpo = 1
359 if r1 != nil && r1.Rpo == 0 {
363 if r1 != nil && r1.Rpo == 0 {
403 src := r.Rpo
404 if r.P1 != nil && doms(idom, src, r.P1.Rpo) {
408 if doms(idom, src, r.Rpo) {
416 if r.Rpo < head || r.Active == head {
430 g.Rpo = make([]*Flow, g.Num)
437 rpo2r := g.Rpo
[all...] |
| go.go | 705 Rpo int32 // reverse post ordering
716 // After calling flowrpo, rpo lists the flow nodes in reverse postorder,
717 // and each non-dead Flow node f has g->rpo[f->rpo] == f.
718 Rpo []*Flow
|
| /prebuilts/go/linux-x86/src/cmd/compile/internal/gc/ |
| popt.go | 351 * recursively, all preds with a greater rpo number are in the loop
354 r.Rpo = 1
356 if r1 != nil && r1.Rpo == 0 {
360 if r1 != nil && r1.Rpo == 0 {
400 src := r.Rpo
401 if r.P1 != nil && doms(idom, src, r.P1.Rpo) {
405 if doms(idom, src, r.Rpo) {
413 if r.Rpo < head || r.Active == head {
427 g.Rpo = make([]*Flow, g.Num)
434 rpo2r := g.Rpo
[all...] |
| go.go | 702 Rpo int32 // reverse post ordering
713 // After calling flowrpo, rpo lists the flow nodes in reverse postorder,
714 // and each non-dead Flow node f has g->rpo[f->rpo] == f.
715 Rpo []*Flow
|
| /external/v8/src/compiler/ |
| register-allocator-verifier.cc | 267 typedef RpoNumber Rpo;
272 PhiData(Rpo definition_rpo, const PhiInstruction* phi, int first_pred_vreg,
283 const Rpo definition_rpo;
|
