【发布时间】:2021-12-12 14:02:05
【问题描述】:
我想了解 setjmp / longjmp 是如何工作的,所以我创建了一个示例程序,其中routineA 打印偶数,routineB 打印奇数,它们通过 longjmp 相互跳转:
#include <setjmp.h>
#include <stdio.h>
#define COUNTER_BEGIN 0
#define COUNTER_END 6
void routineA( jmp_buf* pEnvA, jmp_buf* pEnvB );
void routineB( jmp_buf* pEnvA, jmp_buf* pEnvB );
int main() {
const char message[] = "main [ &envA=0x^%016lx &envB=0x^%016lx ] -- %s\n";
jmp_buf envA;
jmp_buf envB;
fprintf( stdout, message, &envA, &envB,
"Started; Before calling routineA" );
routineA( &envA, &envB );
fprintf( stdout, message, &envA, &envB,
"After routineA returned; Exiting" );
return 0;
}
/* Prints even numbers from COUNTER_BEGIN to COUNTER_END */
void routineA( jmp_buf* pEnvA, jmp_buf* pEnvB ) {
const char* message = "routineA: [ i=%d, sjr=%d ] -- %s\n";
static int i;
static int sjr;
static jmp_buf *s_pEnvA;
static jmp_buf *s_pEnvB;
s_pEnvA = pEnvA;
s_pEnvB = pEnvB;
fprintf( stdout, message, i, sjr, "After saving statics; Before starting the for loop" );
for( i = COUNTER_BEGIN; i < COUNTER_END; i++ ) {
if( i % 2 == COUNTER_BEGIN + 0 ) {
fprintf( stdout, message, i, sjr, "Inside for and if; Before setjmp" );
sjr = setjmp( *s_pEnvA ); /* Added */
if( sjr == 0 ) { /* Added */
/* if( ( sjr = setjmp( *s_pEnvA ) ) == 0 ) { */
fprintf( stdout, message, i, sjr, "Got to this line directly - go to routineB somehow" );
if( i == 0 ) {
fprintf( stdout, message, i, sjr, "This is the first iteration - call routineB as function" );
routineB( s_pEnvA, s_pEnvB );
} else {
fprintf( stdout, message, i, sjr, "This is not the first iteration - longjmp to routineB" );
longjmp( *s_pEnvB, 12 );
}
} else {
fprintf( stdout, message, i, sjr, "Got to this line via longjmp (in this program it must be from routineB) - continue" );
; /* Just continue */
}
}
}
fprintf( stdout, message, i, sjr, "After the for loop, Before leaving the function" );
}
/* Prints odd numbers from COUNTER_BEGIN to COUNTER_END */
void routineB( jmp_buf* pEnvA, jmp_buf* pEnvB ) {
const char* message = "routineB: [ i=%d, sjr=%d ] -- %s\n";
static int i;
static int sjr;
static jmp_buf *s_pEnvA;
static jmp_buf *s_pEnvB;
s_pEnvA = pEnvA;
s_pEnvB = pEnvB;
fprintf( stdout, message, i, sjr, "After saving statics; Before starting the for loop" );
for( i = COUNTER_BEGIN; i < COUNTER_END; i++ ) {
if( i % 2 == 1 ) {
fprintf( stdout, message, i, sjr, "Inside for and if; Before setjmp" );
sjr = setjmp( *s_pEnvB ); /* Added */
if( sjr == 0 ) { /* Added */
/* if( ( sjr = setjmp( *s_pEnvB ) ) == 0 ) { */
fprintf( stdout, message, i, sjr, "Got to this line directly - longjmp to routineA" );
longjmp( *s_pEnvA, 21 );
} else {
fprintf( stdout, message, i, sjr, "Got to this line via longjmp (in this program it must be from routineA) - continue" );
; /* Just continue */
}
}
}
fprintf( stdout, message, i, sjr, "After the for loop, Before leaving the function" );
}
我用 gcc 编译它并收到以下输出(插入行号以供以后参考):
01 main [ &envA=0x^00007ffce81b0280 &envB=0x^00007ffce81b01b0 ] -- Started; Before calling routineA
02 routineA: [ i=0, sjr=0 ] -- After saving statics; Before starting the for loop
03 routineA: [ i=0, sjr=0 ] -- Inside for and if; Before setjmp
04 routineA: [ i=0, sjr=0 ] -- Got to this line directly - go to routineB somehow
05 routineA: [ i=0, sjr=0 ] -- This is the first iteration - call routineB as function
06 routineB: [ i=0, sjr=0 ] -- After saving statics; Before starting the for loop
07 routineB: [ i=1, sjr=0 ] -- Inside for and if; Before setjmp
08 routineB: [ i=1, sjr=0 ] -- Got to this line directly - longjmp to routineA
09 routineA: [ i=0, sjr=21 ] -- Got to this line via longjmp (in this program it must be from routineB) - continue
10 routineA: [ i=2, sjr=21 ] -- Inside for and if; Before setjmp
11 routineA: [ i=2, sjr=0 ] -- Got to this line directly - go to routineB somehow
12 routineA: [ i=2, sjr=0 ] -- This is not the first iteration - longjmp to routineB
13 routineA: [ i=2, sjr=21 ] -- Got to this line via longjmp (in this program it must be from routineB) - continue
14 routineA: [ i=4, sjr=21 ] -- Inside for and if; Before setjmp
15 routineA: [ i=4, sjr=0 ] -- Got to this line directly - go to routineB somehow
16 routineA: [ i=4, sjr=0 ] -- This is not the first iteration - longjmp to routineB
17 routineA: [ i=4, sjr=21 ] -- Got to this line via longjmp (in this program it must be from routineB) - continue
18 routineA: [ i=6, sjr=21 ] -- After the for loop, Before leaving the function
19 main [ &envA=0x^00007ffce81b0280 &envB=0x^00007ffce81b01b0 ] -- After routineA returned; Exiting
在第 12 行之前输出正常:This is not the first iteration - longjmp to routineB,但是,在此之后它应该转到routineB,并打印Got to this line via longjmp (in this program it must be from routineA) - continue,但它留在routineA,并显示Got to this line via longjmp (in this program it must be from routineB) - continue。
我的代码有错误还是我对 setjmp / longjmp 有误解?
更新
根据 Eric Postpischil 的回答的第一部分修改了代码:我认为现在它适合最后一个要点,因为赋值语句是表达式语句。我收到了相同的结果(除了不同的指针值)。
好的,我将sjr = setjmp( *s_pEnvA );(以及routineB的对应部分)替换为
sjr = -1;
switch( setjmp( *s_pEnvA ) ) {
case 0: sjr = 0; break;
case 1: sjr = 1; break;
case 12: sjr = 12; break;
case 21: sjr = 21; break;
default: sjr = -2; break;
}
我认为这完全符合要点“选择或迭代语句的整个控制表达式”。
结果还是一样。
最终更新
Eric 和 Nate 是对的,这是未定义的行为。但是因为我想知道为什么this answer 中的代码有效,所以我逐渐将我的代码转换为那个代码,并观察它在什么时候中断。我最终得到了这个:
#include <setjmp.h>
#include <stdio.h>
#if defined( SORTOFWORKS )
#define CHECKPOINTFORMAT "routineX:\n -- %s\n\n"
#elif defined( DOESNOTWORK )
#define CHECKPOINTFORMAT message, pEnvA, pEnvB, s_pEnvA, s_pEnvB, i, sjr
#else
#error Version (SORTOFWORKS or DOESNOTWORK) is not defined
#endif
#define STRINGIFY( x ) STRINGIFY_IMPLEMENTATION( x )
#define STRINGIFY_IMPLEMENTATION( x ) #x
#define COUNTER_BEGIN 0
#define COUNTER_END 6
void routineA( jmp_buf* pEnvA, jmp_buf* pEnvB );
void routineB( jmp_buf* pEnvA, jmp_buf* pEnvB );
int main() {
const char message[] = "main [ &envA=0x^%016lx &envB=0x^%016lx ]\n -- %s\n\n";
jmp_buf envA;
jmp_buf envB;
fprintf( stdout, message, &envA, &envB,
"Started; Before calling routineA the first time" );
routineA( &envA, &envB );
fprintf( stdout, message, &envA, &envB,
"Before calling routineA the second time" );
routineA( &envA, &envB );
fprintf( stdout, message, &envA, &envB,
"Exiting" );
return 0;
}
/* Prints even numbers from COUNTER_BEGIN to COUNTER_END */
void routineA( jmp_buf* pEnvA, jmp_buf* pEnvB ) {
const char* const message = "routineA: [ pEnvA=0x^%016lx, pEnvB=0x^%016lx, s_pEnvA=0x^%016lx, s_pEnvB=0x^%016lx, i=%d, sjr=%d ]\n"
" -- %s\n\n";
static int i;
static jmp_buf *s_pEnvA;
static jmp_buf *s_pEnvB;
static int sjr;
fprintf( stdout, message, pEnvA, pEnvB, s_pEnvA, s_pEnvB, i, sjr,
"Called; Before saving statics" );
s_pEnvA = pEnvA;
s_pEnvB = pEnvB;
fprintf( stdout, message, pEnvA, pEnvB, s_pEnvA, s_pEnvB, i, sjr,
"After saving statics; Before starting the counting" );
fprintf( stdout, CHECKPOINTFORMAT,
"Checkpoint A0 at line " STRINGIFY( __LINE__ ) );
i = COUNTER_BEGIN;
fprintf( stdout, message, pEnvA, pEnvB, s_pEnvA, s_pEnvB, i, sjr,
"Part of counting; Before setjmp" );
sjr = -1;
switch( setjmp( *s_pEnvA ) ) {
case 0: sjr = 0; break;
case 1: sjr = 1; break;
case 12: sjr = 12; break;
case 21: sjr = 21; break;
default: sjr = -2; break;
}
if( sjr == 0 ) {
fprintf( stdout, message, pEnvA, pEnvB, s_pEnvA, s_pEnvB, i, sjr,
"Got to this line directly - This is the first iteration - call routineB as function" );
routineB( s_pEnvA, s_pEnvB );
} else {
fprintf( stdout, message, pEnvA, pEnvB, s_pEnvA, s_pEnvB, i, sjr,
"Got to this line via longjmp (in this program it must be from routineB) - continue" );
; /* Just continue */
}
fprintf( stdout, CHECKPOINTFORMAT,
"Checkpoint A1 at line " STRINGIFY( __LINE__ ) );
i += 2;
fprintf( stdout, message, pEnvA, pEnvB, s_pEnvA, s_pEnvB, i, sjr,
"Part of counting; Before setjmp" );
sjr = -1;
switch( setjmp( *s_pEnvA ) ) {
case 0: sjr = 0; break;
case 1: sjr = 1; break;
case 12: sjr = 12; break;
case 21: sjr = 21; break;
default: sjr = -2; break;
}
if( sjr == 0 ) {
fprintf( stdout, message, pEnvA, pEnvB, s_pEnvA, s_pEnvB, i, sjr,
"Got to this line directly - This is not the first iteration - longjmp to routineB" );
longjmp( *s_pEnvB, 12 );
} else {
fprintf( stdout, message, pEnvA, pEnvB, s_pEnvA, s_pEnvB, i, sjr,
"Got to this line via longjmp (in this program it must be from routineB) - continue" );
; /* Just continue */
}
fprintf( stdout, CHECKPOINTFORMAT,
"Checkpoint A2 at line " STRINGIFY( __LINE__ ) );
i += 2;
fprintf( stdout, message, pEnvA, pEnvB, s_pEnvA, s_pEnvB, i, sjr,
"Part of counting; Before setjmp" );
sjr = -1;
switch( setjmp( *s_pEnvA ) ) {
case 0: sjr = 0; break;
case 1: sjr = 1; break;
case 12: sjr = 12; break;
case 21: sjr = 21; break;
default: sjr = -2; break;
}
if( sjr == 0 ) {
fprintf( stdout, message, pEnvA, pEnvB, s_pEnvA, s_pEnvB, i, sjr,
"Got to this line directly - This is not the first iteration - longjmp to routineB" );
longjmp( *s_pEnvB, 12 );
} else {
fprintf( stdout, message, pEnvA, pEnvB, s_pEnvA, s_pEnvB, i, sjr,
"Got to this line via longjmp (in this program it must be from routineB) - continue" );
; /* Just continue */
}
fprintf( stdout, CHECKPOINTFORMAT,
"Checkpoint A3 at line " STRINGIFY( __LINE__ ) );
/* Should be able to do this but it causes segfault: longjmp( *s_pEnvB, 12 ); */
fprintf( stdout, message, pEnvA, pEnvB, s_pEnvA, s_pEnvB, i, sjr,
"After the counting, Before leaving the function" );
}
/* Prints odd numbers from COUNTER_BEGIN to COUNTER_END */
void routineB( jmp_buf* pEnvA, jmp_buf* pEnvB ) {
const char* const message = "routineB: [ pEnvA=0x^%016lx, pEnvB=0x^%016lx, s_pEnvA=0x^%016lx, s_pEnvB=0x^%016lx, i=%d, sjr=%d ]\n"
" -- %s\n\n";
static int i;
static jmp_buf *s_pEnvA;
static jmp_buf *s_pEnvB;
static int sjr;
fprintf( stdout, message, pEnvA, pEnvB, s_pEnvA, s_pEnvB, i, sjr,
"Called; Before saving statics" );
s_pEnvA = pEnvA;
s_pEnvB = pEnvB;
fprintf( stdout, message, pEnvA, pEnvB, s_pEnvA, s_pEnvB, i, sjr,
"After saving statics; Before starting the for loop" );
fprintf( stdout, CHECKPOINTFORMAT,
"Checkpoint B0 at line " STRINGIFY( __LINE__ ) );
i = 1 + COUNTER_BEGIN;
fprintf( stdout, message, pEnvA, pEnvB, s_pEnvA, s_pEnvB, i, sjr,
"Part of counting; Before setjmp" );
sjr = -1;
switch( setjmp( *s_pEnvB ) ) {
case 0: sjr = 0; break;
case 1: sjr = 1; break;
case 12: sjr = 12; break;
case 21: sjr = 21; break;
default: sjr = -2; break;
}
if( sjr == 0 ) {
fprintf( stdout, message, pEnvA, pEnvB, s_pEnvA, s_pEnvB, i, sjr,
"Got to this line directly - longjmp to routineA" );
longjmp( *s_pEnvA, 21 );
} else {
fprintf( stdout, message, pEnvA, pEnvB, s_pEnvA, s_pEnvB, i, sjr,
"Got to this line via longjmp (in this program it must be from routineA) - continue" );
; /* Just continue */
}
fprintf( stdout, CHECKPOINTFORMAT,
"Checkpoint B1 at line " STRINGIFY( __LINE__ ) ); /* SORTOFWORKS: printed, DOESNOTWORK: missing */
i += 2;
fprintf( stdout, message, pEnvA, pEnvB, s_pEnvA, s_pEnvB, i, sjr,
"Part of counting; Before setjmp" );
sjr = -1;
switch( setjmp( *s_pEnvB ) ) {
case 0: sjr = 0; break;
case 1: sjr = 1; break;
case 12: sjr = 12; break;
case 21: sjr = 21; break;
default: sjr = -2; break;
}
if( sjr == 0 ) {
fprintf( stdout, message, pEnvA, pEnvB, s_pEnvA, s_pEnvB, i, sjr,
"Got to this line directly - longjmp to routineA" );
longjmp( *s_pEnvA, 21 );
} else {
fprintf( stdout, message, pEnvA, pEnvB, s_pEnvA, s_pEnvB, i, sjr,
"Got to this line via longjmp (in this program it must be from routineA) - continue" );
; /* Just continue */
}
fprintf( stdout, CHECKPOINTFORMAT,
"Checkpoint B2 at line " STRINGIFY( __LINE__ ) ); /* SORTOFWORKS: printed, DOESNOTWORK: missing */
i += 2;
fprintf( stdout, message, pEnvA, pEnvB, s_pEnvA, s_pEnvB, i, sjr,
"Part of counting; Before setjmp" );
sjr = -1;
switch( setjmp( *s_pEnvB ) ) {
case 0: sjr = 0; break;
case 1: sjr = 1; break;
case 12: sjr = 12; break;
case 21: sjr = 21; break;
default: sjr = -2; break;
}
if( sjr == 0 ) {
fprintf( stdout, message, pEnvA, pEnvB, s_pEnvA, s_pEnvB, i, sjr,
"Got to this line directly - longjmp to routineA" );
longjmp( *s_pEnvA, 21 );
} else {
fprintf( stdout, message, pEnvA, pEnvB, s_pEnvA, s_pEnvB, i, sjr,
"Got to this line via longjmp (in this program it must be from routineA) - continue" );
; /* Just continue */
}
fprintf( stdout, message, pEnvA, pEnvB, s_pEnvA, s_pEnvB, i, sjr,
"After the for loop, Before leaving the function" );
}
如果你用gcc -DSORTOFWORKS -o ./jump_sortofworks ./jump.c 编译上面的代码,那么它会打印带有注释/* SORTOFWORKS: printed, DOESNOTWORK: missing */ 的行,但是如果你用gcc -DDOESNOTWORK -o ./jump_doesnotwork ./jump.c 编译它,那么它不会(编译器:GNU C11(Debian 6.3.0 -18+deb9u1) 版本 6.3.0 20170516 (x86_64-linux-gnu))。
我认为这么小的变化(打印不同的字符串格式)会破坏它,清楚地表明 setjmp / longjmp 不能用于此目的。
【问题讨论】:
-
不要打印带有
%lx的指针。将它们转换为void *并使用%p打印。 -
我认为 Eric 有点埋没了。您的代码基本上不是
longjmp所做的。不是在函数之间随意跳转;它仅用于跳转调用堆栈,本质上是强制多层函数一次返回。如果堆栈深处的函数遇到只能更进一步处理的错误,您可能会使用它,例如通过中止计算并继续程序的主循环。如果您熟悉 C++ 或其他语言中的throw/catch,请将longjmp/setjmp视为它的原始版本。 -
带分号的赋值表达式是一个表达式语句,但其中的
setjmp调用并不是 C 标准所要求的整个表达式语句。它只是语句中的一个子表达式。 -
@EricPostpischil:这是否意味着,我无法将 setjmp 的返回值保存到变量中?如果我不能使用它,为什么要向 longjmp 提供一个值?
-
@z32a7ul:您可以在
switch的控制表达式中使用setjmp,并选择带有case标签的各个值。