| /openbsd-src/sys/uvm/ |
| H A D | uvm_addr.c | 27 /* Number of pivots in pivot allocator. */
30 * Max number (inclusive) of pages the pivot allocator
38 * Number of allocations that a pivot can supply before expiring.
39 * When a pivot expires, a new pivot has to be found.
67 * Definition of a pivot in pivot selector.
75 /* uvm_addr state for pivot selector. */
79 /* Free space tree, for fast pivot selection. */
903 * Select a new pivot
917 uaddr_pivot_newpivot(struct vm_map * map,struct uaddr_pivot_state * uaddr,struct uaddr_pivot * pivot,struct vm_map_entry ** entry_out,vaddr_t * addr_out,vsize_t sz,vaddr_t align,vaddr_t offset,vsize_t before_gap,vsize_t after_gap) uaddr_pivot_newpivot() argument
1094 struct uaddr_pivot *pivot; uaddr_pivot_select() local
1273 struct uaddr_pivot *pivot; uaddr_pivot_print() local
[all...] |
| /openbsd-src/regress/sys/kern/stackpivot/pagefault/ |
| H A D | stackpivot.c | 37 pivot(realstack); in dowork()
59 pivot(newstack); in main()
|
| /openbsd-src/gnu/llvm/lld/MachO/ |
| H A D | ExportTrie.cpp | 187 int pivot = charAt(pivotSymbol, pos); in sortAndBuild() local
192 if (c < pivot) in sortAndBuild()
194 else if (c > pivot) in sortAndBuild()
200 bool isTerminal = pivot == -1; in sortAndBuild()
|
| /openbsd-src/regress/sys/kern/stackpivot/syscall/ |
| H A D | stackpivot.c | 32 pivot(newstack); in main()
|
| /openbsd-src/regress/sys/kern/stackpivot/ |
| H A D | pivot.h | 4 static void pivot(void *newstack) { in pivot() function
|
| /openbsd-src/regress/usr.bin/lastcomm/ |
| H A D | pivot.h | 4 static void pivot(void *newstack) { in pivot() function
|
| H A D | callstack.c | 61 pivot(&newstack[pagesize/sizeof(*newstack)/2]); in main()
|
| H A D | trapstack.c | 70 pivot(&newstack[pagesize/sizeof(*newstack)/2]); in main()
|
| /openbsd-src/libexec/snmpd/snmpd_metrics/ |
| H A D | kroute.c | 689 struct kif_arp *pivot; in karp_search() local
691 TAILQ_FOREACH(pivot, &kn->arps, entry) { in karp_search()
692 switch (karp_compare(ka, pivot)) { in karp_search()
694 return (pivot); in karp_search()
733 struct kif_arp *pivot; in karp_insert() local
740 TAILQ_FOREACH(pivot, &kn->arps, entry) { in karp_insert()
741 switch (karp_compare(ka, pivot)) { in karp_insert()
745 TAILQ_INSERT_BEFORE(pivot, ka, entry); in karp_insert()
|
| /openbsd-src/gnu/llvm/llvm/lib/Target/VE/ |
| H A D | VVPInstrPatternsVec.td | 193 i32:$pivot),
198 $pivot,
229 i32:$pivot),
234 $pivot,
265 i32:$pivot),
270 $pivot,
|
| /openbsd-src/gnu/llvm/llvm/include/llvm/IR/ |
| H A D | VPIntrinsics.def | 611 // llvm.vp.merge(cond,on_true,on_false,pivot)
|
| /openbsd-src/gnu/llvm/llvm/docs/ |
| H A D | LangRef.rst | 18366 …m.vp.merge.v16i32 (<16 x i1> <condition>, <16 x i32> <on_true>, <16 x i32> <on_false>, i32 <pivot>)
18367 …le x 4 x i1> <condition>, <vscale x 4 x i64> <on_true>, <vscale x 4 x i64> <on_false>, i32 <pivot>)
18381 false or the lane position is greater equal than the pivot. The fourth operand
18382 is the pivot.
18394 condition vector and pivot value.
18397 than ``%pivot`` the lane is taken from the second operand. Otherwise, the lane
18405 …<4 x i32> @llvm.vp.merge.v4i32(<4 x i1> %cond, <4 x i32> %on_true, <4 x i32> %on_false, i32 %pivot)
18408 ;; Lanes at and above %pivot are taken from %on_false
18409 %atfirst = insertelement <4 x i32> undef, i32 %pivot, i32 0
|
| /openbsd-src/share/dict/ |
| H A D | web2a | 40892 pivot bearing
40893 pivot blow
40894 pivot bridge
40895 pivot joint
40896 pivot man
40897 pivot pier
40898 pivot span
40899 pivot stand
40900 pivot tooth
|
| H A D | web2 | 147605 pivot
|
| /openbsd-src/games/fortune/datfiles/ |
| H A D | fortunes2 | 42784 We'll pivot at warp 2 and bring all tubes to bear, Mr. Sulu!
|