为字符串向量赋值时出现cygwin异常答案

【问题标题】：cygwin exception when assigning value to vector of strings为字符串向量赋值时出现cygwin异常
【发布时间】：2015-05-18 21:10:14
【问题描述】：

我在程序运行过程中遇到以下异常：

0 [main] myFunction 5560 cygwin_exception::open_stackdumpfile: Dumping stack trace to myFunction.exe.stackdump

stackdump文件内容如下：

Stack trace:
Frame        Function    Args
00000223800  0018006FB93 (0060007AE38, 00600083EC8, 00600083EF8, 00600083F28)
00000000006  0018007105A (0060007BB78, 00600000000, 0000000014C, 00000000000)
000002239E0  0018011C6A7 (00600083048, 00600083078, 006000830A8, 006000830D8)
00000000041  001801198DE (0060007DCB8, 0060007DCE8, 00000000000, 0060007DD48)
0060008F2B0  00180119DAB (0060007E1F8, 0060007E228, 0060007E258, 00000000006)
0060008F2B0  00180119F7C (0060007CB38, 0060007CB68, 0060007CB98, 0060007CBC8)
0060008F2B0  0018011A23F (00180115A0B, 0060007CCE8, 006000885B0, 00000000000)
0060008F2B0  00180148A65 (003FC4AA93D, 00600083900, 00100439102, 0060007B080)
0060008F2B0  001800C1DB3 (00000000000, 00000223EE0, 0010042A2BC, 00000223E90)
0060008F2B0  00180115A0B (00000223EE0, 0010042A2BC, 00000223E90, 00000000017)
0060008F2B0  00600000001 (00000223EE0, 0010042A2BC, 00000223E90, 00000000017)
End of stack trace

让我详细描述运行时发生的特殊问题。我无法用语言来描述问题，所以我列出了程序运行时和失败时的场景。

我在头文件中创建了一个字符串向量，并在构造函数中将它们初始化如下：

std::vector <std::string> symbolMap,localSymbolMap;

for(int i=0;i<100;i++){
    symbolMap.push_back(" ");
    localSymbolMap.push_back(" ");
}

我在程序后面定义了一个函数来为这些变量分配适当的值，如下所示：

void TestClient::setTickerMap(int j, std::string symbol, std::string localSymbol){

symbolMap[j] = symbol;
localSymbolMap[j]=localSymbol;
}

现在，在主程序中，我这样调用这个函数：

TestClient client;
for(int j=0;j<27;j++){
std::cout<<j<<" "<<realTimeSymbols[j]<<" "<<getLocalSymbol(realTimeSymbols[j],date)<<std::endl;

client.setTickerMap(j,realTimeSymbols[j],getLocalSymbol(realTimeSymbols[j],date)); } // 这里，我检查了每个 j，realTimeSymbols 和 getLocalSymbol 的值是正确的。

当我运行程序时，我收到上述错误。当 j 等于 24 时程序总是崩溃。

现在以下解决方法正在起作用：

void TestClient ::setTickerMap(int j, std::string symbol, std::string localSymbol){
    if(j==24){
//      symbolMap[j]="SYNDIBANK";
//      localSymbolMap[j]="SYNDIBANK15MARFUT";
    }
    else{
    symbolMap[j] = symbol;
    localSymbolMap[j]=localSymbol;
    }
    if(j==1){
        symbolMap[24]="SYNDIBANK";
        localSymbolMap[24]="SYNDIBANK15MARFUT";
    }
}

以下代码的 3 种变体是上述解决方法不起作用，它们会导致原始错误：

变体 1：

void TestClient ::setTickerMap(int j, std::string symbol, std::string localSymbol){
    if(j==24){
//      symbolMap[j]="SYNDIBANK";
//      localSymbolMap[j]="SYNDIBANK15MARFUT";
    }
    else{
    symbolMap[j] = symbol;
    localSymbolMap[j]=localSymbol;
    }
    if(j==25){
        symbolMap[24]="SYNDIBANK";
        localSymbolMap[24]="SYNDIBANK15MARFUT";
    }
}

变体 2：

void TestClient ::setTickerMap(int j, std::string symbol, std::string localSymbol){
    if(j==24){
        symbolMap[j]="SYNDIBANK";
        localSymbolMap[j]="SYNDIBANK15MARFUT";
    }
    else{
    symbolMap[j] = symbol;
    localSymbolMap[j]=localSymbol;
    }
}

变体 3：

