vm_fault.c (ccbb2f72267a06a8eaa731c123d1fb41ac71f69f) vm_fault.c (21bf3904189702ecb7edd37ab60c76fcf033dcbd)
1/*
2 * Copyright (c) 1991, 1993
3 * The Regents of the University of California. All rights reserved.
4 * Copyright (c) 1994 John S. Dyson
5 * All rights reserved.
6 * Copyright (c) 1994 David Greenman
7 * All rights reserved.
8 *

--- 52 unchanged lines hidden (view full) ---

61 * Software Distribution Coordinator or Software.Distribution@CS.CMU.EDU
62 * School of Computer Science
63 * Carnegie Mellon University
64 * Pittsburgh PA 15213-3890
65 *
66 * any improvements or extensions that they make and grant Carnegie the
67 * rights to redistribute these changes.
68 *
1/*
2 * Copyright (c) 1991, 1993
3 * The Regents of the University of California. All rights reserved.
4 * Copyright (c) 1994 John S. Dyson
5 * All rights reserved.
6 * Copyright (c) 1994 David Greenman
7 * All rights reserved.
8 *

--- 52 unchanged lines hidden (view full) ---

61 * Software Distribution Coordinator or Software.Distribution@CS.CMU.EDU
62 * School of Computer Science
63 * Carnegie Mellon University
64 * Pittsburgh PA 15213-3890
65 *
66 * any improvements or extensions that they make and grant Carnegie the
67 * rights to redistribute these changes.
68 *
69 * $Id: vm_fault.c,v 1.29 1995/09/06 05:37:39 dyson Exp $
69 * $Id: vm_fault.c,v 1.30 1995/09/11 00:45:15 dyson Exp $
70 */
71
72/*
73 * Page fault handling module.
74 */
75
76#include <sys/param.h>
77#include <sys/systm.h>

--- 951 unchanged lines hidden (view full) ---

1029 for (i = 0; i < size; i++) {
1030 if (i != treqpage) {
1031 rtm = vm_page_alloc(object,
1032 startoffset + i * NBPG, VM_ALLOC_NORMAL);
1033 if (rtm == NULL) {
1034 if (i < treqpage) {
1035 int j;
1036 for (j = 0; j < i; j++) {
70 */
71
72/*
73 * Page fault handling module.
74 */
75
76#include <sys/param.h>
77#include <sys/systm.h>

--- 951 unchanged lines hidden (view full) ---

1029 for (i = 0; i < size; i++) {
1030 if (i != treqpage) {
1031 rtm = vm_page_alloc(object,
1032 startoffset + i * NBPG, VM_ALLOC_NORMAL);
1033 if (rtm == NULL) {
1034 if (i < treqpage) {
1035 int j;
1036 for (j = 0; j < i; j++) {
1037 FREE_PAGE(marray[i]);
1037 FREE_PAGE(marray[j]);
1038 }
1039 *reqpage = 0;
1040 marray[0] = m;
1041 return 1;
1042 } else {
1043 size = i;
1044 *reqpage = treqpage;
1045 return size;

--- 15 unchanged lines hidden --- 		1038 }
1039 *reqpage = 0;
1040 marray[0] = m;
1041 return 1;
1042 } else {
1043 size = i;
1044 *reqpage = treqpage;
1045 return size;

--- 15 unchanged lines hidden ---