Search Options

Results per page
Sort
Preferred Languages
Advance

Results 1 - 6 of 6 for succFn (0.11 sec)

  1. src/cmd/compile/internal/liveness/plive.go

    				// A variable is live on output from this block
    				// if it is live on input to some successor.
    				//
    				// out[b] = \bigcup_{s \in succ[b]} in[s]
    				newliveout.Copy(lv.blockEffects(b.Succs[0].Block()).livein)
    				for _, succ := range b.Succs[1:] {
    					newliveout.Or(newliveout, lv.blockEffects(succ.Block()).livein)
    				}
    			}
    
    			if !be.liveout.Eq(newliveout) {
    				change = true
    				be.liveout.Copy(newliveout)
    			}
    Registered: Wed Jun 12 16:32:35 UTC 2024
    - Last Modified: Fri Jun 07 15:22:22 UTC 2024
    - 45.2K bytes
    - Viewed (0)
  2. guava/src/com/google/common/util/concurrent/AbstractFuture.java

            return; // give up if someone is calling complete
          }
          Waiter succ;
          while (curr != null) {
            succ = curr.next;
            if (curr.thread != null) { // we aren't unlinking this node, update pred.
              pred = curr;
            } else if (pred != null) { // We are unlinking this node and it has a predecessor.
              pred.next = succ;
    Registered: Wed Jun 12 16:38:11 UTC 2024
    - Last Modified: Fri Jun 07 22:25:23 UTC 2024
    - 62.8K bytes
    - Viewed (1)
  3. android/guava/src/com/google/common/util/concurrent/AbstractFuture.java

            return; // give up if someone is calling complete
          }
          Waiter succ;
          while (curr != null) {
            succ = curr.next;
            if (curr.thread != null) { // we aren't unlinking this node, update pred.
              pred = curr;
            } else if (pred != null) { // We are unlinking this node and it has a predecessor.
              pred.next = succ;
    Registered: Wed Jun 12 16:38:11 UTC 2024
    - Last Modified: Fri Jun 07 22:25:23 UTC 2024
    - 63.1K bytes
    - Viewed (1)
  4. src/cmd/compile/internal/ssagen/ssa.go

    	case b.Succs[1].Block():
    		s.oneJump(b, &jumps[1][0])
    		s.oneJump(b, &jumps[1][1])
    	default:
    		var q *obj.Prog
    		if b.Likely != ssa.BranchUnlikely {
    			s.oneJump(b, &jumps[1][0])
    			s.oneJump(b, &jumps[1][1])
    			q = s.Br(obj.AJMP, b.Succs[1].Block())
    		} else {
    			s.oneJump(b, &jumps[0][0])
    			s.oneJump(b, &jumps[0][1])
    			q = s.Br(obj.AJMP, b.Succs[0].Block())
    		}
    		q.Pos = b.Pos
    	}
    }
    Registered: Wed Jun 12 16:32:35 UTC 2024
    - Last Modified: Mon Jun 10 19:44:43 UTC 2024
    - 284.9K bytes
    - Viewed (0)
  5. src/cmd/compile/internal/ssa/func.go

    		if int(ID) < len(f.Cache.blocks) {
    			b = &f.Cache.blocks[ID]
    			b.ID = ID
    		} else {
    			b = &Block{ID: ID}
    		}
    	}
    	b.Kind = kind
    	b.Func = f
    	b.Preds = b.predstorage[:0]
    	b.Succs = b.succstorage[:0]
    	b.Values = b.valstorage[:0]
    	f.Blocks = append(f.Blocks, b)
    	f.invalidateCFG()
    	return b
    }
    
    func (f *Func) freeBlock(b *Block) {
    	if b.Func == nil {
    Registered: Wed Jun 12 16:32:35 UTC 2024
    - Last Modified: Mon Jun 10 19:44:43 UTC 2024
    - 25.8K bytes
    - Viewed (0)
  6. src/cmd/compile/internal/ssa/rewrite.go

    	var states map[string]bool
    	for {
    		change := false
    		deadChange := false
    		for _, b := range f.Blocks {
    			var b0 *Block
    			if debug > 1 {
    				b0 = new(Block)
    				*b0 = *b
    				b0.Succs = append([]Edge{}, b.Succs...) // make a new copy, not aliasing
    			}
    			for i, c := range b.ControlValues() {
    				for c.Op == OpCopy {
    					c = c.Args[0]
    					b.ReplaceControl(i, c)
    				}
    			}
    			if rb(b) {
    Registered: Wed Jun 12 16:32:35 UTC 2024
    - Last Modified: Fri Jun 07 19:02:52 UTC 2024
    - 64.2K bytes
    - Viewed (0)
Back to top