Searched refs:divider_ (Results 1 – 4 of 4) sorted by relevance
27 divider_ = last_ = reinterpret_cast<base::AtomicWord>(first_);47 if (divider_ == base::Acquire_Load(&last_)) return false;48 Node* next = reinterpret_cast<Node*>(divider_)->next;50 base::Release_Store(÷r_, reinterpret_cast<base::AtomicWord>(next));61 while (first_ != reinterpret_cast<Node*>(base::Acquire_Load(÷r_))) {69 return base::NoBarrier_Load(÷r_) == base::NoBarrier_Load(&last_);75 if (divider_ == base::Acquire_Load(&last_)) return NULL;76 Node* next = reinterpret_cast<Node*>(divider_)->next;
38 base::AtomicWord divider_; // Node* variable
3499 explicit DivisibleByImpl(int a_divider) : divider_(a_divider) {} in DivisibleByImpl()3504 *listener << "which is " << (n % divider_) << " modulo " in MatchAndExplain()3505 << divider_; in MatchAndExplain()3506 return (n % divider_) == 0; in MatchAndExplain()3510 *os << "is divisible by " << divider_; in DescribeTo()3514 *os << "is not divisible by " << divider_; in DescribeNegationTo()3517 void set_divider(int a_divider) { divider_ = a_divider; } in set_divider()3518 int divider() const { return divider_; } in divider()3521 int divider_; member in testing::gmock_matchers_test::DivisibleByImpl
3782 explicit DivisibleByImpl(int a_divider) : divider_(a_divider) {} in DivisibleByImpl()3787 *listener << "which is " << (n % divider_) << " modulo " in MatchAndExplain()3788 << divider_; in MatchAndExplain()3789 return (n % divider_) == 0; in MatchAndExplain()3793 *os << "is divisible by " << divider_; in DescribeTo()3797 *os << "is not divisible by " << divider_; in DescribeNegationTo()3800 void set_divider(int a_divider) { divider_ = a_divider; } in set_divider()3801 int divider() const { return divider_; } in divider()3804 int divider_; member in testing::gmock_matchers_test::DivisibleByImpl