捕捉“堆栈溢出"递归 C++ 函数中的异常

问题描述

是否可以在递归 C++ 函数中捕获 堆栈溢出异常?如果是，怎么办?

Is it possible to catch a stack overflow exception in a recursive C++ function? If so, how?

那么在这种情况下会发生什么

so what will happen in this case

void doWork()
{

     try() {

     doWork();    
     }


     catch( ... )  {

     doWork();    
     }
}  

我不是在寻找特定操作系统的答案.只是一般

I am not looking for an answer to specific OS. Just in general

推荐答案

这本身并不是一个例外，但是如果您只是希望能够将堆栈使用量限制在固定数量，您可以这样做:

It's not an exception per se, but if you just want to be able to limit your stack usage to a fixed amount, you could do something like this:

#include <stdio.h>

// These will be set at the top of main()
static char * _topOfStack;
static int _maxAllowedStackUsage;

int GetCurrentStackSize()
{
   char localVar;
   int curStackSize = (&localVar)-_topOfStack;
   if (curStackSize < 0) curStackSize = -curStackSize;  // in case the stack is growing down
   return curStackSize;
}

void MyRecursiveFunction()
{
   int curStackSize = GetCurrentStackSize();
   printf("MyRecursiveFunction:  curStackSize=%i
", curStackSize);

   if (curStackSize < _maxAllowedStackUsage) MyRecursiveFunction();
   else
   {
      printf("    Can't recurse any more, the stack is too big!
");
   }
}

int main(int, char **)
{
   char topOfStack;
   _topOfStack = &topOfStack;
   _maxAllowedStackUsage = 4096;  // or whatever amount you feel comfortable allowing

   MyRecursiveFunction();
   return 0;
}

这篇关于捕捉“堆栈溢出"递归 C++ 函数中的异常的文章就介绍到这了，希望我们推荐的答案对大家有所帮助，也希望大家多多支持跟版网！