codesearch.isocpp.org by Andrew Tomazos.
Enter a valid C/C++ code snippet...
Searching for `bitand`...
2489599 source files searched.
164 matches found.
Here is a random sample of matches...
actcd19/main/k/kfreebsd-10/kfreebsd-10_10.3~svn300087-3/sys/dev/sio/sio.c:2147:
if (sigon & SER_RTS)
bitor |= MCR_RTS;
bitand = ~bitand;
mtx_lock_spin(&sio_lock);
com->mcr_image &= bitand;
actcd19/main/f/fuzzylite/fuzzylite_6.0+dfsg-2/fuzzylite/src/rule/Consequent.cpp:191:
}
if ((state bitand S_HEDGE) or (state bitand S_TERM)) {
std::ostringstream ex;
ex << "[syntax error] consequent expected hedge or term, but found <" << token << ">";
actcd19/main/libb/libboost-geometry-utils-perl/libboost-geometry-utils-perl_0.15-2/src/boost/mpl/bitand.hpp:39:
#if defined(_MSC_VER)
#ifndef __GCCXML__
#if defined(bitand)
# pragma pop_macro("bitand")
#endif
actcd19/main/f/flang/flang_20181226-2/flang-driver/test/Parser/cxx0x-decl.cpp:68:
struct s
bitand r2 = v;
struct s
actcd19/main/n/nescc/nescc_1.3.5-1.1/src/AST_print.c:861:
}
case kind_bitand: {
bitand x = CAST(bitand, n);
puts("bitand");
actcd19/main/a/astropy/astropy_3.1.2-2/cextern/cfitsio/lib/eval_y.c:5039:
break;
case '&':
bitand( this->value.data.str, sptr1, sptr2 );
break;
case '+':
actcd19/main/r/rspamd/rspamd_1.8.1-2/contrib/lua-torch/torch7/lib/TH/generic/THTensorMath.c:791:
}
void THTensor_(bitand)(THTensor *r_, THTensor *t, real value)
{
#if defined(TH_REAL_IS_FLOAT) || defined(TH_REAL_IS_DOUBLE) || defined(TH_REAL_IS_HALF)
actcd19/main/f/fuzzylite/fuzzylite_6.0+dfsg-2/fuzzylite/src/rule/Consequent.cpp:210:
}
if (not ((state bitand S_AND) or (state bitand S_WITH))) { //only acceptable final state
if (state bitand S_VARIABLE) {
std::ostringstream ex;
actcd19/main/o/octave/octave_4.4.1-5/libinterp/corefcn/bitfcns.cc:357:
}
DEFUN (bitand, args, ,
doc: /* -*- texinfo -*-
@deftypefn {} {} bitand (@var{x}, @var{y})
actcd19/main/k/kfreebsd-10/kfreebsd-10_10.3~svn300087-5/sys/pc98/cbus/sio.c:3263:
if (sigon & SER_RTS)
bitor |= MCR_RTS;
bitand = ~bitand;
mtx_lock_spin(&sio_lock);
com->mcr_image &= bitand;
actcd19/main/f/fuzzylite/fuzzylite_6.0+dfsg-2/fuzzylite/src/rule/Consequent.cpp:222:
throw Exception(ex.str(), FL_AT);
}
if ((state bitand S_HEDGE) or (state bitand S_TERM)) {
std::ostringstream ex;
ex << "[syntax error] consequent expected hedge or term after <" << token << ">";
actcd19/main/l/llvm-toolchain-8/llvm-toolchain-8_8~+rc3-1~exp1/clang/test/Preprocessor/cxx_oper_keyword_ms_compat.cpp:8:
bool f() {
// Check that operators still work before redefining them.
#if compl 0 bitand 1
return true and false;
#endif
actcd19/main/libb/libboost-geometry-utils-perl/libboost-geometry-utils-perl_0.15-2/src/boost/mpl/bitand.hpp:27:
# pragma push_macro("bitand")
# undef bitand
# define bitand(x)
#endif
#endif
actcd19/main/f/fuzzylite/fuzzylite_6.0+dfsg-2/fuzzylite/src/rule/Antecedent.cpp:354:
throw Exception(ex.str(), FL_AT);
}
if ((state bitand S_HEDGE) or (state bitand S_TERM)) {
std::ostringstream ex;
ex << "[syntax error] antecedent expected hedge or term after <" << token << ">";
actcd19/main/f/fuzzylite/fuzzylite_6.0+dfsg-2/fuzzylite/src/rule/Antecedent.cpp:338:
throw Exception(ex.str(), FL_AT);
}
if ((state bitand S_HEDGE) or (state bitand S_TERM)) {
std::ostringstream ex;
ex << "[syntax error] antecedent expected hedge or term, but found <" << token << ">";
actcd19/main/f/fuzzylite/fuzzylite_6.0+dfsg-2/fuzzylite/src/rule/Antecedent.cpp:303:
}
if (state bitand S_AND_OR) {
if (token == Rule::andKeyword() or token == Rule::orKeyword()) {
if (expressionStack.size() < 2) {
actcd19/main/f/fuzzylite/fuzzylite_6.0+dfsg-2/fuzzylite/src/rule/Consequent.cpp:163:
}
if (state bitand S_TERM) {
if (proposition->variable->hasTerm(token)) {
proposition->term = proposition->variable->getTerm(token);
actcd19/main/g/gcc-arm-none-eabi/gcc-arm-none-eabi_7-2018-q2-5/gcc/testsuite/gcc.dg/Wcxx-compat-13.c:18:
#define M1 and /* { dg-warning "operator" } */
#define M2 and_eq /* { dg-warning "operator" } */
#define M3 bitand /* { dg-warning "operator" } */
#define M4 bitor /* { dg-warning "operator" } */
#define M5 compl /* { dg-warning "operator" } */
actcd19/main/k/kfreebsd-10/kfreebsd-10_10.3~svn300087-5/sys/pc98/cbus/sio.c:3263:
if (sigon & SER_RTS)
bitor |= MCR_RTS;
bitand = ~bitand;
mtx_lock_spin(&sio_lock);
com->mcr_image &= bitand;
actcd19/main/h/healpy/healpy_1.12.8-8/cfitsio/eval_y.c:3887:
break;
case '&':
bitand( this->value.data.str, sptr1, sptr2 );
break;
case '+':
actcd19/main/n/nescc/nescc_1.3.5-1.1/src/AST_list_node.c:453:
bitand bitand_chain(bitand l1, bitand l2)
{ return CAST(bitand, AST_node_chain(CAST(node, l1), CAST(node, l2))); }
bitor bitor_chain(bitor l1, bitor l2)
actcd19/main/libb/libboost-geometry-utils-perl/libboost-geometry-utils-perl_0.15-2/src/boost/mpl/bitand.hpp:33:
#define AUX778076_OP_NAME bitand_
#define AUX778076_OP_PREFIX bitand
#define AUX778076_OP_TOKEN &
#include <boost/mpl/aux_/arithmetic_op.hpp>
actcd19/main/c/ceph/ceph_12.2.11+dfsg1-2/src/boost/boost/mpl/bitand.hpp:33:
#define AUX778076_OP_NAME bitand_
#define AUX778076_OP_PREFIX bitand
#define AUX778076_OP_TOKEN &
#include <boost/mpl/aux_/arithmetic_op.hpp>
actcd19/main/f/fuzzylite/fuzzylite_6.0+dfsg-2/fuzzylite/src/rule/Consequent.cpp:222:
throw Exception(ex.str(), FL_AT);
}
if ((state bitand S_HEDGE) or (state bitand S_TERM)) {
std::ostringstream ex;
ex << "[syntax error] consequent expected hedge or term after <" << token << ">";
actcd19/main/f/fuzzylite/fuzzylite_6.0+dfsg-2/fuzzylite/src/rule/Consequent.cpp:171:
}
if (state bitand S_AND) {
if (token == Rule::andKeyword()) {
state = S_VARIABLE;
actcd19/main/m/mysql-5.7/mysql-5.7_5.7.25-1/boost/boost_1_59_0/boost/wave/grammars/cpp_expression_grammar.hpp:244:
BOOST_WAVE_BINARYOP(or, ||);
BOOST_WAVE_BINARYOP(bitand, &);
BOOST_WAVE_BINARYOP(bitor, |);
BOOST_WAVE_BINARYOP(bitxor, ^);
actcd19/main/f/fuzzylite/fuzzylite_6.0+dfsg-2/fuzzylite/src/rule/Consequent.cpp:191:
}
if ((state bitand S_HEDGE) or (state bitand S_TERM)) {
std::ostringstream ex;
ex << "[syntax error] consequent expected hedge or term, but found <" << token << ">";
actcd19/main/l/llvm-toolchain-8/llvm-toolchain-8_8~+rc3-1~exp1/clang/test/Parser/cxx0x-attributes.cpp:50:
alignas(8) int aligned_attr;
[[test::valid(for 42 [very] **** '+' symbols went on a trip and had a "good"_time; the end.)]] int garbage_attr; // expected-warning {{unknown attribute 'valid' ignored}}
[[,,,static, class, namespace,, inline, constexpr, mutable,, bitand, bitor::compl(!.*_ Cx.!U^*R),,,]] int more_garbage_attr; // expected-warning {{unknown attribute 'static' ignored}} \
// expected-warning {{unknown attribute 'class' ignored}} \
// expected-warning {{unknown attribute 'namespace' ignored}} \
actcd19/main/f/fuzzylite/fuzzylite_6.0+dfsg-2/fuzzylite/src/rule/Consequent.cpp:216:
throw Exception(ex.str(), FL_AT);
}
if (state bitand S_IS) {
std::ostringstream ex;
ex << "[syntax error] consequent expected keyword <" << Rule::isKeyword() << "> "
actcd19/main/a/arrayfire/arrayfire_3.3.2+dfsg1-4/test/binary.cpp:277:
BITOP(bitshiftr, int, >>)
BITOP(bitor, uint, |)
BITOP(bitand, uint, &)
BITOP(bitxor, uint, ^)
BITOP(bitshiftl, uint, <<)
actcd19/main/k/kfreebsd-10/kfreebsd-10_10.3~svn300087-5/sys/pc98/cbus/sio.c:3232:
}
if (sigoff & SER_RTS) {
bitand |= TIOCM_RTS;
clr |= CMD8251_RxEN | CMD8251_RTS;
}
actcd19/main/c/ceph/ceph_12.2.11+dfsg1-2/src/boost/boost/mpl/bitand.hpp:39:
#if defined(_MSC_VER) && !defined(__clang__)
#ifndef __GCCXML__
#if defined(bitand)
# pragma pop_macro("bitand")
#endif
actcd19/main/f/fuzzylite/fuzzylite_6.0+dfsg-2/fuzzylite/src/rule/Consequent.cpp:210:
}
if (not ((state bitand S_AND) or (state bitand S_WITH))) { //only acceptable final state
if (state bitand S_VARIABLE) {
std::ostringstream ex;
actcd19/main/k/kfreebsd-10/kfreebsd-10_10.3~svn300087-5/sys/pc98/cbus/sio.c:3245:
CMD8251_RTS;
}
bitand = ~bitand;
mtx_lock_spin(&sio_lock);
com->pc98_prev_modem_status &= bitand;
actcd19/main/m/mupdf/mupdf_1.14.0+ds1-3/thirdparty/mujs/jsparse.c:519:
static js_Ast *bitxor(js_State *J, int notin)
{
js_Ast *a = bitand(J, notin);
SAVEREC();
while (jsP_accept(J, '^')) {
actcd19/main/k/kfreebsd-10/kfreebsd-10_10.3~svn300087-5/sys/pc98/cbus/sio.c:3258:
bitand |= MCR_DTR;
if (sigoff & SER_RTS)
bitand |= MCR_RTS;
if (sigon & SER_DTR)
bitor |= MCR_DTR;
actcd19/main/g/gcc-arm-none-eabi/gcc-arm-none-eabi_7-2018-q2-5/gcc/testsuite/gcc.dg/Wcxx-compat-13.c:6:
int and; /* { dg-warning "operator" } */
int and_eq; /* { dg-warning "operator" } */
int bitand; /* { dg-warning "operator" } */
int bitor; /* { dg-warning "operator" } */
int compl; /* { dg-warning "operator" } */
actcd19/main/p/pcc-libs/pcc-libs_1.2.0~DEVEL+20180604-2.1/libpcc/include/iso646.h:7:
#define and &&
#define and_eq &=
#define bitand &
#define bitor |
#define compl ~
actcd19/main/k/kfreebsd-10/kfreebsd-10_10.3~svn300087-5/sys/pc98/cbus/sio.c:3228:
clr = set = 0;
if (sigoff & SER_DTR) {
bitand |= TIOCM_DTR;
clr |= CMD8251_DTR;
}
actcd19/main/n/nescc/nescc_1.3.5-1.1/src/AST_list_node.h:556:
#define last_ne(x) CAST(ne, AST_node_last(CAST(node, (x))))
#define scan_ne(var, list) for (var = (list); var; var = CAST(ne, var->next))
#define bitand_reverse(x) CAST(bitand, AST_node_reverse(CAST(node, (x))))
#define bitand_length(x) AST_node_length(CAST(node, (x)))
#define last_bitand(x) CAST(bitand, AST_node_last(CAST(node, (x))))
actcd19/main/l/llvm-toolchain-8/llvm-toolchain-8_8~+rc3-1~exp1/clang/test/Preprocessor/cxx_oper_keyword_ms_compat.cpp:113:
asm
auto
bitand
bitor
bool
actcd19/main/o/openjfx/openjfx_11.0.2+1-1/modules/javafx.web/src/main/native/Source/JavaScriptCore/jit/JIT.cpp:543:
DEFINE_SLOWCASE_SLOW_OP(inc)
DEFINE_SLOWCASE_SLOW_OP(dec)
DEFINE_SLOWCASE_SLOW_OP(bitand)
DEFINE_SLOWCASE_SLOW_OP(bitor)
DEFINE_SLOWCASE_SLOW_OP(bitxor)
actcd19/main/e/edk2/edk2_0~20181115.85588389-2/StdLib/Include/iso646.h:22:
#define and && ///< Logical AND of two boolean expressions
#define and_eq &= ///< Bitwise AND with assignment to lval
#define bitand & ///< Bitwise AND of two scalar expressions
#define bitor | ///< Bitwise OR of two scalar expressions
#define compl ~ ///< Binary complement
actcd19/main/libb/libboost-geometry-utils-perl/libboost-geometry-utils-perl_0.15-2/src/boost/mpl/bitand.hpp:24:
#if defined(_MSC_VER)
#ifndef __GCCXML__
#if defined(bitand)
# pragma push_macro("bitand")
# undef bitand
actcd19/main/f/fuzzylite/fuzzylite_6.0+dfsg-2/fuzzylite/src/rule/Consequent.cpp:211:
if (not ((state bitand S_AND) or (state bitand S_WITH))) { //only acceptable final state
if (state bitand S_VARIABLE) {
std::ostringstream ex;
ex << "[syntax error] consequent expected output variable after <" << token << ">";
actcd19/main/g/gcc-avr/gcc-avr_5.4.0+Atmel3.6.1-2/gcc/gcc/ginclude/iso646.h:34:
#define and &&
#define and_eq &=
#define bitand &
#define bitor |
#define compl ~
actcd19/main/a/astropy/astropy_3.1.2-2/cextern/cfitsio/lib/eval_y.c:5108:
bitor( this->value.data.strptr[rows], sptr1, sptr2 );
else if( this->operation=='&' )
bitand( this->value.data.strptr[rows], sptr1, sptr2 );
else {
strcpy( this->value.data.strptr[rows], sptr1 );
actcd19/main/f/fuzzylite/fuzzylite_6.0+dfsg-2/fuzzylite/src/rule/Antecedent.cpp:349:
if (not ((state bitand S_VARIABLE) or (state bitand S_AND_OR))) { //only acceptable final state
if (state bitand S_IS) {
std::ostringstream ex;
ex << "[syntax error] antecedent expected keyword <" << Rule::isKeyword() << "> after <" << token << ">";
actcd19/main/l/llvm-toolchain-7/llvm-toolchain-7_7.0.1-6/clang/test/Preprocessor/cxx_compl.cpp:4:
// RUN: %clang_cc1 -DA=0 -E %s | grep 'int a = 927 == 927'
// RUN: %clang_cc1 -E %s | grep 'int a = 927 == 927'
#if compl 0 bitand A
#define X 37
#else
actcd19/main/f/fuzzylite/fuzzylite_6.0+dfsg-2/fuzzylite/src/rule/Consequent.cpp:153:
}
if (state bitand S_HEDGE) {
HedgeFactory* factory = FactoryManager::instance()->hedge();
if (factory->hasConstructor(token)) {
actcd19/main/a/arrayfire/arrayfire_3.3.2+dfsg1-3/src/backend/cuda/binary.hpp:50:
BINARY(and)
BINARY(or)
BINARY(bitand)
BINARY(bitor)
BINARY(bitxor)
actcd19/main/l/lua-torch-torch7/lua-torch-torch7_0~20170926-g89ede3b-6/lib/TH/generic/THTensorMath.c:791:
}
void THTensor_(bitand)(THTensor *r_, THTensor *t, real value)
{
#if defined(TH_REAL_IS_FLOAT) || defined(TH_REAL_IS_DOUBLE) || defined(TH_REAL_IS_HALF)
actcd19/main/k/kfreebsd-10/kfreebsd-10_10.3~svn300087-3/sys/dev/sio/sio.c:2149:
bitand = ~bitand;
mtx_lock_spin(&sio_lock);
com->mcr_image &= bitand;
com->mcr_image |= bitor;
outb(com->modem_ctl_port, com->mcr_image);
actcd19/main/f/fuzzylite/fuzzylite_6.0+dfsg-2/fuzzylite/src/Benchmark.cpp:428:
for (std::size_t i = 0; i < results.size(); ++i) {
Result pair = results.at(i);
if (contents bitand Header) {
os << pair.first;
}
actcd19/main/n/nescc/nescc_1.3.5-1.1/src/AST_list_node.h:777:
eq eq_chain(eq l1, eq l2);
ne ne_chain(ne l1, ne l2);
bitand bitand_chain(bitand l1, bitand l2);
bitor bitor_chain(bitor l1, bitor l2);
bitxor bitxor_chain(bitxor l1, bitxor l2);
actcd19/main/libz/libzeep/libzeep_3.0.2-7/zeep/config.hpp:42:
# define and &&
# define and_eq &=
# define bitand &
# define bitor |
# define compl ~
actcd19/main/l/lua-torch-torch7/lua-torch-torch7_0~20170926-g89ede3b-6/lib/TH/generic/THTensorMath.h:44:
TH_API void THTensor_(remainder)(THTensor *r_, THTensor *t, real value);
TH_API void THTensor_(clamp)(THTensor *r_, THTensor *t, real min_value, real max_value);
TH_API void THTensor_(bitand)(THTensor *r_, THTensor *t, real value);
TH_API void THTensor_(bitor)(THTensor *r_, THTensor *t, real value);
TH_API void THTensor_(bitxor)(THTensor *r_, THTensor *t, real value);
actcd19/main/s/sdcc/sdcc_3.8.0+dfsg-2/support/regression/tests/iso646.c:21:
ASSERT(({type})(left bitand right) == ({type})0x1E4);
ASSERT(({type})(right bitand left) == ({type})0x1E4);
ASSERT(({type})(left bitand 0xc1ec) == ({type})0x1E4);
ASSERT(({type})(0x3df7 bitand right) == ({type})0x1E4);
actcd19/main/n/nescc/nescc_1.3.5-1.1/src/AST_types.c:1690:
}
bitand new_bitand(region r, location location, expression arg1, expression arg2)
{
bitand obj = ralloc(r, struct AST_binary);
actcd19/main/f/fuzzylite/fuzzylite_6.0+dfsg-2/fuzzylite/src/rule/Antecedent.cpp:333:
throw Exception(ex.str(), FL_AT);
}
if (state bitand S_IS) {
std::ostringstream ex;
ex << "[syntax error] antecedent expected keyword <" << Rule::isKeyword() << ">, but found <" << token << ">";
actcd19/main/f/fuzzylite/fuzzylite_6.0+dfsg-2/fuzzylite/src/rule/Antecedent.cpp:271:
}
if (state bitand S_IS) {
if (token == Rule::isKeyword()) {
state = S_HEDGE bitor S_TERM;
actcd19/main/f/fuzzylite/fuzzylite_6.0+dfsg-2/fuzzylite/src/Benchmark.cpp:445:
for (std::size_t i = 0; i < results.size(); ++i) {
Result pair = results.at(i);
if (contents bitand Header) {
header << pair.first;
if (i + 1 < results.size()) header << delimiter;
actcd19/main/f/fuzzylite/fuzzylite_6.0+dfsg-2/fuzzylite/src/rule/Antecedent.cpp:254:
try {
while (tokenizer >> token) {
if (state bitand S_VARIABLE) {
Variable* variable = fl::null;
if (engine->hasInputVariable(token))
actcd19/main/f/frama-c/frama-c_20171101+sulfur+dfsg-2/share/libc/iso646.h:30:
#define and &&
#define and_eq &=
#define bitand &
#define bitor |
#define compl ~
actcd19/main/f/fuzzylite/fuzzylite_6.0+dfsg-2/fuzzylite/src/rule/Consequent.cpp:184:
throw Exception(ex.str(), FL_AT);
}
if (state bitand S_IS) {
std::ostringstream ex;
ex << "[syntax error] consequent expected keyword <" << Rule::isKeyword() << ">, "
actcd19/main/k/kfreebsd-10/kfreebsd-10_10.3~svn300087-5/sys/pc98/cbus/sio.c:3265:
bitand = ~bitand;
mtx_lock_spin(&sio_lock);
com->mcr_image &= bitand;
com->mcr_image |= bitor;
outb(com->modem_ctl_port, com->mcr_image);
actcd19/main/l/llvm-toolchain-3.8/llvm-toolchain-3.8_3.8.1-23/clang/test/Parser/cxx-decl.cpp:161:
&r0 = v;
struct s
bitand r2 = v;
}
actcd19/main/f/fuzzylite/fuzzylite_6.0+dfsg-2/fuzzylite/src/Benchmark.cpp:449:
if (i + 1 < results.size()) header << delimiter;
}
if (contents bitand Body) {
body << pair.second;
if (i + 1 < results.size()) body << delimiter;
actcd19/main/k/kfreebsd-10/kfreebsd-10_10.3~svn300087-5/sys/pc98/cbus/sio.c:3247:
bitand = ~bitand;
mtx_lock_spin(&sio_lock);
com->pc98_prev_modem_status &= bitand;
com->pc98_prev_modem_status |= bitor;
pc98_i8251_clear_or_cmd(com, clr, set);
actcd19/main/n/nescc/nescc_1.3.5-1.1/src/AST_list_node.c:452:
{ return CAST(ne, AST_node_chain(CAST(node, l1), CAST(node, l2))); }
bitand bitand_chain(bitand l1, bitand l2)
{ return CAST(bitand, AST_node_chain(CAST(node, l1), CAST(node, l2))); }
actcd19/main/m/mupdf/mupdf_1.14.0+ds1-3/thirdparty/mujs/jsparse.c:523:
while (jsP_accept(J, '^')) {
INCREC();
a = EXP2(BITXOR, a, bitand(J, notin));
}
POPREC();
actcd19/main/l/llvm-toolchain-7/llvm-toolchain-7_7.0.1-8/clang/test/Parser/cxx-decl.cpp:170:
&r0 = v;
struct s
bitand r2 = v;
}
actcd19/main/w/webkit2gtk/webkit2gtk_2.22.7-1/Source/JavaScriptCore/jit/JIT.cpp:561:
DEFINE_SLOWCASE_SLOW_OP(inc)
DEFINE_SLOWCASE_SLOW_OP(dec)
DEFINE_SLOWCASE_SLOW_OP(bitand)
DEFINE_SLOWCASE_SLOW_OP(bitor)
DEFINE_SLOWCASE_SLOW_OP(bitxor)
actcd19/main/a/arrayfire/arrayfire_3.3.2+dfsg1-4/test/binary.cpp:283:
BITOP(bitor, intl, |)
BITOP(bitand, intl, &)
BITOP(bitxor, intl, ^)
BITOP(bitshiftl, intl, <<)
actcd19/main/f/fuzzylite/fuzzylite_6.0+dfsg-2/fuzzylite/src/rule/Antecedent.cpp:328:
//If reached this point, there was an error
if ((state bitand S_VARIABLE) or (state bitand S_AND_OR)) {
std::ostringstream ex;
ex << "[syntax error] antecedent expected variable or logical operator, but found <" << token << ">";
actcd19/main/n/nescc/nescc_1.3.5-1.1/src/AST_list_node.c:452:
{ return CAST(ne, AST_node_chain(CAST(node, l1), CAST(node, l2))); }
bitand bitand_chain(bitand l1, bitand l2)
{ return CAST(bitand, AST_node_chain(CAST(node, l1), CAST(node, l2))); }
actcd19/main/n/nescc/nescc_1.3.5-1.1/src/AST_list_node.c:452:
{ return CAST(ne, AST_node_chain(CAST(node, l1), CAST(node, l2))); }
bitand bitand_chain(bitand l1, bitand l2)
{ return CAST(bitand, AST_node_chain(CAST(node, l1), CAST(node, l2))); }
actcd19/main/a/astropy/astropy_3.1.2-2/cextern/cfitsio/lib/eval_y.c:8128:
}
static void bitand(char *result,char *bitstrm1,char *bitstrm2)
{
int i, l1, l2, ldiff, largestStream;
actcd19/main/k/kfreebsd-10/kfreebsd-10_10.3~svn300087-3/sys/dev/sio/sio.c:2132:
{
struct com_s *com;
int bitand, bitor, msr;
com = tp->t_sc;
actcd19/main/k/kfreebsd-10/kfreebsd-10_10.3~svn300087-5/sys/pc98/cbus/sio.c:3254:
} else {
#endif
bitand = bitor = 0;
if (sigoff & SER_DTR)
bitand |= MCR_DTR;
actcd19/main/k/kfreebsd-10/kfreebsd-10_10.3~svn300087-3/sys/dev/sio/sio.c:2140:
bitand = bitor = 0;
if (sigoff & SER_DTR)
bitand |= MCR_DTR;
if (sigoff & SER_RTS)
bitand |= MCR_RTS;
actcd19/main/l/llvm-toolchain-6.0/llvm-toolchain-6.0_6.0.1-10/clang/test/Parser/cxx0x-decl.cpp:68:
struct s
bitand r2 = v;
struct s
actcd19/main/s/swftools/swftools_0.9.2+git20130725-4.1/lib/as3/opcodes.h:22:
#define OPCODE_ASTYPELATE 0x87
code_t* abc_bitand(code_t*prev);
#define bitand(method) (method->code = abc_bitand(method->code))
#define OPCODE_BITAND 0xA8
code_t* abc_bitnot(code_t*prev);
actcd19/main/n/nescc/nescc_1.3.5-1.1/src/AST_walk_children.c:724:
}
case kind_bitand: {
bitand x = CAST(bitand, n);
AST_walk_list(s, d, (node *)&x->arg1);
actcd19/main/c/ceph/ceph_12.2.11+dfsg1-2/src/boost/boost/mpl/bitand.hpp:27:
# pragma push_macro("bitand")
# undef bitand
# define bitand(x)
#endif
#endif
actcd19/main/k/kfreebsd-10/kfreebsd-10_10.3~svn300087-5/sys/dev/digi/digi.c:607:
struct digi_softc *sc;
struct digi_p *port;
int bitand, bitor, mstat;
port = tp->t_sc;
actcd19/main/l/llvm-toolchain-6.0/llvm-toolchain-6.0_6.0.1-10/clang/test/Parser/cxx0x-attributes.cpp:370:
}
#define attr_name bitand
#define attr_name_2(x) x
#define attr_name_3(x, y) x##y
actcd19/main/r/rspamd/rspamd_1.8.1-2/contrib/lua-torch/torch7/lib/TH/generic/THTensorMath.h:44:
TH_API void THTensor_(remainder)(THTensor *r_, THTensor *t, real value);
TH_API void THTensor_(clamp)(THTensor *r_, THTensor *t, real min_value, real max_value);
TH_API void THTensor_(bitand)(THTensor *r_, THTensor *t, real value);
TH_API void THTensor_(bitor)(THTensor *r_, THTensor *t, real value);
TH_API void THTensor_(bitxor)(THTensor *r_, THTensor *t, real value);
actcd19/main/k/kfreebsd-10/kfreebsd-10_10.3~svn300087-5/sys/dev/digi/digi.c:631:
}
bitand = 0;
bitor = 0;
actcd19/main/c/ceph/ceph_12.2.11+dfsg1-2/src/boost/boost/mpl/bitand.hpp:24:
#if defined(_MSC_VER) && !defined(__clang__)
#ifndef __GCCXML__
#if defined(bitand)
# pragma push_macro("bitand")
# undef bitand
actcd19/main/n/nescc/nescc_1.3.5-1.1/src/AST_list_node.h:777:
eq eq_chain(eq l1, eq l2);
ne ne_chain(ne l1, ne l2);
bitand bitand_chain(bitand l1, bitand l2);
bitor bitor_chain(bitor l1, bitor l2);
bitxor bitxor_chain(bitxor l1, bitxor l2);
actcd19/main/u/usb-modeswitch/usb-modeswitch_2.5.2+repack0-2/usb_modeswitch.h:78:
// Bitwise
#define bitand &
#define bitor |
#define compl ~
actcd19/main/k/kfreebsd-10/kfreebsd-10_10.3~svn300087-5/sys/dev/digi/digi.c:642:
if (sigon & SER_RTS)
bitor |= port->sc->csigs->rts;
fepcmd_b(port, SETMODEM, bitor, ~bitand, 0);
return (0);
}
actcd19/main/l/llvm-toolchain-8/llvm-toolchain-8_8~+rc3-1~exp1/clang/test/Parser/cxx0x-attributes.cpp:370:
}
#define attr_name bitand
#define attr_name_2(x) x
#define attr_name_3(x, y) x##y
actcd19/main/g/gcc-arm-none-eabi/gcc-arm-none-eabi_7-2018-q2-6/gcc/testsuite/g++.dg/cpp0x/gen-attrs-61.C:5:
foo ()
{
int i [[and::bitor, bar::xor_eq, compl::baz(1), bitand::xor_eq(2, 3)]]; // { dg-warning "ignored" }
int j [[using, using::baz, bar::using, using::using (2)]]; // { dg-warning "ignored" }
i = 0;
actcd19/main/c/ceph/ceph_12.2.11+dfsg1-2/src/boost/boost/mpl/bitand.hpp:26:
#if defined(bitand)
# pragma push_macro("bitand")
# undef bitand
# define bitand(x)
#endif
actcd19/main/f/fuzzylite/fuzzylite_6.0+dfsg-2/fuzzylite/src/rule/Consequent.cpp:136:
try {
while (tokenizer >> token) {
if (state bitand S_VARIABLE) {
if (engine->hasOutputVariable(token)) {
proposition = new Proposition;
actcd19/main/b/boost1.67/boost1.67_1.67.0-13/libs/wave/test/testwave/testfiles/t_2_014.cpp:63:
//R #line 66 "t_2_014.cpp"
//R true
#if 1 bitand 2
false
#else
actcd19/main/f/fuzzylite/fuzzylite_6.0+dfsg-2/fuzzylite/src/rule/Antecedent.cpp:279:
}
if (state bitand S_HEDGE) {
HedgeFactory* factory = FactoryManager::instance()->hedge();
if (factory->hasConstructor(token)) {
actcd19/main/k/kfreebsd-10/kfreebsd-10_10.3~svn300087-5/sys/pc98/cbus/sio.c:3225:
#ifdef PC98
if (IS_8251(com->pc98_if_type)) {
bitand = bitor = 0;
clr = set = 0;
if (sigoff & SER_DTR) {