Search Options

Results per page
Sort
Preferred Languages
Advance

Results 1 - 10 of 117 for Slots (0.04 sec)

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

    	locations := map[string][]LocalSlot{}
    
    	// Each time we assign a stack slot to a value v, we remember
    	// the slot we used via an index into locations[v.Type].
    	slots := f.Cache.allocIntSlice(f.NumValues())
    	defer f.Cache.freeIntSlice(slots)
    	for i := range slots {
    		slots[i] = -1
    	}
    
    	// Pick a stack slot for each value needing one.
    	used := f.Cache.allocBoolSlice(f.NumValues())
    	defer f.Cache.freeBoolSlice(used)
    Registered: Wed Jun 12 16:32:35 UTC 2024
    - Last Modified: Thu Feb 29 21:29:41 UTC 2024
    - 12.6K bytes
    - Viewed (0)
  2. src/cmd/compile/internal/ssa/decompose.go

    	for i := 0; i < n; i++ {
    		if name.Type.FieldType(i).IsStruct() {
    			slots = decomposeUserStructInto(f, fnames[i], slots)
    			delete(f.NamedValues, *fnames[i])
    		} else if name.Type.FieldType(i).IsArray() {
    			slots = decomposeUserArrayInto(f, fnames[i], slots)
    			delete(f.NamedValues, *fnames[i])
    		}
    	}
    	return slots
    }
    func decomposeUserPhi(v *Value) {
    	switch {
    	case v.Type.IsStruct():
    Registered: Wed Jun 12 16:32:35 UTC 2024
    - Last Modified: Tue Aug 23 21:22:15 UTC 2022
    - 13.4K bytes
    - Viewed (0)
  3. android/guava/src/com/google/common/hash/Striped64.java

       * number of CPUS. Table slots remain empty (null) until they are
       * needed.
       *
       * A single spinlock ("busy") is used for initializing and
       * resizing the table, as well as populating slots with new Cells.
       * There is no need for a blocking lock; when the lock is not
       * available, threads try other slots (or the base).  During these
    Registered: Wed Jun 12 16:38:11 UTC 2024
    - Last Modified: Fri Jun 07 22:25:23 UTC 2024
    - 11.5K bytes
    - Viewed (0)
  4. guava/src/com/google/common/hash/Striped64.java

       * number of CPUS. Table slots remain empty (null) until they are
       * needed.
       *
       * A single spinlock ("busy") is used for initializing and
       * resizing the table, as well as populating slots with new Cells.
       * There is no need for a blocking lock; when the lock is not
       * available, threads try other slots (or the base).  During these
    Registered: Wed Jun 12 16:38:11 UTC 2024
    - Last Modified: Fri Jun 07 22:25:23 UTC 2024
    - 11.5K bytes
    - Viewed (0)
  5. guava/src/com/google/common/cache/Striped64.java

       * number of CPUS. Table slots remain empty (null) until they are
       * needed.
       *
       * A single spinlock ("busy") is used for initializing and
       * resizing the table, as well as populating slots with new Cells.
       * There is no need for a blocking lock; when the lock is not
       * available, threads try other slots (or the base).  During these
    Registered: Wed Jun 12 16:38:11 UTC 2024
    - Last Modified: Fri Jun 07 22:25:23 UTC 2024
    - 11.5K bytes
    - Viewed (0)
  6. android/guava/src/com/google/common/cache/Striped64.java

       * number of CPUS. Table slots remain empty (null) until they are
       * needed.
       *
       * A single spinlock ("busy") is used for initializing and
       * resizing the table, as well as populating slots with new Cells.
       * There is no need for a blocking lock; when the lock is not
       * available, threads try other slots (or the base).  During these
    Registered: Wed Jun 12 16:38:11 UTC 2024
    - Last Modified: Fri Jun 07 22:25:23 UTC 2024
    - 11.5K bytes
    - Viewed (2)
  7. src/runtime/mcache.go

    	if s != &emptymspan {
    		// Mark this span as no longer cached.
    		if s.sweepgen != mheap_.sweepgen+3 {
    			throw("bad sweepgen in refill")
    		}
    		mheap_.central[spc].mcentral.uncacheSpan(s)
    
    		// Count up how many slots were used and record it.
    		stats := memstats.heapStats.acquire()
    		slotsUsed := int64(s.allocCount) - int64(s.allocCountBeforeCache)
    		atomic.Xadd64(&stats.smallAllocCount[spc.sizeclass()], slotsUsed)
    
    Registered: Wed Jun 12 16:32:35 UTC 2024
    - Last Modified: Mon Mar 25 19:53:03 UTC 2024
    - 10K bytes
    - Viewed (0)
  8. src/cmd/compile/internal/ssagen/pgen.go

    	}
    
    	// Sort normal variables before open-coded-defer slots, so that the
    	// latter are grouped together and near the top of the frame (to
    	// minimize varint encoding of their varp offset).
    	if a.OpenDeferSlot() != b.OpenDeferSlot() {
    		return a.OpenDeferSlot()
    	}
    
    	// If a and b are both open-coded defer slots, then order them by
    	// index in descending order, so they'll be laid out in the frame in
    Registered: Wed Jun 12 16:32:35 UTC 2024
    - Last Modified: Wed May 15 15:44:14 UTC 2024
    - 13.1K bytes
    - Viewed (0)
  9. src/time/sleep_test.go

    	// to depend on channel queuing semantics that might
    	// possibly change in the future.
    	result := make(chan afterResult, len(slots))
    
    	t0 := Now()
    	for _, slot := range slots {
    		go await(slot, result, After(Duration(slot)*delta))
    	}
    	var order []int
    	var times []Time
    	for range slots {
    		r := <-result
    		order = append(order, r.slot)
    		times = append(times, r.t)
    	}
    	for i := range order {
    Registered: Wed Jun 12 16:32:35 UTC 2024
    - Last Modified: Fri Mar 22 16:33:57 UTC 2024
    - 22.5K bytes
    - Viewed (0)
  10. src/cmd/compile/internal/liveness/plive.go

    			if n.OpenDeferSlot() {
    				// Open-coded defer args slots must be live
    				// everywhere in a function, since a panic can
    				// occur (almost) anywhere. Because it is live
    				// everywhere, it must be zeroed on entry.
    				livedefer.Set(int32(i))
    				// It was already marked as Needzero when created.
    				if !n.Needzero() {
    					base.Fatalf("all pointer-containing defer arg slots should have Needzero set")
    				}
    			}
    		}
    	}
    Registered: Wed Jun 12 16:32:35 UTC 2024
    - Last Modified: Fri Jun 07 15:22:22 UTC 2024
    - 45.2K bytes
    - Viewed (0)
Back to top