嵌入式操作系统 实验报告汇 实验1-5_第1页
嵌入式操作系统 实验报告汇 实验1-5_第2页
嵌入式操作系统 实验报告汇 实验1-5_第3页
嵌入式操作系统 实验报告汇 实验1-5_第4页
嵌入式操作系统 实验报告汇 实验1-5_第5页
已阅读5页,还剩59页未读 继续免费阅读

下载本文档

版权说明:本文档由用户提供并上传,收益归属内容提供方,若内容存在侵权,请进行举报或认领

文档简介

学年第一学期软件学院课程名称嵌入式操作系统报告性质实验一任课教师严海蓉课程性质专业选修课学分2.00学时32

实验1题目:双向链表Tasklist的Creat_Tasklist()、InsertlistNode()和DeletelistNode()函数要求:Creat_Tasklist():动态创建双向链表。DeletelistNode():从给出的链表中断开一个节点并存储该节点。InsertlistNode():将所给的节点链接进链表,可一次性链接多个节点并指定位置。代码:Tasklist.h#include<stdio.h>#include<exception>#include<iostream>usingnamespacestd;#defineMAX_TASKLIST_NODE_NUM5typedefstructNode{chardata;Node*next;Node*pre;}Node;Node*Creat_New_Node();Node*Creat_Tasklist(intNode_Num);boolInsertlistNode(Node**Head,Node*InsertNode_list[],intLocation[],intInsert_Num);Node*DeletelistNode(Node**Head);Tasklist.cpp#include<stdio.h>#include<exception>#include<iostream>#include"Tasklist.h"usingnamespacestd;/*========================================================*创建链表、节点插入、节点移出========================================================*//***@brief创建一个已初始化的新节点*@return返回创建的新节点*/Node*Creat_New_Node(){Node*node=NULL;try{node=(Node*)malloc(sizeof(Node));node->next=NULL;node->pre=NULL;}catch(conststd::exception&e){std::cerr<<e.what()<<'\n';}returnnode;}/***@brief将创建的新节点链接成表*@return返回链表头*/Node*Creat_Tasklist(intNode_Num){Node*Head=NULL;Node*temp=NULL;if(Node_Num<=0){returnNULL;}Head=Creat_New_Node();temp=Head;for(inti=1;i<Node_Num;i++){temp->next=Creat_New_Node();temp->next->pre=temp;temp=temp->next;}returnHead;}/***@brief将创建的新节点链接成表*@paramHead要插入链表的头节点,可能插入位置在头节点位置,所以用Node**类型*@paramInsertNode_list等待插入的节点数组*@paramLocation与'InsertNode_list'相对的插入位置*@paramInsert_Num要插入的节点数量*@returntrue插入成功/false插入失败*/boolInsertlistNode(Node**Head,Node*InsertNode_list[],intLocation[],intInsert_Num){Node*temp_Head=(*Head);Node*temp=NULL;if(Insert_Num<0)returnfalse;for(inti=0;i<Insert_Num;i++){if(*Head==NULL){//插入空链表(*Head)=InsertNode_list[i];(*Head)->next=NULL;(*Head)->pre=NULL;}elseif(Location[i]==0){//插入头位置temp=InsertNode_list[i];temp->next=temp_Head;temp->pre=NULL;temp_Head->pre=temp;(*Head)=temp;}elseif(Location[i]>0){intNode_count=0;while(Node_count<Location[i]&&temp_Head->next!=NULL){temp_Head=temp_Head->next;Node_count++;}if(Node_count==Location[i]){//插入位置位于头和尾中间temp=InsertNode_list[i];temp->pre=temp_Head->pre;temp->next=temp_Head;temp->pre->next=temp;temp_Head->pre=temp;}else{//插入尾位置temp=InsertNode_list[i];temp_Head->next=temp;temp->pre=temp_Head;temp->next=NULL;}}temp_Head=(*Head);InsertNode_list[i]=NULL;}returntrue;}/***@brief从所给链表头Head中移出一个节点,并返回*@paramHead要移出节点的链表头,可能移出的是头节点,所以用Node**类型*@return移出的节点地址,若所给链表为空,则返回空。*/Node*DeletelistNode(Node**Head){//Node*temp=(*Head);if((*Head)==NULL)returnNULL;(*Head)=(*Head)->next;if((*Head)!=NULL){(*Head)->pre=NULL;}temp->next=NULL;temp->pre=NULL;returntemp;}main.cpp#include<stdio.h>#include<exception>#include<iostream>#include"Tasklist.h"usingnamespacestd;intmain(intargc,char*argv[]){//将链表取空,再插入三个,分别为头、尾、中Node*Head=Creat_Tasklist(MAX_TASKLIST_NODE_NUM);Node*Node_list[MAX_TASKLIST_NODE_NUM]={NULL};intNode_Insert_Location[MAX_TASKLIST_NODE_NUM]={0,9,2,0,0};Node_list[0]=DeletelistNode(&Head);Node_list[1]=DeletelistNode(&Head);Node_list[2]=DeletelistNode(&Head);Node_list[3]=DeletelistNode(&Head);Node_list[4]=DeletelistNode(&Head);InsertlistNode(&Head,Node_list,Node_Insert_Location,3);system("pause");}实验结果:Creat_Tasklist(5);创建5个节点的双向链表,按从头到尾的地址顺序为0xda1560,0xda15b0,0xda1600,0xda1650,0xda16a0DeletelistNode(&Head);五次分别每次移出一个节点,移出的节点存放在数组Node_list中。InsertlistNode(&Head,Node_list,Node_Insert_Location,3);将链表取空,再插入三个,分别为头(第一个位置)0xda1560、尾(最后一个位置)0xda1600、中(中间位置)0xda15b0。ADDINCNKISM.UserStyle北京工业大学2022-2023学年第一学期软件学院课程名称嵌入式操作系统报告性质实验二任课教师严海蓉课程性质专业选修课学分2.00学时32

