Search Options

Results per page
Sort
Preferred Languages
Advance

Results 21 - 30 of 66 for reg1 (0.1 sec)

  1. tensorflow/compiler/mlir/lite/stablehlo/transforms/legalize_hlo_patterns.td

                  (MHLO_CompareOp:$rnz $rem1, (MHLO_ConstantOp $cst2), MHLO_ComparisonDirectionValue<"NE">, $compare_type3)),
                (MHLO_AddOp $rem2, $arg1),
                $rem3),
              (TF_FloorModOp $arg, $arg1),
              [(ValueEquals<"0.0"> $cst),
               (ValueEquals<"0.0"> $cst1),
               (ValueEquals<"0.0"> $cst2),
               (SameValue $rem, $rem1),
               (SameValue $rem, $rem2),
    Registered: Sun Jun 16 05:45:23 UTC 2024
    - Last Modified: Sat Feb 03 08:58:22 UTC 2024
    - 34K bytes
    - Viewed (0)
  2. src/cmd/internal/obj/x86/obj6.go

    		p.To.Type = obj.TYPE_REG
    		p.To.Reg = reg
    		p.To.Offset = 0
    		p.To.Sym = nil
    		p1 := obj.Appendp(p, newprog)
    		p1.As = lea
    		p1.From.Type = obj.TYPE_MEM
    		p1.From.Offset = offset
    		p1.From.Reg = reg
    		p1.To.Type = obj.TYPE_REG
    		p1.To.Reg = reg
    		p2 := obj.Appendp(p1, newprog)
    		p2.As = obj.ACALL
    		p2.To.Type = obj.TYPE_REG
    		p2.To.Reg = reg
    	}
    
    Registered: Wed Jun 12 16:32:35 UTC 2024
    - Last Modified: Fri Sep 08 18:36:45 UTC 2023
    - 40.9K bytes
    - Viewed (0)
  3. src/syscall/mksyscall.pl

    		my ($name, $type) = parseparam($p);
    		my $reg = "";
    		if($name eq "err" && !$plan9) {
    			$reg = "e1";
    			$ret[2] = $reg;
    			$do_errno = 1;
    		} elsif($name eq "err" && $plan9) {
    			$ret[0] = "r0";
    			$ret[2] = "e1";
    			next;
    		} else {
    			$reg = sprintf("r%d", $i);
    			$ret[$i] = $reg;
    		}
    		if($type eq "bool") {
    			$reg = "$reg != 0";
    		}
    		if($type eq "int64" && $_32bit ne "") {
    Registered: Wed Jun 12 16:32:35 UTC 2024
    - Last Modified: Fri May 24 17:15:02 UTC 2024
    - 10.3K bytes
    - Viewed (0)
  4. src/runtime/mbarrier.go

    	}
    	memmove(dst, src, size)
    
    	// Move pointers returned in registers to a place where the GC can see them.
    	for i := range regs.Ints {
    		if regs.ReturnIsPtr.Get(i) {
    			regs.Ptrs[i] = unsafe.Pointer(regs.Ints[i])
    		}
    	}
    }
    
    // typedslicecopy should be an internal detail,
    // but widely used packages access it using linkname.
    Registered: Wed Jun 12 16:32:35 UTC 2024
    - Last Modified: Wed May 29 17:58:53 UTC 2024
    - 15.7K bytes
    - Viewed (0)
  5. src/reflect/abi.go

    }
    
    // intFromReg loads an argSize sized integer from reg and places it at to.
    //
    // argSize must be non-zero, fit in a register, and a power-of-two.
    func intFromReg(r *abi.RegArgs, reg int, argSize uintptr, to unsafe.Pointer) {
    	memmove(to, r.IntRegArgAddr(reg, argSize), argSize)
    }
    
    // intToReg loads an argSize sized integer and stores it into reg.
    //
    // argSize must be non-zero, fit in a register, and a power-of-two.
    Registered: Wed Jun 12 16:32:35 UTC 2024
    - Last Modified: Tue May 07 17:08:32 UTC 2024
    - 15K bytes
    - Viewed (0)
  6. src/cmd/compile/internal/ssa/op.go

    			a.reg.inputs = append(a.reg.inputs, inputInfo{idx: k, regs: (1 << m)})
    			k++
    		}
    	}
    	a.reg.inputs = append(a.reg.inputs, i.inputs...) // These are less constrained, thus should come last
    	k = len(i.outputs)
    	for _, p := range a.abiInfo.OutParams() {
    		for _, r := range p.Registers {
    			m := archRegForAbiReg(r, c)
    			a.reg.outputs = append(a.reg.outputs, outputInfo{idx: k, regs: (1 << m)})
    			k++
    		}
    Registered: Wed Jun 12 16:32:35 UTC 2024
    - Last Modified: Mon Apr 22 15:29:10 UTC 2024
    - 18.7K bytes
    - Viewed (0)
  7. src/runtime/defer_test.go

    		globstruct.c = c
    		globstruct.d = d
    		globstruct.e = e
    		globstruct.f = f
    		globstruct.g = g
    		globstruct.h = h
    	}(ap, a, b, c, d, e, f, g, h, i)
    	panic("ff1 panic")
    }
    
    func rec1(max int) {
    	if max > 0 {
    		rec1(max - 1)
    	}
    }
    
    func TestIssue43921(t *testing.T) {
    	defer func() {
    		expect(t, 1, recover())
    	}()
    	func() {
    		// Prevent open-coded defers
    		for {
    			defer func() {}()
    Registered: Wed Jun 12 16:32:35 UTC 2024
    - Last Modified: Wed Sep 20 18:57:24 UTC 2023
    - 11.4K bytes
    - Viewed (0)
  8. pkg/kubelet/eviction/mock_threshold_notifier_test.go

    func (m *MockDiskInfoProvider) HasDedicatedImageFs(ctx context.Context) (bool, error) {
    	m.ctrl.T.Helper()
    	ret := m.ctrl.Call(m, "HasDedicatedImageFs", ctx)
    	ret0, _ := ret[0].(bool)
    	ret1, _ := ret[1].(error)
    	return ret0, ret1
    }
    
    // HasDedicatedImageFs indicates an expected call of HasDedicatedImageFs.
    func (mr *MockDiskInfoProviderMockRecorder) HasDedicatedImageFs(ctx any) *gomock.Call {
    	mr.mock.ctrl.T.Helper()
    Registered: Sat Jun 15 01:39:40 UTC 2024
    - Last Modified: Thu Mar 07 08:12:16 UTC 2024
    - 13.2K bytes
    - Viewed (0)
  9. pkg/kubelet/kuberuntime/helpers_test.go

    		originalImage           image
    		expectedImageUserValues imageUserValues
    	}{
    		{
    			"image without username and uid should return (new(int64), \"\", nil)",
    			image{
    				name:     "test-image-ref1",
    				uid:      (*runtimeapi.Int64Value)(nil),
    				username: "",
    			},
    			imageUserValues{
    				uid:      int64(0),
    				username: "",
    				err:      nil,
    			},
    		},
    		{
    Registered: Sat Jun 15 01:39:40 UTC 2024
    - Last Modified: Wed Apr 24 18:25:29 UTC 2024
    - 11.7K bytes
    - Viewed (0)
  10. pkg/kubelet/preemption/preemption.go

    	priorityList := []v1.ResourceName{
    		v1.ResourceMemory,
    		v1.ResourceCPU,
    	}
    	for _, res := range priorityList {
    		req1 := resource.GetResourceRequest(pod1, res)
    		req2 := resource.GetResourceRequest(pod2, res)
    		if req1 < req2 {
    			return true
    		} else if req1 > req2 {
    			return false
    		}
    	}
    	return true
    Registered: Sat Jun 15 01:39:40 UTC 2024
    - Last Modified: Tue May 02 16:53:19 UTC 2023
    - 11.5K bytes
    - Viewed (0)
Back to top