/prebuilts/go/darwin-x86/test/ |
escape2.go | 21 func foo1(x int) { // ERROR "moved to heap: x$" 22 gxx = &x // ERROR "&x escapes to heap$" 29 func foo3(x int) *int { // ERROR "moved to heap: x$" 30 return &x // ERROR "&x escapes to heap$" 95 func foo15(yy *int) { // ERROR "moved to heap: yy$" 96 xxx = &yy // ERROR "&yy escapes to heap$" 107 func foo18(y int) { // ERROR "moved to heap: y$" 108 *xxx = &y // ERROR "&y escapes to heap$" 121 return &Bar{42, nil} // ERROR "&Bar literal escapes to heap$" 125 return &Bar{42, x} // ERROR "&Bar literal escapes to heap$ [all...] |
escape2n.go | 21 func foo1(x int) { // ERROR "moved to heap: x$" 22 gxx = &x // ERROR "&x escapes to heap$" 29 func foo3(x int) *int { // ERROR "moved to heap: x$" 30 return &x // ERROR "&x escapes to heap$" 95 func foo15(yy *int) { // ERROR "moved to heap: yy$" 96 xxx = &yy // ERROR "&yy escapes to heap$" 107 func foo18(y int) { // ERROR "moved to heap: y$" 108 *xxx = &y // ERROR "&y escapes to heap$" 121 return &Bar{42, nil} // ERROR "&Bar literal escapes to heap$" 125 return &Bar{42, x} // ERROR "&Bar literal escapes to heap$ [all...] |
/prebuilts/go/linux-x86/test/ |
escape2.go | 21 func foo1(x int) { // ERROR "moved to heap: x$" 22 gxx = &x // ERROR "&x escapes to heap$" 29 func foo3(x int) *int { // ERROR "moved to heap: x$" 30 return &x // ERROR "&x escapes to heap$" 95 func foo15(yy *int) { // ERROR "moved to heap: yy$" 96 xxx = &yy // ERROR "&yy escapes to heap$" 107 func foo18(y int) { // ERROR "moved to heap: y$" 108 *xxx = &y // ERROR "&y escapes to heap$" 121 return &Bar{42, nil} // ERROR "&Bar literal escapes to heap$" 125 return &Bar{42, x} // ERROR "&Bar literal escapes to heap$ [all...] |
escape2n.go | 21 func foo1(x int) { // ERROR "moved to heap: x$" 22 gxx = &x // ERROR "&x escapes to heap$" 29 func foo3(x int) *int { // ERROR "moved to heap: x$" 30 return &x // ERROR "&x escapes to heap$" 95 func foo15(yy *int) { // ERROR "moved to heap: yy$" 96 xxx = &yy // ERROR "&yy escapes to heap$" 107 func foo18(y int) { // ERROR "moved to heap: y$" 108 *xxx = &y // ERROR "&y escapes to heap$" 121 return &Bar{42, nil} // ERROR "&Bar literal escapes to heap$" 125 return &Bar{42, x} // ERROR "&Bar literal escapes to heap$ [all...] |
/prebuilts/go/darwin-x86/src/container/heap/ |
heap.go | 5 // Package heap provides heap operations for any type that implements 6 // heap.Interface. A heap is a tree with the property that each node is the 11 // A heap is a common way to implement a priority queue. To build a priority 12 // queue, implement the Heap interface with the (negative) priority as the 17 package heap package 21 // Any type that implements heap.Interface may be used as a 22 // min-heap with the following invariants (established after 27 // Note that Push and Pop in this interface are for package heap' [all...] |
example_intheap_test.go | 5 // This example demonstrates an integer heap built using the heap interface. 9 "container/heap" 13 // An IntHeap is a min-heap of ints. 38 heap.Init(h) 39 heap.Push(h, 3) 42 fmt.Printf("%d ", heap.Pop(h))
|
/prebuilts/go/linux-x86/src/container/heap/ |
heap.go | 5 // Package heap provides heap operations for any type that implements 6 // heap.Interface. A heap is a tree with the property that each node is the 11 // A heap is a common way to implement a priority queue. To build a priority 12 // queue, implement the Heap interface with the (negative) priority as the 17 package heap package 21 // Any type that implements heap.Interface may be used as a 22 // min-heap with the following invariants (established after 27 // Note that Push and Pop in this interface are for package heap' [all...] |
example_intheap_test.go | 5 // This example demonstrates an integer heap built using the heap interface. 9 "container/heap" 13 // An IntHeap is a min-heap of ints. 38 heap.Init(h) 39 heap.Push(h, 3) 42 fmt.Printf("%d ", heap.Pop(h))
|
/external/bzip2/ |
huffman.c | 36 zz = z; tmp = heap[zz]; \ 37 while (weight[tmp] < weight[heap[zz >> 1]]) { \ 38 heap[zz] = heap[zz >> 1]; \ 41 heap[zz] = tmp; \ 47 zz = z; tmp = heap[zz]; \ 52 weight[heap[yy+1]] < weight[heap[yy]]) \ 54 if (weight[tmp] < weight[heap[yy]]) break; \ 55 heap[zz] = heap[yy]; 75 Int32 heap [ BZ_MAX_ALPHA_SIZE + 2 ]; local [all...] |
/prebuilts/go/darwin-x86/test/fixedbugs/ |
issue13799.go | 23 fmt.Println(iter) // ERROR "iter escapes to heap$" "main ... argument does not escape$" 37 m := make(map[int][]int) // ERROR "make\(map\[int\]\[\]int\) escapes to heap$" 45 // Heap -> stack pointer eventually causes badness when stack reallocation 48 var fn func() // ERROR "moved to heap: fn$" 49 for i := 0; i < maxI; i++ { // ERROR "moved to heap: i$" 50 // var fn func() // this makes it work, because fn stays off heap 51 j := 0 // ERROR "moved to heap: j$" 52 fn = func() { // ERROR "func literal escapes to heap$" 53 m[i] = append(m[i], 0) // ERROR "&i escapes to heap$" 54 if j < 25 { // ERROR "&j escapes to heap$ [all...] |
/prebuilts/go/linux-x86/test/fixedbugs/ |
issue13799.go | 23 fmt.Println(iter) // ERROR "iter escapes to heap$" "main ... argument does not escape$" 37 m := make(map[int][]int) // ERROR "make\(map\[int\]\[\]int\) escapes to heap$" 45 // Heap -> stack pointer eventually causes badness when stack reallocation 48 var fn func() // ERROR "moved to heap: fn$" 49 for i := 0; i < maxI; i++ { // ERROR "moved to heap: i$" 50 // var fn func() // this makes it work, because fn stays off heap 51 j := 0 // ERROR "moved to heap: j$" 52 fn = func() { // ERROR "func literal escapes to heap$" 53 m[i] = append(m[i], 0) // ERROR "&i escapes to heap$" 54 if j < 25 { // ERROR "&j escapes to heap$ [all...] |
/external/v8/src/heap/ |
objects-visiting.cc | 5 #include "src/heap/objects-visiting.h" 7 #include "src/heap/heap-inl.h" 8 #include "src/heap/mark-compact-inl.h" 9 #include "src/heap/objects-visiting-inl.h" 222 static bool MustRecordSlots(Heap* heap) { 223 return heap->gc_state() == Heap::MARK_COMPACT && 224 heap->mark_compact_collector()->is_compacting() [all...] |
array-buffer-tracker.h | 17 class Heap; 33 inline static void RegisterNew(Heap* heap, JSArrayBuffer* buffer); 34 inline static void Unregister(Heap* heap, JSArrayBuffer* buffer); 38 static void FreeDeadInNewSpace(Heap* heap); 68 explicit LocalArrayBufferTracker(Heap* heap) : heap_(heap) {} [all...] |
mark-compact.cc | 5 #include "src/heap/mark-compact.h" 17 #include "src/heap/array-buffer-tracker.h" 18 #include "src/heap/gc-tracer.h" 19 #include "src/heap/incremental-marking.h" 20 #include "src/heap/mark-compact-inl.h" 21 #include "src/heap/object-stats.h" 22 #include "src/heap/objects-visiting-inl.h" 23 #include "src/heap/objects-visiting.h" 24 #include "src/heap/page-parallel-job.h" 25 #include "src/heap/spaces-inl.h 1060 Heap* heap = isolate_->heap(); local 1156 Heap* heap = obj->GetHeap(); local 1245 Heap* heap = map->GetHeap(); local 2813 Heap* heap = this->heap(); local 3074 inline Heap* heap() { return collector_->heap(); } function in class:v8::MarkCompactCollector::Evacuator 3105 Heap* heap = page->heap(); local 3836 Heap* heap = this->heap(); local [all...] |
/prebuilts/gradle-plugin/com/android/tools/perflib/perflib/25.2.0/ |
perflib-25.2.0.jar | |
/prebuilts/gradle-plugin/com/android/tools/perflib/perflib/25.2.0-alpha4/ |
perflib-25.2.0-alpha4.jar | |
/prebuilts/gradle-plugin/com/android/tools/perflib/perflib/25.2.0-alpha7/ |
perflib-25.2.0-alpha7.jar | |
/prebuilts/gradle-plugin/com/android/tools/perflib/perflib/25.2.0-beta1/ |
perflib-25.2.0-beta1.jar | |
/prebuilts/gradle-plugin/com/android/tools/perflib/perflib/25.2.0-beta2/ |
perflib-25.2.0-beta2.jar | |
/prebuilts/gradle-plugin/com/android/tools/perflib/perflib/25.2.0-beta3/ |
perflib-25.2.0-beta3.jar | |
/prebuilts/gradle-plugin/com/android/tools/perflib/perflib/25.2.0-rc1/ |
perflib-25.2.0-rc1.jar | |
/prebuilts/gradle-plugin/com/android/tools/perflib/perflib/25.2.0-rc2/ |
perflib-25.2.0-rc2.jar | |
/prebuilts/gradle-plugin/com/android/tools/perflib/perflib/25.2.1/ |
perflib-25.2.1.jar | |
/prebuilts/gradle-plugin/com/android/tools/perflib/perflib/25.2.3/ |
perflib-25.2.3.jar | |
/prebuilts/misc/common/perflib/ |
perflib-prebuilt.jar | |