問題描述

是否可以在遞歸 C++ 函數(shù)中捕獲堆棧溢出異常?如果是，怎么辦?

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

那么在這種情況下會發(fā)生什么

so what will happen in this case

void doWork()
{

     try() {

     doWork();    
     }


     catch( ... )  {

     doWork();    
     }
}  

我不是在尋找特定操作系統(tǒng)的答案.只是一般

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

推薦答案

這本身并不是一個例外，但如果您只想將堆棧使用限制在一個固定的數(shù)量，您可以這樣做:

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;
}

這篇關(guān)于捕獲“堆棧溢出"遞歸 C++ 函數(shù)中的異常的文章就介紹到這了，希望我們推薦的答案對大家有所幫助，也希望大家多多支持html5模板網(wǎng)！