- Sort Score
- Result 10 results
- Languages All
Results 1 - 7 of 7 for Free1 (0.03 sec)
-
src/runtime/mpagecache.go
// This method is called very infrequently, so just do the // slower, safer thing by iterating over each bit individually. for i := uint(0); i < 64; i++ { if c.cache&(1<<i) != 0 { p.chunkOf(ci).free1(pi + i) // Update density statistics. p.scav.index.free(ci, pi+i, 1) } if c.scav&(1<<i) != 0 { p.chunkOf(ci).scavenged.setRange(pi+i, 1) } }
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed Apr 19 14:30:00 UTC 2023 - 5.6K bytes - Viewed (0) -
src/runtime/mpallocbits.go
(*pageBits)(b).setRange(i, n) } // allocAll allocates all the bits of b. func (b *pallocBits) allocAll() { (*pageBits)(b).setAll() } // free1 frees a single page in the pallocBits at i. func (b *pallocBits) free1(i uint) { (*pageBits)(b).clear(i) } // free frees the range [i, i+n) of pages in the pallocBits. func (b *pallocBits) free(i, n uint) { (*pageBits)(b).clearRange(i, n) }
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Sat May 18 15:13:43 UTC 2024 - 12.5K bytes - Viewed (0) -
src/runtime/mpagealloc.go
if npages == 1 { // Fast path: we're clearing a single bit, and we know exactly // where it is, so mark it directly. i := chunkIndex(base) pi := chunkPageIndex(base) p.chunkOf(i).free1(pi) p.scav.index.free(i, pi, 1) } else { // Slow path: we're clearing more bits so we may need to iterate. sc, ec := chunkIndex(base), chunkIndex(limit) si, ei := chunkPageIndex(base), chunkPageIndex(limit)
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon Mar 25 19:53:03 UTC 2024 - 39.2K bytes - Viewed (0) -
platforms/core-configuration/file-collections/src/test/groovy/org/gradle/api/internal/file/AbstractFileTreeTest.groovy
FileVisitDetails fileVisitDetails1 = fileVisitDetails(file1) FileVisitDetails fileVisitDetails2 = fileVisitDetails(file2) def tree1 = new TestFileTree([fileVisitDetails1]) def tree2 = new TestFileTree([fileVisitDetails2]) when: FileTree sum = tree1.plus(tree2) then: sum.files.sort() == [file1, file2] } def "can add file trees together using + operator"() {
Registered: Wed Jun 12 18:38:38 UTC 2024 - Last Modified: Thu Oct 05 19:36:14 UTC 2023 - 4.5K bytes - Viewed (0) -
platforms/core-configuration/file-collections/src/test/groovy/org/gradle/api/internal/file/DefaultCompositeFileTreeTest.groovy
def "dependencies are union of dependencies of source trees"() { def task1 = Stub(Task) def task2 = Stub(Task) def task3 = Stub(Task) def tree1 = Stub(FileTreeInternal) def tree2 = Stub(FileTreeInternal) given: tree1.visitDependencies(_) >> { TaskDependencyResolveContext context -> context.add(task1) context.add(task2) }
Registered: Wed Jun 12 18:38:38 UTC 2024 - Last Modified: Thu Sep 28 09:51:04 UTC 2023 - 2.9K bytes - Viewed (0) -
platforms/core-configuration/file-collections/src/test/groovy/org/gradle/api/internal/file/DirectoryPropertyTest.groovy
def file2 = dir1.createFile("file2") def dir2 = baseDir.createDir("dir2") def file3 = dir2.createFile("other/file3") expect: def tree1 = baseDirectory.asFileTree tree1.files == [file1, file2, file3] as Set and: def tree2 = baseDirectory.dir("dir2").get().asFileTree tree2.files == [file3] as Set }
Registered: Wed Jun 12 18:38:38 UTC 2024 - Last Modified: Thu Sep 28 09:51:04 UTC 2023 - 3K bytes - Viewed (0) -
subprojects/core/src/test/groovy/org/gradle/api/internal/file/DefaultProjectLayoutTest.groovy
def file2 = dir1.createFile("file2") def dir2 = projectDir.createDir("dir2") def file3 = dir2.createFile("other/file3") expect: def tree1 = layout.projectDirectory.dir("dir1").asFileTree tree1.files == [file1, file2] as Set def tree2 = layout.projectDirectory.dir("dir2").asFileTree tree2.files == [file3] as Set }
Registered: Wed Jun 12 18:38:38 UTC 2024 - Last Modified: Fri Sep 23 16:13:03 UTC 2022 - 9.5K bytes - Viewed (0)