|
|
@ -1111,13 +1111,11 @@ printf("dequeue %p funcid.%d aliceid.%llu iambob.%d\n",qtp,funcid,(long long)qtp |
|
|
|
tp->Q = qtp->Q; |
|
|
|
if ( qtp->iambob == tp->iambob && qtp->pairstr[0] != 0 ) |
|
|
|
safecopy(tp->pairstr,qtp->pairstr,sizeof(tp->pairstr)); |
|
|
|
printf("finished dequeue %p funcid.%d aliceid.%llu iambob.%d\n",qtp,funcid,(long long)qtp->aliceid,qtp->iambob); |
|
|
|
printf("finished dequeue %p funcid.%d aliceid.%llu iambob.%d/%d done.%u\n",qtp,funcid,(long long)qtp->aliceid,qtp->iambob,tp->iambob,tp->negotiationdone); |
|
|
|
free(qtp); |
|
|
|
if ( tp->negotiationdone != 0 ) |
|
|
|
continue; |
|
|
|
flag = 0; |
|
|
|
if ( qtp->iambob == tp->iambob ) |
|
|
|
{ |
|
|
|
if ( tp->iambob == 0 ) |
|
|
|
{ |
|
|
|
if ( funcid == LP_RESERVED ) |
|
|
@ -1155,7 +1153,6 @@ printf("finished dequeue %p funcid.%d aliceid.%llu iambob.%d\n",qtp,funcid,(long |
|
|
|
tp->lastprocessed = (uint32_t)time(NULL); |
|
|
|
nonz++; |
|
|
|
} |
|
|
|
} else printf("qtp->iambob.%d vs tp->iambob.%d\n",qtp->iambob,tp->iambob); |
|
|
|
} |
|
|
|
if ( nonz == 0 ) |
|
|
|
sleep(1); |
|
|
|