void TestClient ::setTickerMap(int j, std::string symbol, std::string localSymbol){
    if(j==24){
        symbolMap[j]="AB";
        localSymbolMap[j]="SYNDIBANK15MARFUT";
    }
    else{
    symbolMap[j] = symbol;
    localSymbolMap[j]=localSymbol;
    }
}

现在，如果我在变体 3 中为 symbolMap 分配一个字符，如下所示：

 symbolMap[j]="A";

那么代码就可以运行了（虽然结果不正确）。

我无法弄清楚究竟是什么导致了这个运行时错误。我已经检查了相关问题（Cygwin Exception : open stack dump file）并且我没有单独的 cygwin 会话运行。我已经重新启动了我的电脑，只是要格外确定。问题仍然存在。关于为什么在我的电脑上看到此行为的任何建议。

更新： 为确保错误与超出索引无关，主程序的以下调用可以正常工作：

    TestClient client;
    for(int j=25;j<27;j++){
    std::cout<<j<<" "<<realTimeSymbols[j]<<" "<<getLocalSymbol(realTimeSymbols[j],date)<<std::endl;    
  client.setTickerMap(j,realTimeSymbols[j],getLocalSymbol(realTimeSymbols[j],date));
    }

当 j 从 24 迭代到 27 时，程序也可以正常工作。但是当循环从 24 到 27 之前的任何数字迭代时，程序会失败。

GDB 输出 我对 gdb 没有太多经验，但如果有帮助，以下是 gdb 的输出：

GNU gdb (GDB) 7.8
Copyright (C) 2014 Free Software Foundation, Inc.
License GPLv3+: GNU GPL version 3 or later <http://gnu.org/licenses/gpl.html>
This is free software: you are free to change and redistribute it.
There is NO WARRANTY, to the extent permitted by law.  Type "show copying"
and "show warranty" for details.
This GDB was configured as "x86_64-pc-cygwin".
Type "show configuration" for configuration details.
For bug reporting instructions, please see:
<http://www.gnu.org/software/gdb/bugs/>.
Find the GDB manual and other documentation resources online at:
<http://www.gnu.org/software/gdb/documentation/>.
For help, type "help".
Type "apropos word" to search for commands related to "word"...
Reading symbols from order_trading2632_limit.exe...done.
(gdb) run
Starting program: /cygdrive/e/eclipse_workspace/testClient/Debug/testClient.exe
[New Thread 4832.0x11e4]
[New Thread 4832.0x1798]
Attempt 1 of 10000
[New Thread 4832.0x1020]
Connection successful

Program received signal SIGABRT, Aborted.
0x00000003fc4ab0e3 in cygstdc++-6!_ZNSs6assignERKSs () from /usr/bin/cygstdc++-6.dll
(gdb) bt
#0  0x00000003fc4ab0e3 in cygstdc++-6!_ZNSs6assignERKSs () from /usr/bin/cygstdc++-6.dll
#1  0x0000000000000000 in ?? ()
Backtrace stopped: previous frame inner to this frame (corrupt stack?)
(gdb) set $pc=*(void **)$rsp
(gdb) set $rsp=$rsp+8
(gdb) bt
#0  0x000007fefd3110ac in WaitForSingleObjectEx () from /cygdrive/c/Windows/system32/KERNELBASE.dll
#1  0x000000018011c639 in sig_send(_pinfo*, siginfo_t&, _cygtls*) () from /usr/bin/cygwin1.dll
#2  0x00000001801198de in _pinfo::kill(siginfo_t&) () from /usr/bin/cygwin1.dll
#3  0x0000000180119dab in kill0(int, siginfo_t&) () from /usr/bin/cygwin1.dll
#4  0x0000000180119f7c in raise () from /usr/bin/cygwin1.dll
#5  0x000000018011a23f in abort () from /usr/bin/cygwin1.dll
#6  0x0000000180148a65 in dlfree () from /usr/bin/cygwin1.dll
#7  0x00000001800c1db3 in free () from /usr/bin/cygwin1.dll
#8  0x0000000180115a0b in _sigfe () from /usr/bin/cygwin1.dll
#9  0x0000000000000000 in ?? ()
Backtrace stopped: previous frame inner to this frame (corrupt stack?)

请注意，堆栈跟踪已损坏，我使用了以下问题中的技巧来打印堆栈跟踪 (GDB corrupted stack frame - How to debug?)。请帮助我进一步调试程序。

更新

