Searched refs:m_castle (Results 1 – 3 of 3) sorted by relevance
417 m_castle |= 1 << color; in setCastleShort()422 m_castle |= 4 << color; in setCastleLong()427 m_castle &= ~(5 << color); in destroyCastle()438 case 0: if (color == 0) m_castle &= (unsigned char) ~4; break; in destroyCastleInDirection()439 case 1: if (color == 0) m_castle &= (unsigned char) ~1; break; in destroyCastleInDirection()440 case 2: if (color == 1) m_castle &= (unsigned char) ~8; break; in destroyCastleInDirection()441 case 3: if (color == 1) m_castle &= (unsigned char) ~2; break; in destroyCastleInDirection()489 return m_castle & (5 << color); in canCastle()494 return m_castle & (1 << color); in canCastleShort()499 return m_castle & (4 << color); in canCastleLong()[all …]
555 m_castle &= Castle[s]; in removeAt()1776 m.u |= (((unsigned short) m_castle & 0xF) << 8); in nullMove()2552 m_castle = (m.u >> 8) & 0xF; in undoMove()2760 move.u |= (((unsigned short) m_castle & 0xF) << 8); in prepareMove()3506 m_castle = cr; in setCastlingRights()
1064 shared_ptr<CastleProto> m_castle = make_shared<CastleProto>(a_castle); in attemptRoseCastleMerge() local1065 pruneCastle(*m_castle, a_left.leftfix_report); in attemptRoseCastleMerge()1066 setReports(*m_castle, new_report); in attemptRoseCastleMerge()1084 const PureRepeat &a_pr = m_castle->repeats[a_top]; // new report in attemptRoseCastleMerge()1091 u32 new_top = m_castle->merge(pr); in attemptRoseCastleMerge()1102 m_castle->repeats.size()); in attemptRoseCastleMerge()1109 a_left.castle = m_castle; in attemptRoseCastleMerge()1111 b_left.castle = m_castle; in attemptRoseCastleMerge()1117 pruneUnusedTops(*m_castle, g, rai.rev_leftfix[a_left]); in attemptRoseCastleMerge()