Search Options

Results per page
Sort
Preferred Languages
Advance

Results 1 - 7 of 7 for houcine (0.23 sec)

  1. doc/asm.html

    The linker will choose one of the duplicates to use.
    </li>
    <li>
    <code>NOSPLIT</code> = 4
    <br>
    (For <code>TEXT</code> items.)
    Don't insert the preamble to check if the stack must be split.
    The frame for the routine, plus anything it calls, must fit in the
    spare space remaining in the current stack segment.
    Used to protect routines such as the stack splitting code itself.
    </li>
    <li>
    <code>RODATA</code> = 8
    <br>
    Registered: Wed Jun 12 16:32:35 UTC 2024
    - Last Modified: Tue Nov 28 19:15:27 UTC 2023
    - 36.3K bytes
    - Viewed (0)
  2. doc/go_spec.html

    	}
    	return y
    }
    </pre>
    
    <p>
    A function declaration without type parameters may omit the body.
    Such a declaration provides the signature for a function implemented outside Go,
    such as an assembly routine.
    </p>
    
    <pre>
    func flushICache(begin, end uintptr)  // implemented externally
    </pre>
    
    <h3 id="Method_declarations">Method declarations</h3>
    
    <p>
    Registered: Wed Jun 12 16:32:35 UTC 2024
    - Last Modified: Tue Jun 04 21:07:21 UTC 2024
    - 281.5K bytes
    - Viewed (0)
  3. src/cmd/compile/internal/ssagen/abi.go

    	// nosplit-overflow analysis would trigger a link failure. On the
    	// other hand if they not tagged NOSPLIT then this could cause
    	// problems when building the runtime (since there may be calls to
    	// asm routine in cases where it's not safe to grow the stack). In
    	// most cases the wrapper would be (in effect) inlined, but are
    	// there (perhaps) indirect calls from the runtime that could run
    	// into trouble here.
    Registered: Wed Jun 12 16:32:35 UTC 2024
    - Last Modified: Wed May 15 19:57:43 UTC 2024
    - 13.8K bytes
    - Viewed (0)
  4. src/cmd/compile/internal/ssagen/ssa.go

    	}
    	return a
    }
    
    func (s *state) storeArgWithBase(n ir.Node, t *types.Type, base *ssa.Value, off int64) {
    	pt := types.NewPtr(t)
    	var addr *ssa.Value
    	if base == s.sp {
    		// Use special routine that avoids allocation on duplicate offsets.
    		addr = s.constOffPtrSP(pt, off)
    	} else {
    		addr = s.newValue1I(ssa.OpOffPtr, pt, off, base)
    	}
    
    	if !ssa.CanSSA(t) {
    		a := s.addr(n)
    Registered: Wed Jun 12 16:32:35 UTC 2024
    - Last Modified: Mon Jun 10 19:44:43 UTC 2024
    - 284.9K bytes
    - Viewed (0)
  5. src/cmd/compile/internal/dwarfgen/dwinl.go

    		// names are given "middle dot" version numbers as part of the
    		// writing them out to export data (see issue 4326). If DWARF
    		// inlined routine generation is turned on, we want to undo
    		// this versioning, since DWARF variables in question will be
    		// parented by the inlined routine and not the top-level
    		// caller.
    		synthCount := len(m)
    		for _, v := range sl {
    			vp := varPos{
    				DeclName: v.Name,
    Registered: Wed Jun 12 16:32:35 UTC 2024
    - Last Modified: Mon Feb 26 20:45:07 UTC 2024
    - 12.8K bytes
    - Viewed (0)
  6. doc/go1.17_spec.html

    	}
    	// invalid: missing return statement
    }
    </pre>
    
    <p>
    A function declaration may omit the body. Such a declaration provides the
    signature for a function implemented outside Go, such as an assembly routine.
    </p>
    
    <pre>
    func min(x int, y int) int {
    	if x &lt; y {
    		return x
    	}
    	return y
    }
    
    func flushICache(begin, end uintptr)  // implemented externally
    </pre>
    
    Registered: Wed Jun 12 16:32:35 UTC 2024
    - Last Modified: Thu Apr 11 20:22:45 UTC 2024
    - 211.6K bytes
    - Viewed (0)
  7. src/cmd/compile/internal/ssa/_gen/rulegen.go

    		sw.add(swc)
    	}
    	if len(sw.List) > 0 { // skip if empty
    		fn.add(sw)
    	}
    	fn.add(stmtf("return false"))
    	genFile.add(fn)
    
    	// Generate a routine per op. Note that we don't make one giant routine
    	// because it is too big for some compilers.
    	for _, op := range ops {
    		rules := oprules[op]
    		_, ok := parseEllipsisRules(oprules[op], arch)
    		if ok {
    			continue
    		}
    
    Registered: Wed Jun 12 16:32:35 UTC 2024
    - Last Modified: Sat Sep 02 22:09:21 UTC 2023
    - 48.7K bytes
    - Viewed (0)
Back to top