不是只在index为24时才会出现错误。在调用上述循环之前，我初始化了各种int，double和string数组。发生此错误时，更改初始化次数会影响索引。今天，我在运行这个循环之前初始化了长度为 24 的向量，这次错误发生在索引 3 处。

实施该解决方法确实令人沮丧。如果我因此而忽略了其他一些内存问题，我不会这样做。请提出建议。

代码

int main(int argc, char** argv) {
    unsigned int port = 7900;
    const char* host = "";
    int clientId = 6;
    int attempt = 0;
    int MAX_ATTEMPTS=10000;
     int NUMREALTIMESYMBOLS=37;
     std::string realTimeSymbolsArr[]={"a","b","c","d","e","f","g","h","i","j","k","l","m","n","o","p","q","r","s","t","u","v","w","x","y","z","aa","bb","cc","dd","ee","ff","gg","hh","ii","jj","kk"};
     std::vector <std::string> realTimeSymbols(realTimeSymbolsArr,realTimeSymbolsArr+NUMREALTIMESYMBOLS);
     int isTradeable[]={1,0,0,0,1,0,1,1,1,1,1,0,0,1,0,1,1,0,0,0,0,1,0,0,0,0,0,1,1,1,0,1,0,1,1,0,1};
     int numSubscriptions[]={2,2,1,4,1,1,2,6,3,1,1,1,2,1,3,1,1,2,1,3,1,1,1,10,4,1,6,1,1,9,4,2,1,3,1,1,2};
     int subscriptionList[NUMREALTIMESYMBOLS][100];
     int subscriptionIndex[NUMREALTIMESYMBOLS][100];
     subscriptionList[0][0]=0;subscriptionIndex[0][0]=0;
     subscriptionList[0][1]=2;subscriptionIndex[0][1]=2;
     subscriptionList[1][0]=2;subscriptionIndex[1][0]=1;
     subscriptionList[1][1]=0;subscriptionIndex[1][1]=3;
     subscriptionList[2][0]=2;subscriptionIndex[2][0]=0;
     subscriptionList[3][0]=4;subscriptionIndex[3][0]=2;
     subscriptionList[3][1]=31;subscriptionIndex[3][1]=2;
     subscriptionList[3][2]=13;subscriptionIndex[3][2]=3;
     subscriptionList[3][3]=34;subscriptionIndex[3][3]=3;
     subscriptionList[4][0]=4;subscriptionIndex[4][0]=0;
     subscriptionList[5][0]=9;subscriptionIndex[5][0]=2;
     subscriptionList[6][0]=6;subscriptionIndex[6][0]=0;
     subscriptionList[6][1]=8;subscriptionIndex[6][1]=2;
     subscriptionList[7][0]=7;subscriptionIndex[7][0]=0;
     subscriptionList[7][1]=8;subscriptionIndex[7][1]=1;
     subscriptionList[7][2]=31;subscriptionIndex[7][2]=1;
     subscriptionList[7][3]=36;subscriptionIndex[7][3]=1;
     subscriptionList[7][4]=13;subscriptionIndex[7][4]=2;
     subscriptionList[7][5]=34;subscriptionIndex[7][5]=2;
     subscriptionList[8][0]=8;subscriptionIndex[8][0]=0;
     subscriptionList[8][1]=7;subscriptionIndex[8][1]=1;
     subscriptionList[8][2]=21;subscriptionIndex[8][2]=3;
     subscriptionList[9][0]=9;subscriptionIndex[9][0]=0;
     subscriptionList[10][0]=10;subscriptionIndex[10][0]=0;
     subscriptionList[11][0]=11;subscriptionIndex[11][0]=0;
     subscriptionList[12][0]=28;subscriptionIndex[12][0]=3;
     subscriptionList[12][1]=33;subscriptionIndex[12][1]=3;
     subscriptionList[13][0]=13;subscriptionIndex[13][0]=0;
     subscriptionList[14][0]=33;subscriptionIndex[14][0]=1;
     subscriptionList[14][1]=28;subscriptionIndex[14][1]=2;
     subscriptionList[14][2]=15;subscriptionIndex[14][2]=3;
     subscriptionList[15][0]=15;subscriptionIndex[15][0]=0;
     subscriptionList[16][0]=16;subscriptionIndex[16][0]=0;
     subscriptionList[17][0]=0;subscriptionIndex[17][0]=1;
     subscriptionList[17][1]=11;subscriptionIndex[17][1]=2;
     subscriptionList[18][0]=7;subscriptionIndex[18][0]=2;
     subscriptionList[19][0]=6;subscriptionIndex[19][0]=3;
     subscriptionList[19][1]=8;subscriptionIndex[19][1]=3;
     subscriptionList[19][2]=16;subscriptionIndex[19][2]=3;
     subscriptionList[20][0]=9;subscriptionIndex[20][0]=1;
     subscriptionList[21][0]=21;subscriptionIndex[21][0]=0;
     subscriptionList[22][0]=9;subscriptionIndex[22][0]=3;
     subscriptionList[23][0]=6;subscriptionIndex[23][0]=1;
     subscriptionList[23][1]=10;subscriptionIndex[23][1]=1;
     subscriptionList[23][2]=27;subscriptionIndex[23][2]=1;
     subscriptionList[23][3]=29;subscriptionIndex[23][3]=1;
     subscriptionList[23][4]=16;subscriptionIndex[23][4]=2;
     subscriptionList[23][5]=21;subscriptionIndex[23][5]=2;
     subscriptionList[23][6]=2;subscriptionIndex[23][6]=3;
     subscriptionList[23][7]=4;subscriptionIndex[23][7]=3;
     subscriptionList[23][8]=7;subscriptionIndex[23][8]=3;
     subscriptionList[23][9]=36;subscriptionIndex[23][9]=3;
     subscriptionList[24][0]=24;subscriptionIndex[24][0]=0;
     subscriptionList[24][1]=24;subscriptionIndex[24][1]=1;
     subscriptionList[24][2]=24;subscriptionIndex[24][2]=2;
     subscriptionList[24][3]=24;subscriptionIndex[24][3]=3;
     subscriptionList[25][0]=29;subscriptionIndex[25][0]=3;
     subscriptionList[26][0]=21;subscriptionIndex[26][0]=1;
     subscriptionList[26][1]=0;subscriptionIndex[26][1]=2;
     subscriptionList[26][2]=10;subscriptionIndex[26][2]=2;
     subscriptionList[26][3]=15;subscriptionIndex[26][3]=2;
     subscriptionList[26][4]=27;subscriptionIndex[26][4]=2;
     subscriptionList[26][5]=33;subscriptionIndex[26][5]=2;
     subscriptionList[27][0]=27;subscriptionIndex[27][0]=0;
     subscriptionList[28][0]=28;subscriptionIndex[28][0]=0;
     subscriptionList[29][0]=29;subscriptionIndex[29][0]=0;
     subscriptionList[29][1]=4;subscriptionIndex[29][1]=1;
     subscriptionList[29][2]=13;subscriptionIndex[29][2]=1;
     subscriptionList[29][3]=16;subscriptionIndex[29][3]=1;
     subscriptionList[29][4]=34;subscriptionIndex[29][4]=1;
     subscriptionList[29][5]=6;subscriptionIndex[29][5]=2;
     subscriptionList[29][6]=36;subscriptionIndex[29][6]=2;
     subscriptionList[29][7]=27;subscriptionIndex[29][7]=3;
     subscriptionList[29][8]=31;subscriptionIndex[29][8]=3;
     subscriptionList[30][0]=30;subscriptionIndex[30][0]=0;
     subscriptionList[30][1]=30;subscriptionIndex[30][1]=1;
     subscriptionList[30][2]=30;subscriptionIndex[30][2]=2;
     subscriptionList[30][3]=30;subscriptionIndex[30][3]=3;
     subscriptionList[31][0]=31;subscriptionIndex[31][0]=0;
     subscriptionList[31][1]=29;subscriptionIndex[31][1]=2;
     subscriptionList[32][0]=11;subscriptionIndex[32][0]=3;
     subscriptionList[33][0]=33;subscriptionIndex[33][0]=0;
     subscriptionList[33][1]=15;subscriptionIndex[33][1]=1;
     subscriptionList[33][2]=28;subscriptionIndex[33][2]=1;
     subscriptionList[34][0]=34;subscriptionIndex[34][0]=0;
     subscriptionList[35][0]=11;subscriptionIndex[35][0]=1;
     subscriptionList[36][0]=36;subscriptionIndex[36][0]=0;
     subscriptionList[36][1]=10;subscriptionIndex[36][1]=3;
     double a1[]={720,0.0,750,0.0,900,0.0,760,360,120,390,600,360,0.0,760,0.0,140,660,0.0,0.0,0.0,0.0,720,0.0,0.0,100,0.0,0.0,120,320,40,100,500,0.0,630,570,0.0,100};
     double a2[]={0.5,0.0,1.3,0.0,0.6,0.0,0.45,0.15,0.45,0.4,0.25,1.4,0.0,0.55,0.0,0.2,0.8,0.0,0.0,0.0,0.0,0.6,0.0,0.0,0.4,0.0,0.0,0.25,0.4,0.25,0.4,0.35,0.0,0.4,0.5,0.0,0.4};
     double a3[]={1350,0.0,1250,0.0,300,0.0,1150,1400,900,1200,850,900,0.0,600,0.0,1450,1450,0.0,0.0,0.0,0.0,1000,0.0,0.0,1200,0.0,0.0,1150,350,1400,1200,1350,0.0,1500,300,0.0,1200};
     double a4[]={0.6,0.0,0.7,0.0,0.2,0.0,0.3,0.55,0.4,0.8,0.25,0.7,0.0,0.25,0.0,0.55,0.5,0.0,0.0,0.0,0.0,0.4,0.0,0.0,0.7,0.0,0.0,0.65,0.55,0.45,0.7,0.6,0.0,0.4,0.4,0.0,0.7};
     double a5[]={300,0.0,1300,0.0,1350,0.0,200,1100,1200,650,1500,1350,0.0,1050,0.0,1300,550,0.0,0.0,0.0,0.0,250,0.0,0.0,150,0.0,0.0,1250,700,1150,150,1250,0.0,1500,1500,0.0,150};
     double a6[]={0.3,0.0,0.8,0.0,0.6,0.0,0.5,0.6,0.6,0.3,0.35,0.7,0.0,0.55,0.0,0.45,0.35,0.0,0.0,0.0,0.0,0.3,0.0,0.0,0.5,0.0,0.0,0.55,0.3,0.35,0.5,0.75,0.0,0.2,0.5,0.0,0.5};
     double a7[]={1500,0.0,1500,0.0,1050,0.0,750,1100,1350,1350,100,1350,0.0,550,0.0,1400,1000,0.0,0.0,0.0,0.0,1000,0.0,0.0,1350,0.0,0.0,350,550,350,1350,500,0.0,1350,1250,0.0,1350};
     double a8[]={0.9,0.0,0.9,0.0,0.8,0.0,0.6,0.35,0.7,0.2,0.15,0.7,0.0,0.3,0.0,0.55,0.5,0.0,0.0,0.0,0.0,0,0.0,0.0,0.3,0.0,0.0,0.4,0.3,0.5,0.3,0.35,0.0,0.5,0.5,0.0,0.3};
     double a9[]={0.008,0.0,0.009,0.0,0.01,0.0,0.01,0.009,0.009,0.007,0.009,0.01,0.0,0.009,0.0,0.01,0.008,0.0,0.0,0.0,0.0,0.01,0.0,0.0,0.006,0.0,0.0,0.008,0.009,0.01,0.006,0.009,0.0,0.008,0.009,0.0,0.006};
     double a10[]={0.008,0.0,0.009,0.0,0.008,0.0,0.008,0.008,0.009,0.008,0.008,0.006,0.0,0.009,0.0,0.01,0.008,0.0,0.0,0.0,0.0,0.005,0.0,0.0,0.009,0.0,0.0,0.01,0.008,0.009,0.009,0.009,0.0,0.008,0.01,0.0,0.009};
     double a11[]={0.4,0.0,0.2,0.0,0.1,0.0,0.3,0.4,0.2,0.1,0.7,0.2,0.0,0,0.0,0.1,0,0.0,0.0,0.0,0.0,0.1,0.0,0.0,0.2,0.0,0.0,0.3,0,0.2,0.2,0,0.0,0.7,0.1,0.0,0.2};
     int a12[]={500,1000,8000,2000,4000,1000,1250,1000,1000,500,1000,125,2000,4000,1000,250,2000,250,1000,1250,500,2000,1000,500,0,250,500,4000,4000,1250,0,2000,500,500,4000,125,1000};
     double a13[]={0.0013406,0.0020022,0.0018709,0.0018948,0.0017975,0.0014687,0.0011068,0.001355,0.0010891,0.00088151,0.0014294,0.0012989,0.0014205,0.0019711,0.0015365,0.0020505,0.0018961,0.00078672,0.0023114,0.0012203,0.0012849,0.0015674,0.0012844,0.0014197,0.0,0.00074657,0.00096164,0.0017109,0.0015385,0.00068178,0.0,0.0021815,0.00087359,0.00074349,0.0021645,0.001595,0.0014573};
     int a14[]={14850,0,16500,0,13740,0,13740,24750,13740,14100,13740,30750,0,14400,0,13740,13740,0,0,0,0,14100,0,0,13500,0,0,13740,13740,25200,13500,13740,0,13740,13740,0,13740};
     int a15[]={30750,0,35900,0,34950,0,35900,35900,35900,35900,30000,34950,0,26250,0,34000,35900,0,0,0,0,34500,0,0,13500,0,0,35900,34650,35900,13500,32700,0,35900,35900,0,33300};
      Client client;
     for (int i = 0; i < MAX_ATTEMPTS; i++) {
        client.connect(host, port, clientId);
        ++attempt;
        std::cout << "Attempt " << attempt << " of " << MAX_ATTEMPTS<< std::endl;
        for (int j=0;j<NUMREALTIMESYMBOLS;j++){
            if(j==24 || j==30)
                continue;

            std::cout<<j<<" "<<realTimeSymbols[j]<<" "<<getLocalSymbol(realTimeSymbols[j],date)<<std::endl;
            client.setTickerMap(j,realTimeSymbols[j],getLocalSymbol(realTimeSymbols[j],date));
        }
    }
}

