Search Options

Results per page
Sort
Preferred Languages
Advance

Results 1 - 7 of 7 for InMerge (0.15 sec)

  1. src/cmd/internal/obj/s390x/rotate.go

    	r.End = (r.Start + uint8(l) - 1) & 63
    	return &r
    }
    
    // InMerge tries to generate a new set of parameters representing
    // the intersection between the selected bits and the provided mask
    // as applied to the source value (i.e. pre-rotation).
    // If the intersection is unrepresentable (0 or not contiguous) nil
    // will be returned.
    func (r RotateParams) InMerge(mask uint64) *RotateParams {
    Registered: Wed Jun 12 16:32:35 UTC 2024
    - Last Modified: Mon Dec 21 19:19:04 UTC 2020
    - 3.6K bytes
    - Viewed (0)
  2. src/cmd/compile/internal/ssa/_gen/S390X.rules

    // Absorb input zero extension into 'rotate then insert selected bits [into zero]'.
    (RISBGZ (MOVWZreg x) {r}) && r.InMerge(0xffffffff) != nil => (RISBGZ x {*r.InMerge(0xffffffff)})
    (RISBGZ (MOVHZreg x) {r}) && r.InMerge(0x0000ffff) != nil => (RISBGZ x {*r.InMerge(0x0000ffff)})
    (RISBGZ (MOVBZreg x) {r}) && r.InMerge(0x000000ff) != nil => (RISBGZ x {*r.InMerge(0x000000ff)})
    
    // Absorb 'rotate then insert selected bits [into zero]' into zero extension.
    Registered: Wed Jun 12 16:32:35 UTC 2024
    - Last Modified: Thu Oct 12 18:09:26 UTC 2023
    - 74.3K bytes
    - Viewed (0)
  3. src/cmd/internal/obj/s390x/rotate_test.go

    		if x == nil && y == nil {
    			return true
    		}
    		if x == nil || y == nil {
    			return false
    		}
    		return *x == *y
    	}
    
    	for _, test := range tests {
    		if r := test.src.InMerge(test.mask); !eq(r, test.in) {
    			t.Errorf("%v merged with %#x (input): want %v, got %v", test.src, test.mask, test.in, r)
    		}
    		if r := test.src.OutMerge(test.mask); !eq(r, test.out) {
    Registered: Wed Jun 12 16:32:35 UTC 2024
    - Last Modified: Mon Dec 14 17:17:59 UTC 2020
    - 3.6K bytes
    - Viewed (0)
  4. src/cmd/compile/internal/ssa/rewriteS390X.go

    	// match: (RISBGZ (MOVWZreg x) {r})
    	// cond: r.InMerge(0xffffffff) != nil
    	// result: (RISBGZ x {*r.InMerge(0xffffffff)})
    	for {
    		r := auxToS390xRotateParams(v.Aux)
    		if v_0.Op != OpS390XMOVWZreg {
    			break
    		}
    		x := v_0.Args[0]
    		if !(r.InMerge(0xffffffff) != nil) {
    			break
    		}
    		v.reset(OpS390XRISBGZ)
    		v.Aux = s390xRotateParamsToAux(*r.InMerge(0xffffffff))
    		v.AddArg(x)
    		return true
    Registered: Wed Jun 12 16:32:35 UTC 2024
    - Last Modified: Thu Oct 12 18:09:26 UTC 2023
    - 395.1K bytes
    - Viewed (0)
  5. pkg/proxy/servicechangetracker.go

    		}
    		result.UpdatedServices.Insert(nn)
    
    		sm.merge(change.current)
    		// filter out the Update event of current changes from previous changes
    		// before calling unmerge() so that can skip deleting the Update events.
    		change.previous.filter(change.current)
    		sm.unmerge(change.previous, result.DeletedUDPClusterIPs)
    	}
    	// clear changes after applying them to ServicePortMap.
    	sct.items = make(map[types.NamespacedName]*serviceChange)
    Registered: Sat Jun 15 01:39:40 UTC 2024
    - Last Modified: Thu Dec 21 14:44:08 UTC 2023
    - 8.7K bytes
    - Viewed (0)
  6. pkg/proxy/endpointschangetracker.go

    func (em EndpointsMap) merge(other EndpointsMap) {
    	for svcPortName := range other {
    		em[svcPortName] = other[svcPortName]
    	}
    }
    
    // Unmerge removes the <service, endpoints> pairs from the current EndpointsMap which are contained in the EndpointsMap passed in.
    func (em EndpointsMap) unmerge(other EndpointsMap) {
    	for svcPortName := range other {
    		delete(em, svcPortName)
    	}
    }
    
    Registered: Sat Jun 15 01:39:40 UTC 2024
    - Last Modified: Thu Dec 21 14:44:08 UTC 2023
    - 13.2K bytes
    - Viewed (0)
  7. tensorflow/compiler/jit/deadness_analysis.cc

        }
      }
      return errors::InvalidArgument(
          "Multiple NextIteration inputs to merge node ",
          FormatNodeForError(*merge), ": \n", absl::StrJoin(backedges, "\n"),
          "\nMerge nodes can have at most one incoming NextIteration edge.");
    }
    
    Status FindUniqueBackedge(Node* merge, const Edge** result) {
      *result = nullptr;
      CHECK(merge->IsMerge());
    Registered: Sun Jun 16 05:45:23 UTC 2024
    - Last Modified: Tue Mar 12 06:33:33 UTC 2024
    - 60.4K bytes
    - Viewed (0)
Back to top