| /libcore/ojluni/src/main/java/java/util/concurrent/ |
| H A D | TransferQueue.java | 46 * sometimes (using method {@link #transfer}) await receipt of
58 * capacity bounded. If so, an attempted transfer operation may
62 * and {@code transfer} are effectively synonymous.
77 * @param e the element to transfer
96 * @param e the element to transfer
105 void transfer(E e) throws InterruptedException; method in interface:TransferQueue
118 * @param e the element to transfer
|
| H A D | SynchronousQueue.java | 115 * defining the single method transfer that does a put or a
118 * so nearly all code can be combined. The resulting transfer
177 * if null, requests that transfer return an item
186 abstract E transfer(E e, boolean timed, long nanos); method in class:SynchronousQueue.Transferer
311 * Creates or resets fields of a node. Called only from transfer
328 E transfer(E e, boolean timed, long nanos) { method in class:SynchronousQueue.TransferStack
433 * and don't wait at all, so are trapped in transfer
641 E transfer(E e, boolean timed, long nanos) { method in class:SynchronousQueue.TransferQueue
873 if (transferer.transfer(e, false, 0) == null) {
891 if (transferer.transfer(
[all...] |
| H A D | LinkedTransferQueue.java | 278 * of offer, put, poll, take, or transfer (each possibly with
586 private static final int SYNC = 2; // for transfer, take
1317 public void transfer(E e) throws InterruptedException { method in class:LinkedTransferQueue
|
| H A D | ConcurrentHashMap.java | 379 * blocks of indices to transfer (via field transferIndex) before
390 * traversing table. Upon transfer, the old table bin contains
396 * Each bin transfer requires its bin lock, which can stall
400 * progresses. The transfer operation must also ensure that all
563 * Minimum number of rebinnings per transfer step. Ranges are
2229 * A node inserted at head of bins during transfer operations.
2316 * resizing, initiates transfer. If already resizing, helps
2317 * perform transfer if work is available. Rechecks occupancy
2318 * after a transfer to see if another resize is already needed
2352 transfer(ta
2426 private final void transfer(Node<K,V>[] tab, Node<K,V>[] nextTab) { method in class:ConcurrentHashMap
[all...] |
| /libcore/luni/src/test/java/libcore/javax/net/ |
| H A D | ServerSocketFactoryTest.java | 85 transfer(in, out);
128 private void transfer(InputStream in, ByteArrayOutputStream out) throws IOException { method in class:ServerSocketFactoryTest
|
| /libcore/support/src/test/java/tests/http/ |
| H A D | MockWebServer.java | 353 if (lowercaseHeader.startsWith("transfer-encoding:") &&
364 transfer(contentLength, in, requestBody);
374 transfer(chunkSize, in, requestBody);
435 private void transfer(int length, InputStream in, OutputStream out) throws IOException { method in class:MockWebServer
|
| /libcore/jsr166-tests/src/test/java/jsr166/ |
| H A D | LinkedTransferQueueTest.java | 768 * transfer(null) throws NullPointerException
773 q.transfer(null);
779 * transfer waits until a poll occurs. The transfered element
790 q.transfer(five);
806 * transfer waits until a poll occurs, and then transfers in fifo order
814 q.transfer(four);
824 q.transfer(five);
839 * transfer waits until a poll occurs, at which point the polling
847 q.transfer(four);
862 * transfer wait
[all...] |
| /libcore/ojluni/src/main/java/sun/nio/fs/ |
| H A D | UnixCopyFile.java | 249 // transfer bytes to target file
251 transfer(fo, fi, addressToPollForCancel);
605 static native void transfer(int dst, int src, long addressToPollForCancel) method in class:UnixCopyFile
|
| /libcore/ojluni/src/main/java/java/util/ |
| H A D | WeakHashMap.java | 493 transfer(oldTable, newTable);
505 transfer(newTable, oldTable);
511 private void transfer(Entry<K,V>[] src, Entry<K,V>[] dest) { method in class:WeakHashMap
|