客户端的构造函数：

 Client::Client(){
    for(int i=0;i<50;i++){
        symbolMap.push_back(" ");
        localSymbolMap.push_back(" ");
    }
}

上述代码在 24 和 30 处失败。因此，当 j 为 24 或 30 时循环继续作为解决方法。

【问题讨论】：

尝试在 gdb 中运行？这将帮助您确定程序崩溃的位置。
尝试与标准库的索引检查版本链接，或将[i]替换为.at(i)，以查找可能的越界索引。
@jsantander：我没有使用 gdb，但我已经检查了 printf 和 fflush(stdout) 以确保当 j 等于 24 时发生错误。以及在内部分配 symbolMap[j] 期间setTickerMap 函数。
三屏代码，但我无法编译以重现错误？发布的赏金禁止投票结束，否则我会投票。请改写您的问题以包含MCVE。准备这样一个最小的例子是一种历史悠久的调试技术。
您需要的是提供一个完整的代码示例，可以编译和崩溃。意思是上面的 main.cpp，以及 Client 类的简化版本。然后我们可以运行代码，调试它，很容易找到错误。

标签： c++ memory cygwin heap-memory heap-corruption

【解决方案1】：

std::string realTimeSymbolsArr[]={"a","b","c","d","e","f","g","h","i","j","k","l","m","n","o","p","q","r","s","t","u","v","w","x","y","z","aa","bb","cc","dd","ee","ff","gg","hh","ii","jj","kk"};

