check
#define CHECK_IP_FETCH() (M.x86.check & CHECK_IP_FETCH_F)
#define CHECK_SP_ACCESS() (M.x86.check & CHECK_SP_ACCESS_F)
#define CHECK_MEM_ACCESS() (M.x86.check & CHECK_MEM_ACCESS_F)
#define CHECK_DATA_ACCESS() (M.x86.check & CHECK_DATA_ACCESS_F)
int check;
status_t check = InitCheck();
if (check < B_OK)
return check;
static BPrivateScreen* _Get(int32 id, bool check);
BMessage check(kMsgCheckTime);
fRunner = new (std::nothrow) BMessageRunner(fController, &check,
uint32 value, uint8 size, bool check = false)
if (!check)
uint32 check;
check = device->rxDescriptor[current].wb_status;
if (check & WB_RXSTAT_OWN) {
if (check & (WB_RXSTAT_RXERR | WB_RXSTAT_CRCERR | WB_RXSTAT_RUNT)) {
size = WB_RXBYTES(check);
uint32 check;
check = device->txDescriptor[current].wb_status;
if (check & WB_TXSTAT_OWN) {
const hal_mac_hang_check_t *check)
if (check->states & dcu_chain_state) {
check->dcu_chain_state)
check->dcu_chain_state)
if (check->states & dcu_complete_state) {
if ((regs->dma_dbg_6 & 0x3) == check->dcu_complete_state)
if (check->states & qcu_stitch_state) {
if (((regs->dma_dbg_3 >> 18) & 0xf) == check->qcu_stitch_state)
if (check->states & qcu_fetch_state) {
if (((regs->dma_dbg_3 >> 22) & 0xf) == check->qcu_fetch_state)
if (check->states & qcu_complete_state) {
if (((regs->dma_dbg_3 >> 26) & 0x7) == check->qcu_complete_state)
return (found_states == check->states);
BPlusTree::_ValidateChildren(TreeCheck& check, uint32 level, off_t offset,
check.FoundError();
check.FoundError();
check.SetLevel(level);
if (check.Visited(offset)) {
check.FoundError();
check.SetVisited(offset);
off_t lastOffset = check.PreviousOffset(level);
check.FoundError();
check.FoundError();
&& check.VisitedFragment(duplicateOffset);
if (!isKnownFragment && check.Visited(duplicateOffset)) {
check.FoundError();
if (!check.Visited(duplicateOffset))
check.SetVisited(duplicateOffset);
check.SetVisitedFragment(duplicateOffset);
check.FoundError();
check.FoundError();
check.FoundError();
check.FoundError();
status_t status = _ValidateChild(check, cached, level, childOffset,
check.FoundError();
status_t status = _ValidateChild(check, cached, level, childOffset,
check.SetPreviousOffset(level, lastOffset);
BPlusTree::_ValidateChild(TreeCheck& check, CachedNode& cached, uint32 level,
check.FoundError();
check.FoundError();
check.FoundError();
return _ValidateChildren(check, level + 1, offset, key, keyLength, node);
CachedNode::SetTo(off_t offset, bool check)
if (SetTo(offset, &node, check) == B_OK)
CachedNode::SetTo(off_t offset, const bplustree_node** _node, bool check)
if (check) {
CachedNode::SetToWritable(Transaction& transaction, off_t offset, bool check)
if (check) {
TreeCheck check(this);
if (check.InitCheck() != B_OK)
check.SetVisited(0);
check.FoundError();
if (check.Visited(freeOffset)) {
check.FoundError();
check.SetVisited(freeOffset);
status = _ValidateChildren(check, 0, fHeader.RootNode(), NULL, 0, root);
if (check.ErrorsFound())
if (check.MaxLevels() + 1 != fHeader.MaxNumberOfLevels()) {
"declared %" B_PRIu32 "!\n", fStream->ID(), check.MaxLevels(),
if ((off_t)check.VisitedCount() != fHeader.MaximumSize() / fNodeSize) {
" nodes.\n", fStream->ID(), check.VisitedCount(),
CachedNode(BPlusTree* tree, off_t offset, bool check = true)
SetTo(offset, check);
const bplustree_node* SetTo(off_t offset, bool check = true);
bool check = true);
off_t offset, bool check = true);
status_t _ValidateChildren(TreeCheck& check,
status_t _ValidateChild(TreeCheck& check,
uint8 check = fat32 == true ? 0x42 : 0x26;
if (buffer[check] == EXBOOTSIG && memcmp(buffer + offset, " ", LABEL_LENGTH) != 0) {
checkForBlockRunIntersection(const block_run& check, const block_run& against)
if (check.allocation_group == against.allocation_group
&& check.start + check.length > against.start
&& check.start < against.start + against.length)
bplustree_node *BPlusTree::Node(off_t nodeOffset,bool check)
if (check && node != NULL)
bplustree_node *Node(off_t nodeoffset,bool check = true);
goto check;
check:
&& (*proto->check)((u_char *)icp, (u_char)seq))
&& (*proto->check)(inner, (u_char)seq))
int (*check)(const u_char *, int);
BPrivateScreen::_Get(int32 id, bool check)
if (check) {
if (!area.check(name, nameSize)) {
while (area.check(data, minRemainderSize)) {
if (!area.check(data, kMinResourceInfoBlockSize)) {
if (!area.check(data, kResourceInfoSeparatorSize)) {
if (!area.check(data, kResourceInfoSeparatorSize)) {
ParanoiaCheck* NextCheck(ParanoiaCheck* check) const
return check->fNext;
ParanoiaCheck* check = fChecks;
while (check != NULL && check->Address() != address)
check = check->fNext;
return check;
void AddCheck(ParanoiaCheck* check)
check->fNext = fChecks;
fChecks = check;
void RemoveCheck(ParanoiaCheck* check)
if (check == fChecks) {
fChecks = check->fNext;
while (previous != NULL && previous->fNext != check)
previous->fNext = check->fNext;
ParanoiaCheck* check = fChecks;
if (check == NULL)
fChecks = check->fNext;
return check;
uint8 check[sizeof(ParanoiaCheck)];
while (ParanoiaCheck* check = set->RemoveFirstCheck())
free_slot((paranoia_slot*)check);
ParanoiaCheck* check = set->FirstCheck();
while (check != NULL) {
if (!check->Check()) {
check->Address(), check->Size());
check = set->NextCheck(check);
ParanoiaCheck* check = set->FindCheck(address);
if (check != NULL) {
if (check->Size() != size) {
check->Update();
check = new(slot) ParanoiaCheck(address, size);
set->AddCheck(check);
ParanoiaCheck* check = set->FindCheck(address);
if (check == NULL) {
if (check->Size() != size) {
set->RemoveCheck(check);
find_chunknum(struct dir_info *d, struct chunk_info *info, void *ptr, int check)
if (check && info->bucket > 0) {
ofree(struct dir_info **argpool, void *p, int clear, int check, size_t argsz)
if (!check) {
if (check) {
bool check;
check = iter->ai_family == AF_INET;
if (!check) break;
CPPUNIT_ASSERT(check);
while (area.check(data, minRemainderSize)) {
if (!area.check(data, kMinResourceInfoBlockSize)) {
if (!area.check(data, kResourceInfoSeparatorSize)) {
if (!area.check(data, kResourceInfoSeparatorSize)) {
if (!area.check(name, nameSize)) {