Synchronization mechanism for providing multiple readers and writers access to performance information of an extensible computer system

• US 5,887,167 A
• Filed: 11/03/1995
• Issued: 03/23/1999
• Est. Priority Date: 11/03/1995
• Status: Expired due to Term

• Current Assignee: Apple Inc.
• Original Assignee: Apple Computer Incorporated (Apple Inc.)
• Inventors: Sutton, Carl D.
• Primary Examiner(s): TOPLU, LUCIEN
• Application Number:
  US08/553,104
• Time in Patent Office: 1,236 Days
• Field of Search: 395/677, 395/680, 395/676
• US Class Current: 719/314
• CPC Class Codes: G06F 11/3442 for planning or managing the needed capacity
• CPC Class Codes: G06F 11/348 Circuit details, i.e. tracer hardware
• CPC Class Codes: G06F 2201/88 Monitoring involving counting
• CPC Class Codes: G06F 9/52 Program synchronisation; Mutual exclusion, e.g. by means of semaphores

Abstract

A synchronization arrangement provides writer and reader entities access to an information resource, such as a trace buffer, located in a registry of a computer. The arrangement comprises a counter upon which atomic increments are performed to allocate entries of the trace buffer for temporarily storing trace message fragments provided by the writer entities. The arrangement also comprises reassembly queues for temporarily storing the message fragments sequentially retrieved from the trace buffer by the reader entities.

Claims

1. A synchronization arrangement for use by reader and writer entities executing on a computer having a memory, the synchronization arrangement comprising:

an information resource located in the memory of the computer, the information resource having a plurality of entries and being accessible by the reader and writer entities;

a first counter operatively coupled to the writer entities for having atomic increments performed thereon, the first counter configured to allocate a specific entry of the information resource to a given writer entity in response to the performance of an atomic increment by the given writer entity, the resource entries temporarily storing messages sequentially posted by the writer entities;

means for limiting allocation of the entries of the information resource to the writer entities except through the first counter; and

a reassembly queue for temporarily storing messages sequentially retrieved from the resource by the reader entities,

wherein only one writer entity, at any given time, is allocated a specific entry of the information resource.

2. The synchronization arrangement of claim 1 further comprising a time-out mechanism for detecting incomplete messages retrieved from the resource, the time-out mechanism comprising a predetermined threshold established by contents of the first counter, wherein a message is incomplete if it is not completely retrieved by a reader entity before the contents of the first counter exceed the predetermined threshold.

3. The synchronization arrangement of claim 2 wherein the message is a trace message apportioned into a plurality of fragments prior to storage in the resource and wherein the resource is a trace buffer comprising a fixed number of equally-sized entries, each having a capacity sufficient to store one of the fragments.

4. The synchronization arrangement of claim 3 wherein each fragment contains a fragment number and a sequence number, the sequence number being sequentially assigned to each message prior to being apportioned into fragments by a second counter.

5. The synchronization arrangement of claim 4 wherein the first counter is a fragment allocation counter and the second counter is a sequence allocation counter, and wherein a sequence number of zero is an invalid sequence number that signifies copying of a fragment into a trace buffer entry.

6. The synchronization arrangement of claim 1 further comprising a barrier synchronizer for limiting the number of reader entities accessing the resource to retrieve messages posted by the writer entities, wherein the number of reader entities with access to the resource is two or more but less than all of the reader entities.

7. The synchronization arrangement of claim 6 wherein the barrier synchronizer comprises a lock mechanism that periodically notifies the reader entities as to when access to the resource is available.

8. The synchronization arrangement of claim 3 wherein the predetermined threshold is half the number of entries of the trace buffer.

15. The synchronization arrangement of claim 1 wherein the first counter defines corresponding contents and a writer entity, having control of the first counter, either increments or decrements its corresponding contents and performs an operation on the resulting contents to identify the entry of the information resource being allocated.

16. The synchronization arrangement of claim 15 wherein the operation is a modulo operation.

17. The synchronization arrangement of claim 1 further wherein multiple writer entities can access the information resource simultaneously.

9. A method for providing reader and writer entities access to a trace buffer located in a memory of a computer to reliably exchange complete trace messages, the method comprising the steps of:

allocating entries of the trace buffer to the writer entities using a counter responsive to atomic increments thereon, the trace buffer entries temporarily storing trace messages sequentially provided by the writer entities;

temporarily storing the trace messages sequentially retrieved from the trace buffer by the reader entities using a reassembly queue; and

detecting incomplete trace messages retrieved from the trace buffer using a time-out mechanism comprising a predetermined threshold established by contents of the counter, wherein a trace message is incomplete if it is not completely retrieved by a reader entity before the contents of the counter exceed the predetermined threshold.

10. The method of claim 9 further comprising the step of apportioning the trace message into a plurality of fragments prior to storage in the trace buffer.

11. The method of claim 10 further comprising the step of limiting the number of reader entities accessing the trace buffer to retrieve trace message fragments posted by the writer entities using a barrier synchronizer, wherein the number of reader entities with access to the resource is two or more but less than all of the reader entities.

12. The method of claim 10 further comprising the steps of:

synchronizing access by the reader entities to the trace messsage fragments contained in the trace buffer entries; and

synchronizing copying of the trace message fragments by the writer entities into the trace buffer.

13. The method of claim 12 wherein the step of synchronizing access further comprises the steps of:

examining the value of a sequence number of a fragment in a trace buffer entry;

if the sequence number value is zero, determining that the entry is currently being accessed; and

if the sequence number changes while the fragment is being read, determining that the fragment is overwritten.

14. The method of claim 12 wherein the step of synchronizing copying further comprises the steps of:

signaling a busy status of a fragment in a trace buffer entry using a sequence number of the fragment;

writing a value of zero to a sequence number field of the fragment prior to copying the fragment to the trace buffer entry; and

writing a non-zero value to the sequence number field in response to completing copying of the fragment to the trace buffer entry, the non-zero sequence value being allocated to a trace message of the fragment.