Spelling
This commit is contained in:
parent
f25c63af03
commit
956f31353c
Notes:
svn2git
2020-12-20 02:59:44 +00:00
svn path=/head/; revision=58634
@ -11,7 +11,7 @@
|
||||
* notice, this list of conditions and the following disclaimer in the
|
||||
* documentation and/or other materials provided with the distribution.
|
||||
* 3. All advertising materials mentioning features or use of this software
|
||||
* must display the following acknowledgement:
|
||||
* must display the following acknowledgment:
|
||||
* This product includes software developed by David Greenman.
|
||||
* 4. The name of the author may not be used to endorse or promote products
|
||||
* derived from this software without specific prior written permission.
|
||||
|
@ -16,7 +16,7 @@
|
||||
* notice, this list of conditions and the following disclaimer in the
|
||||
* documentation and/or other materials provided with the distribution.
|
||||
* 3. All advertising materials mentioning features or use of this software
|
||||
* must display the following acknowledgement:
|
||||
* must display the following acknowledgment:
|
||||
* This product includes software developed by the University of
|
||||
* California, Berkeley and its contributors.
|
||||
* 4. Neither the name of the University nor the names of its contributors
|
||||
@ -128,7 +128,7 @@ dev_pager_alloc(void *handle, vm_ooffset_t size, vm_prot_t prot, vm_ooffset_t fo
|
||||
return (NULL);
|
||||
|
||||
/*
|
||||
* Lock to prevent object creation race contion.
|
||||
* Lock to prevent object creation race condition.
|
||||
*/
|
||||
while (dev_pager_alloc_lock) {
|
||||
dev_pager_alloc_lock_want++;
|
||||
|
@ -18,7 +18,7 @@
|
||||
* notice, this list of conditions and the following disclaimer in the
|
||||
* documentation and/or other materials provided with the distribution.
|
||||
* 3. All advertising materials mentioning features or use of this software
|
||||
* must display the following acknowledgement:
|
||||
* must display the following acknowledgment:
|
||||
* This product includes software developed by the University of
|
||||
* California, Berkeley and its contributors.
|
||||
* 4. Neither the name of the University nor the names of its contributors
|
||||
@ -682,7 +682,7 @@ swap_pager_copy(srcobject, dstobject, offset, destroysource)
|
||||
/*
|
||||
* Reverting the type is not necessary, the caller is going
|
||||
* to destroy srcobject directly, but I'm doing it here
|
||||
* for consistancy since we've removed the object from its
|
||||
* for consistency since we've removed the object from its
|
||||
* queues.
|
||||
*/
|
||||
srcobject->type = OBJT_DEFAULT;
|
||||
@ -1538,7 +1538,7 @@ swp_pager_async_iodone(bp)
|
||||
* someone may be waiting for that.
|
||||
*
|
||||
* NOTE: for reads, m->dirty will probably
|
||||
* be overriden by the original caller of
|
||||
* be overridden by the original caller of
|
||||
* getpages so don't play cute tricks here.
|
||||
*
|
||||
* XXX it may not be legal to free the page
|
||||
@ -1573,7 +1573,7 @@ swp_pager_async_iodone(bp)
|
||||
* make sure the pmap modify bits are also cleared.
|
||||
*
|
||||
* NOTE: for reads, m->dirty will probably be
|
||||
* overriden by the original caller of getpages so
|
||||
* overridden by the original caller of getpages so
|
||||
* we cannot set them in order to free the underlying
|
||||
* swap in a low-swap situation. I don't think we'd
|
||||
* want to do that anyway, but it was an optimization
|
||||
|
@ -19,7 +19,7 @@
|
||||
* notice, this list of conditions and the following disclaimer in the
|
||||
* documentation and/or other materials provided with the distribution.
|
||||
* 3. All advertising materials mentioning features or use of this software
|
||||
* must display the following acknowledgement:
|
||||
* must display the following acknowledgment:
|
||||
* This product includes software developed by the University of
|
||||
* California, Berkeley and its contributors.
|
||||
* 4. Neither the name of the University nor the names of its contributors
|
||||
@ -165,7 +165,7 @@ _unlock_things(struct faultstate *fs, int dealloc)
|
||||
/*
|
||||
* vm_fault:
|
||||
*
|
||||
* Handle a page fault occuring at the given address,
|
||||
* Handle a page fault occurring at the given address,
|
||||
* requiring the given permissions, in the map specified.
|
||||
* If successful, the page is inserted into the
|
||||
* associated physical map.
|
||||
@ -294,7 +294,7 @@ RetryFault:;
|
||||
* vm_page_t->busy because the vm_pager may be using
|
||||
* vm_page_t->busy for pageouts ( and even pageins if
|
||||
* it is the vnode pager ), and we could end up trying
|
||||
* to pagein and pageout the same page simultaniously.
|
||||
* to pagein and pageout the same page simultaneously.
|
||||
*
|
||||
* We can theoretically allow the busy case on a read
|
||||
* fault if the page is marked valid, but since such
|
||||
@ -626,7 +626,7 @@ RetryFault:;
|
||||
*/
|
||||
(fs.object->ref_count == 1) &&
|
||||
/*
|
||||
* Noone else can look this object up
|
||||
* None else can look this object up
|
||||
*/
|
||||
(fs.object->handle == NULL) &&
|
||||
/*
|
||||
|
@ -14,7 +14,7 @@
|
||||
* notice, this list of conditions and the following disclaimer in the
|
||||
* documentation and/or other materials provided with the distribution.
|
||||
* 3. All advertising materials mentioning features or use of this software
|
||||
* must display the following acknowledgement:
|
||||
* must display the following acknowledgment:
|
||||
* This product includes software developed by the University of
|
||||
* California, Berkeley and its contributors.
|
||||
* 4. Neither the name of the University nor the names of its contributors
|
||||
|
@ -14,7 +14,7 @@
|
||||
* notice, this list of conditions and the following disclaimer in the
|
||||
* documentation and/or other materials provided with the distribution.
|
||||
* 3. All advertising materials mentioning features or use of this software
|
||||
* must display the following acknowledgement:
|
||||
* must display the following acknowledgment:
|
||||
* This product includes software developed by the University of
|
||||
* California, Berkeley and its contributors.
|
||||
* 4. Neither the name of the University nor the names of its contributors
|
||||
|
@ -14,7 +14,7 @@
|
||||
* notice, this list of conditions and the following disclaimer in the
|
||||
* documentation and/or other materials provided with the distribution.
|
||||
* 3. All advertising materials mentioning features or use of this software
|
||||
* must display the following acknowledgement:
|
||||
* must display the following acknowledgment:
|
||||
* This product includes software developed by the University of
|
||||
* California, Berkeley and its contributors.
|
||||
* 4. Neither the name of the University nor the names of its contributors
|
||||
|
@ -14,7 +14,7 @@
|
||||
* notice, this list of conditions and the following disclaimer in the
|
||||
* documentation and/or other materials provided with the distribution.
|
||||
* 3. All advertising materials mentioning features or use of this software
|
||||
* must display the following acknowledgement:
|
||||
* must display the following acknowledgment:
|
||||
* This product includes software developed by the University of
|
||||
* California, Berkeley and its contributors.
|
||||
* 4. Neither the name of the University nor the names of its contributors
|
||||
@ -100,7 +100,7 @@
|
||||
* Maps consist of an ordered doubly-linked list of simple
|
||||
* entries; a single hint is used to speed up lookups.
|
||||
*
|
||||
* Since portions of maps are specified by start/end addreses,
|
||||
* Since portions of maps are specified by start/end addresses,
|
||||
* which may not align with existing map entries, all
|
||||
* routines merely "clip" entries to these start/end values.
|
||||
* [That is, an entry is split into two, bordering at a
|
||||
|
@ -11,7 +11,7 @@
|
||||
* notice, this list of conditions and the following disclaimer in the
|
||||
* documentation and/or other materials provided with the distribution.
|
||||
* 3. All advertising materials mentioning features or use of this software
|
||||
* must display the following acknowledgement:
|
||||
* must display the following acknowledgment:
|
||||
* This product includes software developed by the University of
|
||||
* California, Berkeley and its contributors.
|
||||
* 4. Neither the name of the University nor the names of its contributors
|
||||
@ -83,7 +83,7 @@ loadav(struct loadavg *avg)
|
||||
case SSLEEP:
|
||||
if (p->p_priority > PZERO || p->p_slptime != 0)
|
||||
continue;
|
||||
/* fall through */
|
||||
/* FALLTHROUGH */
|
||||
case SRUN:
|
||||
case SIDL:
|
||||
nrun++;
|
||||
|
@ -16,7 +16,7 @@
|
||||
* notice, this list of conditions and the following disclaimer in the
|
||||
* documentation and/or other materials provided with the distribution.
|
||||
* 3. All advertising materials mentioning features or use of this software
|
||||
* must display the following acknowledgement:
|
||||
* must display the following acknowledgment:
|
||||
* This product includes software developed by the University of
|
||||
* California, Berkeley and its contributors.
|
||||
* 4. Neither the name of the University nor the names of its contributors
|
||||
|
@ -14,7 +14,7 @@
|
||||
* notice, this list of conditions and the following disclaimer in the
|
||||
* documentation and/or other materials provided with the distribution.
|
||||
* 3. All advertising materials mentioning features or use of this software
|
||||
* must display the following acknowledgement:
|
||||
* must display the following acknowledgment:
|
||||
* This product includes software developed by the University of
|
||||
* California, Berkeley and its contributors.
|
||||
* 4. Neither the name of the University nor the names of its contributors
|
||||
@ -927,7 +927,7 @@ vm_object_shadow(object, offset, length)
|
||||
* of reference count.
|
||||
*
|
||||
* Try to optimize the result object's page color when shadowing
|
||||
* in order to maintain page coloring consistancy in the combined
|
||||
* in order to maintain page coloring consistency in the combined
|
||||
* shadowed object.
|
||||
*/
|
||||
result->backing_object = source;
|
||||
@ -977,7 +977,7 @@ vm_object_backing_scan(vm_object_t object, int op)
|
||||
|
||||
if (op & OBSC_TEST_ALL_SHADOWED) {
|
||||
/*
|
||||
* We do not want to have to test for the existance of
|
||||
* We do not want to have to test for the existence of
|
||||
* swap pages in the backing object. XXX but with the
|
||||
* new swapper this would be pretty easy to do.
|
||||
*
|
||||
|
@ -14,7 +14,7 @@
|
||||
* notice, this list of conditions and the following disclaimer in the
|
||||
* documentation and/or other materials provided with the distribution.
|
||||
* 3. All advertising materials mentioning features or use of this software
|
||||
* must display the following acknowledgement:
|
||||
* must display the following acknowledgment:
|
||||
* This product includes software developed by the University of
|
||||
* California, Berkeley and its contributors.
|
||||
* 4. Neither the name of the University nor the names of its contributors
|
||||
@ -475,7 +475,7 @@ vm_page_remove(m)
|
||||
* NOTE: the code below does not lock. It will operate properly if
|
||||
* an interrupt makes a change, but the generation algorithm will not
|
||||
* operate properly in an SMP environment where both cpu's are able to run
|
||||
* kernel code simultaniously.
|
||||
* kernel code simultaneously.
|
||||
*
|
||||
* The object must be locked. No side effects.
|
||||
* This routine may not block.
|
||||
@ -612,7 +612,7 @@ vm_page_unqueue(m)
|
||||
*
|
||||
* The page coloring optimization attempts to locate a page
|
||||
* that does not overload other nearby pages in the object in
|
||||
* the cpu's L1 or L2 caches. We need this optmization because
|
||||
* the cpu's L1 or L2 caches. We need this optimization because
|
||||
* cpu caches tend to be physical caches, while object spaces tend
|
||||
* to be virtual.
|
||||
*
|
||||
@ -770,7 +770,7 @@ vm_page_alloc(object, pindex, page_req)
|
||||
m = vm_page_select_free(object, pindex, FALSE);
|
||||
} else if (page_req != VM_ALLOC_INTERRUPT) {
|
||||
/*
|
||||
* Allocateable from cache (non-interrupt only). On success,
|
||||
* Allocatable from cache (non-interrupt only). On success,
|
||||
* we must free the page and try again, thus ensuring that
|
||||
* cnt.v_*_free_min counters are replenished.
|
||||
*/
|
||||
@ -792,7 +792,7 @@ vm_page_alloc(object, pindex, page_req)
|
||||
goto loop;
|
||||
} else {
|
||||
/*
|
||||
* Not allocateable from cache from interrupt, give up.
|
||||
* Not allocatable from cache from interrupt, give up.
|
||||
*/
|
||||
splx(s);
|
||||
vm_pageout_deficit++;
|
||||
@ -1182,7 +1182,7 @@ vm_page_wire(m)
|
||||
* processes. This optimization causes one-time-use metadata to be
|
||||
* reused more quickly.
|
||||
*
|
||||
* A number of routines use vm_page_unwire() to guarentee that the page
|
||||
* A number of routines use vm_page_unwire() to guarantee that the page
|
||||
* will go into either the inactive or active queues, and will NEVER
|
||||
* be placed in the cache - for example, just after dirtying a page.
|
||||
* dirty pages in the cache are not allowed.
|
||||
|
@ -18,7 +18,7 @@
|
||||
* notice, this list of conditions and the following disclaimer in the
|
||||
* documentation and/or other materials provided with the distribution.
|
||||
* 3. All advertising materials mentioning features or use of this software
|
||||
* must display the following acknowledgement:
|
||||
* must display the following acknowledgment:
|
||||
* This product includes software developed by the University of
|
||||
* California, Berkeley and its contributors.
|
||||
* 4. Neither the name of the University nor the names of its contributors
|
||||
@ -951,7 +951,7 @@ vm_pageout_scan()
|
||||
while ((m != NULL) && (pcount-- > 0) && (page_shortage > 0)) {
|
||||
|
||||
/*
|
||||
* This is a consistancy check, and should likely be a panic
|
||||
* This is a consistency check, and should likely be a panic
|
||||
* or warning.
|
||||
*/
|
||||
if (m->queue != PQ_ACTIVE) {
|
||||
@ -975,7 +975,7 @@ vm_pageout_scan()
|
||||
|
||||
/*
|
||||
* The count for pagedaemon pages is done after checking the
|
||||
* page for eligbility...
|
||||
* page for eligibility...
|
||||
*/
|
||||
cnt.v_pdpages++;
|
||||
|
||||
@ -1140,7 +1140,7 @@ vm_pageout_scan()
|
||||
/*
|
||||
* This routine tries to maintain the pseudo LRU active queue,
|
||||
* so that during long periods of time where there is no paging,
|
||||
* that some statistic accumlation still occurs. This code
|
||||
* that some statistic accumulation still occurs. This code
|
||||
* helps the situation where paging just starts to occur.
|
||||
*/
|
||||
static void
|
||||
|
@ -14,7 +14,7 @@
|
||||
* notice, this list of conditions and the following disclaimer in the
|
||||
* documentation and/or other materials provided with the distribution.
|
||||
* 3. All advertising materials mentioning features or use of this software
|
||||
* must display the following acknowledgement:
|
||||
* must display the following acknowledgment:
|
||||
* This product includes software developed by the University of
|
||||
* California, Berkeley and its contributors.
|
||||
* 4. Neither the name of the University nor the names of its contributors
|
||||
@ -487,7 +487,7 @@ relpbuf(bp, pfreecnt)
|
||||
*
|
||||
* io completion routine for child bp. Currently we fudge a bit
|
||||
* on dealing with b_resid. Since users of these routines may issue
|
||||
* multiple children simultaniously, sequencing of the error can be lost.
|
||||
* multiple children simultaneously, sequencing of the error can be lost.
|
||||
*/
|
||||
|
||||
static void
|
||||
@ -530,7 +530,7 @@ vm_pager_chain_iodone(struct buf *nbp)
|
||||
*
|
||||
* Obtain a physical buffer and chain it to its parent buffer. When
|
||||
* I/O completes, the parent buffer will be B_SIGNAL'd. Errors are
|
||||
* automatically propogated to the parent
|
||||
* automatically propagated to the parent
|
||||
*
|
||||
* Since these are brand new buffers, we do not have to clear B_INVAL
|
||||
* and B_ERROR because they are already clear.
|
||||
|
@ -11,7 +11,7 @@
|
||||
* notice, this list of conditions and the following disclaimer in the
|
||||
* documentation and/or other materials provided with the distribution.
|
||||
* 3. All advertising materials mentioning features or use of this software
|
||||
* must display the following acknowledgement:
|
||||
* must display the following acknowledgment:
|
||||
* This product includes software developed by the University of
|
||||
* California, Berkeley and its contributors.
|
||||
* 4. Neither the name of the University nor the names of its contributors
|
||||
|
@ -16,7 +16,7 @@
|
||||
* notice, this list of conditions and the following disclaimer in the
|
||||
* documentation and/or other materials provided with the distribution.
|
||||
* 3. All advertising materials mentioning features or use of this software
|
||||
* must display the following acknowledgement:
|
||||
* must display the following acknowledgment:
|
||||
* This product includes software developed by the University of
|
||||
* California, Berkeley and its contributors.
|
||||
* 4. Neither the name of the University nor the names of its contributors
|
||||
|
@ -18,7 +18,7 @@
|
||||
* notice, this list of conditions and the following disclaimer in the
|
||||
* documentation and/or other materials provided with the distribution.
|
||||
* 3. All advertising materials mentioning features or use of this software
|
||||
* must display the following acknowledgement:
|
||||
* must display the following acknowledgment:
|
||||
* This product includes software developed by the University of
|
||||
* California, Berkeley and its contributors.
|
||||
* 4. Neither the name of the University nor the names of its contributors
|
||||
@ -806,7 +806,7 @@ vnode_pager_generic_getpages(vp, m, bytecount, reqpage)
|
||||
* whether or not to leave the page activated is up in
|
||||
* the air, but we should put the page on a page queue
|
||||
* somewhere. (it already is in the object). Result:
|
||||
* It appears that emperical results show that
|
||||
* It appears that empirical results show that
|
||||
* deactivating pages is best.
|
||||
*/
|
||||
|
||||
|
Loading…
Reference in New Issue
Block a user