Search - INT 1 - CodeBus

Search - INT 1 - List

[Disk Tools] 扩展Int 13H调用规范 DL : 0: 硬盘参数释疑到目前为止，人们常说的硬盘参数还是古老的 CHS (Cylinder/Head/Sector)参数。那么为什么要使用这些参数，它们的意义是什么？它们的取值范围是什么？-drive parameters construction date, known as the hard drive or the old parameters CHS (Cylinder/Head/Sector) parameters. Then why should the use of these parameters, what is the meaning? Their value in the range of what?
Date : 2026-01-07 Size : 6kb User : 莫希
[Disk Tools] E820 DL : 0: E820 Address Map描述(用C与Assembly混编) OS必须知道系统物理内存的数量，才能够有效的使用和管理这些物理内存。所以在booting阶段，我们必须通过某种手段来检测和获取物理内存的总量。因此我们利用BIOS中断获取内存容量，常用的是INT 15h, AX=E820h - Query System Address Map的中断方法 -E820 Address Map describe (using C and Assembly mixed) OS system must know the number of physical memory in order to effectively use and manage the physical memory. So booting stage, we must by some means to detect and obtain the total amount of physical memory. Therefore, we use BIOS interrupt access to the amount of memory, commonly used is the INT 15h, AX = E820h- Query System Address Map interruption method
Date : 2026-01-07 Size : 7kb User : 胡太运
[Disk Tools] Partition_structure DL : 0: 基本INT 13H读写磁盘扇区一、读磁盘 MOV AX,0201H MOV BX,7C00H MOV CX,0001H MOV DX,0080H INT 13H INT 3H 二、写磁盘 MOV AX,0301H MOV BX,7C00H MOV CX,0001H MOV DX,0080H INT 13H INT 3H -Partition structure
Date : 2026-01-07 Size : 22kb User : 146
[Disk Tools] NStepSCAN DL : 1: NStepSCAN N步磁盘扫描调度算法C++程序-#include "stdafx.h" #include "stdlib.h" int L,P int a[20] int flag //访问位 typedef struct TASK { int requrie int io } TASK TASK T[50][50] TASK N[50] int diskway //当前磁道 void iodowith() void init() { int i,j for(i=0 i<20 i++) { for(j=0 j<20 j++) { T[i][j].requrie=-1 } } for(i=0 i<L i++) { for(j=0 j<P j++) { T[i][j].requrie=rand() 200 T[i][j].io=rand() 2 } } } void output() { printf("磁盘访问的初始顺序是：\n") for(int i=0 i<L i++) { printf("第 d组是:\n",i+1) for(int j=0 j<P j++) { printf(" d d\t",T[i][j].requrie,T[i][j].io) } printf("\n") } } void sort_btos(TASK x[],int n) { int i,j,k TASK t for(i=0 i<n-1 i++) { k=i for(j=i+1 j<n j++) if(x[j].requrie>x[k].requrie) k=j if(k!=i) { t=x[i] x[i]=x[k] x[k]=t } } } void sort_stob(TASK x[],int n) { int i,j,k TASK t fo
Date : 2026-01-07 Size : 1kb User : 吴英杰