Lines Matching refs:block

526            // We use a mixed spin/yield/block mechanism.
832 ObjectMonitor* block = gBlockList;
834 while (block) {
835 assert(block->object() == CHAINMARKER, "must be a block header");
837 mid = block + i;
843 block = (ObjectMonitor*) block->FreeNext;
847 // Get the next block in the block list.
848 static inline ObjectMonitor* next(ObjectMonitor* block) {
849 assert(block->object() == CHAINMARKER, "must be a block header");
850 block = block->FreeNext ;
851 assert(block == NULL || block->object() == CHAINMARKER, "must be a block header");
852 return block;
858 for (ObjectMonitor* block = gBlockList; block != NULL; block = next(block)) {
859 assert(block->object() == CHAINMARKER, "must be a block header");
861 ObjectMonitor* mid = &block[i];
1015 // 3: allocate a block of new ObjectMonitors
1028 // Format the block.
1031 // will points to next block, which forms the block list.
1032 // The trick of using the 1st element in the block as gBlockList
1047 // block in hand. This avoids some lock traffic and redundant
1056 // Add the new block to the list of extant blocks (gBlockList).
1057 // The very first objectMonitor in a block is reserved and dedicated.
1066 TEVENT (Allocate block of monitors) ;
1537 } else for (ObjectMonitor* block = gBlockList; block != NULL; block = next(block)) {
1539 assert(block->object() == CHAINMARKER, "must be a block header");
1542 ObjectMonitor* mid = &block[i];
1651 ObjectMonitor* block = gBlockList;
1653 while (block) {
1654 assert(block->object() == CHAINMARKER, "must be a block header");
1656 mid = block + i;
1662 block = (ObjectMonitor*) block->FreeNext;
1671 ObjectMonitor* block = gBlockList;
1673 while (block) {
1674 assert(block->object() == CHAINMARKER, "must be a block header");
1675 if (monitor > &block[0] && monitor < &block[_BLOCKSIZE]) {
1677 address blk = (address) block;
1682 block = (ObjectMonitor*) block->FreeNext;