Searched refs:divider_ (Results 1 – 4 of 4) sorted by relevance
25 divider_ = last_ = reinterpret_cast<base::AtomicWord>(first_);45 if (divider_ == base::Acquire_Load(&last_)) return false;46 Node* next = reinterpret_cast<Node*>(divider_)->next;48 base::Release_Store(÷r_, reinterpret_cast<base::AtomicWord>(next));59 while (first_ != reinterpret_cast<Node*>(base::Acquire_Load(÷r_))) {67 return base::Relaxed_Load(÷r_) == base::Relaxed_Load(&last_);73 if (divider_ == base::Acquire_Load(&last_)) return nullptr;74 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
4606 explicit DivisibleByImpl(int a_divider) : divider_(a_divider) {} in DivisibleByImpl()4611 *listener << "which is " << (n % divider_) << " modulo " in MatchAndExplain()4612 << divider_; in MatchAndExplain()4613 return (n % divider_) == 0; in MatchAndExplain()4617 *os << "is divisible by " << divider_; in DescribeTo()4621 *os << "is not divisible by " << divider_; in DescribeNegationTo()4624 void set_divider(int a_divider) { divider_ = a_divider; } in set_divider()4625 int divider() const { return divider_; } in divider()4628 int divider_; member in testing::gmock_matchers_test::__anond473036a0111::DivisibleByImpl