/usr/include/paw/ntuple/qp_exev_op_bool.h is in libpawlib2-dev 1:2.14.04.dfsg.2-9.1build1.
This file is owned by root:root, with mode 0o644.
The actual contents of the file can be viewed below.
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 | /*
* qp_exev_op_bool.h --
*
* Original: 24-Jan-1995 14:29
*
* Author: Maarten Ballintijn <Maarten.Ballintijn@cern.ch>
*
* $Id: qp_exev_op_bool.h,v 1.3 1996/04/23 18:38:38 maartenb Exp $
*
* $Log: qp_exev_op_bool.h,v $
* Revision 1.3 1996/04/23 18:38:38 maartenb
* - Add RCS keywords
*
*
*/
case FC_OR:
{
OP_TYPE tmp1, tmp2;
int i, n = 1;
if ( frame_size[framep] != 1 ) {
o1 = &stack[frame[framep]];
inc_o1 = datatype_size[OP_DTYPE];
qp_assert( n==1 || n==frame_size[framep-1] );
n = frame_size[framep];
} else {
tmp1 = *((OP_TYPE *) &stack[frame[framep]]);
o1 = (Int32 *) &tmp1;
inc_o1 = 0;
}
if ( frame_size[framep-1] != 1 ) {
o2 = &stack[frame[framep-1]];
inc_o2 = datatype_size[OP_DTYPE];
qp_assert( n==1 || n==frame_size[framep-1] );
n = frame_size[framep-1];
} else {
tmp2 = *((OP_TYPE *) &stack[frame[framep-1]]);
o2 = (Int32 *) &tmp2;
inc_o2 = 0;
}
POP_FRAME(2);
NEW_FRAME(OP_DTYPE,n,r);
inc_r = datatype_size[OP_DTYPE];
o1 += inc_o1 * (n-1);
o2 += inc_o2 * (n-1);
r += inc_r * (n-1);
for ( i=0 ; i < n ; i++ ) {
*((OP_TYPE *) r) = *((OP_TYPE *) o1) || *((OP_TYPE *) o2);
o1 -= inc_o1;
o2 -= inc_o2;
r -= inc_r;
}
break;
}
case FC_AND:
{
OP_TYPE tmp1, tmp2;
int i, n = 1;
if ( frame_size[framep] != 1 ) {
o1 = &stack[frame[framep]];
inc_o1 = datatype_size[OP_DTYPE];
qp_assert( n==1 || n==frame_size[framep-1] );
n = frame_size[framep];
} else {
tmp1 = *((OP_TYPE *) &stack[frame[framep]]);
o1 = (Int32 *) &tmp1;
inc_o1 = 0;
}
if ( frame_size[framep-1] != 1 ) {
o2 = &stack[frame[framep-1]];
inc_o2 = datatype_size[OP_DTYPE];
qp_assert( n==1 || n==frame_size[framep-1] );
n = frame_size[framep-1];
} else {
tmp2 = *((OP_TYPE *) &stack[frame[framep-1]]);
o2 = (Int32 *) &tmp2;
inc_o2 = 0;
}
POP_FRAME(2);
NEW_FRAME(OP_DTYPE,n,r);
inc_r = datatype_size[OP_DTYPE];
o1 += inc_o1 * (n-1);
o2 += inc_o2 * (n-1);
r += inc_r * (n-1);
for ( i=0 ; i < n ; i++ ) {
*((OP_TYPE *) r) = *((OP_TYPE *) o1) && *((OP_TYPE *) o2);
o1 -= inc_o1;
o2 -= inc_o2;
r -= inc_r;
}
break;
}
case FC_NOT:
{
int i, n = 1;
o1 = &stack[frame[framep]];
inc_o1 = datatype_size[OP_DTYPE];
n = frame_size[framep];
o1 += inc_o1 * (n-1);
for ( i=0 ; i < n ; i++ ) {
*((OP_TYPE *) o1) = ! *((OP_TYPE *) o1);
o1 -= inc_o1;
}
break;
}
|