实验2题目:用位图做优先级注册表,编写CreatTask()、SuspendTask()和Findhighestprior()函数要求:CreatTask():创建任务,优先级就绪组与就绪表相应位置置1,从空任务链表中取出一个空任务,设置优先级存入就绪链表中。SuspendTask():暂停任务,将指定优先级的任务从优先级就绪组和就绪表中清除,将任务归还于空任务链表。Findhighestprior():从任务就绪组和任务就绪表中找到最高优先级任务。代码:Tasklist.h(新增按地址删除节点函数)#include<stdio.h>#include<exception>#include<iostream>usingnamespacestd;#defineMAX_TASKLIST_NODE_NUM64typedefstructNode{chardata;Node*next;Node*pre;intpriority;}Node;Node*Creat_New_Node();Node*Creat_Tasklist(intNode_Num);boolInsertlistNode(Node**Head,Node*InsertNode_list[],intLocation[],intInsert_Num);Node*DeletelistNode(Node**Head);voidDeletelistNodebyAdd(Node**Head,Node*DeleteNode);Tasklist.cpp(新增函数)/***@brief从所给链表头Head中移出指定一个节点*@paramHead要移出节点的链表头,可能移出的是头节点,所以用Node**类型*@paramDeleteNode要移出的指定节点*/voidDeletelistNodebyAdd(Node**Head,Node*DeleteNode){//if((*Head)==DeleteNode){(*Head)=DeleteNode->next;(*Head)->pre=NULL;DeleteNode->next=NULL;}elseif(DeleteNode->next==NULL){Node*temp=DeleteNode->pre;temp->next=NULL;DeleteNode->pre=NULL;}else{Node*temp=DeleteNode->pre;temp->next=DeleteNode->next;DeleteNode->next->pre=temp;DeleteNode->next=NULL;DeleteNode->pre=NULL;}}OSRdyTbl.h/*===================================*用位图做优先级注册表===================================*/#include<stdio.h>#include<iostream>#defineMAX_NUM_OSRDYGRP8voidCreatTaskPriority(intpriority);voidSuspendTaskPriority(intpriority);intFindHighestTaskPrior();OSRdyTbl.cpp/*===================================*用位图做优先级注册表===================================*/#include<stdio.h>#include<iostream>#include<OSRdyTbl.h>charOSRdyGrp;//任务就绪组unsignedcharOSRdyTbl[MAX_NUM_OSRDYGRP];//任务就绪表unsignedintOSMapTbl[MAX_NUM_OSRDYGRP]={0x01,0x02,0x04,0x08,0x10,0x20,0x40,0x80};unsignedintconstOSUnMapTbl[256]={0,0,1,0,2,0,1,0,3,0,1,0,2,0,1,0,/*0x00to0x0F*/4,0,1,0,2,0,1,0,3,0,1,0,2,0,1,0,/*0x10to0x1F*/5,0,1,0,2,0,1,0,3,0,1,0,2,0,1,0,/*0x20to0x2F*/4,0,1,0,2,0,1,0,3,0,1,0,2,0,1,0,/*0x30to0x3F*/6,0,1,0,2,0,1,0,3,0,1,0,2,0,1,0,/*0x40to0x4F*/4,0,1,0,2,0,1,0,3,0,1,0,2,0,1,0,/*0x50to0x5F*/5,0,1,0,2,0,1,0,3,0,1,0,2,0,1,0,/*0x60to0x6F*/4,0,1,0,2,0,1,0,3,0,1,0,2,0,1,0,/*0x70to0x7F*/7,0,1,0,2,0,1,0,3,0,1,0,2,0,1,0,/*0x80to0x8F*/4,0,1,0,2,0,1,0,3,0,1,0,2,0,1,0,/*0x90to0x9F*/5,0,1,0,2,0,1,0,3,0,1,0,2,0,1,0,/*0xA0to0xAF*/4,0,1,0,2,0,1,0,3,0,1,0,2,0,1,0,/*0xB0to0xBF*/6,0,1,0,2,0,1,0,3,0,1,0,2,0,1,0,/*0xC0to0xCF*/4,0,1,0,2,0,1,0,3,0,1,0,2,0,1,0,/*0xD0to0xDF*/5,0,1,0,2,0,1,0,3,0,1,0,2,0,1,0,/*0xE0to0xEF*/4,0,1,0,2,0,1,0,3,0,1,0,2,0,1,0/*0xF0to0xFF*/};/***@brief位图优先级注册*@parampriority注册任务的优先级*/voidCreatTaskPriority(intpriority){OSRdyGrp|=OSMapTbl[priority>>3];OSRdyTbl[priority>>3]|=OSMapTbl[priority&0x07];}/***@brief位图优先级清除*@parampriority清除任务的优先级*/voidSuspendTaskPriority(intpriority){if((OSRdyTbl[priority>>3]&=~OSMapTbl[priority&0x07])==0)OSRdyGrp&=~OSMapTbl[priority>>3];}/***@brief找到位图中最高优先级*@returnint:最高优先级*/intFindHighestTaskPrior(){inthigh3Bit=OSUnMapTbl[OSRdyGrp];intlow3Bit=OSUnMapTbl[OSRdyTbl[high3Bit]];return(high3Bit<<3)+low3Bit;}Task.h#include<stdio.h>#include<iostream>voidCreatTask(Node**OSTCBFreeList,Node**OSTCBReadyList,Node*OSTCBPrioTb1[],intpriority);voidSuspendTask(Node**OSTCBFreeList,Node**OSTCBReadyList,Node*OSTCBPrioTb1[],intpriority);voidFindhighestprior(Node**highestpriorNode,Node*OSTCBPrioTb1[]);Task.cpp/*===================================*(2)用位图做优先级注册表,编写*CreatTask()*SuspendTask()*Findhighestprior()===================================*/#include<stdio.h>#include<iostream>#include<OSRdyTbl.h>#include<Tasklist.h>/***@brief创建任务,添加优先级*@paramOSTCBFreeList任务控制块链表:空任务池*@paramOSTCBReadyList任务控制块链表:就绪任务表*@paramOSTCBPrioTb1优先级映射任务地址表*@parampriority操作任务的优先级*/voidCreatTask(Node**OSTCBFreeList,Node**OSTCBReadyList,Node*OSTCBPrioTb1[],intpriority){intlocation[1]={0};Node*TempNode[1]={DeletelistNode(OSTCBFreeList)};if(TempNode==NULL){perror("Can'tfindFreeOSTCB");}TempNode[0]->priority=priority;CreatTaskPriority(priority);OSTCBPrioTb1[priority]=TempNode[0];InsertlistNode(OSTCBReadyList,TempNode,location,1);}/***@brief暂停任务,取消优先级*@paramOSTCBFreeList任务控制块链表:空任务池*@paramOSTCBReadyList任务控制块链表:就绪任务表*@paramOSTCBPrioTb1优先级映射任务地址表*@parampriority操作任务的优先级*/voidSuspendTask(Node**OSTCBFreeList,Node**OSTCBReadyList,Node*OSTCBPrioTb1[],intpriority){intlocation[1]={0};Node*TempNode[1]={OSTCBPrioTb1[priority]};DeletelistNodebyAdd(OSTCBReadyList,OSTCBPrioTb1[priority]);InsertlistNode(OSTCBFreeList,TempNode,location,1);OSTCBPrioTb1[priority]=NULL;SuspendTaskPriority(priority);}/***@brief找到最高优先级任务,存入highestpriorNode*@paramhighestpriorNode最高优先级任务地址*@paramOSTCBPrioTb1优先级映射任务地址表*/voidFindhighestprior(Node**highestpriorNode,Node*OSTCBPrioTb1[]){*highestpriorNode=OSTCBPrioTb1[FindHighestTaskPrior()];}main.cpp#include<stdio.h>#include<exception>#include<iostream>#include"Tasklist.h"#include<Task.h>usingnamespacestd;Node*OSTCBFreeList=Creat_Tasklist(MAX_TASKLIST_NODE_NUM);Node*OSTCBReadyList=NULL;Node*OSTCBPrioTb1[MAX_TASKLIST_NODE_NUM]={NULL};Node*highestpriorNode=NULL;intNode_Insert_Location[MAX_TASKLIST_NODE_NUM]={0};intmain(intargc,char*argv[]){//创建优先级为7和6的两个任务,之后查找最高优先级任务,并将其暂停CreatTask(&OSTCBFreeList,&OSTCBReadyList,OSTCBPrioTb1,7);CreatTask(&OSTCBFreeList,&OSTCBReadyList,OSTCBPrioTb1,6);Findhighestprior(&highestpriorNode,OSTCBPrioTb1);SuspendTask(&OSTCBFreeList,&OSTCBReadyList,OSTCBPrioTb1,highestpriorNode->priority);system("pause");}实验结果:创建优先级为7和6的两个任务,优先级就绪组第一位为1,则存在0-7优先级的任务,优先级就绪表第一个元素为192(二进制:11000000),表示有7、6两个优先级的任务存在。就绪任务链表中任务地址分别为(0xe31560,7)和(0xe315b0,6)找到最高优先级6的任务,地址为0xe315b0暂停最高优先级(6)的任务,任务从就绪表中退出还入空任务表中。优先级就绪组第一位为1,则存在0-7优先级的任务,优先级就绪表第一个元素为128(二进制:10000000),表示只有7优先级的任务存在。ADDINCNKISM.UserStyle北京工业大学2022-2023学年第一学期软件学院课程名称嵌入式操作系统报告性质实验三任课教师严海蓉课程性质专业选修课学分2.00学时32

