Lines Matching full:needs

100 but only one of those copies needs to be there - the last one "D", as it
173 running. For example, a transaction has object A locked and modified, but needs
238 region state that needs to be placed into the headers during the log write.
271 committed item tracking needs it's own locks, lists and state fields in the log
348 buffer and log vector attached to each log item needs to be attached to the
448 checkpoint sequence needs to be committed before they can continue. As a
449 result, the code that forces the log to a specific LSN now needs to ensure that
523 1MB of log space consumed (512 bytes per 32k) and the reservation needs to be
525 reservation needs to be made before the checkpoint is started, and we need to
529 A static reservation needs to manipulate the log grant counters - we can take a
571 whether this log force needs to be done more frequently than the current rate
597 To keep pin/unpin symmetry, the algorithm needs to change to a "pin on
625 As a result, the delayed logging transaction commit code needs to be designed
640 The amount of time a transaction commit needs to hold out a flush is a
641 relatively long period of time - the pinning of log items needs to be done
649 really needs to be a sleeping lock - if the CIL flush takes the lock, we do not
665 concurrently, the CIL needs to be protected separately from the above
666 commit/flush exclusion. It also needs to be an exclusive lock but it is only
676 checkpoints and needs to block waiting for checkpoints to complete their commit
677 record write. As a result it needs a lock and a wait variable. Log force
683 sequencing needs to wait until checkpoint contexts contain a commit LSN
685 sequencing needs to wait until previous checkpoint contexts are removed from