io.reactivex.rxjava3.internal.operators.parallel.ParallelJoin Maven / Gradle / Ivy
Go to download
Show more of this group Show more artifacts with this name
Show all versions of redisson-all Show documentation
Show all versions of redisson-all Show documentation
Easy Redis Java client and Real-Time Data Platform. Valkey compatible. Sync/Async/RxJava3/Reactive API. Client side caching. Over 50 Redis based Java objects and services: JCache API, Apache Tomcat, Hibernate, Spring, Set, Multimap, SortedSet, Map, List, Queue, Deque, Semaphore, Lock, AtomicLong, Map Reduce, Bloom filter, Scheduler, RPC
/*
* Copyright (c) 2016-present, RxJava Contributors.
*
* Licensed under the Apache License, Version 2.0 (the "License"); you may not use this file except in
* compliance with the License. You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing, software distributed under the License is
* distributed on an "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. See
* the License for the specific language governing permissions and limitations under the License.
*/
package io.reactivex.rxjava3.internal.operators.parallel;
import java.util.concurrent.atomic.*;
import org.reactivestreams.*;
import io.reactivex.rxjava3.core.*;
import io.reactivex.rxjava3.exceptions.*;
import io.reactivex.rxjava3.internal.subscriptions.SubscriptionHelper;
import io.reactivex.rxjava3.internal.util.*;
import io.reactivex.rxjava3.operators.SimplePlainQueue;
import io.reactivex.rxjava3.operators.SimpleQueue;
import io.reactivex.rxjava3.operators.SpscArrayQueue;
import io.reactivex.rxjava3.parallel.ParallelFlowable;
import io.reactivex.rxjava3.plugins.RxJavaPlugins;
/**
* Merges the individual 'rails' of the source ParallelFlowable, unordered,
* into a single regular Publisher sequence (exposed as Flowable).
*
* @param the value type
*/
public final class ParallelJoin extends Flowable {
final ParallelFlowable source;
final int prefetch;
final boolean delayErrors;
public ParallelJoin(ParallelFlowable source, int prefetch, boolean delayErrors) {
this.source = source;
this.prefetch = prefetch;
this.delayErrors = delayErrors;
}
@Override
protected void subscribeActual(Subscriber s) {
JoinSubscriptionBase parent;
if (delayErrors) {
parent = new JoinSubscriptionDelayError<>(s, source.parallelism(), prefetch);
} else {
parent = new JoinSubscription<>(s, source.parallelism(), prefetch);
}
s.onSubscribe(parent);
source.subscribe(parent.subscribers);
}
abstract static class JoinSubscriptionBase extends AtomicInteger
implements Subscription {
private static final long serialVersionUID = 3100232009247827843L;
final Subscriber downstream;
final JoinInnerSubscriber[] subscribers;
final AtomicThrowable errors = new AtomicThrowable();
final AtomicLong requested = new AtomicLong();
volatile boolean cancelled;
final AtomicInteger done = new AtomicInteger();
JoinSubscriptionBase(Subscriber actual, int n, int prefetch) {
this.downstream = actual;
@SuppressWarnings("unchecked")
JoinInnerSubscriber[] a = new JoinInnerSubscriber[n];
for (int i = 0; i < n; i++) {
a[i] = new JoinInnerSubscriber<>(this, prefetch);
}
this.subscribers = a;
done.lazySet(n);
}
@Override
public void request(long n) {
if (SubscriptionHelper.validate(n)) {
BackpressureHelper.add(requested, n);
drain();
}
}
@Override
public void cancel() {
if (!cancelled) {
cancelled = true;
cancelAll();
if (getAndIncrement() == 0) {
cleanup();
}
}
}
void cancelAll() {
for (JoinInnerSubscriber s : subscribers) {
s.cancel();
}
}
void cleanup() {
for (JoinInnerSubscriber s : subscribers) {
s.queue = null;
}
}
abstract void onNext(JoinInnerSubscriber inner, T value);
abstract void onError(Throwable e);
abstract void onComplete();
abstract void drain();
}
static final class JoinSubscription extends JoinSubscriptionBase {
private static final long serialVersionUID = 6312374661811000451L;
JoinSubscription(Subscriber actual, int n, int prefetch) {
super(actual, n, prefetch);
}
@Override
public void onNext(JoinInnerSubscriber inner, T value) {
if (get() == 0 && compareAndSet(0, 1)) {
if (requested.get() != 0) {
downstream.onNext(value);
if (requested.get() != Long.MAX_VALUE) {
requested.decrementAndGet();
}
inner.request(1);
} else {
SimplePlainQueue q = inner.getQueue();
if (!q.offer(value)) {
cancelAll();
Throwable mbe = new QueueOverflowException();
if (errors.compareAndSet(null, mbe)) {
downstream.onError(mbe);
} else {
RxJavaPlugins.onError(mbe);
}
return;
}
}
if (decrementAndGet() == 0) {
return;
}
} else {
SimplePlainQueue q = inner.getQueue();
if (!q.offer(value)) {
cancelAll();
onError(new QueueOverflowException());
return;
}
if (getAndIncrement() != 0) {
return;
}
}
drainLoop();
}
@Override
public void onError(Throwable e) {
if (errors.compareAndSet(null, e)) {
cancelAll();
drain();
} else {
if (e != errors.get()) {
RxJavaPlugins.onError(e);
}
}
}
@Override
public void onComplete() {
done.decrementAndGet();
drain();
}
@Override
void drain() {
if (getAndIncrement() != 0) {
return;
}
drainLoop();
}
void drainLoop() {
int missed = 1;
JoinInnerSubscriber[] s = this.subscribers;
int n = s.length;
Subscriber a = this.downstream;
for (;;) {
long r = requested.get();
long e = 0;
middle:
while (e != r) {
if (cancelled) {
cleanup();
return;
}
Throwable ex = errors.get();
if (ex != null) {
cleanup();
a.onError(ex);
return;
}
boolean d = done.get() == 0;
boolean empty = true;
for (int i = 0; i < s.length; i++) {
JoinInnerSubscriber inner = s[i];
SimplePlainQueue q = inner.queue;
if (q != null) {
T v = q.poll();
if (v != null) {
empty = false;
a.onNext(v);
inner.requestOne();
if (++e == r) {
break middle;
}
}
}
}
if (d && empty) {
a.onComplete();
return;
}
if (empty) {
break;
}
}
if (e == r) {
if (cancelled) {
cleanup();
return;
}
Throwable ex = errors.get();
if (ex != null) {
cleanup();
a.onError(ex);
return;
}
boolean d = done.get() == 0;
boolean empty = true;
for (int i = 0; i < n; i++) {
JoinInnerSubscriber inner = s[i];
SimpleQueue q = inner.queue;
if (q != null && !q.isEmpty()) {
empty = false;
break;
}
}
if (d && empty) {
a.onComplete();
return;
}
}
if (e != 0) {
BackpressureHelper.produced(requested, e);
}
missed = addAndGet(-missed);
if (missed == 0) {
break;
}
}
}
}
static final class JoinSubscriptionDelayError extends JoinSubscriptionBase {
private static final long serialVersionUID = -5737965195918321883L;
JoinSubscriptionDelayError(Subscriber actual, int n, int prefetch) {
super(actual, n, prefetch);
}
@Override
void onNext(JoinInnerSubscriber inner, T value) {
if (get() == 0 && compareAndSet(0, 1)) {
if (requested.get() != 0) {
downstream.onNext(value);
if (requested.get() != Long.MAX_VALUE) {
requested.decrementAndGet();
}
inner.request(1);
} else {
SimplePlainQueue q = inner.getQueue();
if (!q.offer(value)) {
inner.cancel();
errors.tryAddThrowableOrReport(new QueueOverflowException());
done.decrementAndGet();
drainLoop();
return;
}
}
if (decrementAndGet() == 0) {
return;
}
} else {
SimplePlainQueue q = inner.getQueue();
if (!q.offer(value)) {
inner.cancel();
errors.tryAddThrowableOrReport(new QueueOverflowException());
done.decrementAndGet();
}
if (getAndIncrement() != 0) {
return;
}
}
drainLoop();
}
@Override
void onError(Throwable e) {
if (errors.tryAddThrowableOrReport(e)) {
done.decrementAndGet();
drain();
}
}
@Override
void onComplete() {
done.decrementAndGet();
drain();
}
@Override
void drain() {
if (getAndIncrement() != 0) {
return;
}
drainLoop();
}
void drainLoop() {
int missed = 1;
JoinInnerSubscriber[] s = this.subscribers;
int n = s.length;
Subscriber a = this.downstream;
for (;;) {
long r = requested.get();
long e = 0;
middle:
while (e != r) {
if (cancelled) {
cleanup();
return;
}
boolean d = done.get() == 0;
boolean empty = true;
for (int i = 0; i < n; i++) {
JoinInnerSubscriber inner = s[i];
SimplePlainQueue q = inner.queue;
if (q != null) {
T v = q.poll();
if (v != null) {
empty = false;
a.onNext(v);
inner.requestOne();
if (++e == r) {
break middle;
}
}
}
}
if (d && empty) {
errors.tryTerminateConsumer(a);
return;
}
if (empty) {
break;
}
}
if (e == r) {
if (cancelled) {
cleanup();
return;
}
boolean d = done.get() == 0;
boolean empty = true;
for (int i = 0; i < n; i++) {
JoinInnerSubscriber inner = s[i];
SimpleQueue q = inner.queue;
if (q != null && !q.isEmpty()) {
empty = false;
break;
}
}
if (d && empty) {
errors.tryTerminateConsumer(a);
return;
}
}
if (e != 0) {
BackpressureHelper.produced(requested, e);
}
missed = addAndGet(-missed);
if (missed == 0) {
break;
}
}
}
}
static final class JoinInnerSubscriber
extends AtomicReference
implements FlowableSubscriber {
private static final long serialVersionUID = 8410034718427740355L;
final JoinSubscriptionBase parent;
final int prefetch;
final int limit;
long produced;
volatile SimplePlainQueue queue;
JoinInnerSubscriber(JoinSubscriptionBase parent, int prefetch) {
this.parent = parent;
this.prefetch = prefetch ;
this.limit = prefetch - (prefetch >> 2);
}
@Override
public void onSubscribe(Subscription s) {
SubscriptionHelper.setOnce(this, s, prefetch);
}
@Override
public void onNext(T t) {
parent.onNext(this, t);
}
@Override
public void onError(Throwable t) {
parent.onError(t);
}
@Override
public void onComplete() {
parent.onComplete();
}
public void requestOne() {
long p = produced + 1;
if (p == limit) {
produced = 0;
get().request(p);
} else {
produced = p;
}
}
public void request(long n) {
long p = produced + n;
if (p >= limit) {
produced = 0;
get().request(p);
} else {
produced = p;
}
}
public boolean cancel() {
return SubscriptionHelper.cancel(this);
}
SimplePlainQueue getQueue() {
SimplePlainQueue q = queue;
if (q == null) {
q = new SpscArrayQueue<>(prefetch);
this.queue = q;
}
return q;
}
}
}
© 2015 - 2024 Weber Informatics LLC | Privacy Policy