实验题目:任务控制块的OS_Resume()、OS_Suspend()和信号量的发送OS_Sempend()函数要求:OS_Resume():任务恢复,可能恢复到就绪态也可能恢复后仍然在等待态。OS_Suspend():任务挂起。OS_Sempend():信号量的发送。代码:OS.cpp/*==========================================*任务控制块的OS_Resume()、OS_Suspend()*信号量的发送OS_Sempend()==========================================*/#include<stdio.h>#include<iostream>#include"Tasklist.h"#include<Task.h>#include<OSRdyTbl.h>#include<OS.h>Node*CurrentTCB=NULL;/***@brief任务恢复*@paramOSTCBWaitList任务等待链*@paramOSTCBReadyList任务就绪链*@paramOSTCBFreeList空任务表链*@paramOSTCB恢复的任务TCB*@paramOSTCBPrioTb1任务就绪组*@returnbool:true恢复到就绪态/false未能恢复到就绪态*/boolOS_Resume(Node**OSTCBWaitList,Node**OSTCBReadyList,Node**OSTCBFreeList,Node*OSTCB,Node*OSTCBPrioTb1[]){intsem;if(OSTCB==CurrentTCB)returnfalse;if(!OS_Sempend(OSTCB,&sem)){//判断任务是否被挂起if(sem==-1){OSTCB->sem++;OSTCB->sem++;//从挂起列表中移除intlocation[1]={0};DeletelistNodebyAdd(OSTCBWaitList,OSTCB);Node*TempNode[1]={OSTCB};if(OSTCB->priority<=CurrentTCB->priority){//完成一次任务切换//当前任务加入//OSTCB->m_lock.lock();TempNode[0]=CurrentTCB;InsertlistNode(OSTCBReadyList,TempNode,location,1);CreatTaskPriority(CurrentTCB->priority);OSTCBPrioTb1[CurrentTCB->priority]=CurrentTCB;CurrentTCB=OSTCB;//OSTCB->m_lock.unlock();}else{InsertlistNode(OSTCBReadyList,TempNode,location,1);CreatTaskPriority(OSTCB->priority);OSTCBPrioTb1[OSTCB->priority]=CurrentTCB;}returntrue;}else{OSTCB->sem++;OSTCB->sem++;returnfalse;}}}/***@brief任务挂起*@paramOSTCBFreeList空任务表链*@paramOSTCBWaitList任务等待链*@paramOSTCBReadyList任务就绪链*@paramOSTCB挂起的任务TCB*@paramOSTCBPrioTb1任务就绪组*/voidOS_Suspend(Node**OSTCBFreeList,Node**OSTCBWaitList,Node**OSTCBReadyList,Node*OSTCB,Node*OSTCBPrioTb1[]){intval=0;Node*TempNode[1]={NULL};intlocation[1]={0};OS_Sempend(OSTCB,&val);if(OSTCB==CurrentTCB){TempNode[0]=CurrentTCB;Node*highestpriorNode=NULL;InsertlistNode(OSTCBWaitList,TempNode,location,1);SuspendTaskPriority(CurrentTCB->priority);OSTCBPrioTb1[CurrentTCB->priority]=NULL;Findhighestprior(&highestpriorNode,OSTCBPrioTb1);DeletelistNodebyAdd(OSTCBReadyList,highestpriorNode);SuspendTaskPriority(highestpriorNode->priority);OSTCBPrioTb1[highestpriorNode->priority]=NULL;CurrentTCB=highestpriorNode;}elseif(val==0){//挂起队列TempNode[0]=OSTCB;InsertlistNode(OSTCBWaitList,TempNode,location,1);SuspendTaskPriority(OSTCB->priority);OSTCBPrioTb1[OSTCB->priority]=NULL;}}/***@brief任务信号量的发送*@paramOSTCB当前任务TCB*@paramval返回当前任务TCB信号量*@returnbool:true信号量可用/flase信号量不可用*/boolOS_Sempend(Node*OSTCB,int*val){//OSTCB->m_lock.lock();if(OSTCB->sem>0){//信号量可用OSTCB->sem--;*val=OSTCB->sem;//OSTCB->m_lock.unlock();returntrue;}else{//信号量不可用OSTCB->sem--;*val=OSTCB->sem;//OSTCB->m_lock.unlock();returnfalse;}}Node*getCurrentTCB(){returnCurrentTCB;}boolsetCurrentTCB(Node*OSTCB){CurrentTCB=OSTCB;returntrue;}main.cpp#include<stdio.h>#include<exception>#include<iostream>#include"Tasklist.h"#include<Task.h>#include<OS.h>#include<mutex>#include<OSRdyTbl.h>usingnamespacestd;Node*OSTCBFreeList=Creat_Tasklist(MAX_TASKLIST_NODE_NUM);Node*OSTCBReadyList=NULL;Node*OSTCBWaitList=NULL;Node*OSTCBPrioTb1[MAX_TASKLIST_NODE_NUM]={NULL};Node*highestpriorNode=NULL;intNode_Insert_Location[MAX_TASKLIST_NODE_NUM]={0};intmain(intargc,char*argv[]){/*===============================================*环境为优先级为5、7的就绪任务,*当前任务为优先级为6的任务*将优先级为5的任务挂起两遍*再将优先级为5的任务恢复两遍===============================================*/CreatTask(&OSTCBFreeList,&OSTCBReadyList,OSTCBPrioTb1,7);CreatTask(&OSTCBFreeList,&OSTCBReadyList,OSTCBPrioTb1,6);Findhighestprior(&highestpriorNode,OSTCBPrioTb1);//SuspendTask(&OSTCBFreeList,&OSTCBReadyList,OSTCBPrioTb1,highestpriorNode->priority);setCurrentTCB(highestpriorNode);CreatTask(&OSTCBFreeList,&OSTCBReadyList,OSTCBPrioTb1,5);Node*CurrentTCB=getCurrentTCB();DeletelistNodebyAdd(&OSTCBReadyList,CurrentTCB);SuspendTaskPriority(CurrentTCB->priority);OSTCBPrioTb1[CurrentTCB->priority]=NULL;Findhighestprior(&highestpriorNode,OSTCBPrioTb1);DeletelistNodebyAdd(&OSTCBReadyList,highestpriorNode);OS_Suspend(&OSTCBFreeList,&OSTCBWaitList,&OSTCBReadyList,highestpriorNode,OSTCBPrioTb1);CurrentTCB=getCurrentTCB();OS_Suspend(&OSTCBFreeList,&OSTCBWaitList,&OSTCBReadyList,highestpriorNode,OSTCBPrioTb1);CurrentTCB=getCurrentTCB();OS_Resume(&OSTCBWaitList,&OSTCBReadyList,&OSTCBFreeList,OSTCBWaitList,OSTCBPrioTb1);OS_Resume(&OSTCBWaitList,&OSTCBReadyList,&OSTCBFreeList,OSTCBWaitList,OSTCBPrioTb1);CurrentTCB=getCurrentTCB();system("pause");}实验结果:环境为优先级为5、7的就绪任务,当前任务为优先级为6的任务。将优先级为5的任务挂起两遍,信号量sem为-1再将优先级为5的任务恢复两遍,由于恢复的任务优先级更高,则发生任务调度。ADDINCNKISM.UserStyle北京工业大学2022-2023学年第一学期软件学院课程名称嵌入式操作系统报告性质实验四任课教师严海蓉课程性质专业选修课学分2.00学时32

