// Up to now we extracted the induction variable (ind),
// the increment delta (inc), the temporary sum (nxt),
- // the mininum value (min) and the maximum value (max).
+ // the minimum value (min) and the maximum value (max).
//
// We also know that ind has the form (Phi min nxt) where
// nxt is (Add inc nxt) which means: 1) inc dominates nxt
}
t = p.newReader(off-predeclReserved, nil).typ1()
// Ensure size is calculated for imported types. Since CL 283313, the compiler
- // does not compile the function immediately when it sees them. Instead, funtions
+ // does not compile the function immediately when it sees them. Instead, functions
// are pushed to compile queue, then draining from the queue for compiling.
// During this process, the size calculation is disabled, so it is not safe for
// calculating size during SSA generation anymore. See issue #44732.
files[name] = missingFile(name)
continue
} else if f.IsDir() {
- return nil, fmt.Errorf("for overlay of %q to %q: overlay Replace entries can't point to dirctories",
+ return nil, fmt.Errorf("for overlay of %q to %q: overlay Replace entries can't point to directories",
filepath.Join(dir, name), to.actualFilePath)
}
// Add a fileinfo for the overlaid file, so that it has
return o
}
-/* genrate instruction encoding for ldp and stp series */
+/* generate instruction encoding for ldp and stp series */
func (c *ctxt7) opldpstp(p *obj.Prog, o *Optab, vo int32, rbase, rl, rh, ldp uint32) uint32 {
wback := false
if o.scond == C_XPOST || o.scond == C_XPRE {
C_DCON // constant (int64 or uint64)
C_SACON // computed address, 16-bit displacement, possibly SP-relative
C_LACON // computed address, 32-bit displacement, possibly SP-relative
- C_DACON // computed address, 64-bit displacment?
+ C_DACON // computed address, 64-bit displacement?
C_SBRA // short branch
C_LBRA // long branch
C_SAUTO // short auto
badDir := filepath.Join(dir, "not-exist")
_, err = TempDir(badDir, "foo")
if pe, ok := err.(*fs.PathError); !ok || !os.IsNotExist(err) || pe.Path != badDir {
- t.Errorf("TempDir error = %#v; want PathError for path %q satisifying os.IsNotExist", err, badDir)
+ t.Errorf("TempDir error = %#v; want PathError for path %q satisfying os.IsNotExist", err, badDir)
}
}
badDir := filepath.Join(dir, "not-exist")
_, err = MkdirTemp(badDir, "foo")
if pe, ok := err.(*fs.PathError); !ok || !IsNotExist(err) || pe.Path != badDir {
- t.Errorf("TempDir error = %#v; want PathError for path %q satisifying IsNotExist", err, badDir)
+ t.Errorf("TempDir error = %#v; want PathError for path %q satisfying IsNotExist", err, badDir)
}
}
// 2. Push the current PC on the stack (updating SP).
// 3. Write the desired argument frame size at SP-16 (using the SP
// after step 2).
-// 4. Save all machine registers (including flags and XMM reigsters)
+// 4. Save all machine registers (including flags and XMM registers)
// so they can be restored later by the debugger.
// 5. Set the PC to debugCallV2 and resume execution.
//
// 3. Store the current LR in (SP) (using the SP after step 2).
// 4. Store the current PC in the LR register.
// 5. Write the desired argument frame size at SP-16
-// 6. Save all machine registers (including flags and fpsimd reigsters)
+// 6. Save all machine registers (including flags and fpsimd registers)
// so they can be restored later by the debugger.
// 7. Set the PC to debugCallV2 and resume execution.
//
// Below this point, c.heapMarked < goal.
- // heapMarked is our absolute minumum, and it's possible the trigger
+ // heapMarked is our absolute minimum, and it's possible the trigger
// bound we get from heapGoalinternal is less than that.
if minTrigger < c.heapMarked {
minTrigger = c.heapMarked
// Increase the popped count. If we are the last possible popper
// in the block (note that bottom need not equal spanSetBlockEntries-1
- // due to races) then it's our resposibility to free the block.
+ // due to races) then it's our responsibility to free the block.
//
// If we increment popped to spanSetBlockEntries, we can be sure that
// we're the last popper for this block, and it's thus safe to free it.
// Runs on OS stack.
// duration (in -100ns units) is in dt+0(FP).
// g is valid.
-// TODO: neeeds to be implemented properly.
+// TODO: needs to be implemented properly.
TEXT runtime·usleep2HighRes(SB),NOSPLIT|NOFRAME,$0-4
B runtime·abort(SB)
// Runs on OS stack.
// duration (in -100ns units) is in dt+0(FP).
// g is valid.
-// TODO: neeeds to be implemented properly.
+// TODO: needs to be implemented properly.
TEXT runtime·usleep2HighRes(SB),NOSPLIT,$0-4
B runtime·abort(SB)
}
/*
-bugs/bug150.go:13: reorder2: too many funcation calls evaluating parameters
+bugs/bug150.go:13: reorder2: too many function calls evaluating parameters
*/