zoukankan      html  css  js  c++  java
  • 16.2.2火车站售票系统模拟程序(CriticalSection)

    #include<iostream>
    #include<Windows.h>
    using namespace std;

    DWORD WINAPI ThreadProc1(LPVOID lpParameter);
    DWORD WINAPI ThreadProc2(LPVOID lpParameter);

    CRITICAL_SECTION CriticalSection;
    int tickets = 100;

    int main()
    {
     InitializeCriticalSection(&CriticalSection);
     HANDLE hThread1 = CreateThread(NULL,0,ThreadProc1,NULL,0,NULL);
     HANDLE hThread2 = CreateThread(NULL,0,ThreadProc2,NULL,0,NULL);


     Sleep(4000);
     DeleteCriticalSection(&CriticalSection);

    CloseHandle(hThread1);

    CloseHandle(hThread2);

     return 0;
    }

    DWORD WINAPI ThreadProc1(LPVOID lpParameter)
    {
     while(TRUE)
     {
      EnterCriticalSection(&CriticalSection);
      Sleep(1);
      if(tickets > 0)
      {
       Sleep(1);
       cout<<"ThreadProc1 sells "<<tickets--<<endl;
       LeaveCriticalSection(&CriticalSection);
      }
      else
      {
       LeaveCriticalSection(&CriticalSection);
       break;
      }
     }
     return 0;
    }

    DWORD WINAPI ThreadProc2(LPVOID lpParameter)
    {
     while(TRUE)
     {
      EnterCriticalSection(&CriticalSection);
      Sleep(1);
      if(tickets > 0)
      {
       Sleep(1);
       cout<<"ThreadProc2 sells "<<tickets--<<endl;
       LeaveCriticalSection(&CriticalSection);
      }
      else
      {
       LeaveCriticalSection(&CriticalSection);
       break;
      }
     }
     return 0;
    }

    //临界区要在线程执行前初始化,因为线程一但被建立即开始运行(除非手工挂起),但线程建立后在初始化临界区可能出现问题

  • 相关阅读:
    uoj#207 共价大爷游长沙
    bzoj4006 [JLOI2015]管道连接
    bzoj2595 [Wc2008]游览计划
    uoj#300.【CTSC2017】吉夫特
    bzoj2565 最长双回文串
    bzoj2342 [Shoi2011]双倍回文
    bzoj3676 [Apio2014]回文串
    [转载]物理大神的八卦完整版——大爱物理
    低层次数论书籍大杂烩
    控制论课题
  • 原文地址:https://www.cnblogs.com/BeyondTechnology/p/1813096.html
Copyright © 2011-2022 走看看