Merge branch 'maint' into sverk/trace-process_dump-matchstate

Conflicts:
	erts/emulator/beam/erl_printf_term.c
	erts/emulator/beam/erl_term.c
	erts/emulator/beam/utils.c

1 files changed, 105 insertions, 104 deletions

diff --git a/lib/jinterface/java_src/com/ericsson/otp/erlang/GenericQueue.java b/lib/jinterface/java_src/com/ericsson/otp/erlang/GenericQueue.java
index 80bb02f16c..193df527d5 100644
--- a/lib/jinterface/java_src/com/ericsson/otp/erlang/GenericQueue.java
+++ b/lib/jinterface/java_src/com/ericsson/otp/erlang/GenericQueue.java
@@ -1,19 +1,20 @@
-/* 
+/*
  * %CopyrightBegin%
- * 
+ *
  * Copyright Ericsson AB 2000-2009. All Rights Reserved.
- * 
- * The contents of this file are subject to the Erlang Public License,
- * Version 1.1, (the "License"); you may not use this file except in
- * compliance with the License. You should have received a copy of the
- * Erlang Public License along with this software. If not, it can be
- * retrieved online at http://www.erlang.org/.
- * 
- * Software distributed under the License is distributed on an "AS IS"
- * basis, WITHOUT WARRANTY OF ANY KIND, either express or implied. See
- * the License for the specific language governing rights and limitations
- * under the License.
- * 
+ *
+ * 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.
+ *
  * %CopyrightEnd%
  */
 package com.ericsson.otp.erlang;
@@ -34,128 +35,128 @@ public class GenericQueue {
     private int count;
 
     private void init() {
-	head = null;
-	tail = null;
-	count = 0;
+        head = null;
+        tail = null;
+        count = 0;
     }
 
     /** Create an empty queue */
     public GenericQueue() {
-	init();
-	status = open;
+        init();
+        status = open;
     }
 
     /** Clear a queue */
     public void flush() {
-	init();
+        init();
     }
 
     public void close() {
-	status = closing;
+        status = closing;
     }
 
     /**
      * Add an object to the tail of the queue.
-     * 
+     *
      * @param o
-     *                Object to insert in the queue
+     *            Object to insert in the queue
      */
     public synchronized void put(final Object o) {
-	final Bucket b = new Bucket(o);
-
-	if (tail != null) {
-	    tail.setNext(b);
-	    tail = b;
-	} else {
-	    // queue was empty but has one element now
-	    head = tail = b;
-	}
-	count++;
-
-	// notify any waiting tasks
-	notify();
+        final Bucket b = new Bucket(o);
+
+        if (tail != null) {
+            tail.setNext(b);
+            tail = b;
+        } else {
+            // queue was empty but has one element now
+            head = tail = b;
+        }
+        count++;
+
+        // notify any waiting tasks
+        notify();
     }
 
     /**
      * Retrieve an object from the head of the queue, or block until one
      * arrives.
-     * 
+     *
      * @return The object at the head of the queue.
      */
     public synchronized Object get() {
-	Object o = null;
-
-	while ((o = tryGet()) == null) {
-	    try {
-		this.wait();
-	    } catch (final InterruptedException e) {
-	    }
-	}
-	return o;
+        Object o = null;
+
+        while ((o = tryGet()) == null) {
+            try {
+                this.wait();
+            } catch (final InterruptedException e) {
+            }
+        }
+        return o;
     }
 
     /**
      * Retrieve an object from the head of the queue, blocking until one arrives
      * or until timeout occurs.
-     * 
+     *
      * @param timeout
-     *                Maximum time to block on queue, in ms. Use 0 to poll the
-     *                queue.
-     * 
+     *            Maximum time to block on queue, in ms. Use 0 to poll the
+     *            queue.
+     *
      * @exception InterruptedException
-     *                    if the operation times out.
-     * 
+     *                if the operation times out.
+     *
      * @return The object at the head of the queue, or null if none arrived in
      *         time.
      */
     public synchronized Object get(final long timeout)
-	    throws InterruptedException {
-	if (status == closed) {
-	    return null;
-	}
-
-	long currentTime = System.currentTimeMillis();
-	final long stopTime = currentTime + timeout;
-	Object o = null;
-
-	while (true) {
-	    if ((o = tryGet()) != null) {
-		return o;
-	    }
-
-	    currentTime = System.currentTimeMillis();
-	    if (stopTime <= currentTime) {
-		throw new InterruptedException("Get operation timed out");
-	    }
-
-	    try {
-		this.wait(stopTime - currentTime);
-	    } catch (final InterruptedException e) {
-		// ignore, but really should retry operation instead
-	    }
-	}
+            throws InterruptedException {
+        if (status == closed) {
+            return null;
+        }
+
+        long currentTime = System.currentTimeMillis();
+        final long stopTime = currentTime + timeout;
+        Object o = null;
+
+        while (true) {
+            if ((o = tryGet()) != null) {
+                return o;
+            }
+
+            currentTime = System.currentTimeMillis();
+            if (stopTime <= currentTime) {
+                throw new InterruptedException("Get operation timed out");
+            }
+
+            try {
+                this.wait(stopTime - currentTime);
+            } catch (final InterruptedException e) {
+                // ignore, but really should retry operation instead
+            }
+        }
     }
 
     // attempt to retrieve message from queue head
     public Object tryGet() {
-	Object o = null;
+        Object o = null;
 
-	if (head != null) {
-	    o = head.getContents();
-	    head = head.getNext();
-	    count--;
+        if (head != null) {
+            o = head.getContents();
+            head = head.getNext();
+            count--;
 
-	    if (head == null) {
-		tail = null;
-		count = 0;
-	    }
-	}
+            if (head == null) {
+                tail = null;
+                count = 0;
+            }
+        }
 
-	return o;
+        return o;
     }
 
     public synchronized int getCount() {
-	return count;
+        return count;
     }
 
     /*
@@ -163,24 +164,24 @@ public class GenericQueue {
      * The container holds the queued object and a reference to the next Bucket.
      */
     class Bucket {
-	private Bucket next;
-	private final Object contents;
+        private Bucket next;
+        private final Object contents;
 
-	public Bucket(final Object o) {
-	    next = null;
-	    contents = o;
-	}
+        public Bucket(final Object o) {
+            next = null;
+            contents = o;
+        }
 
-	public void setNext(final Bucket newNext) {
-	    next = newNext;
-	}
+        public void setNext(final Bucket newNext) {
+            next = newNext;
+        }
 
-	public Bucket getNext() {
-	    return next;
-	}
+        public Bucket getNext() {
+            return next;
+        }
 
-	public Object getContents() {
-	    return contents;
-	}
+        public Object getContents() {
+            return contents;
+        }
     }
 }