- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 17 for nextFast (0.23 sec)
-
src/runtime/mbitmap.go
} // nextFast is the fast path of next. nextFast is written to be inlineable and, // as the name implies, fast. // // Callers that are performance-critical should iterate using the following // pattern: // // for { // var addr uintptr // if tp, addr = tp.nextFast(); addr == 0 { // if tp, addr = tp.next(limit); addr == 0 { // break // }
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu May 23 00:18:55 UTC 2024 - 60K bytes - Viewed (0) -
src/cmd/compile/internal/test/inl_test.go
"cgoInRange", "gclinkptr.ptr", "guintptr.ptr", "heapBitsSlice", "markBits.isMarked", "muintptr.ptr", "puintptr.ptr", "spanOf", "spanOfUnchecked", "typePointers.nextFast", "(*gcWork).putFast", "(*gcWork).tryGetFast", "(*guintptr).set", "(*markBits).advance", "(*mspan).allocBitsForIndex", "(*mspan).base", "(*mspan).markBitsForBase",
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Tue Apr 09 04:07:57 UTC 2024 - 10.7K bytes - Viewed (0) -
src/runtime/mgcmark.go
tp = tp.fastForward(b-tp.addr, b+n) } else { tp = s.typePointersOfUnchecked(b) } var scanSize uintptr for { var addr uintptr if tp, addr = tp.nextFast(); addr == 0 { if tp, addr = tp.next(b + n); addr == 0 { break } } // Keep track of farthest pointer we found, so we can // update heapScanWork. TODO: is there a better metric,
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu Apr 18 21:25:11 UTC 2024 - 52.5K bytes - Viewed (0) -
internal/http/listener_test.go
} nextTest: for i, testCase := range testCases { listener, errs := newHTTPListener(context.Background(), testCase.serverAddrs, TCPOptions{}, ) for _, err := range errs { if err != nil { if strings.Contains(err.Error(), "The requested address is not valid in its context") { // Ignore if IP is unbindable. continue nextTest }
Registered: Sun Jun 16 00:44:34 UTC 2024 - Last Modified: Mon Jun 10 17:41:02 UTC 2024 - 11.8K bytes - Viewed (0) -
schema/naming.go
buf strings.Builder lastCase, nextCase, nextNumber bool // upper case == true curCase = value[0] <= 'Z' && value[0] >= 'A' ) for i, v := range value[:len(value)-1] { nextCase = value[i+1] <= 'Z' && value[i+1] >= 'A' nextNumber = value[i+1] >= '0' && value[i+1] <= '9' if curCase { if lastCase && (nextCase || nextNumber) { buf.WriteRune(v + 32) } else {
Registered: Wed Jun 12 16:27:09 UTC 2024 - Last Modified: Wed Jun 12 03:46:59 UTC 2024 - 5.3K bytes - Viewed (0) -
src/mime/multipart/multipart.go
// When there are no more parts, the error [io.EOF] is returned. // // Unlike [Reader.NextPart], it does not have special handling for // "Content-Transfer-Encoding: quoted-printable". func (r *Reader) NextRawPart() (*Part, error) { return r.nextPart(true, maxMIMEHeaderSize, maxMIMEHeaders()) } func (r *Reader) nextPart(rawPart bool, maxMIMEHeaderSize, maxMIMEHeaders int64) (*Part, error) { if r.currentPart != nil {
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu Mar 21 16:12:35 UTC 2024 - 14.1K bytes - Viewed (0) -
src/cmd/compile/internal/ssa/debug_test.go
return true } return false } func (h *nextHist) addVar(text string) { l := len(h.texts) h.vars[l-1] = append(h.vars[l-1], text) } func invertMapSU8(hf2i map[string]uint8) map[uint8]string { hi2f := make(map[uint8]string) for hs, i := range hf2i { hi2f[i] = hs } return hi2f } func (h *nextHist) equals(k *nextHist) bool { if len(h.f2i) != len(k.f2i) { return false }
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Tue Apr 02 16:11:47 UTC 2024 - 28.6K bytes - Viewed (0) -
okhttp-testing-support/src/main/kotlin/okhttp3/internal/concurrent/TaskFaker.kt
taskRunner.assertThreadHoldsLock() val index = serialTaskQueue.indexOfFirst { it.isReady() } if (index == -1) return null val nextTask = serialTaskQueue.removeAt(index) currentTask = nextTask contextSwitchCount++ nextTask.start() return nextTask } private interface SerialTask { /** Returns true if this task is ready to start. */ fun isReady() = true
Registered: Sun Jun 16 04:42:17 UTC 2024 - Last Modified: Mon Apr 29 00:33:04 UTC 2024 - 12.6K bytes - Viewed (0) -
src/internal/dag/parse.go
func (p *rulesParser) syntaxError(msg string) { panic(syntaxError(fmt.Sprintf("parsing graph: line %d: syntax error: %s near %s", p.lineno, msg, p.lastWord))) } // nextList parses and returns a comma-separated list of names. func (p *rulesParser) nextList() (list []string, token string) { for { tok := p.nextToken() switch tok { case "": if len(list) == 0 { return nil, "" } fallthrough
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu May 23 01:00:11 UTC 2024 - 6.7K bytes - Viewed (0) -
src/mime/multipart/formdata.go
if maxMemoryBytes <= 0 { if maxMemory < 0 { maxMemoryBytes = 0 } else { maxMemoryBytes = math.MaxInt64 } } var copyBuf []byte for { p, err := r.nextPart(false, maxMemoryBytes, maxHeaders) if err == io.EOF { break } if err != nil { return nil, err } if maxParts <= 0 { return nil, ErrMessageTooLarge } maxParts--
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu Mar 21 16:12:35 UTC 2024 - 7.7K bytes - Viewed (0)