- Sort Score
- Result 10 results
- Languages All
Results 1 - 3 of 3 for moving (0.14 sec)
-
doc/go_mem.html
If <code>list</code> pointed to a cyclic list, then the original program would never access <code>*p</code> or <code>*q</code>, but the rewritten program would. (Moving `*p` ahead would be safe if the compiler can prove `*p` will not panic; moving `*q` ahead would also require the compiler proving that no other goroutine can access `*q`.) </p> <p> Not introducing data races also means not assuming that called functions
HTML - Registered: Tue May 07 11:14:38 GMT 2024 - Last Modified: Mon Mar 04 15:54:42 GMT 2024 - 26.6K bytes - Viewed (0) -
doc/asm.html
Otherwise, the local stack frame must not contain pointers, and the assembly must confirm this fact by executing the pseudo-instruction <code>NO_LOCAL_POINTERS</code>. Because stack resizing is implemented by moving the stack, the stack pointer may change during any function call: even pointers to stack data must not be kept in local variables. </p> <p> Assembly functions should always be given Go prototypes,
HTML - Registered: Tue May 07 11:14:38 GMT 2024 - Last Modified: Tue Nov 28 19:15:27 GMT 2023 - 36.3K bytes - Viewed (0) -
doc/go_spec.html
<code>A</code> must have all methods of <code>C</code>, if any, and corresponding method types must unify exactly. </li> </ul> <p> When solving type equations from type constraints, solving one equation may infer additional type arguments, which in turn may enable solving other equations that depend on those type arguments. Type inference repeats type unification as long as new type arguments are inferred. </p>
HTML - Registered: Tue May 07 11:14:38 GMT 2024 - Last Modified: Thu May 02 22:43:51 GMT 2024 - 279.6K bytes - Viewed (0)