zoukankan      html  css  js  c++  java
  • 多线程异步管理——信号

    #include <stdio.h>
    #include <pthread.h>
    #include <stdlib.h>
    #include <unistd.h>
    #include <signal.h>
    void *sigone_program(void *arg);
    void *sigtwo_program(void *arg);
    void report(int);
    
    int main(int argc,char *argv[])
    {
        int i;
        void *status;
        pthread_t thread_one,thread_two;
        if(pthread_create(&thread_one,NULL,sigone_program,NULL)!=0)
        {
            fprintf(stderr,"pthread_create failure
    ");
            exit(EXIT_FAILURE);
        }
        if(pthread_create(&thread_two,NULL,sigtwo_program,NULL)!=0)
        {
            fprintf(stderr,"pthread_create failure
    ");
            exit(EXIT_FAILURE);
        }
        sleep(1);
        printf("this is parent, send SIGUSR1, SIGUSR2 to thread %u
    ",thread_one);
        if(pthread_kill(thread_one,SIGUSR1)!=0)
        {
            perror("pthread_kill");
            exit(EXIT_FAILURE);
        }
        if(pthread_kill(thread_one,SIGUSR2)!=0)
        {
            perror("pthread_kill");
            exit(EXIT_FAILURE);
        }
        printf("this is parent, send SIGUSR1, SIGUSR2 to thread %u
    ",thread_two);
        if(pthread_kill(thread_two,SIGUSR1)!=0)
        {
            perror("pthread_kill");
            exit(EXIT_FAILURE);
        }
        if(pthread_kill(thread_two,SIGUSR2)!=0)
        {
            perror("pthread_kill");
            exit(EXIT_FAILURE);
        }
        sleep(1);
        if(pthread_kill(thread_one,SIGKILL)!=0)
        {
            perror("pthread_kill");
            exit(EXIT_FAILURE);
        }
        if(pthread_kill(thread_two,SIGKILL)!=0)
        {
            perror("pthread_kill");
            exit(EXIT_FAILURE);
        }
        pthread_join(thread_two,NULL);
        pthread_join(thread_one,NULL);
        return 0;
    }
    void *sigone_program(void *arg)
    {
        int i;
        __sigset_t set;
        signal(SIGUSR1,report);
        sigfillset(&set);
        sigdelset(&set,SIGUSR2);
        pthread_sigmask(SIG_SETMASK,&set,NULL);
        for(i=0;i<5;i++)
        {
            printf("this is set mask %u thread
    ",pthread_self());
            pause();
        }
    }
    
    void report(int sig)
    {
        printf("
    in signal, the sig=%d	, the thread id=%u
    ",sig,pthread_self());
    }
    
    void *sigtwo_program(void *arg)
    {
        int i;
        signal(SIGUSR2,report);
        for(i=0;i<5;i++)
        {
            printf("this is no set mask %u thread
    ",pthread_self());
            pause();
        }
    }

  • 相关阅读:
    Codeforces Round #384 (Div. 2)
    Codeforces Round #383 (Div. 2)
    bzoj-4514(网络流)
    bzoj-4518 4518: [Sdoi2016]征途(斜率优化dp)
    bzoj-1096 1096: [ZJOI2007]仓库建设(斜率优化dp)
    hdu-5988 Coding Contest(费用流)
    hdu-5992 Finding Hotels(kd-tree)
    用链表实现杭电1276士兵队列训练问题
    循环链表
    图书管理系统
  • 原文地址:https://www.cnblogs.com/lakeone/p/3792238.html
Copyright © 2011-2022 走看看