1 /*

     2  * Copyright 2001-2007 Sun Microsystems, Inc.  All Rights Reserved.

     3  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.

     4  *

     5  * This code is free software; you can redistribute it and/or modify it

     6  * under the terms of the GNU General Public License version 2 only, as

     7  * published by the Free Software Foundation.

     8  *

     9  * This code is distributed in the hope that it will be useful, but WITHOUT

    10  * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or

    11  * FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License

    12  * version 2 for more details (a copy is included in the LICENSE file that

    13  * accompanied this code).

    14  *

    15  * You should have received a copy of the GNU General Public License version

    16  * 2 along with this work; if not, write to the Free Software Foundation,

    17  * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.

    18  *

    19  * Please contact Sun Microsystems, Inc., 4150 Network Circle, Santa Clara,

    20  * CA 95054 USA or visit www.sun.com if you need additional information or

    21  * have any questions.

    22  *

    23  */

    24 

    25 void PtrQueue::handle_zero_index() {

    26   assert(0 == _index, "Precondition.");

    27   // This thread records the full buffer and allocates a new one (while

    28   // holding the lock if there is one).

    29   void** buf = _buf;

    30   _buf = qset()->allocate_buffer();

    31   _sz = qset()->buffer_size();

    32   _index = _sz;

    33   assert(0 <= _index && _index <= _sz, "Invariant.");

    34   if (buf != NULL) {

    35     if (_lock) {

    36       locking_enqueue_completed_buffer(buf);

    37     } else {

    38       qset()->enqueue_complete_buffer(buf);

    39     }

    40   }

    41 }