实验4题目:事件标志组的OS_FlagBlock()函数要求:OS_FlagBlock():暂停任务,直到收到事件标志。代码:OS_Flag.cpp/*=============================*事件标志组的OS_FlagBlock()函数=============================*/#include<iostream>#include<OS_Flag.h>#include"Tasklist.h"#include<OS.h>OS_Flags*OS_FlagsGrp=NULL;/***@brief事件标志组初始化*@returnOS_Flags:返回事件标志组*/OS_Flags*OS_Flagsinit(){OS_FlagsGrp=(OS_Flags*)malloc(sizeof(OS_Flags));OS_FlagsGrp->OS_FlagQty=0;OS_FlagsGrp->Pendlist=NULL;returnOS_FlagsGrp;}/***@brief创建事件标志*@returnOS_Flag:返回事件标志*/OS_Flag*OS_FlagCreate(){OS_Flag*flag=(OS_Flag*)malloc(sizeof(OS_Flag));flag->CurrentTCB=NULL;flag->flag_next=NULL;flag->flag_pre=NULL;returnflag;}/***@brief暂停任务,直到收到事件标志*@paramOS_flag当前事件标志*@paramflags*@paramWait_Type等待模式*@paramCurrentTCB当前任务*@paramOSTCBFreeList空任务表链*@paramOSTCBWaitList任务等待链*@paramOSTCBReadyList任务就绪链*@paramOSTCBPrioTb1任务就绪组*/voidOS_FlagBlock(OS_Flag*OS_flag,charflags,intWait_Type,Node*CurrentTCB,Node**OSTCBFreeList,Node**OSTCBWaitList,Node**OSTCBReadyList,Node*OSTCBPrioTb1[]){OS_flag->CurrentTCB=CurrentTCB;OS_flag->Wait_Type=Wait_Type;OS_flag->flags=flags;OS_FlagsGrp->OS_FlagQty++;OS_flag->flag_next=OS_FlagsGrp->Pendlist;if((OS_FlagsGrp->Pendlist)!=NULL)OS_FlagsGrp->Pendlist->flag_pre=OS_flag;OS_FlagsGrp->Pendlist=OS_flag;OS_Suspend(OSTCBFreeList,OSTCBWaitList,OSTCBReadyList,CurrentTCB,OSTCBPrioTb1);}OS_Flag.h#include<iostream>#include"Tasklist.h"#ifndef_OS_Flags_OS_Flag_#define_OS_Flags_OS_Flag_typedefstructOS_Flag{charflags;//8位Node*CurrentTCB;OS_Flag*flag_next;OS_Flag*flag_pre;intWait_Type;}OS_Flag;typedefstructOS_Flags{OS_Flag*Pendlist;intOS_FlagQty;}OS_Flags;#endifOS_Flags*OS_Flagsinit();OS_Flag*OS_FlagCreate();voidOS_FlagBlock(OS_Flag*OS_flag,charflags,intWait_Type,Node*CurrentTCB,Node**OSTCBFreeList,Node**OSTCBWaitList,Node**OSTCBReadyList,Node*OSTCBPrioTb1[]);main.cpp#include<stdio.h>#include<exception>#include<iostream>#include"Tasklist.h"#include<Task.h>#include<OS.h>#include<mutex>#include<OSRdyTbl.h>#include<OS_Flag.h>usingnamespacestd;Node*OSTCBFreeList=Creat_Tasklist(MAX_TASKLIST_NODE_NUM);Node*OSTCBReadyList=NULL;Node*OSTCBWaitList=NULL;Node*OSTCBPrioTb1[MAX_TASKLIST_NODE_NUM]={NULL};Node*highestpriorNode=NULL;intNode_Insert_Location[MAX_TASKLIST_NODE_NUM]={0};intmain(intargc,char*argv[]){/*===============================================*创建事件标志,暂停任务,直到收到事件标志或发生超时===============================================*/CreatTask(&OSTCBFreeList,&OSTCBReadyList,OSTCBPrioTb1,7);CreatTask(&OSTCBFreeList,&OSTCBReadyList,OSTCBPrioTb1,6);Findhighestprior(&highestpriorNode,OSTCBPrioTb1);//SuspendTask(&OSTCBFreeList,&OSTCBReadyList,OSTCBPrioTb1,highestpriorNode->priority);setCurrentTCB(highestpriorNode);CreatTask(&OSTCBFreeList,&OSTCBReadyList,OSTCBPrioTb1,5);Node*CurrentTCB=getCurrentTCB();DeletelistNodebyAdd(&OSTCBReadyList,CurrentTCB);SuspendTaskPriority(CurrentTCB->priority);OSTCBPrioTb1[CurrentTCB->priority]=NULL;OS_Flags*OS_FlagsGrp=OS_Flagsinit();OS_Flag*flag=OS_FlagCreate();CurrentTCB=getCurrentTCB();OS_FlagBlock(flag,'0',0,CurrentTCB,&OSTCBFreeList,&OSTCBWaitList,&OSTCBReadyList,OSTCBPrioTb1);CurrentTCB=getCurrentTCB();system("pause");}实验结果:创建事件标志,将任务暂停,事件标志入事件标志组ADDINCNKISM.UserStyle北京工业大学2022-2023学年第一学期软件学院课程名

温馨提示

  • 1. 本站所有资源如无特殊说明,都需要本地电脑安装OFFICE2007和PDF阅读器。图纸软件为CAD,CAXA,PROE,UG,SolidWorks等.压缩文件请下载最新的WinRAR软件解压。
  • 2. 本站的文档不包含任何第三方提供的附件图纸等,如果需要附件,请联系上传者。文件的所有权益归上传用户所有。
  • 3. 本站RAR压缩包中若带图纸,网页内容里面会有图纸预览,若没有图纸预览就没有图纸。
  • 4. 未经权益所有人同意不得将文件中的内容挪作商业或盈利用途。
  • 5. 人人文库网仅提供信息存储空间,仅对用户上传内容的表现方式做保护处理,对用户上传分享的文档内容本身不做任何修改或编辑,并不能对任何下载内容负责。
  • 6. 下载文件中如有侵权或不适当内容,请与我们联系,我们立即纠正。
  • 7. 本站不保证下载资源的准确性、安全性和完整性, 同时也不承担用户因使用这些下载资源对自己和他人造成任何形式的伤害或损失。

最新文档

评论

0/150

提交评论