Searched full:many (Results 1 – 25 of 4770) sorted by relevance
12345678910>>...191
19 The aliases file is read-only and specifies how many caches48 The alloc_fastpath file shows how many objects have been59 The alloc_from_partial file shows how many times a cpu slab has71 The alloc_refill file shows how many times the per-cpu freelist82 The alloc_slab file is shows how many times a new slab had to93 The alloc_slowpath file shows how many objects have been115 The cpu_slabs file is read-only and displays how many cpu slabs124 The file cpuslab_flush shows how many times a cache's cpu slabs147 The deactivate_empty file shows how many times an empty cpu slab157 The deactivate_full file shows how many times a full cpu slab[all …]
19 full_scans: how many times all mergeable areas have been22 pages_shared: how many shared pages are being used.24 pages_sharing: how many more sites are sharing them i.e. how27 pages_to_scan: how many present pages to scan before ksmd goes30 pages_unshared: how many pages unique but repeatedly checked33 pages_volatile: how many pages changing too fast to be placed40 sleep_millisecs: how many milliseconds ksm should sleep between
19 full_scans: how many times all mergeable areas have been22 pages_shared: how many shared pages are being used.24 pages_sharing: how many more sites are sharing them i.e. how27 pages_to_scan: how many present pages to scan before ksmd goes30 pages_unshared: how many pages unique but repeatedly checked33 pages_volatile: how many pages changing too fast to be placed41 sleep_millisecs: how many milliseconds ksm should sleep between
38 br.ret.sptk.many rp48 br.cond.sptk.many rp83 br.cond.sptk.many b790 br.ret.sptk.many b0120 br.call.sptk.many rp=b7 // now make the call126 br.ret.sptk.many b0180 br.call.sptk.many rp=ia64_switch_mode_phys184 br.cond.sptk.many b7190 br.call.sptk.many rp=ia64_switch_mode_virt // return to virtual mode198 br.ret.sptk.many b0[all …]
72 br.call.sptk.many rp=sys_execve81 (p7) br.ret.sptk.many rp101 br.ret.sptk.many rp127 br.call.sptk.many rp=do_fork132 br.ret.sptk.many rp158 br.call.sptk.many rp=do_fork163 br.ret.sptk.many rp205 br.ret.sptk.many rp // boogie on out in new context356 br.cond.sptk.many b7456 br.cond.sptk.many b7[all …]
72 br.call.sptk.many rp=sys_execve81 (p7) br.ret.sptk.many rp101 br.ret.sptk.many rp124 br.call.sptk.many rp=ia64_clone129 br.ret.sptk.many rp152 br.call.sptk.many rp=ia64_clone157 br.ret.sptk.many rp199 br.ret.sptk.many rp // boogie on out in new context350 br.cond.sptk.many b7450 br.cond.sptk.many b7[all …]
18 #define MANY(x...) x macro21 #define MANY(x...) macro67 MANY( mov r3, #VLOCK_VOTING_OFFSET )69 MANY( ldr r2, [r0, r3] )74 MANY( add r3, r3, #4 )75 MANY( cmp r3, #VLOCK_VOTING_OFFSET + VLOCK_VOTING_SIZE )76 MANY( bne 0b )
17 atomic_t processes; /* How many processes does this user have? */18 atomic_t sigpending; /* How many pending signals does this user have? */27 unsigned long mq_bytes; /* How many bytes can be allocated to mqueue? */29 unsigned long locked_shm; /* How many pages of mlocked shm ? */30 unsigned long unix_inflight; /* How many files in flight in unix sockets */31 atomic_long_t pipe_bufs; /* how many pages are allocated in pipe buffers */
15 atomic_t processes; /* How many processes does this user have? */16 atomic_t sigpending; /* How many pending signals does this user have? */25 unsigned long mq_bytes; /* How many bytes can be allocated to mqueue? */27 unsigned long locked_shm; /* How many pages of mlocked shm ? */28 unsigned long unix_inflight; /* How many files in flight in unix sockets */29 atomic_long_t pipe_bufs; /* how many pages are allocated in pipe buffers */
27 #define MANY(x...) x macro30 #define MANY(x...) macro76 MANY( mov r3, #VLOCK_VOTING_OFFSET )78 MANY( ldr r2, [r0, r3] )83 MANY( add r3, r3, #4 )84 MANY( cmp r3, #VLOCK_VOTING_OFFSET + VLOCK_VOTING_SIZE )85 MANY( bne 0b )
21 srli $p1, $r2, #2 ! $p1 is how many words to copy29 andi $r2, $r2, #3 ! How many bytes are less than a word35 addi $p1, $p1, #-1 ! How many words left to copy44 andi $r2, $r2, #3 ! How many bytes are less than a word50 addi $p1, $p1, #-1 ! How many words left to copy60 addi $r2, $r2, #-1 ! How many bytes left to copy
9 the IBM Linux JFS team for explaining many esoteric Linux filesystem features.41 Jeff Layton (many, many fixes, as well as great work on the cifs Kerberos code)46 Shirish Pargaonkar (for many ACL patches over the years)47 Sachin Prabhu (many bug fixes, including for reconnect, copy offload and security)59 mention to the Stanford Checker (SWAT) which pointed out many minor
14 the IBM Linux JFS team for explaining many esoteric Linux filesystem features.47 - Jeff Layton (many, many fixes, as well as great work on the cifs Kerberos code)52 - Shirish Pargaonkar (for many ACL patches over the years)53 - Sachin Prabhu (many bug fixes, including for reconnect, copy offload and security)65 mention to the Stanford Checker (SWAT) which pointed out many minor
16 * \brief Channel map, specifies transformation of one-to-many or many-to-one.18 * In case of one-to-many specifies how the output channels are computed out of20 * in case of many-to-one specifies how a single target channel is computed29 * Channel mask describes which channels are taken into account on the "many"
76 /* How many connections can we support? A localhost implementation uses 2 connections,83 /* How many services can we open per connection? Extending this doesn't cost processing time, just …99 /* How many receive slots do we use. This times VCHI_MAX_MSG_SIZE gives the effective114 /* How many transmit slots do we use. Generally don't need many, as the hardware driver159 /* How many TX messages can we have pending in our transmit slots. Once exhausted,165 /* How many RX messages can we have parsed in the receive slots. Once exhausted, parsing179 /* How many bulk transmits can we have pending. Once exhausted, vchi_bulk_queue_transmit185 /* How many bulk receives can we have pending. Once exhausted, vchi_bulk_queue_receive191 /* A limit on how many outstanding bulk requests we expect the peer to give us. If
17 application which generates many instances of the same data.82 how many pages to scan before ksmd goes to sleep88 how many milliseconds ksmd should sleep before next scan163 how many shared pages are being used165 how many more sites are sharing them i.e. how much saved167 how many pages unique but repeatedly checked for merging169 how many pages changing too fast to be placed in a tree171 how many times all mergeable areas have been scanned
39 unsigned long hdr_count; /* how many valid entries */43 unsigned long hdr_overflows; /* how many times the buffer overflowed */44 unsigned long hdr_buf_size; /* how many bytes in the buffer */54 * index order: PMD4, PMD5, and so on. How many PMDs are present depends 76 #define PFM_DEFAULT_MAX_PMDS 64 /* how many pmds supported by data structures (sizeof(unsigned lon…
78 (p_scr) br.ret.dpnt.many rp // return immediately if count = 085 (p_scr) br.cond.dptk.many .move_bytes_unaligned // go move just a few (M_B_U)121 (p_scr) br.cond.dpnt.many .fraction_of_line // go move just a few127 (p_zr) br.cond.dptk.many .l1b // Jump to use stf.spill195 (p_scr) br.cond.dpnt.many .fraction_of_line // Branch no. 2196 br.cond.dpnt.many .move_bytes_from_alignment // Branch no. 3249 (p_scr) br.cond.dpnt.many .move_bytes_from_alignment //260 (p_scr) br.cond.dpnt.many .store_words274 br.cloop.dptk.many .l2279 (p_scr) br.cond.dpnt.many .move_bytes_from_alignment // Branch[all …]
33 #define ETOOMANYREFS 59 /* Too many references: cannot splice */36 #define ELOOP 62 /* Too many symbolic links encountered */41 #define EPROCLIM 67 /* SUNOS: Too many processes */42 #define EUSERS 68 /* Too many users */55 #define ERREMOTE 81 /* SunOS: Too many lvls of remote in path */99 #define ELIBMAX 123 /* Atmpt to link in too many shared libs */