Search Options

Results per page
Sort
Preferred Languages
Advance

Results 1 - 10 of 216 for vSlots (0.19 sec)

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

    	// The location of each known slot, indexed by SlotID.
    	slots []VarLoc
    	// The slots present in each register, indexed by register number.
    	registers [][]SlotID
    }
    
    // reset fills state with the live variables from live.
    func (state *stateAtPC) reset(live abt.T) {
    	slots, registers := state.slots, state.registers
    	for i := range slots {
    		slots[i] = VarLoc{}
    	}
    	for i := range registers {
    Registered: Wed Jun 12 16:32:35 UTC 2024
    - Last Modified: Mon Jun 10 19:44:43 UTC 2024
    - 58.4K bytes
    - Viewed (0)
  2. 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)
  3. 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)
  4. src/main/webapp/js/admin/plugins/form-validator/lang/ca.js

    d'incloure entre ",lengthBadEnd:" caràcters",lengthTooLongStart:"La seva resposta ha de ser menor a ",lengthTooShortStart:"La seva resposta ha de ser major a ",notConfirmed:"Els valors proporcionats no poden ser confirmats",badDomain:"Ha introduït un domini incorrecte",badUrl:"La URL proporcionada no és vàlida",badCustomVal:"Els valors proporcionats no són vàlids",andSpaces:" i espais ",badInt:"El valor proporcionat no és un número vàlid",badSecurityNumber:"El número de seguretat social proporcionat és ...
    Registered: Wed Jun 12 13:08:18 UTC 2024
    - Last Modified: Mon Jan 01 05:12:47 UTC 2018
    - 2.6K bytes
    - Viewed (0)
  5. src/log/slog/example_custom_levels_test.go

    	logger.Log(ctx, LevelEmergency, "missing pilots")
    	logger.Error("failed to start engines", "err", "missing fuel")
    	logger.Warn("falling back to default value")
    	logger.Log(ctx, LevelNotice, "all systems are running")
    	logger.Info("initiating launch")
    	logger.Debug("starting background job")
    	logger.Log(ctx, LevelTrace, "button clicked")
    
    	// Output:
    	// sev=EMERGENCY msg="missing pilots"
    Registered: Wed Jun 12 16:32:35 UTC 2024
    - Last Modified: Tue Jul 11 17:06:26 UTC 2023
    - 3K bytes
    - Viewed (0)
  6. testing/internal-performance-testing/src/main/resources/org/gradle/reporting/performanceGraph.js

        const renderCommitIds = function (commits) {
            return commits.map(function (commit) {
                return commit.substring(0, 7);
            }).join('|');
        };
    
        const plots = [];
    
        const togglePlot = function (chartId, label) {
            const plot = plots[chartId];
            const plotData = plot.getData();
            $.each(plotData, function (index, value) {
                if (value.label == label) {
    Registered: Wed Jun 12 18:38:38 UTC 2024
    - Last Modified: Thu Apr 04 07:21:38 UTC 2024
    - 6K bytes
    - Viewed (0)
  7. src/go/doc/comment/testdata/list.txt

              * Indentation does not matter.
         + Lots of bullets.
    More text.
    
    -- gofmt --
    Text.
    - Not a list.
      - Here is the list.
      - Using multiple bullets.
      - Indentation does not matter.
      - Lots of bullets.
    
    More text.
    
    -- text --
    Text. - Not a list.
      - Here is the list.
      - Using multiple bullets.
      - Indentation does not matter.
      - Lots of bullets.
    
    More text.
    
    -- markdown --
    Registered: Wed Jun 12 16:32:35 UTC 2024
    - Last Modified: Mon Apr 11 16:31:48 UTC 2022
    - 776 bytes
    - Viewed (0)
  8. src/runtime/testdata/testwintls/main.c

    #include <windows.h>
    
    int main(int argc, char **argv) {
        if (argc < 3) {
            return 1;
        }
        // Allocate more than 64 TLS indices
        // so the Go runtime doesn't find
        // enough space in the TEB TLS slots.
        for (int i = 0; i < 65; i++) {
            TlsAlloc();
        }
        HMODULE hlib = LoadLibrary(argv[1]);
        if (hlib == NULL) {
            return 2;
        }
        FARPROC proc = GetProcAddress(hlib, argv[2]);
    Registered: Wed Jun 12 16:32:35 UTC 2024
    - Last Modified: Tue Apr 25 15:37:00 UTC 2023
    - 692 bytes
    - Viewed (0)
  9. 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 (0)
  10. 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)
Back to top