subscriptionList[24][1]=24;subscriptionIndex[24][1]=1;
subscriptionList[24][2]=24;subscriptionIndex[24][2]=2;
subscriptionList[24][3]=24;subscriptionIndex[24][3]=3;

subscriptionList[30][1]=30;subscriptionIndex[30][1]=1;
subscriptionList[30][2]=30;subscriptionIndex[30][2]=2;
subscriptionList[30][3]=30;subscriptionIndex[30][3]=3;

您尚未发布getLocalSymbol 的来源，但我必须假设它也使用相同的数据并且具有以下形式的流程：

getLocalSymbol(a, b) {
    int i, j, old_i, old_j;
    std::string value;
    // Derive i and j from the parameters
    // ...
    // And build the String
    do {
            old_i = i;
            old_j = j;
            i = subscriptionList[old_i][old_j];
            j = subscriptionIndex[old_i][old_j];
            value += realTimeSymbolsArr[i];
    } while(j > 0);
    return value;
}

没看错吧？无论哪种方式，该控制流或等效的东西似乎都是它的一部分。

这适用于几乎所有的 i 和 j 值 - 除了前面提到的 i 的 24 和 30 以及 1 到 3 的 j 的值。

有了这些值，i 和 j 在每次迭代中都保持不变，value 变得越来越长，直到最终堆栈上出现中断并覆盖 j（从而导致循环终止) 并破坏value。

无论哪种方式，您返回的 std::string 现在已损坏，因为您在无限循环期间超出了某个限制。

至于如何解决它，修复那个无限循环并修复你的数据。

为了修复循环，限制迭代次数。

对于修复数据，好吧，既然您知道数据导致错误的原因，您应该能够自己弄清楚如何修复它。

请记住，您必须修复 BOTH。如果你不修复数据，你会得到一个不合理的长返回值。而且如果不修复迭代限制，一旦有人在更新数据时重复类似的错误，它就会再次崩溃。

【讨论】：