简体   繁体   English

如果不调用 `std::future::get()`,下面的代码片段中是否存在任何潜在问题?

[英]Is there any potential problem in the code snippet below if `std::future::get()` would not be called?

Is there any potential problem in the code snippet below if std::future::get() would not be called?如果不调用std::future::get() ,下面的代码片段中是否存在任何潜在问题?

I did several tests.我做了几个测试。 It seems that the said code works well without invoking std::future::get() even if it takes std::async a long time to finish its work .似乎上述代码在不调用std::future::get()的情况下运行良好,即使std::async需要很长时间才能完成其工作。 It's really out of my expectation.真是出乎我的意料。

    #include<future>
    #include<iostream>
    #include<array>
    #include<algorithm>
    #include<thread>
    #include<vector>

    std::array<int, 100000> arr;
    int sum=0;

    struct Wrapper
    {   
        void consume()
        {
            std::cout << "consumer:" << std::this_thread::get_id() << std::endl;
            std::for_each(arr.begin(), arr.end(), [](int val) {sum+=val; });
        }

        void produce()
        {
            std::cout << "producer:" <<std::this_thread::get_id() << std::endl;
            
            int a=0;
            while(true)
            {
                if(a++>1e9)
                {
                    break;
                }
            }
        }
    };


    int main()
    {
        std::fill(arr.begin(), arr.end(), 1);

        std::cout << "main:" <<std::this_thread::get_id() << std::endl;

        Wrapper wrap;

        std::vector<std::future<void>> vec;
        vec.push_back(std::async(std::launch::async, &Wrapper::produce, &wrap));
        vec.push_back(std::async(std::launch::async, &Wrapper::consume, &wrap));

        #ifdef WAIT  //Is there any potencial problem if the block below does not run?
        for(auto& future:vec)
        {
            future.get();
        }
        #endif
    }

As per the document about std::future destructor (emphasis mine):根据有关std::future 析构函数的文档(强调我的):

these actions will not block for the shared state to become ready, except that it may block if all of the following are true: the shared state was created by a call to std::async, the shared state is not yet ready, and this was the last reference to the shared state .这些操作不会阻塞共享状态准备就绪,除非满足以下所有条件时可能会阻塞:共享状态是通过调用 std::async 创建的,共享状态尚未准备好,并且这是对共享状态的最后引用 (since C++14) (C++14 起)

But it seems only guaranteed by C++14 and afterwards other than C++11 .但它似乎只能由C++14和之后的C++11保证。

And for some cases, std::future::get() still needs to be explicitly called, for example :在某些情况下,仍然需要显式调用std::future::get()例如

    #include<future>
    #include<iostream>
    #include<array>
    #include<algorithm>
    #include<thread>
    #include<vector>

    std::array<int, 100000> arr;
    int sum=0;

    struct Wrapper
    {   
        void consume()
        {
            std::cout << "consumer:" << std::this_thread::get_id() << std::endl;
            std::for_each(arr.begin(), arr.end(), [](int val) {sum+=val; });
        }

        void produce()
        {
            std::cout << "producer:" <<std::this_thread::get_id() << std::endl;
            
            int a=0;
            while(true)
            {
                if(a++>1e9)
                {
                    break;
                }
            }
        }
    };


    int main()
    {
        std::fill(arr.begin(), arr.end(), 1);

        std::cout << "main:" <<std::this_thread::get_id() << std::endl;

        Wrapper wrap;

        std::vector<std::future<void>> vec;
        vec.push_back(std::async(std::launch::async, &Wrapper::produce, &wrap));
        vec.push_back(std::async(std::launch::async, &Wrapper::consume, &wrap));

        std::cout << sum << std::endl;
        #if 1
        for(auto& future:vec)
        {
            future.get();
        }
        #endif
        std::cout << sum << std::endl;
    }

Here is the output of the said code snippet above:以下是上述代码片段的输出:

main:140198225385280
0
producer:140198225381120
consumer:140198216988416
100000

声明:本站的技术帖子网页,遵循CC BY-SA 4.0协议,如果您需要转载,请注明本站网址或者原文地址。任何问题请咨询:yoyou2525@163.com.

 
粤ICP备18138465号  © 2020-2024 STACKOOM.COM