Search Options

Results per page
Sort
Preferred Languages
Advance

Results 1 - 10 of 193 for newValue1 (0.23 sec)

  1. src/cmd/compile/internal/ssa/decompose.go

    	lenType := types.Int
    
    	ptr := v.Block.NewValue0(v.Pos, OpPhi, ptrType)
    	len := v.Block.NewValue0(v.Pos, OpPhi, lenType)
    	cap := v.Block.NewValue0(v.Pos, OpPhi, lenType)
    	for _, a := range v.Args {
    		ptr.AddArg(a.Block.NewValue1(v.Pos, OpSlicePtr, ptrType, a))
    		len.AddArg(a.Block.NewValue1(v.Pos, OpSliceLen, lenType, a))
    		cap.AddArg(a.Block.NewValue1(v.Pos, OpSliceCap, lenType, a))
    	}
    	v.reset(OpSliceMake)
    Registered: Wed Jun 12 16:32:35 UTC 2024
    - Last Modified: Tue Aug 23 21:22:15 UTC 2022
    - 13.4K bytes
    - Viewed (0)
  2. src/cmd/compile/internal/ssagen/ssa.go

    	return s.curBlock.NewValue1A(s.peekPos().WithNotStmt(), op, t, aux, arg)
    }
    
    // newValue1I adds a new value with one argument and an auxint value to the current block.
    func (s *state) newValue1I(op ssa.Op, t *types.Type, aux int64, arg *ssa.Value) *ssa.Value {
    	return s.curBlock.NewValue1I(s.peekPos(), op, t, aux, arg)
    }
    
    // newValue2 adds a new value with two arguments to the current block.
    Registered: Wed Jun 12 16:32:35 UTC 2024
    - Last Modified: Mon Jun 10 19:44:43 UTC 2024
    - 284.9K bytes
    - Viewed (0)
  3. src/cmd/compile/internal/ssa/memcombine.go

    	}
    }
    
    func truncate(b *Block, pos src.XPos, v *Value, from, to int64) *Value {
    	switch from*10 + to {
    	case 82:
    		return b.NewValue1(pos, OpTrunc64to16, types.Types[types.TUINT16], v)
    	case 84:
    		return b.NewValue1(pos, OpTrunc64to32, types.Types[types.TUINT32], v)
    	case 42:
    		return b.NewValue1(pos, OpTrunc32to16, types.Types[types.TUINT16], v)
    	default:
    		base.Fatalf("bad sizes %d %d\n", from, to)
    		return nil
    	}
    }
    Registered: Wed Jun 12 16:32:35 UTC 2024
    - Last Modified: Thu Mar 21 19:45:41 UTC 2024
    - 18.4K bytes
    - Viewed (0)
  4. src/cmd/compile/internal/ssa/writebarrier.go

    				curCall = bThen.NewValue1(pos, OpWB, t, memThen)
    				curPtr = bThen.NewValue1(pos, OpSelect0, types.Types[types.TUINTPTR].PtrTo(), curCall)
    				memThen = bThen.NewValue1(pos, OpSelect1, types.TypeMem, curCall)
    			}
    			// Store value in write buffer
    			num := curCall.AuxInt
    			curCall.AuxInt = num + 1
    Registered: Wed Jun 12 16:32:35 UTC 2024
    - Last Modified: Fri Sep 08 19:09:14 UTC 2023
    - 23.5K bytes
    - Viewed (0)
  5. src/cmd/compile/internal/ssa/phiopt.go

    	default:
    		return
    	}
    
    	if reverse == 1 {
    		negate = !negate
    	}
    
    	a := b0.Controls[0]
    	if negate {
    		a = v.Block.NewValue1(v.Pos, OpNot, a.Type, a)
    	}
    	v.AddArg(a)
    
    	cvt := v.Block.NewValue1(v.Pos, OpCvtBoolToUint8, v.Block.Func.Config.Types.UInt8, a)
    	switch v.Type.Size() {
    	case 1:
    		v.reset(OpCopy)
    	case 2:
    		v.reset(OpZeroExt8to16)
    	case 4:
    Registered: Wed Jun 12 16:32:35 UTC 2024
    - Last Modified: Mon Apr 11 16:34:30 UTC 2022
    - 8.1K bytes
    - Viewed (0)
  6. src/cmd/compile/internal/ssa/loopreschedchecks.go

    		cfgtypes := &f.Config.Types
    		pt := cfgtypes.Uintptr
    		g := test.NewValue1(bb.Pos, OpGetG, pt, mem0)
    		sp := test.NewValue0(bb.Pos, OpSP, pt)
    		cmpOp := OpLess64U
    		if pt.Size() == 4 {
    			cmpOp = OpLess32U
    		}
    		limaddr := test.NewValue1I(bb.Pos, OpOffPtr, pt, 2*pt.Size(), g)
    		lim := test.NewValue2(bb.Pos, OpLoad, pt, limaddr, mem0)
    		cmp := test.NewValue2(bb.Pos, cmpOp, cfgtypes.Bool, sp, lim)
    		test.SetControl(cmp)
    
    Registered: Wed Jun 12 16:32:35 UTC 2024
    - Last Modified: Tue Aug 22 21:17:10 UTC 2023
    - 16K bytes
    - Viewed (0)
  7. src/cmd/compile/internal/ssa/regalloc.go

    			// of narrowing conversions).
    			x = e.p.NewValue1(pos, OpStoreReg, loc.(LocalSlot).Type, x)
    		}
    	} else {
    		// Emit move from src to dst.
    		_, srcReg := src.(*Register)
    		if srcReg {
    			if dstReg {
    				x = e.p.NewValue1(pos, OpCopy, c.Type, c)
    			} else {
    				x = e.p.NewValue1(pos, OpStoreReg, loc.(LocalSlot).Type, c)
    			}
    		} else {
    			if dstReg {
    Registered: Wed Jun 12 16:32:35 UTC 2024
    - Last Modified: Tue Nov 21 17:49:56 UTC 2023
    - 87.2K bytes
    - Viewed (0)
  8. src/cmd/compile/internal/ssa/expand_calls.go

    	return
    }
    
    func (x *expandState) decomposePair(pos src.XPos, b *Block, a, mem *Value, t0, t1 *types.Type, o0, o1 Op, rc *registerCursor) *Value {
    	e := b.NewValue1(pos, o0, t0, a)
    	pos = pos.WithNotStmt()
    	mem = x.decomposeAsNecessary(pos, b, e, mem, rc.next(t0))
    	e = b.NewValue1(pos, o1, t1, a)
    	mem = x.decomposeAsNecessary(pos, b, e, mem, rc.next(t1))
    	return mem
    }
    
    Registered: Wed Jun 12 16:32:35 UTC 2024
    - Last Modified: Tue Nov 28 05:13:40 UTC 2023
    - 31.9K bytes
    - Viewed (0)
  9. src/cmd/compile/internal/ssa/func.go

    	v := b.Func.newValue(op, t, b, pos)
    	v.AuxInt = auxint
    	v.Aux = aux
    	v.Args = v.argstorage[:0]
    	return v
    }
    
    // NewValue1 returns a new value in the block with one argument and zero aux values.
    func (b *Block) NewValue1(pos src.XPos, op Op, t *types.Type, arg *Value) *Value {
    	v := b.Func.newValue(op, t, b, pos)
    	v.AuxInt = 0
    	v.Args = v.argstorage[:1]
    Registered: Wed Jun 12 16:32:35 UTC 2024
    - Last Modified: Mon Jun 10 19:44:43 UTC 2024
    - 25.8K bytes
    - Viewed (0)
  10. pkg/ledger/smt_test.go

    		t.Fatal("root not stored")
    	}
    
    	newValues := getFreshData(5)
    	_, err := smt.Update(keys, newValues)
    	assert.NoError(t, err)
    
    	// Check all keys have been modified
    	for i, key := range keys {
    		value, _ := smt.Get(key)
    		if !bytes.Equal(newValues[i], value) {
    			t.Fatal("trie not updated")
    		}
    	}
    
    	newKeys := getFreshData(5)
    	newValues = getFreshData(5)
    	_, err = smt.Update(newKeys, newValues)
    Registered: Fri Jun 14 15:00:06 UTC 2024
    - Last Modified: Tue Aug 08 16:43:05 UTC 2023
    - 7.9K bytes
    - Viewed (0)
Back to top