酷代码 AI
菜单
服务商
DeepSeek字节豆包讯飞星火
更多选项

C语言实现分页式存储系统内存分配,含输入合法性与边界检查!

```c #include <stdio.h> // 定义位示图的大小 #define BITMAP_SIZE 64 // 位示图数组 int bitmap[BITMAP_SIZE]; // 初始化位示图,将所有位设置为 0 表示空闲 void initBitmap() { for (int i = 0; i < BITMAP_SIZE; i++) { bitmap[i] = 0; } } // 标记已占用的内存块 void markOccupiedBlocks(int occupiedBlocks[], int numBlocks) { for (int i = 0; i < numBlocks; i++) { bitmap[occupiedBlocks[i]] = 1; } } // 查找空闲内存块 int findFreeBlock() { for (int i = 0; i < BITMAP_SIZE; i++) { if (bitmap[i] == 0) { return i; } } return -1; } // 处理进程申请内存 void handleProcessRequest(int processRequests[], int numProcesses) { int allocatedBlocks[numProcesses]; for (int i = 0; i < numProcesses; i++) { int requestedBlocks = processRequests[i]; int allocated = 0; int startBlock = -1; // 查找连续的空闲块 for (int j = 0; j < BITMAP_SIZE && allocated < requestedBlocks; j++) { if (bitmap[j] == 0) { if (startBlock == -1) { startBlock = j; } allocated++; } else { startBlock = -1; allocated = 0; } } if (allocated == requestedBlocks) { for (int k = startBlock; k < startBlock + requestedBlocks; k++) { bitmap[k] = 1; } allocatedBlocks[i] = startBlock; } else { allocatedBlocks[i] = -1; } } // 输出结果 for (int i = 0; i < numProcesses; i++) { if (allocatedBlocks[i]!= -1) { printf("%d\n", allocatedBlocks[i]); } else { printf("wait\n"); } } } int main() { initBitmap(); int occupiedBlocks[] = {1, 3, 5, 7, 9, 11, 13, 15, 17, 19}; markOccupiedBlocks(occupiedBlocks, sizeof(occupiedBlocks) / sizeof(occupiedBlocks[0])); int processRequests[4]; printf("请输入四个进程申请的内存块数,以空格分隔:\n"); for (int i = 0; i < 4; i++) { scanf("%d", &processRequests[i]); } int numProcesses = 4; handleProcessRequest(processRequests, numProcesses); int processNumber, pageNumber; printf("请输入进程编号和页面编号,以空格分隔:\n"); scanf("%d %d", &processNumber, &pageNumber); if (processNumber >= 1 && processNumber <= 4) { if (allocatedBlocks[processNumber - 1]!= -1) { if (pageNumber >= 0 && pageNumber < processRequests[processNumber - 1]) { int blockNumber = allocatedBlocks[processNumber - 1] + pageNumber; printf("%d\n", blockNumber); } else { printf("error\n"); } } else { printf("wait\n"); } } else { printf("输入的进程编号不正确\n"); } return 0; } ``` 额外需要注意的逻辑点: 1. 处理输入时要确保输入的数值合法,比如进程申请的内存块数不能为负数。 2. 在查找空闲内存块时,要注意边界情况,避免越界访问。 3. 对于进程编号和页面编号的输入错误,要给出清晰明确的提示信息。 ######[AI写代码神器 | 964点数解答 | 2024-11-21 15:40:22]

相关提问
本站限时免费提问中
实用工具查看更多
Linux在线手册 [开发类]
Jquery在线手册 [开发类]
今日油价 [生活类]
图片互转base64 [开发类]
时间转换器 [开发类]