Logging events with timestamps

Patent metadata

Field	Value
Publication number	US-2016283312-A1
Application number	US-201615079580-A
Country	US
Kind code	A1
Filing date	Mar 24, 2016
Priority date	Mar 24, 2015
Publication date	Sep 29, 2016
Grant date	—

Abstract

A logging unit is used to log entries for events in a computer system. Each entry includes an n-bit timestamp field and a payload. The payload includes information about the event and the timestamp field includes the n least significant bits of an N-bit timestamp for the event, where N>n. If the n least significant bits of the timestamp have wrapped compared to the corresponding n bits of the timestamp of the preceding entry then a timing entry is logged which includes other bits of the timestamp. Therefore, an N-bit timestamp can be determined for an event, but only the n least significant bits of the timestamp are stored in the timestamp field of an entry for the event. Therefore, the time flow of events in the store is better maintained (by having a larger timestamp) without increasing the number of bits (n) in the timestamp field of each entry.

First claim

1 . A logging unit that logs events by causing entries to be stored in a store, wherein each of said entries comprises an n-bit timestamp field and a payload, the logging unit comprising:
control logic configured to
determine from a clock a timestamp for an event which is to be logged, wherein the determined timestamp comprises N bits, where N>n;
cause a timing entry which includes a set of k bits of the determined timestamp to be stored in the store if one or more of the N−n most significant bits of the determined timestamp are different to a corresponding one or more of the N−n most significant bits of a timestamp for a preceding event for which a preceding entry is stored in the store, said k bits being more significant bits of the determined timestamp than the n least significant bits of the determined timestamp; and
cause an entry for the event to be stored in the store, wherein the n least significant bits of the determined timestamp are included in the timestamp field of the entry for the event.

2 . The logging unit of claim 1 wherein said k bits are the k next least significant bits of the determined timestamp other than the n least significant bits of the determined timestamp.

3 . The logging unit of claim 1 wherein the control logic is further configured to cause the set of k bits of the determined timestamp to be included in the payload of the timing entry.

4 . The logging unit of claim 1 wherein the control logic is further configured to cause the n least significant bits of the determined timestamp to be included in the timestamp field of the timing entry.

5 . The logging unit of claim 1 wherein the control logic is further configured to:
cause some bits of the set of k bits of the determined timestamp to be included in the payload of the timing entry, and
cause other bits of the set of k bits of the determined timestamp to be included in the timestamp field of the timing entry.

6 . The logging unit of claim 1 wherein said preceding event is the most recent event for which an entry is stored in the store.

7 . The logging unit of claim 1 wherein the control logic is further configured to cause data relating to the event to be included in the payload of the entry for the event.

8 . The logging unit of claim 1 wherein the payload of an entry includes: (i) an ID field, and (ii) a data field.

9 . The logging unit of claim 8 wherein the control logic is further configured to set the ID field of the timing entry to a predetermined value which is indicative of a timing entry.

10 . The logging unit of claim 1 wherein the control logic is further configured to determine the timestamp for the event which is to be logged using a timing clock, and wherein the frequency of the timing clock is set based on one or more of: (i) an expected frequency of events, (ii) the value of n, and (iii) the value of N.

11 . The logging unit of claim 1 wherein k=N−n, wherein the k bits are the most significant bits of the determined timestamp.

12 . The logging unit of claim 1 wherein k<N−n, wherein said timing entry including the set of k bits of the determined timestamp is a first-level timing entry, and wherein the control logic is further configured to cause a second-level timing entry which includes a set of m bits of the determined timestamp to be stored in the store if one or more of the N−k−n most significant bits of the determined timestamp are different to a corresponding one or more of the N−k−n most significant bits of the timestamp for the preceding event for which the preceding entry is stored in the store, said m bits being more significant bits of the determined timestamp than the k bits of the determined timestamp.

13 . The logging unit of claim 12 wherein the payload of an entry includes: (i) an ID field, and (ii) a data field, and wherein the control logic is further configured to:
set ID fields of first-level timing entries to a first predetermined value which is indicative of a first-level timing entry; and
set ID fields of second-level timing entries to a second predetermined value which is indicative of a second-level timing entry.

14 . The logging unit of claim 1 wherein the control logic is further configured to:
read a particular entry for a particular event from the store; and
construct the timestamp for the particular event by: (i) identifying a timing entry preceding the particular entry in the store, and (ii) concatenating the k bits of the timestamp from the identified timing entry with the n bits of the timestamp from the timestamp field of the particular entry.

15 . The logging unit of claim 14 wherein the identified timing entry is the most recent timing entry stored in the store prior to the particular entry.

16 . A method of logging events by storing entries in a store, each of said entries comprising an n-bit timestamp field and a payload, the method comprising:
determining from a clock a timestamp for an event which is to be logged, wherein the determined timestamp comprises N bits, where N>n; if one or more of the N−n most significant bits of the determined timestamp are different to a corresponding one or more of the N−n most significant bits of a timestamp for a preceding event for which a preceding entry is stored in the store, storing a timing entry in the store, said timing entry including a set of k bits of the determined timestamp, said k bits being more significant bits of the determined timestamp than the n least significant bits of the determined timestamp; and storing an entry for the event in the store, wherein the n least significant bits of the determined timestamp are included in the timestamp field of the entry for the event.

17 . A method of retrieving information relating to a particular event from a store configured to store entries, each of said entries comprising an n-bit timestamp field and a payload, and wherein the particular event is associated with a timestamp comprising N bits, where N>n, the method comprising:
reading a particular entry for the particular event from the store, wherein the n least significant bits of the timestamp are included in the timestamp field of the particular entry; identifying a timing entry preceding the particular entry in the store, wherein the identified timing entry includes a set of k bits of the timestamp for the particular entry, said k bits being more significant bits of the timestamp than the n least significant bits of the timestamp; and concatenating the k bits of the timestamp from the identified timing entry with the n bits of the timestamp from the timestamp field of the particular entry, for use in constructing the timestamp for the particular event.

18 . The method of claim 17 wherein k=N−n, wherein the result of said concatenation is the timestamp for the particular event.

19 . The method of claim 18 wherein k<N−n, wherein said identified timing entry is a first-level timing entry, and wherein the method further comprises:
identifying a second-level timing entry preceding the identified first-level timing entry in the store, wherein the identified second-level timing entry includes a set of m bits of the timestamp for the particular entry, said m bits being more significant bits of the timestamp than the k bits of the timestamp;
wherein the m bits of the timestamp from the identified second-level timing entry are concatenated with the k bits of the timestamp from the identified first-level timing entry and the n bits of the timestamp from the timestamp field of the particular entry, for use in cons

Assignees

• Imagination Tech Ltd

Inventors

• Murrin Paul
• Davies Gareth

Classifications

• G06F2201/835

  Timestamp · CPC title

• G06F11/3466

  Performance evaluation by tracing or monitoring · CPC title

• G06F2201/86

  Event-based monitoring · CPC title

• G06F11/3636 Primary

  by tracing the execution of the program · CPC title

• G06F11/3476 Primary

  Data logging (G06F11/14, G06F11/2205 take precedence) · CPC title