Home
last modified time | relevance | path

Searched refs:seq (Results 1 – 4 of 4) sorted by relevance

/misc/debug_tools/acrn_log/
A Dacrnlog.c65 __u64 seq; /* sequence num, used to reorder logs */ member
150 msg[msg_num]->seq = strtoull(p, NULL, 10); in hvlog_read_dev()
151 if ((errno == ERANGE && (msg[msg_num]->seq == ULLONG_MAX)) in hvlog_read_dev()
152 || (errno != 0 && msg[msg_num]->seq == 0)) { in hvlog_read_dev()
282 min_seq = data[i].msg->seq; in get_min_seq_msg()
286 if (data[i].msg->seq > min_seq) in get_min_seq_msg()
289 min_seq = data[i].msg->seq; in get_min_seq_msg()
364 if (last_seq + 1 < msg->seq) { in cur_read_func()
374 last_seq = msg->seq; in cur_read_func()
/misc/config_tools/board_inspector/acpiparser/aml/
A Dparser.py264 def __init__(self, label, seq): argument
276 self.seq = grammar.get_definition(label)
279 self.seq = seq
280 self.structure = seq
289 (self.seq[0][-1] in ["*", "?"]):
302 for i,elem in enumerate(self.seq):
352 tree.factory = SequenceFactory(f"{self.label}.deferred", self.seq[i:])
369 if isinstance(self.seq[0], int):
370 self.__decoder = {self.seq[0]: self}
373 for k in globals()[self.seq[0]].decoder.keys():
A Dexception.py11 def __init__(self, label, seq): argument
A Dbuilder.py68 seq = grammar.get_definition(label)
74 for elem in seq:

Completed in 7 milliseconds