start marker work
[lttv.git] / ltt / branches / poly / ltt / tracefile.c
1 /* This file is part of the Linux Trace Toolkit viewer
2 * Copyright (C) 2005 Mathieu Desnoyers
3 *
4 * Complete rewrite from the original version made by XangXiu Yang.
5 *
6 * This library is free software; you can redistribute it and/or
7 * modify it under the terms of the GNU Lesser General Public
8 * License Version 2.1 as published by the Free Software Foundation.
9 *
10 * This library is distributed in the hope that it will be useful,
11 * but WITHOUT ANY WARRANTY; without even the implied warranty of
12 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
13 * Lesser General Public License for more details.
14 *
15 * You should have received a copy of the GNU Lesser General Public
16 * License along with this library; if not, write to the
17 * Free Software Foundation, Inc., 59 Temple Place - Suite 330,
18 * Boston, MA 02111-1307, USA.
19 */
20
21 #ifdef HAVE_CONFIG_H
22 #include <config.h>
23 #endif
24
25 #include <stdio.h>
26 #include <fcntl.h>
27 #include <string.h>
28 #include <dirent.h>
29 #include <sys/stat.h>
30 #include <sys/types.h>
31 #include <errno.h>
32 #include <unistd.h>
33 #include <math.h>
34 #include <glib.h>
35 #include <malloc.h>
36 #include <sys/mman.h>
37 #include <string.h>
38
39 // For realpath
40 #include <limits.h>
41 #include <stdlib.h>
42
43
44 #include "parser.h"
45 #include <ltt/ltt.h>
46 #include "ltt-private.h"
47 #include <ltt/trace.h>
48 #include <ltt/facility.h>
49 #include <ltt/event.h>
50 #include <ltt/type.h>
51 #include <ltt/ltt-types.h>
52 #include <ltt/markers.h>
53
54 /* Facility names used in this file */
55
56 GQuark LTT_FACILITY_NAME_HEARTBEAT,
57 LTT_EVENT_NAME_HEARTBEAT,
58 LTT_EVENT_NAME_HEARTBEAT_FULL;
59 GQuark LTT_TRACEFILE_NAME_FACILITIES;
60
61 #ifndef g_open
62 #define g_open open
63 #endif
64
65
66 #define __UNUSED__ __attribute__((__unused__))
67
68 #define g_info(format...) g_log (G_LOG_DOMAIN, G_LOG_LEVEL_INFO, format)
69
70 #ifndef g_debug
71 #define g_debug(format...) g_log (G_LOG_DOMAIN, G_LOG_LEVEL_DEBUG, format)
72 #endif
73
74 #define g_close close
75
76 /* Those macros must be called from within a function where page_size is a known
77 * variable */
78 #define PAGE_MASK (~(page_size-1))
79 #define PAGE_ALIGN(addr) (((addr)+page_size-1)&PAGE_MASK)
80
81 /* set the offset of the fields belonging to the event,
82 need the information of the archecture */
83 //void set_fields_offsets(LttTracefile *tf, LttEventType *event_type);
84 //size_t get_fields_offsets(LttTracefile *tf, LttEventType *event_type, void *data);
85
86 /* get the size of the field type according to
87 * The facility size information. */
88 #if 0
89 static inline void preset_field_type_size(LttTracefile *tf,
90 LttEventType *event_type,
91 off_t offset_root, off_t offset_parent,
92 enum field_status *fixed_root, enum field_status *fixed_parent,
93 LttField *field);
94 #endif //0
95
96 /* map a fixed size or a block information from the file (fd) */
97 static gint map_block(LttTracefile * tf, guint block_num);
98
99 /* calculate nsec per cycles for current block */
100 #if 0
101 static guint32 calc_nsecs_per_cycle(LttTracefile * t);
102 static guint64 cycles_2_ns(LttTracefile *tf, guint64 cycles);
103 #endif //0
104
105 /* go to the next event */
106 static int ltt_seek_next_event(LttTracefile *tf);
107
108 void ltt_update_event_size(LttTracefile *tf);
109
110
111 void precompute_offsets(LttFacility *fac, LttEventType *event);
112
113 #if 0
114 /* Functions to parse system.xml file (using glib xml parser) */
115 static void parser_start_element (GMarkupParseContext __UNUSED__ *context,
116 const gchar *element_name,
117 const gchar **attribute_names,
118 const gchar **attribute_values,
119 gpointer user_data,
120 GError **error)
121 {
122 int i=0;
123 LttSystemDescription* des = (LttSystemDescription* )user_data;
124 if(strcmp("system", element_name)){
125 *error = g_error_new(G_MARKUP_ERROR,
126 G_LOG_LEVEL_WARNING,
127 "This is not system.xml file");
128 return;
129 }
130
131 while(attribute_names[i]){
132 if(strcmp("node_name", attribute_names[i])==0){
133 des->node_name = g_strdup(attribute_values[i]);
134 }else if(strcmp("domainname", attribute_names[i])==0){
135 des->domain_name = g_strdup(attribute_values[i]);
136 }else if(strcmp("cpu", attribute_names[i])==0){
137 des->nb_cpu = atoi(attribute_values[i]);
138 }else if(strcmp("arch_size", attribute_names[i])==0){
139 if(strcmp(attribute_values[i],"LP32") == 0) des->size = LTT_LP32;
140 else if(strcmp(attribute_values[i],"ILP32") == 0) des->size = LTT_ILP32;
141 else if(strcmp(attribute_values[i],"LP64") == 0) des->size = LTT_LP64;
142 else if(strcmp(attribute_values[i],"ILP64") == 0) des->size = LTT_ILP64;
143 else if(strcmp(attribute_values[i],"UNKNOWN") == 0) des->size = LTT_UNKNOWN;
144 }else if(strcmp("endian", attribute_names[i])==0){
145 if(strcmp(attribute_values[i],"LITTLE_ENDIAN") == 0)
146 des->endian = LTT_LITTLE_ENDIAN;
147 else if(strcmp(attribute_values[i],"BIG_ENDIAN") == 0)
148 des->endian = LTT_BIG_ENDIAN;
149 }else if(strcmp("kernel_name", attribute_names[i])==0){
150 des->kernel_name = g_strdup(attribute_values[i]);
151 }else if(strcmp("kernel_release", attribute_names[i])==0){
152 des->kernel_release = g_strdup(attribute_values[i]);
153 }else if(strcmp("kernel_version", attribute_names[i])==0){
154 des->kernel_version = g_strdup(attribute_values[i]);
155 }else if(strcmp("machine", attribute_names[i])==0){
156 des->machine = g_strdup(attribute_values[i]);
157 }else if(strcmp("processor", attribute_names[i])==0){
158 des->processor = g_strdup(attribute_values[i]);
159 }else if(strcmp("hardware_platform", attribute_names[i])==0){
160 des->hardware_platform = g_strdup(attribute_values[i]);
161 }else if(strcmp("operating_system", attribute_names[i])==0){
162 des->operating_system = g_strdup(attribute_values[i]);
163 }else if(strcmp("ltt_major_version", attribute_names[i])==0){
164 des->ltt_major_version = atoi(attribute_values[i]);
165 }else if(strcmp("ltt_minor_version", attribute_names[i])==0){
166 des->ltt_minor_version = atoi(attribute_values[i]);
167 }else if(strcmp("ltt_block_size", attribute_names[i])==0){
168 des->ltt_block_size = atoi(attribute_values[i]);
169 }else{
170 *error = g_error_new(G_MARKUP_ERROR,
171 G_LOG_LEVEL_WARNING,
172 "Not a valid attribute");
173 return;
174 }
175 i++;
176 }
177 }
178
179 static void parser_characters (GMarkupParseContext __UNUSED__ *context,
180 const gchar *text,
181 gsize __UNUSED__ text_len,
182 gpointer user_data,
183 GError __UNUSED__ **error)
184 {
185 LttSystemDescription* des = (LttSystemDescription* )user_data;
186 des->description = g_strdup(text);
187 }
188 #endif //0
189
190
191 LttFacility *ltt_trace_get_facility_by_num(LttTrace *t,
192 guint num)
193 {
194 g_assert(num < t->facilities_by_num->len);
195
196 return &g_array_index(t->facilities_by_num, LttFacility, num);
197
198 }
199
200 guint ltt_trace_get_num_cpu(LttTrace *t)
201 {
202 return t->num_cpu;
203 }
204
205
206 /* trace can be NULL
207 *
208 * Return value : 0 success, 1 bad tracefile
209 */
210 int parse_trace_header(void *header, LttTracefile *tf, LttTrace *t)
211 {
212 guint32 *magic_number = (guint32*)header;
213 struct ltt_trace_header_any *any = (struct ltt_trace_header_any *)header;
214
215 if(*magic_number == LTT_MAGIC_NUMBER)
216 tf->reverse_bo = 0;
217 else if(*magic_number == LTT_REV_MAGIC_NUMBER)
218 tf->reverse_bo = 1;
219 else /* invalid magic number, bad tracefile ! */
220 return 1;
221
222 /* Get float byte order : might be different from int byte order
223 * (or is set to 0 if the trace has no float (kernel trace)) */
224 tf->float_word_order = any->float_word_order;
225 tf->has_alignment = any->has_alignment;
226 tf->has_heartbeat = any->has_heartbeat;
227
228 if(t) {
229 t->arch_type = ltt_get_uint32(LTT_GET_BO(tf),
230 &any->arch_type);
231 t->arch_variant = ltt_get_uint32(LTT_GET_BO(tf),
232 &any->arch_variant);
233 t->arch_size = any->arch_size;
234 t->ltt_major_version = any->major_version;
235 t->ltt_minor_version = any->minor_version;
236 t->flight_recorder = any->flight_recorder;
237 t->compact_facilities = NULL;
238 }
239
240
241 switch(any->major_version) {
242
243 case 0:
244 switch(any->minor_version) {
245 case 3:
246 {
247 tf->buffer_header_size =
248 sizeof(struct ltt_block_start_header)
249 + sizeof(struct ltt_trace_header_0_3);
250 g_warning("Unsupported trace version : %hhu.%hhu",
251 any->major_version, any->minor_version);
252 return 1;
253 }
254 break;
255 case 7:
256 {
257 struct ltt_trace_header_0_7 *vheader =
258 (struct ltt_trace_header_0_7 *)header;
259 tf->buffer_header_size =
260 sizeof(struct ltt_block_start_header)
261 + sizeof(struct ltt_trace_header_0_7);
262 tf->tsc_lsb_truncate = 0;
263 tf->tscbits = 32;
264 tf->tsc_msb_cutoff = 32 - tf->tsc_lsb_truncate - tf->tscbits;
265 tf->tsc_mask = (1ULL<<32)-1;
266 tf->tsc_mask_next_bit = (1ULL<<32);
267 if(t) {
268 t->start_freq = ltt_get_uint64(LTT_GET_BO(tf),
269 &vheader->start_freq);
270 t->freq_scale = ltt_get_uint32(LTT_GET_BO(tf),
271 &vheader->freq_scale);
272 t->start_tsc = ltt_get_uint64(LTT_GET_BO(tf),
273 &vheader->start_tsc);
274 t->start_monotonic = ltt_get_uint64(LTT_GET_BO(tf),
275 &vheader->start_monotonic);
276 t->start_time.tv_sec = ltt_get_uint64(LTT_GET_BO(tf),
277 &vheader->start_time_sec);
278 t->start_time.tv_nsec = ltt_get_uint64(LTT_GET_BO(tf),
279 &vheader->start_time_usec);
280 t->start_time.tv_nsec *= 1000; /* microsec to nanosec */
281
282 t->start_time_from_tsc = ltt_time_from_uint64(
283 (double)t->start_tsc
284 * (1000000000.0 / tf->trace->freq_scale)
285 / (double)t->start_freq);
286 t->compact_event_bits = 0;
287 }
288 }
289 break;
290 case 8:
291 {
292 struct ltt_trace_header_0_8 *vheader =
293 (struct ltt_trace_header_0_8 *)header;
294 tf->buffer_header_size =
295 sizeof(struct ltt_block_start_header)
296 + sizeof(struct ltt_trace_header_0_8);
297 tf->tsc_lsb_truncate = vheader->tsc_lsb_truncate;
298 tf->tscbits = vheader->tscbits;
299 tf->tsc_msb_cutoff = 32 - tf->tsc_lsb_truncate - tf->tscbits;
300 tf->tsc_mask = ((1ULL << (tf->tscbits))-1);
301 tf->tsc_mask = tf->tsc_mask << tf->tsc_lsb_truncate;
302 tf->tsc_mask_next_bit = (1ULL<<(tf->tscbits));
303 tf->tsc_mask_next_bit = tf->tsc_mask_next_bit << tf->tsc_lsb_truncate;
304 if(t) {
305 t->start_freq = ltt_get_uint64(LTT_GET_BO(tf),
306 &vheader->start_freq);
307 t->freq_scale = ltt_get_uint32(LTT_GET_BO(tf),
308 &vheader->freq_scale);
309 t->start_tsc = ltt_get_uint64(LTT_GET_BO(tf),
310 &vheader->start_tsc);
311 t->start_monotonic = ltt_get_uint64(LTT_GET_BO(tf),
312 &vheader->start_monotonic);
313 t->start_time.tv_sec = ltt_get_uint64(LTT_GET_BO(tf),
314 &vheader->start_time_sec);
315 t->start_time.tv_nsec = ltt_get_uint64(LTT_GET_BO(tf),
316 &vheader->start_time_usec);
317 t->start_time.tv_nsec *= 1000; /* microsec to nanosec */
318
319 t->start_time_from_tsc = ltt_time_from_uint64(
320 (double)t->start_tsc
321 * (1000000000.0 / tf->trace->freq_scale)
322 / (double)t->start_freq);
323 t->compact_event_bits = 0;
324 }
325 }
326 break;
327 default:
328 g_warning("Unsupported trace version : %hhu.%hhu",
329 any->major_version, any->minor_version);
330 return 1;
331 }
332 break;
333
334 default:
335 g_warning("Unsupported trace version : %hhu.%hhu",
336 any->major_version, any->minor_version);
337 return 1;
338 }
339
340
341 return 0;
342 }
343
344
345
346 /*****************************************************************************
347 *Function name
348 * ltt_tracefile_open : open a trace file, construct a LttTracefile
349 *Input params
350 * t : the trace containing the tracefile
351 * fileName : path name of the trace file
352 * tf : the tracefile structure
353 *Return value
354 * : 0 for success, -1 otherwise.
355 ****************************************************************************/
356
357 gint ltt_tracefile_open(LttTrace *t, gchar * fileName, LttTracefile *tf)
358 {
359 struct stat lTDFStat; /* Trace data file status */
360 struct ltt_block_start_header *header;
361 int page_size = getpagesize();
362
363 //open the file
364 tf->long_name = g_quark_from_string(fileName);
365 tf->trace = t;
366 tf->fd = open(fileName, O_RDONLY);
367 if(tf->fd < 0){
368 g_warning("Unable to open input data file %s\n", fileName);
369 goto end;
370 }
371
372 // Get the file's status
373 if(fstat(tf->fd, &lTDFStat) < 0){
374 g_warning("Unable to get the status of the input data file %s\n", fileName);
375 goto close_file;
376 }
377
378 // Is the file large enough to contain a trace
379 if(lTDFStat.st_size <
380 (off_t)(sizeof(struct ltt_block_start_header)
381 + sizeof(struct ltt_trace_header_any))){
382 g_print("The input data file %s does not contain a trace\n", fileName);
383 goto close_file;
384 }
385
386 /* Temporarily map the buffer start header to get trace information */
387 /* Multiple of pages aligned head */
388 tf->buffer.head = mmap(0,
389 PAGE_ALIGN(sizeof(struct ltt_block_start_header)
390 + sizeof(struct ltt_trace_header_any)), PROT_READ,
391 MAP_PRIVATE, tf->fd, 0);
392 if(tf->buffer.head == MAP_FAILED) {
393 perror("Error in allocating memory for buffer of tracefile");
394 goto close_file;
395 }
396 g_assert( ( (guint)tf->buffer.head&(8-1) ) == 0); // make sure it's aligned.
397
398 header = (struct ltt_block_start_header*)tf->buffer.head;
399
400 if(parse_trace_header(header->trace, tf, NULL)) {
401 g_warning("parse_trace_header error");
402 goto unmap_file;
403 }
404
405 //store the size of the file
406 tf->file_size = lTDFStat.st_size;
407 tf->buf_size = ltt_get_uint32(LTT_GET_BO(tf), &header->buf_size);
408 tf->num_blocks = tf->file_size / tf->buf_size;
409
410 if(munmap(tf->buffer.head,
411 PAGE_ALIGN(sizeof(struct ltt_block_start_header)
412 + sizeof(struct ltt_trace_header_any)))) {
413 g_warning("unmap size : %u\n",
414 PAGE_ALIGN(sizeof(struct ltt_block_start_header)
415 + sizeof(struct ltt_trace_header_any)));
416 perror("munmap error");
417 g_assert(0);
418 }
419 tf->buffer.head = NULL;
420
421 //read the first block
422 if(map_block(tf,0)) {
423 perror("Cannot map block for tracefile");
424 goto close_file;
425 }
426
427 return 0;
428
429 /* Error */
430 unmap_file:
431 if(munmap(tf->buffer.head,
432 PAGE_ALIGN(sizeof(struct ltt_block_start_header)
433 + sizeof(struct ltt_trace_header_any)))) {
434 g_warning("unmap size : %u\n",
435 PAGE_ALIGN(sizeof(struct ltt_block_start_header)
436 + sizeof(struct ltt_trace_header_any)));
437 perror("munmap error");
438 g_assert(0);
439 }
440 close_file:
441 close(tf->fd);
442 end:
443 return -1;
444 }
445
446 LttTrace *ltt_tracefile_get_trace(LttTracefile *tf)
447 {
448 return tf->trace;
449 }
450
451 #if 0
452 /*****************************************************************************
453 *Open control and per cpu tracefiles
454 ****************************************************************************/
455
456 void ltt_tracefile_open_cpu(LttTrace *t, gchar * tracefile_name)
457 {
458 LttTracefile * tf;
459 tf = ltt_tracefile_open(t,tracefile_name);
460 if(!tf) return;
461 t->per_cpu_tracefile_number++;
462 g_ptr_array_add(t->per_cpu_tracefiles, tf);
463 }
464
465 gint ltt_tracefile_open_control(LttTrace *t, gchar * control_name)
466 {
467 LttTracefile * tf;
468 LttEvent ev;
469 LttFacility * f;
470 void * pos;
471 FacilityLoad fLoad;
472 unsigned int i;
473
474 tf = ltt_tracefile_open(t,control_name);
475 if(!tf) {
476 g_warning("ltt_tracefile_open_control : bad file descriptor");
477 return -1;
478 }
479 t->control_tracefile_number++;
480 g_ptr_array_add(t->control_tracefiles,tf);
481
482 //parse facilities tracefile to get base_id
483 if(strcmp(&control_name[strlen(control_name)-10],"facilities") ==0){
484 while(1){
485 if(!ltt_tracefile_read(tf,&ev)) return 0; // end of file
486
487 if(ev.event_id == TRACE_FACILITY_LOAD){
488 pos = ev.data;
489 fLoad.name = (gchar*)pos;
490 fLoad.checksum = *(LttChecksum*)(pos + strlen(fLoad.name));
491 fLoad.base_code = *(guint32 *)(pos + strlen(fLoad.name) + sizeof(LttChecksum));
492
493 for(i=0;i<t->facility_number;i++){
494 f = (LttFacility*)g_ptr_array_index(t->facilities,i);
495 if(strcmp(f->name,fLoad.name)==0 && fLoad.checksum==f->checksum){
496 f->base_id = fLoad.base_code;
497 break;
498 }
499 }
500 if(i==t->facility_number) {
501 g_warning("Facility: %s, checksum: %u is not found",
502 fLoad.name,(unsigned int)fLoad.checksum);
503 return -1;
504 }
505 }else if(ev.event_id == TRACE_BLOCK_START){
506 continue;
507 }else if(ev.event_id == TRACE_BLOCK_END){
508 break;
509 }else {
510 g_warning("Not valid facilities trace file");
511 return -1;
512 }
513 }
514 }
515 return 0;
516 }
517 #endif //0
518
519 /*****************************************************************************
520 *Function name
521 * ltt_tracefile_close: close a trace file,
522 *Input params
523 * t : tracefile which will be closed
524 ****************************************************************************/
525
526 void ltt_tracefile_close(LttTracefile *t)
527 {
528 int page_size = getpagesize();
529
530 if(t->buffer.head != NULL)
531 if(munmap(t->buffer.head, PAGE_ALIGN(t->buf_size))) {
532 g_warning("unmap size : %u\n",
533 PAGE_ALIGN(t->buf_size));
534 perror("munmap error");
535 g_assert(0);
536 }
537
538 close(t->fd);
539 }
540
541
542 /*****************************************************************************
543 *Get system information
544 ****************************************************************************/
545 #if 0
546 gint getSystemInfo(LttSystemDescription* des, gchar * pathname)
547 {
548 int fd;
549 GIOChannel *iochan;
550 gchar *buf = NULL;
551 gsize length;
552
553 GMarkupParseContext * context;
554 GError * error = NULL;
555 GMarkupParser markup_parser =
556 {
557 parser_start_element,
558 NULL,
559 parser_characters,
560 NULL, /* passthrough */
561 NULL /* error */
562 };
563
564 fd = g_open(pathname, O_RDONLY, 0);
565 if(fd == -1){
566 g_warning("Can not open file : %s\n", pathname);
567 return -1;
568 }
569
570 iochan = g_io_channel_unix_new(fd);
571
572 context = g_markup_parse_context_new(&markup_parser, 0, des,NULL);
573
574 //while(fgets(buf,DIR_NAME_SIZE, fp) != NULL){
575 while(g_io_channel_read_line(iochan, &buf, &length, NULL, &error)
576 != G_IO_STATUS_EOF) {
577
578 if(error != NULL) {
579 g_warning("Can not read xml file: \n%s\n", error->message);
580 g_error_free(error);
581 }
582 if(!g_markup_parse_context_parse(context, buf, length, &error)){
583 if(error != NULL) {
584 g_warning("Can not parse xml file: \n%s\n", error->message);
585 g_error_free(error);
586 }
587 g_markup_parse_context_free(context);
588
589 g_io_channel_shutdown(iochan, FALSE, &error); /* No flush */
590 if(error != NULL) {
591 g_warning("Can not close file: \n%s\n", error->message);
592 g_error_free(error);
593 }
594
595 close(fd);
596 return -1;
597 }
598 }
599 g_markup_parse_context_free(context);
600
601 g_io_channel_shutdown(iochan, FALSE, &error); /* No flush */
602 if(error != NULL) {
603 g_warning("Can not close file: \n%s\n", error->message);
604 g_error_free(error);
605 }
606
607 g_close(fd);
608
609 g_free(buf);
610 return 0;
611 }
612 #endif //0
613
614 /*****************************************************************************
615 *The following functions get facility/tracefile information
616 ****************************************************************************/
617 #if 0
618 gint getFacilityInfo(LttTrace *t, gchar* eventdefs)
619 {
620 GDir * dir;
621 const gchar * name;
622 unsigned int i,j;
623 LttFacility * f;
624 LttEventType * et;
625 gchar fullname[DIR_NAME_SIZE];
626 GError * error = NULL;
627
628 dir = g_dir_open(eventdefs, 0, &error);
629
630 if(error != NULL) {
631 g_warning("Can not open directory: %s, %s\n", eventdefs, error->message);
632 g_error_free(error);
633 return -1;
634 }
635
636 while((name = g_dir_read_name(dir)) != NULL){
637 if(!g_pattern_match_simple("*.xml", name)) continue;
638 strcpy(fullname,eventdefs);
639 strcat(fullname,name);
640 ltt_facility_open(t,fullname);
641 }
642 g_dir_close(dir);
643
644 for(j=0;j<t->facility_number;j++){
645 f = (LttFacility*)g_ptr_array_index(t->facilities, j);
646 for(i=0; i<f->event_number; i++){
647 et = f->events[i];
648 setFieldsOffset(NULL, et, NULL, t);
649 }
650 }
651 return 0;
652 }
653 #endif //0
654
655 /*****************************************************************************
656 *A trace is specified as a pathname to the directory containing all the
657 *associated data (control tracefiles, per cpu tracefiles, event
658 *descriptions...).
659 *
660 *When a trace is closed, all the associated facilities, types and fields
661 *are released as well.
662 */
663
664
665 /****************************************************************************
666 * get_absolute_pathname
667 *
668 * return the unique pathname in the system
669 *
670 * MD : Fixed this function so it uses realpath, dealing well with
671 * forgotten cases (.. were not used correctly before).
672 *
673 ****************************************************************************/
674 void get_absolute_pathname(const gchar *pathname, gchar * abs_pathname)
675 {
676 abs_pathname[0] = '\0';
677
678 if ( realpath (pathname, abs_pathname) != NULL)
679 return;
680 else
681 {
682 /* error, return the original path unmodified */
683 strcpy(abs_pathname, pathname);
684 return;
685 }
686 return;
687 }
688
689 /* Search for something like : .*_.*
690 *
691 * The left side is the name, the right side is the number.
692 */
693
694 int get_tracefile_name_number(gchar *raw_name,
695 GQuark *name,
696 guint *num,
697 guint *tid,
698 guint *pgid,
699 guint64 *creation)
700 {
701 guint raw_name_len = strlen(raw_name);
702 gchar char_name[PATH_MAX];
703 int i;
704 int underscore_pos;
705 long int cpu_num;
706 gchar *endptr;
707 gchar *tmpptr;
708
709 for(i=raw_name_len-1;i>=0;i--) {
710 if(raw_name[i] == '_') break;
711 }
712 if(i==-1) { /* Either not found or name length is 0 */
713 /* This is a userspace tracefile */
714 strncpy(char_name, raw_name, raw_name_len);
715 char_name[raw_name_len] = '\0';
716 *name = g_quark_from_string(char_name);
717 *num = 0; /* unknown cpu */
718 for(i=0;i<raw_name_len;i++) {
719 if(raw_name[i] == '/') {
720 break;
721 }
722 }
723 i++;
724 for(;i<raw_name_len;i++) {
725 if(raw_name[i] == '/') {
726 break;
727 }
728 }
729 i++;
730 for(;i<raw_name_len;i++) {
731 if(raw_name[i] == '-') {
732 break;
733 }
734 }
735 if(i == raw_name_len) return -1;
736 i++;
737 tmpptr = &raw_name[i];
738 for(;i<raw_name_len;i++) {
739 if(raw_name[i] == '.') {
740 raw_name[i] = ' ';
741 break;
742 }
743 }
744 *tid = strtoul(tmpptr, &endptr, 10);
745 if(endptr == tmpptr)
746 return -1; /* No digit */
747 if(*tid == ULONG_MAX)
748 return -1; /* underflow / overflow */
749 i++;
750 tmpptr = &raw_name[i];
751 for(;i<raw_name_len;i++) {
752 if(raw_name[i] == '.') {
753 raw_name[i] = ' ';
754 break;
755 }
756 }
757 *pgid = strtoul(tmpptr, &endptr, 10);
758 if(endptr == tmpptr)
759 return -1; /* No digit */
760 if(*pgid == ULONG_MAX)
761 return -1; /* underflow / overflow */
762 i++;
763 tmpptr = &raw_name[i];
764 *creation = strtoull(tmpptr, &endptr, 10);
765 if(endptr == tmpptr)
766 return -1; /* No digit */
767 if(*creation == G_MAXUINT64)
768 return -1; /* underflow / overflow */
769 } else {
770 underscore_pos = i;
771
772 cpu_num = strtol(raw_name+underscore_pos+1, &endptr, 10);
773
774 if(endptr == raw_name+underscore_pos+1)
775 return -1; /* No digit */
776 if(cpu_num == LONG_MIN || cpu_num == LONG_MAX)
777 return -1; /* underflow / overflow */
778
779 strncpy(char_name, raw_name, underscore_pos);
780 char_name[underscore_pos] = '\0';
781
782 *name = g_quark_from_string(char_name);
783 *num = cpu_num;
784 }
785
786
787 return 0;
788 }
789
790
791 GData **ltt_trace_get_tracefiles_groups(LttTrace *trace)
792 {
793 return &trace->tracefiles;
794 }
795
796
797 void compute_tracefile_group(GQuark key_id,
798 GArray *group,
799 struct compute_tracefile_group_args *args)
800 {
801 int i;
802 LttTracefile *tf;
803
804 for(i=0; i<group->len; i++) {
805 tf = &g_array_index (group, LttTracefile, i);
806 if(tf->cpu_online)
807 args->func(tf, args->func_args);
808 }
809 }
810
811
812 void ltt_tracefile_group_destroy(gpointer data)
813 {
814 GArray *group = (GArray *)data;
815 int i;
816 LttTracefile *tf;
817
818 for(i=0; i<group->len; i++) {
819 tf = &g_array_index (group, LttTracefile, i);
820 if(tf->cpu_online)
821 ltt_tracefile_close(tf);
822 }
823 g_array_free(group, TRUE);
824 }
825
826 gboolean ltt_tracefile_group_has_cpu_online(gpointer data)
827 {
828 GArray *group = (GArray *)data;
829 int i;
830 LttTracefile *tf;
831
832 for(i=0; i<group->len; i++) {
833 tf = &g_array_index (group, LttTracefile, i);
834 if(tf->cpu_online) return 1;
835 }
836 return 0;
837 }
838
839
840 /* Open each tracefile under a specific directory. Put them in a
841 * GData : permits to access them using their tracefile group pathname.
842 * i.e. access control/modules tracefile group by index :
843 * "control/module".
844 *
845 * relative path is the path relative to the trace root
846 * root path is the full path
847 *
848 * A tracefile group is simply an array where all the per cpu tracefiles sit.
849 */
850
851 static int open_tracefiles(LttTrace *trace, gchar *root_path,
852 gchar *relative_path)
853 {
854 DIR *dir = opendir(root_path);
855 struct dirent *entry;
856 struct stat stat_buf;
857 int ret;
858
859 gchar path[PATH_MAX];
860 int path_len;
861 gchar *path_ptr;
862
863 int rel_path_len;
864 gchar rel_path[PATH_MAX];
865 gchar *rel_path_ptr;
866 LttTracefile tmp_tf;
867
868 if(dir == NULL) {
869 perror(root_path);
870 return ENOENT;
871 }
872
873 strncpy(path, root_path, PATH_MAX-1);
874 path_len = strlen(path);
875 path[path_len] = '/';
876 path_len++;
877 path_ptr = path + path_len;
878
879 strncpy(rel_path, relative_path, PATH_MAX-1);
880 rel_path_len = strlen(rel_path);
881 rel_path[rel_path_len] = '/';
882 rel_path_len++;
883 rel_path_ptr = rel_path + rel_path_len;
884
885 while((entry = readdir(dir)) != NULL) {
886
887 if(entry->d_name[0] == '.') continue;
888
889 strncpy(path_ptr, entry->d_name, PATH_MAX - path_len);
890 strncpy(rel_path_ptr, entry->d_name, PATH_MAX - rel_path_len);
891
892 ret = stat(path, &stat_buf);
893 if(ret == -1) {
894 perror(path);
895 continue;
896 }
897
898 g_debug("Tracefile file or directory : %s\n", path);
899
900 if(strcmp(rel_path, "/eventdefs") == 0) continue;
901
902 if(S_ISDIR(stat_buf.st_mode)) {
903
904 g_debug("Entering subdirectory...\n");
905 ret = open_tracefiles(trace, path, rel_path);
906 if(ret < 0) continue;
907 } else if(S_ISREG(stat_buf.st_mode)) {
908 GQuark name;
909 guint num, tid, pgid;
910 guint64 creation;
911 GArray *group;
912 num = tid = pgid = 0;
913 creation = 0;
914 if(get_tracefile_name_number(rel_path, &name, &num, &tid, &pgid, &creation))
915 continue; /* invalid name */
916
917 g_debug("Opening file.\n");
918 if(ltt_tracefile_open(trace, path, &tmp_tf)) {
919 g_info("Error opening tracefile %s", path);
920
921 continue; /* error opening the tracefile : bad magic number ? */
922 }
923
924 g_debug("Tracefile name is %s and number is %u",
925 g_quark_to_string(name), num);
926
927 tmp_tf.cpu_online = 1;
928 tmp_tf.cpu_num = num;
929 tmp_tf.name = name;
930 tmp_tf.tid = tid;
931 tmp_tf.pgid = pgid;
932 tmp_tf.creation = creation;
933 if(tmp_tf.name == g_quark_from_string("/compact")
934 || tmp_tf.name == g_quark_from_string("/flight-compact"))
935 tmp_tf.compact = 1;
936 else
937 tmp_tf.compact = 0;
938 group = g_datalist_id_get_data(&trace->tracefiles, name);
939 if(group == NULL) {
940 /* Elements are automatically cleared when the array is allocated.
941 * It makes the cpu_online variable set to 0 : cpu offline, by default.
942 */
943 group = g_array_sized_new (FALSE, TRUE, sizeof(LttTracefile), 10);
944 g_datalist_id_set_data_full(&trace->tracefiles, name,
945 group, ltt_tracefile_group_destroy);
946 }
947
948 /* Add the per cpu tracefile to the named group */
949 unsigned int old_len = group->len;
950 if(num+1 > old_len)
951 group = g_array_set_size(group, num+1);
952 g_array_index (group, LttTracefile, num) = tmp_tf;
953
954 }
955 }
956
957 closedir(dir);
958
959 return 0;
960 }
961
962 /* ltt_get_facility_description
963 *
964 * Opens the file corresponding to the requested facility (identified by fac_id
965 * and checksum).
966 *
967 * The name searched is : %trace root%/eventdefs/facname_checksum.xml
968 *
969 * Returns 0 on success, or 1 on failure.
970 */
971
972 static int ltt_get_facility_description(LttFacility *f,
973 LttTrace *t,
974 LttTracefile *fac_tf)
975 {
976 char desc_file_name[PATH_MAX];
977 const gchar *text;
978 guint textlen;
979 gint err;
980 gint arch_spec;
981 gint fac_name_len;
982
983 text = g_quark_to_string(t->pathname);
984 textlen = strlen(text);
985
986 if(textlen >= PATH_MAX) goto name_error;
987 strcpy(desc_file_name, text);
988
989 text = "/eventdefs/";
990 textlen+=strlen(text);
991 if(textlen >= PATH_MAX) goto name_error;
992 strcat(desc_file_name, text);
993
994 text = g_quark_to_string(f->name);
995 fac_name_len = strlen(text);
996 textlen+=fac_name_len;
997 if(textlen >= PATH_MAX) goto name_error;
998 strcat(desc_file_name, text);
999
1000 /* arch specific facilities are named like this : name_arch */
1001 if(fac_name_len+1 < sizeof("_arch"))
1002 arch_spec = 0;
1003 else {
1004 if(!strcmp(&text[fac_name_len+1-sizeof("_arch")], "_arch"))
1005 arch_spec = 1;
1006 else
1007 arch_spec = 0;
1008 }
1009
1010 #if 0
1011 text = "_";
1012 textlen+=strlen(text);
1013 if(textlen >= PATH_MAX) goto name_error;
1014 strcat(desc_file_name, text);
1015
1016 err = snprintf(desc_file_name+textlen, PATH_MAX-textlen-1,
1017 "%u", f->checksum);
1018 if(err < 0) goto name_error;
1019
1020 textlen=strlen(desc_file_name);
1021
1022 #endif //0
1023
1024 if(arch_spec) {
1025 switch(t->arch_type) {
1026 case LTT_ARCH_TYPE_I386:
1027 text = "_i386";
1028 break;
1029 case LTT_ARCH_TYPE_PPC:
1030 text = "_ppc";
1031 break;
1032 case LTT_ARCH_TYPE_SH:
1033 text = "_sh";
1034 break;
1035 case LTT_ARCH_TYPE_S390:
1036 text = "_s390";
1037 break;
1038 case LTT_ARCH_TYPE_MIPS:
1039 text = "_mips";
1040 break;
1041 case LTT_ARCH_TYPE_ARM:
1042 text = "_arm";
1043 break;
1044 case LTT_ARCH_TYPE_PPC64:
1045 text = "_ppc64";
1046 break;
1047 case LTT_ARCH_TYPE_X86_64:
1048 text = "_x86_64";
1049 break;
1050 case LTT_ARCH_TYPE_C2:
1051 text = "_c2";
1052 break;
1053 case LTT_ARCH_TYPE_POWERPC:
1054 text = "_powerpc";
1055 break;
1056 default:
1057 g_error("Trace from unsupported architecture.");
1058 }
1059 textlen+=strlen(text);
1060 if(textlen >= PATH_MAX) goto name_error;
1061 strcat(desc_file_name, text);
1062 }
1063
1064 text = ".xml";
1065 textlen+=strlen(text);
1066 if(textlen >= PATH_MAX) goto name_error;
1067 strcat(desc_file_name, text);
1068
1069 err = ltt_facility_open(f, t, desc_file_name);
1070 if(err) goto facility_error;
1071
1072 return 0;
1073
1074 facility_error:
1075 name_error:
1076 return 1;
1077 }
1078
1079 static void ltt_fac_ids_destroy(gpointer data)
1080 {
1081 GArray *fac_ids = (GArray *)data;
1082
1083 g_array_free(fac_ids, TRUE);
1084 }
1085
1086
1087 /* Presumes the tracefile is already seeked at the beginning. It makes sense,
1088 * because it must be done just after the opening */
1089 static int ltt_process_facility_tracefile(LttTracefile *tf)
1090 {
1091 int err;
1092 LttFacility *fac;
1093 GArray *fac_ids;
1094 guint i;
1095 LttEventType *et;
1096
1097 while(1) {
1098 err = ltt_tracefile_read_seek(tf);
1099 if(err == EPERM) goto seek_error;
1100 else if(err == ERANGE) break; /* End of tracefile */
1101
1102 err = ltt_tracefile_read_update_event(tf);
1103 if(err) goto update_error;
1104
1105 /* We are on a facility load/or facility unload/ or heartbeat event */
1106 /* The rules are :
1107 * * facility 0 is hardcoded : this is the core facility. It will be shown
1108 * in the facility array though, and is shown as "loaded builtin" in the
1109 * trace.
1110 * It contains event :
1111 * 0 : facility load
1112 * 1 : facility unload
1113 * 2 : state dump facility load
1114 * 3 : heartbeat
1115 */
1116 if(tf->event.facility_id != LTT_FACILITY_CORE) {
1117 /* Should only contain core facility */
1118 g_warning("Error in processing facility file %s, "
1119 "should not contain facility id %u.", g_quark_to_string(tf->name),
1120 tf->event.facility_id);
1121 err = EPERM;
1122 goto fac_id_error;
1123 } else {
1124
1125 struct LttFacilityLoad *fac_load_data;
1126 struct LttStateDumpFacilityLoad *fac_state_dump_load_data;
1127 char *fac_name;
1128 void *pos;
1129
1130 // FIXME align
1131 switch((enum ltt_core_events)tf->event.event_id) {
1132 case LTT_EVENT_FACILITY_LOAD:
1133 fac_name = (char*)(tf->event.data);
1134 g_debug("Doing LTT_EVENT_FACILITY_LOAD of facility %s",
1135 fac_name);
1136 pos = (tf->event.data + strlen(fac_name) + 1);
1137 pos += ltt_align((size_t)pos, tf->trace->arch_size, tf->has_alignment);
1138 fac_load_data = (struct LttFacilityLoad *)pos;
1139
1140 fac = &g_array_index (tf->trace->facilities_by_num, LttFacility,
1141 ltt_get_uint32(LTT_GET_BO(tf), &fac_load_data->id));
1142 /* facility may already exist if trace is paused/unpaused */
1143 if(fac->exists) continue;
1144 fac->name = g_quark_from_string(fac_name);
1145 fac->checksum = ltt_get_uint32(LTT_GET_BO(tf),
1146 &fac_load_data->checksum);
1147 fac->id = ltt_get_uint32(LTT_GET_BO(tf), &fac_load_data->id);
1148 fac->pointer_size = ltt_get_uint32(LTT_GET_BO(tf),
1149 &fac_load_data->pointer_size);
1150 fac->int_size = ltt_get_uint32(LTT_GET_BO(tf),
1151 &fac_load_data->int_size);
1152 fac->long_size = ltt_get_uint32(LTT_GET_BO(tf),
1153 &fac_load_data->long_size);
1154 fac->size_t_size = ltt_get_uint32(LTT_GET_BO(tf),
1155 &fac_load_data->size_t_size);
1156 fac->alignment = ltt_get_uint32(LTT_GET_BO(tf),
1157 &fac_load_data->has_alignment);
1158
1159 if(ltt_get_facility_description(fac, tf->trace, tf))
1160 continue; /* error opening description */
1161
1162 fac->trace = tf->trace;
1163
1164 /* Preset the field offsets */
1165 for(i=0; i<fac->events->len; i++){
1166 et = &g_array_index(fac->events, LttEventType, i);
1167 precompute_offsets(fac, et);
1168 }
1169
1170 fac->exists = 1;
1171
1172 fac_ids = g_datalist_id_get_data(&tf->trace->facilities_by_name,
1173 fac->name);
1174 if(fac_ids == NULL) {
1175 fac_ids = g_array_sized_new (FALSE, TRUE, sizeof(guint), 1);
1176 g_datalist_id_set_data_full(&tf->trace->facilities_by_name,
1177 fac->name,
1178 fac_ids, ltt_fac_ids_destroy);
1179 }
1180 g_array_append_val(fac_ids, fac->id);
1181
1182 break;
1183 case LTT_EVENT_FACILITY_UNLOAD:
1184 g_debug("Doing LTT_EVENT_FACILITY_UNLOAD");
1185 /* We don't care about unload : facilities ID are valid for the whole
1186 * trace. They simply won't be used after the unload. */
1187 break;
1188 case LTT_EVENT_STATE_DUMP_FACILITY_LOAD:
1189 fac_name = (char*)(tf->event.data);
1190 g_debug("Doing LTT_EVENT_STATE_DUMP_FACILITY_LOAD of facility %s",
1191 fac_name);
1192 pos = (tf->event.data + strlen(fac_name) + 1);
1193 pos += ltt_align((size_t)pos, tf->trace->arch_size, tf->has_alignment);
1194 fac_state_dump_load_data = (struct LttStateDumpFacilityLoad *)pos;
1195
1196 fac = &g_array_index (tf->trace->facilities_by_num, LttFacility,
1197 ltt_get_uint32(LTT_GET_BO(tf), &fac_state_dump_load_data->id));
1198 /* facility may already exist if trace is paused/unpaused */
1199 if(fac->exists) continue;
1200 fac->name = g_quark_from_string(fac_name);
1201 fac->checksum = ltt_get_uint32(LTT_GET_BO(tf),
1202 &fac_state_dump_load_data->checksum);
1203 fac->id = ltt_get_uint32(LTT_GET_BO(tf),
1204 &fac_state_dump_load_data->id);
1205 fac->pointer_size = ltt_get_uint32(LTT_GET_BO(tf),
1206 &fac_state_dump_load_data->pointer_size);
1207 fac->int_size = ltt_get_uint32(LTT_GET_BO(tf),
1208 &fac_state_dump_load_data->int_size);
1209 fac->long_size = ltt_get_uint32(LTT_GET_BO(tf),
1210 &fac_state_dump_load_data->long_size);
1211 fac->size_t_size = ltt_get_uint32(LTT_GET_BO(tf),
1212 &fac_state_dump_load_data->size_t_size);
1213 fac->alignment = ltt_get_uint32(LTT_GET_BO(tf),
1214 &fac_state_dump_load_data->has_alignment);
1215 if(ltt_get_facility_description(fac, tf->trace, tf))
1216 continue; /* error opening description */
1217
1218 fac->trace = tf->trace;
1219
1220 /* Preset the field offsets */
1221 for(i=0; i<fac->events->len; i++){
1222 et = &g_array_index(fac->events, LttEventType, i);
1223 precompute_offsets(fac, et);
1224 }
1225
1226 fac->exists = 1;
1227
1228 fac_ids = g_datalist_id_get_data(&tf->trace->facilities_by_name,
1229 fac->name);
1230 if(fac_ids == NULL) {
1231 fac_ids = g_array_sized_new (FALSE, TRUE, sizeof(guint), 1);
1232 g_datalist_id_set_data_full(&tf->trace->facilities_by_name,
1233 fac->name,
1234 fac_ids, ltt_fac_ids_destroy);
1235 }
1236 g_array_append_val(fac_ids, fac->id);
1237 g_debug("fac id : %u", fac->id);
1238
1239 break;
1240 case LTT_EVENT_HEARTBEAT:
1241 break;
1242 case LTT_EVENT_HEARTBEAT_FULL:
1243 break;
1244 default:
1245 g_warning("Error in processing facility file %s, "
1246 "unknown event id %hhu in core facility.",
1247 g_quark_to_string(tf->name),
1248 tf->event.event_id);
1249 err = EPERM;
1250 goto event_id_error;
1251 }
1252 }
1253 }
1254 return 0;
1255
1256 /* Error handling */
1257 event_id_error:
1258 fac_id_error:
1259 update_error:
1260 seek_error:
1261 g_warning("An error occured in facility tracefile parsing");
1262 return err;
1263 }
1264
1265
1266 LttTrace *ltt_trace_open(const gchar *pathname)
1267 {
1268 gchar abs_path[PATH_MAX];
1269 LttTrace * t;
1270 LttTracefile *tf;
1271 GArray *group;
1272 int i, ret;
1273 struct ltt_block_start_header *header;
1274 DIR *dir;
1275 struct dirent *entry;
1276 guint control_found = 0;
1277 guint eventdefs_found = 0;
1278 struct stat stat_buf;
1279 gchar path[PATH_MAX];
1280
1281 t = g_new(LttTrace, 1);
1282 if(!t) goto alloc_error;
1283
1284 get_absolute_pathname(pathname, abs_path);
1285 t->pathname = g_quark_from_string(abs_path);
1286
1287 g_datalist_init(&t->tracefiles);
1288
1289 /* Test to see if it looks like a trace */
1290 dir = opendir(abs_path);
1291 if(dir == NULL) {
1292 perror(abs_path);
1293 goto open_error;
1294 }
1295 while((entry = readdir(dir)) != NULL) {
1296 strcpy(path, abs_path);
1297 strcat(path, "/");
1298 strcat(path, entry->d_name);
1299 ret = stat(path, &stat_buf);
1300 if(ret == -1) {
1301 perror(path);
1302 continue;
1303 }
1304 if(S_ISDIR(stat_buf.st_mode)) {
1305 if(strcmp(entry->d_name, "control") == 0) {
1306 control_found = 1;
1307 }
1308 if(strcmp(entry->d_name, "eventdefs") == 0) {
1309 eventdefs_found = 1;
1310 }
1311 }
1312 }
1313 closedir(dir);
1314
1315 if(!control_found || !eventdefs_found) goto find_error;
1316
1317 /* Open all the tracefiles */
1318 if(open_tracefiles(t, abs_path, "")) {
1319 g_warning("Error opening tracefile %s", abs_path);
1320 goto find_error;
1321 }
1322
1323 /* Prepare the facilities containers : array and mapping */
1324 /* Array is zeroed : the "exists" field is set to false by default */
1325 t->facilities_by_num = g_array_sized_new (FALSE,
1326 TRUE, sizeof(LttFacility),
1327 NUM_FACILITIES);
1328 t->facilities_by_num = g_array_set_size(t->facilities_by_num, NUM_FACILITIES);
1329
1330 g_datalist_init(&t->facilities_by_name);
1331
1332 /* Parse each trace control/facilitiesN files : get runtime fac. info */
1333 group = g_datalist_id_get_data(&t->tracefiles, LTT_TRACEFILE_NAME_FACILITIES);
1334 if(group == NULL) {
1335 g_error("Trace %s has no facility tracefile", abs_path);
1336 g_assert(0);
1337 goto facilities_error;
1338 }
1339
1340 /* Get the trace information for the control/facility 0 tracefile */
1341 g_assert(group->len > 0);
1342 tf = &g_array_index (group, LttTracefile, 0);
1343 header = (struct ltt_block_start_header*)tf->buffer.head;
1344 g_assert(parse_trace_header(header->trace,
1345 tf, t) == 0);
1346
1347 t->num_cpu = group->len;
1348
1349 for(i=0; i<group->len; i++) {
1350 tf = &g_array_index (group, LttTracefile, i);
1351 if(ltt_process_facility_tracefile(tf))
1352 goto facilities_error;
1353 }
1354 t->compact_facilities = ltt_trace_facility_get_by_name(t,
1355 g_quark_from_string("compact"));
1356 if(!t->compact_facilities)
1357 t->compact_facilities = ltt_trace_facility_get_by_name(t,
1358 g_quark_from_string("flight-compact"));
1359 if (t->compact_facilities) {
1360 /* FIXME : currently does not support unload/load of compact
1361 * facility during tracing. Should check for the currently loaded
1362 * version of the facility. */
1363 g_assert(t->compact_facilities->len == 1);
1364 g_assert(t->compact_facilities);
1365 {
1366 guint facility_id = g_array_index(t->compact_facilities, guint, 0);
1367 LttFacility *fac = ltt_trace_facility_by_id(t, facility_id);
1368 unsigned int num = ltt_facility_eventtype_number(fac);
1369 /* Could be done much quicker, but not on much used code path */
1370 if(num) {
1371 t->compact_event_bits = 1;
1372 while(num >>= 1)
1373 t->compact_event_bits++;
1374 } else
1375 t->compact_event_bits = 0;
1376 }
1377 }
1378
1379 return t;
1380
1381 /* Error handling */
1382 facilities_error:
1383 g_datalist_clear(&t->facilities_by_name);
1384 g_array_free(t->facilities_by_num, TRUE);
1385 find_error:
1386 g_datalist_clear(&t->tracefiles);
1387 open_error:
1388 g_free(t);
1389 alloc_error:
1390 return NULL;
1391
1392 }
1393
1394 GQuark ltt_trace_name(const LttTrace *t)
1395 {
1396 return t->pathname;
1397 }
1398
1399
1400 /******************************************************************************
1401 * When we copy a trace, we want all the opening actions to happen again :
1402 * the trace will be reopened and totally independant from the original.
1403 * That's why we call ltt_trace_open.
1404 *****************************************************************************/
1405 LttTrace *ltt_trace_copy(LttTrace *self)
1406 {
1407 return ltt_trace_open(g_quark_to_string(self->pathname));
1408 }
1409
1410 void ltt_trace_close(LttTrace *t)
1411 {
1412 guint i;
1413 LttFacility *fac;
1414
1415 for(i=0; i<t->facilities_by_num->len; i++) {
1416 fac = &g_array_index (t->facilities_by_num, LttFacility, i);
1417 if(fac->exists)
1418 ltt_facility_close(fac);
1419 }
1420
1421 g_datalist_clear(&t->facilities_by_name);
1422 g_array_free(t->facilities_by_num, TRUE);
1423 g_datalist_clear(&t->tracefiles);
1424 g_free(t);
1425 }
1426
1427
1428 /*****************************************************************************
1429 *Get the system description of the trace
1430 ****************************************************************************/
1431
1432 LttFacility *ltt_trace_facility_by_id(LttTrace *t, guint8 id)
1433 {
1434 g_assert(id < t->facilities_by_num->len);
1435 return &g_array_index(t->facilities_by_num, LttFacility, id);
1436 }
1437
1438 /* ltt_trace_facility_get_by_name
1439 *
1440 * Returns the GArray of facility indexes. All the fac_ids that matches the
1441 * requested facility name.
1442 *
1443 * If name is not found, returns NULL.
1444 */
1445 GArray *ltt_trace_facility_get_by_name(LttTrace *t, GQuark name)
1446 {
1447 return g_datalist_id_get_data(&t->facilities_by_name, name);
1448 }
1449
1450 /*****************************************************************************
1451 * Functions to discover all the event types in the trace
1452 ****************************************************************************/
1453
1454 #if 0
1455 unsigned ltt_trace_eventtype_number(LttTrace *t)
1456 {
1457 unsigned int i;
1458 unsigned count = 0;
1459 unsigned int num = t->facility_number;
1460 LttFacility * f;
1461
1462 for(i=0;i<num;i++){
1463 f = (LttFacility*)g_ptr_array_index(t->facilities, i);
1464 count += f->event_number;
1465 }
1466 return count;
1467 }
1468 #endif //0
1469
1470 #if 0
1471 //use an iteration on all the trace facilities, and inside iteration on all the
1472 //event types in each facilities instead.
1473 LttEventType *ltt_trace_eventtype_get(LttTrace *t, unsigned evId)
1474 {
1475 LttEventType *event_type;
1476
1477 LttFacility * f;
1478 f = ltt_trace_facility_by_id(t,evId);
1479
1480 if(unlikely(!f)) event_type = NULL;
1481 else event_type = f->events[evId - f->base_id];
1482
1483 return event_type;
1484 }
1485 #endif //0
1486
1487 #if 0
1488 /*****************************************************************************
1489 * ltt_trace_find_tracefile
1490 *
1491 * Find a tracefile by name and index in the group.
1492 *
1493 * Returns a pointer to the tracefiles, else NULL.
1494 ****************************************************************************/
1495
1496 LttTracefile *ltt_trace_find_tracefile(LttTrace *t, const gchar *name)
1497 {
1498 }
1499 #endif //0
1500
1501 /*****************************************************************************
1502 * Get the start time and end time of the trace
1503 ****************************************************************************/
1504
1505 static void ltt_tracefile_time_span_get(LttTracefile *tf,
1506 LttTime *start, LttTime *end)
1507 {
1508 int err;
1509
1510 err = map_block(tf, 0);
1511 if(unlikely(err)) {
1512 g_error("Can not map block");
1513 *start = ltt_time_infinite;
1514 } else
1515 *start = tf->buffer.begin.timestamp;
1516
1517 err = map_block(tf, tf->num_blocks - 1); /* Last block */
1518 if(unlikely(err)) {
1519 g_error("Can not map block");
1520 *end = ltt_time_zero;
1521 } else
1522 *end = tf->buffer.end.timestamp;
1523 }
1524
1525 struct tracefile_time_span_get_args {
1526 LttTrace *t;
1527 LttTime *start;
1528 LttTime *end;
1529 };
1530
1531 static void group_time_span_get(GQuark name, gpointer data, gpointer user_data)
1532 {
1533 struct tracefile_time_span_get_args *args =
1534 (struct tracefile_time_span_get_args*)user_data;
1535
1536 GArray *group = (GArray *)data;
1537 int i;
1538 LttTracefile *tf;
1539 LttTime tmp_start;
1540 LttTime tmp_end;
1541
1542 for(i=0; i<group->len; i++) {
1543 tf = &g_array_index (group, LttTracefile, i);
1544 if(tf->cpu_online) {
1545 ltt_tracefile_time_span_get(tf, &tmp_start, &tmp_end);
1546 if(ltt_time_compare(*args->start, tmp_start)>0) *args->start = tmp_start;
1547 if(ltt_time_compare(*args->end, tmp_end)<0) *args->end = tmp_end;
1548 }
1549 }
1550 }
1551
1552 void ltt_trace_time_span_get(LttTrace *t, LttTime *start, LttTime *end)
1553 {
1554 LttTime min_start = ltt_time_infinite;
1555 LttTime max_end = ltt_time_zero;
1556 struct tracefile_time_span_get_args args = { t, &min_start, &max_end };
1557
1558 g_datalist_foreach(&t->tracefiles, &group_time_span_get, &args);
1559
1560 if(start != NULL) *start = min_start;
1561 if(end != NULL) *end = max_end;
1562
1563 }
1564
1565
1566 /*****************************************************************************
1567 *Get the name of a tracefile
1568 ****************************************************************************/
1569
1570 GQuark ltt_tracefile_name(const LttTracefile *tf)
1571 {
1572 return tf->name;
1573 }
1574
1575 GQuark ltt_tracefile_long_name(const LttTracefile *tf)
1576 {
1577 return tf->long_name;
1578 }
1579
1580
1581
1582 guint ltt_tracefile_cpu(LttTracefile *tf)
1583 {
1584 return tf->cpu_num;
1585 }
1586
1587 guint ltt_tracefile_tid(LttTracefile *tf)
1588 {
1589 return tf->tid;
1590 }
1591
1592 guint ltt_tracefile_pgid(LttTracefile *tf)
1593 {
1594 return tf->pgid;
1595 }
1596
1597 guint64 ltt_tracefile_creation(LttTracefile *tf)
1598 {
1599 return tf->creation;
1600 }
1601 /*****************************************************************************
1602 * Get the number of blocks in the tracefile
1603 ****************************************************************************/
1604
1605 guint ltt_tracefile_block_number(LttTracefile *tf)
1606 {
1607 return tf->num_blocks;
1608 }
1609
1610
1611 /* Seek to the first event in a tracefile that has a time equal or greater than
1612 * the time passed in parameter.
1613 *
1614 * If the time parameter is outside the tracefile time span, seek to the first
1615 * event or if after, return ERANGE.
1616 *
1617 * If the time parameter is before the first event, we have to seek specially to
1618 * there.
1619 *
1620 * If the time is after the end of the trace, return ERANGE.
1621 *
1622 * Do a binary search to find the right block, then a sequential search in the
1623 * block to find the event.
1624 *
1625 * In the special case where the time requested fits inside a block that has no
1626 * event corresponding to the requested time, the first event of the next block
1627 * will be seeked.
1628 *
1629 * IMPORTANT NOTE : // FIXME everywhere...
1630 *
1631 * You MUST NOT do a ltt_tracefile_read right after a ltt_tracefile_seek_time :
1632 * you will jump over an event if you do.
1633 *
1634 * Return value : 0 : no error, the tf->event can be used
1635 * ERANGE : time if after the last event of the trace
1636 * otherwise : this is an error.
1637 *
1638 * */
1639
1640 int ltt_tracefile_seek_time(LttTracefile *tf, LttTime time)
1641 {
1642 int ret = 0;
1643 int err;
1644 unsigned int block_num, high, low;
1645
1646 /* seek at the beginning of trace */
1647 err = map_block(tf, 0); /* First block */
1648 if(unlikely(err)) {
1649 g_error("Can not map block");
1650 goto fail;
1651 }
1652
1653 /* If the time is lower or equal the beginning of the trace,
1654 * go to the first event. */
1655 if(ltt_time_compare(time, tf->buffer.begin.timestamp) <= 0) {
1656 ret = ltt_tracefile_read(tf);
1657 if(ret == ERANGE) goto range;
1658 else if (ret) goto fail;
1659 goto found; /* There is either no event in the trace or the event points
1660 to the first event in the trace */
1661 }
1662
1663 err = map_block(tf, tf->num_blocks - 1); /* Last block */
1664 if(unlikely(err)) {
1665 g_error("Can not map block");
1666 goto fail;
1667 }
1668
1669 /* If the time is after the end of the trace, return ERANGE. */
1670 if(ltt_time_compare(time, tf->buffer.end.timestamp) > 0) {
1671 goto range;
1672 }
1673
1674 /* Binary search the block */
1675 high = tf->num_blocks - 1;
1676 low = 0;
1677
1678 while(1) {
1679 block_num = ((high-low) / 2) + low;
1680
1681 err = map_block(tf, block_num);
1682 if(unlikely(err)) {
1683 g_error("Can not map block");
1684 goto fail;
1685 }
1686 if(high == low) {
1687 /* We cannot divide anymore : this is what would happen if the time
1688 * requested was exactly between two consecutive buffers'end and start
1689 * timestamps. This is also what would happend if we didn't deal with out
1690 * of span cases prior in this function. */
1691 /* The event is right in the buffer!
1692 * (or in the next buffer first event) */
1693 while(1) {
1694 ret = ltt_tracefile_read(tf);
1695 if(ret == ERANGE) goto range; /* ERANGE or EPERM */
1696 else if(ret) goto fail;
1697
1698 if(ltt_time_compare(time, tf->event.event_time) <= 0)
1699 goto found;
1700 }
1701
1702 } else if(ltt_time_compare(time, tf->buffer.begin.timestamp) < 0) {
1703 /* go to lower part */
1704 high = block_num - 1;
1705 } else if(ltt_time_compare(time, tf->buffer.end.timestamp) > 0) {
1706 /* go to higher part */
1707 low = block_num + 1;
1708 } else {/* The event is right in the buffer!
1709 (or in the next buffer first event) */
1710 while(1) {
1711 ret = ltt_tracefile_read(tf);
1712 if(ret == ERANGE) goto range; /* ERANGE or EPERM */
1713 else if(ret) goto fail;
1714
1715 if(ltt_time_compare(time, tf->event.event_time) <= 0)
1716 break;
1717 }
1718 goto found;
1719 }
1720 }
1721
1722 found:
1723 return 0;
1724 range:
1725 return ERANGE;
1726
1727 /* Error handling */
1728 fail:
1729 g_error("ltt_tracefile_seek_time failed on tracefile %s",
1730 g_quark_to_string(tf->name));
1731 return EPERM;
1732 }
1733
1734
1735 int ltt_tracefile_seek_position(LttTracefile *tf, const LttEventPosition *ep) {
1736
1737 int err;
1738
1739 if(ep->tracefile != tf) {
1740 goto fail;
1741 }
1742
1743 err = map_block(tf, ep->block);
1744 if(unlikely(err)) {
1745 g_error("Can not map block");
1746 goto fail;
1747 }
1748
1749 tf->event.offset = ep->offset;
1750
1751 /* Put back the event real tsc */
1752 tf->event.tsc = ep->tsc;
1753 tf->buffer.tsc = ep->tsc;
1754
1755 err = ltt_tracefile_read_update_event(tf);
1756 if(err) goto fail;
1757 err = ltt_tracefile_read_op(tf);
1758 if(err) goto fail;
1759
1760 return 0;
1761
1762 fail:
1763 g_error("ltt_tracefile_seek_time failed on tracefile %s",
1764 g_quark_to_string(tf->name));
1765 return 1;
1766 }
1767
1768 LttTime ltt_interpolate_time_from_tsc(LttTracefile *tf, guint64 tsc)
1769 {
1770 LttTime time;
1771
1772 if(tsc > tf->trace->start_tsc) {
1773 time = ltt_time_from_uint64(
1774 (double)(tsc - tf->trace->start_tsc)
1775 * (1000000000.0 / tf->trace->freq_scale)
1776 / (double)tf->trace->start_freq);
1777 time = ltt_time_add(tf->trace->start_time_from_tsc, time);
1778 } else {
1779 time = ltt_time_from_uint64(
1780 (double)(tf->trace->start_tsc - tsc)
1781 * (1000000000.0 / tf->trace->freq_scale)
1782 / (double)tf->trace->start_freq);
1783 time = ltt_time_sub(tf->trace->start_time_from_tsc, time);
1784 }
1785 return time;
1786 }
1787
1788 /* Calculate the real event time based on the buffer boundaries */
1789 LttTime ltt_interpolate_time(LttTracefile *tf, LttEvent *event)
1790 {
1791 return ltt_interpolate_time_from_tsc(tf, tf->buffer.tsc);
1792 }
1793
1794
1795 /* Get the current event of the tracefile : valid until the next read */
1796 LttEvent *ltt_tracefile_get_event(LttTracefile *tf)
1797 {
1798 return &tf->event;
1799 }
1800
1801
1802
1803 /*****************************************************************************
1804 *Function name
1805 * ltt_tracefile_read : Read the next event in the tracefile
1806 *Input params
1807 * t : tracefile
1808 *Return value
1809 *
1810 * Returns 0 if an event can be used in tf->event.
1811 * Returns ERANGE on end of trace. The event in tf->event still can be used
1812 * (if the last block was not empty).
1813 * Returns EPERM on error.
1814 *
1815 * This function does make the tracefile event structure point to the event
1816 * currently pointed to by the tf->event.
1817 *
1818 * Note : you must call a ltt_tracefile_seek to the beginning of the trace to
1819 * reinitialize it after an error if you want results to be coherent.
1820 * It would be the case if a end of trace last buffer has no event : the end
1821 * of trace wouldn't be returned, but an error.
1822 * We make the assumption there is at least one event per buffer.
1823 ****************************************************************************/
1824
1825 int ltt_tracefile_read(LttTracefile *tf)
1826 {
1827 int err;
1828
1829 err = ltt_tracefile_read_seek(tf);
1830 if(err) return err;
1831 err = ltt_tracefile_read_update_event(tf);
1832 if(err) return err;
1833 err = ltt_tracefile_read_op(tf);
1834 if(err) return err;
1835
1836 return 0;
1837 }
1838
1839 int ltt_tracefile_read_seek(LttTracefile *tf)
1840 {
1841 int err;
1842
1843 /* Get next buffer until we finally have an event, or end of trace */
1844 while(1) {
1845 err = ltt_seek_next_event(tf);
1846 if(unlikely(err == ENOPROTOOPT)) {
1847 return EPERM;
1848 }
1849
1850 /* Are we at the end of the buffer ? */
1851 if(err == ERANGE) {
1852 if(unlikely(tf->buffer.index == tf->num_blocks-1)){ /* end of trace ? */
1853 return ERANGE;
1854 } else {
1855 /* get next block */
1856 err = map_block(tf, tf->buffer.index + 1);
1857 if(unlikely(err)) {
1858 g_error("Can not map block");
1859 return EPERM;
1860 }
1861 }
1862 } else break; /* We found an event ! */
1863 }
1864
1865 return 0;
1866 }
1867
1868
1869 /* do specific operation on events */
1870 int ltt_tracefile_read_op(LttTracefile *tf)
1871 {
1872 LttEvent *event;
1873
1874 event = &tf->event;
1875
1876 /* do event specific operation */
1877
1878 /* do something if its an heartbeat event : increment the heartbeat count */
1879 //if(event->facility_id == LTT_FACILITY_CORE)
1880 // if(event->event_id == LTT_EVENT_HEARTBEAT)
1881 // tf->cur_heart_beat_number++;
1882
1883 return 0;
1884 }
1885
1886
1887 /* same as ltt_tracefile_read, but does not seek to the next event nor call
1888 * event specific operation. */
1889 int ltt_tracefile_read_update_event(LttTracefile *tf)
1890 {
1891 void * pos;
1892 LttEvent *event;
1893
1894 event = &tf->event;
1895 pos = tf->buffer.head + event->offset;
1896
1897 /* Read event header */
1898
1899 /* Align the head */
1900 if(!tf->compact)
1901 pos += ltt_align((size_t)pos, tf->trace->arch_size, tf->has_alignment);
1902 else {
1903 g_assert(tf->has_heartbeat);
1904 pos += ltt_align((size_t)pos, sizeof(uint32_t), tf->has_alignment);
1905 }
1906
1907 if(tf->has_heartbeat) {
1908 event->timestamp = ltt_get_uint32(LTT_GET_BO(tf),
1909 pos);
1910 if(!tf->compact) {
1911 /* 32 bits -> 64 bits tsc */
1912 /* note : still works for seek and non seek cases. */
1913 if(event->timestamp < (0xFFFFFFFFULL&tf->buffer.tsc)) {
1914 tf->buffer.tsc = ((tf->buffer.tsc&0xFFFFFFFF00000000ULL)
1915 + 0x100000000ULL)
1916 | (guint64)event->timestamp;
1917 event->tsc = tf->buffer.tsc;
1918 } else {
1919 /* no overflow */
1920 tf->buffer.tsc = (tf->buffer.tsc&0xFFFFFFFF00000000ULL)
1921 | (guint64)event->timestamp;
1922 event->tsc = tf->buffer.tsc;
1923 event->compact_data = 0;
1924 }
1925 } else {
1926 /* Compact header */
1927 /* We keep the LSB of the previous timestamp, to make sure
1928 * we never go back */
1929 event->event_id = event->timestamp >> tf->tscbits;
1930 event->event_id = event->event_id & ((1 << tf->trace->compact_event_bits) - 1);
1931 event->compact_data = event->timestamp >>
1932 (tf->trace->compact_event_bits + tf->tscbits);
1933 //printf("tsc bits %u, ev bits %u init data %u\n",
1934 // tf->tscbits, tf->trace->compact_event_bits, event->compact_data);
1935 /* Put the compact data back in original endianness */
1936 event->compact_data = ltt_get_uint32(LTT_GET_BO(tf), &event->compact_data);
1937 event->event_size = 0xFFFF;
1938 //printf("Found compact event %d\n", event->event_id);
1939 //printf("Compact data %d\n", event->compact_data);
1940 event->timestamp = event->timestamp << tf->tsc_lsb_truncate;
1941 event->timestamp = event->timestamp & tf->tsc_mask;
1942 //printf("timestamp 0x%lX\n", event->timestamp);
1943 //printf("mask 0x%llX\n", tf->tsc_mask);
1944 //printf("mask_next 0x%llX\n", tf->tsc_mask_next_bit);
1945 //printf("previous tsc 0x%llX\n", tf->buffer.tsc);
1946 //printf("previous tsc&mask 0x%llX\n", tf->tsc_mask&tf->buffer.tsc);
1947 //printf("previous tsc&(~mask) 0x%llX\n", tf->buffer.tsc&(~tf->tsc_mask));
1948 if(event->timestamp < (tf->tsc_mask&tf->buffer.tsc)) {
1949 //printf("wrap\n");
1950 tf->buffer.tsc = ((tf->buffer.tsc&(~tf->tsc_mask))
1951 + tf->tsc_mask_next_bit)
1952 | (guint64)event->timestamp;
1953 event->tsc = tf->buffer.tsc;
1954 } else {
1955 //printf("no wrap\n");
1956 /* no overflow */
1957 tf->buffer.tsc = (tf->buffer.tsc&(~tf->tsc_mask))
1958 | (guint64)event->timestamp;
1959 event->tsc = tf->buffer.tsc;
1960 }
1961 //printf("current tsc 0x%llX\n", tf->buffer.tsc);
1962 event->facility_id = g_array_index(tf->trace->compact_facilities, guint, 0);
1963 }
1964 pos += sizeof(guint32);
1965 } else {
1966 event->tsc = ltt_get_uint64(LTT_GET_BO(tf), pos);
1967 tf->buffer.tsc = event->tsc;
1968 event->compact_data = 0;
1969 pos += sizeof(guint64);
1970 }
1971 event->event_time = ltt_interpolate_time(tf, event);
1972
1973 if(!tf->compact) {
1974 event->facility_id = *(guint8*)pos;
1975 pos += sizeof(guint8);
1976
1977 event->event_id = *(guint8*)pos;
1978 pos += sizeof(guint8);
1979
1980 event->event_size = ltt_get_uint16(LTT_GET_BO(tf), pos);
1981 pos += sizeof(guint16);
1982 } else {
1983 /* Compact event */
1984 }
1985 /* Align the head */
1986 if(!tf->compact)
1987 pos += ltt_align((size_t)pos, tf->trace->arch_size, tf->has_alignment);
1988
1989 event->data = pos;
1990
1991 /* get the data size and update the event fields with the current
1992 * information. Also update the time if a heartbeat_full event is found. */
1993 ltt_update_event_size(tf);
1994
1995 return 0;
1996 }
1997
1998
1999 /****************************************************************************
2000 *Function name
2001 * map_block : map a block from the file
2002 *Input Params
2003 * lttdes : ltt trace file
2004 * whichBlock : the block which will be read
2005 *return value
2006 * 0 : success
2007 * EINVAL : lseek fail
2008 * EIO : can not read from the file
2009 ****************************************************************************/
2010
2011 static gint map_block(LttTracefile * tf, guint block_num)
2012 {
2013 int page_size = getpagesize();
2014 struct ltt_block_start_header *header;
2015
2016 g_assert(block_num < tf->num_blocks);
2017
2018 if(tf->buffer.head != NULL) {
2019 if(munmap(tf->buffer.head, PAGE_ALIGN(tf->buf_size))) {
2020 g_warning("unmap size : %u\n",
2021 PAGE_ALIGN(tf->buf_size));
2022 perror("munmap error");
2023 g_assert(0);
2024 }
2025 }
2026
2027
2028 /* Multiple of pages aligned head */
2029 tf->buffer.head = mmap(0,
2030 PAGE_ALIGN(tf->buf_size),
2031 PROT_READ, MAP_PRIVATE, tf->fd,
2032 PAGE_ALIGN((off_t)tf->buf_size * (off_t)block_num));
2033
2034 if(tf->buffer.head == MAP_FAILED) {
2035 perror("Error in allocating memory for buffer of tracefile");
2036 g_assert(0);
2037 goto map_error;
2038 }
2039 g_assert( ( (guint)tf->buffer.head&(8-1) ) == 0); // make sure it's aligned.
2040
2041
2042 tf->buffer.index = block_num;
2043
2044 header = (struct ltt_block_start_header*)tf->buffer.head;
2045
2046 #if 0
2047 tf->buffer.begin.timestamp = ltt_time_add(
2048 ltt_time_from_uint64(
2049 ltt_get_uint64(LTT_GET_BO(tf),
2050 &header->begin.timestamp)
2051 - tf->trace->start_monotonic),
2052 tf->trace->start_time);
2053 #endif //0
2054 //g_debug("block %u begin : %lu.%lu", block_num,
2055 // tf->buffer.begin.timestamp.tv_sec, tf->buffer.begin.timestamp.tv_nsec);
2056 tf->buffer.begin.cycle_count = ltt_get_uint64(LTT_GET_BO(tf),
2057 &header->begin.cycle_count);
2058 tf->buffer.begin.freq = ltt_get_uint64(LTT_GET_BO(tf),
2059 &header->begin.freq);
2060 if(tf->buffer.begin.freq == 0)
2061 tf->buffer.begin.freq = tf->trace->start_freq;
2062
2063 tf->buffer.begin.timestamp = ltt_interpolate_time_from_tsc(tf,
2064 tf->buffer.begin.cycle_count);
2065 #if 0
2066 ltt_time_add(
2067 ltt_time_from_uint64(
2068 (double)(tf->buffer.begin.cycle_count
2069 - tf->trace->start_tsc) * 1000000.0
2070 / (double)tf->trace->start_freq),
2071 tf->trace->start_time_from_tsc);
2072 #endif //0
2073 #if 0
2074
2075 tf->buffer.end.timestamp = ltt_time_add(
2076 ltt_time_from_uint64(
2077 ltt_get_uint64(LTT_GET_BO(tf),
2078 &header->end.timestamp)
2079 - tf->trace->start_monotonic),
2080 tf->trace->start_time);
2081 #endif //0
2082 //g_debug("block %u end : %lu.%lu", block_num,
2083 // tf->buffer.end.timestamp.tv_sec, tf->buffer.end.timestamp.tv_nsec);
2084 tf->buffer.end.cycle_count = ltt_get_uint64(LTT_GET_BO(tf),
2085 &header->end.cycle_count);
2086 tf->buffer.end.freq = ltt_get_uint64(LTT_GET_BO(tf),
2087 &header->end.freq);
2088 if(tf->buffer.end.freq == 0)
2089 tf->buffer.end.freq = tf->trace->start_freq;
2090
2091 tf->buffer.lost_size = ltt_get_uint32(LTT_GET_BO(tf),
2092 &header->lost_size);
2093 tf->buffer.end.timestamp = ltt_interpolate_time_from_tsc(tf,
2094 tf->buffer.end.cycle_count);
2095 #if 0
2096 ltt_time_add(
2097 ltt_time_from_uint64(
2098 (double)(tf->buffer.end.cycle_count
2099 - tf->trace->start_tsc) * 1000000.0
2100 / (double)tf->trace->start_freq),
2101 tf->trace->start_time_from_tsc);
2102 #endif //0
2103 tf->buffer.tsc = tf->buffer.begin.cycle_count;
2104 tf->event.tsc = tf->buffer.tsc;
2105 tf->buffer.freq = tf->buffer.begin.freq;
2106
2107 /* FIXME
2108 * eventually support variable buffer size : will need a partial pre-read of
2109 * the headers to create an index when we open the trace... eventually. */
2110 g_assert(tf->buf_size == ltt_get_uint32(LTT_GET_BO(tf),
2111 &header->buf_size));
2112
2113 /* Now that the buffer is mapped, calculate the time interpolation for the
2114 * block. */
2115
2116 // tf->buffer.nsecs_per_cycle = calc_nsecs_per_cycle(tf);
2117 //tf->buffer.cyc2ns_scale = calc_nsecs_per_cycle(tf);
2118
2119 /* Make the current event point to the beginning of the buffer :
2120 * it means that the event read must get the first event. */
2121 tf->event.tracefile = tf;
2122 tf->event.block = block_num;
2123 tf->event.offset = 0;
2124
2125 return 0;
2126
2127 map_error:
2128 return -errno;
2129
2130 }
2131
2132 /* It will update the fields offsets too */
2133 void ltt_update_event_size(LttTracefile *tf)
2134 {
2135 off_t size = 0;
2136 char *tscdata;
2137 struct marker_info *info;
2138
2139 switch((enum marker_id)tf->event.event_id) {
2140 case MARKER_ID_SET_MARKER_ID:
2141 size = strlen((char*)tf->event.data) + 1;
2142 //g_debug("marker %s id set", (char*)tf->event.data);
2143 size += ltt_align(size, sizeof(guint16), tf->has_alignment);
2144 size += sizeof(guint16);
2145 break;
2146 case MARKER_ID_SET_MARKER_FORMAT:
2147 //g_debug("marker %s format set", (char*)tf->event.data);
2148 size = strlen((char*)tf->event.data) + 1;
2149 size += strlen((char*)tf->event.data) + 1;
2150 break;
2151 case MARKER_ID_HEARTBEAT_32:
2152 //g_debug("Update Event heartbeat 32 bits");
2153 size = ltt_align(size, sizeof(guint32), tf->has_alignment);
2154 size += sizeof(guint32);
2155 break;
2156 case MARKER_ID_HEARTBEAT_64:
2157 //g_debug("Update Event heartbeat 64 bits");
2158 tscdata = (char*)(tf->event.data);
2159 tf->event.tsc = ltt_get_uint64(LTT_GET_BO(tf), tscdata);
2160 tf->buffer.tsc = tf->event.tsc;
2161 tf->event.event_time = ltt_interpolate_time(tf, &tf->event);
2162 size = ltt_align(size, sizeof(guint64), tf->has_alignment);
2163 size += sizeof(guint64);
2164 break;
2165 default:
2166 info = marker_get_info_from_id(tf->trace, tf->event.event_id);
2167 g_assert(info != NULL);
2168 if (info->size) {
2169 size = info->size;
2170 } else {
2171 /* Must compute the event size dynamically TODO */
2172
2173 }
2174 }
2175
2176 tf->event.data_size = size;
2177
2178 /* Check consistency between kernel and LTTV structure sizes */
2179 if(tf->event.event_size == 0xFFFF) {
2180 /* Event size too big to fit in the event size field */
2181 tf->event.event_size = tf->event.data_size;
2182 }
2183 if (tf->event.data_size != tf->event.event_size) {
2184 g_error("Kernel/LTTV event size differs for event %s.%s: kernel %u, LTTV %u",
2185 g_quark_to_string(f->name), g_quark_to_string(event_type->name),
2186 tf->event.event_size, tf->event.data_size);
2187 exit(-1);
2188 }
2189
2190 #if 0
2191 LttEventType *event_type =
2192 ltt_facility_eventtype_get(f, tf->event.event_id);
2193
2194 if(!event_type) {
2195 g_warning("Unknown event id %hhu in facility %s in tracefile %s",
2196 tf->event.event_id,
2197 g_quark_to_string(f->name),
2198 g_quark_to_string(tf->name));
2199 goto event_type_error;
2200 }
2201
2202 /* Compute the dynamic offsets */
2203 compute_offsets(tf, f, event_type, &size, tf->event.data);
2204
2205 //g_debug("Event root field : f.e %hhu.%hhu size %zd",
2206 // tf->event.facility_id,
2207 // tf->event.event_id, size);
2208
2209 no_offset:
2210 tf->event.data_size = size;
2211
2212 /* Check consistency between kernel and LTTV structure sizes */
2213 if(tf->event.event_size == 0xFFFF) {
2214 /* Event size too big to fit in the event size field */
2215 tf->event.event_size = tf->event.data_size;
2216 }
2217 if (tf->event.data_size != tf->event.event_size) {
2218 g_error("Kernel/LTTV event size differs for event %s.%s: kernel %u, LTTV %u",
2219 g_quark_to_string(f->name), g_quark_to_string(event_type->name),
2220 tf->event.event_size, tf->event.data_size);
2221 exit(-1);
2222 }
2223 //g_assert(tf->event.data_size == tf->event.event_size);
2224
2225 return;
2226
2227 event_type_error:
2228 event_id_error:
2229 if(tf->event.event_size == 0xFFFF) {
2230 g_error("Cannot jump over an unknown event bigger than 0xFFFE bytes");
2231 }
2232 /* The facility is unknown : use the kernel information about this event
2233 * to jump over it. */
2234 tf->event.data_size = tf->event.event_size;
2235 #endif //0
2236 }
2237
2238
2239 /* Take the tf current event offset and use the event facility id and event id
2240 * to figure out where is the next event offset.
2241 *
2242 * This is an internal function not aiming at being used elsewhere : it will
2243 * not jump over the current block limits. Please consider using
2244 * ltt_tracefile_read to do this.
2245 *
2246 * Returns 0 on success
2247 * ERANGE if we are at the end of the buffer.
2248 * ENOPROTOOPT if an error occured when getting the current event size.
2249 */
2250 static int ltt_seek_next_event(LttTracefile *tf)
2251 {
2252 int ret = 0;
2253 void *pos;
2254
2255 /* seek over the buffer header if we are at the buffer start */
2256 if(tf->event.offset == 0) {
2257 tf->event.offset += tf->buffer_header_size;
2258
2259 if(tf->event.offset == tf->buf_size - tf->buffer.lost_size) {
2260 ret = ERANGE;
2261 }
2262 goto found;
2263 }
2264
2265
2266 pos = tf->event.data;
2267
2268 if(tf->event.data_size < 0) goto error;
2269
2270 pos += (size_t)tf->event.data_size;
2271
2272 tf->event.offset = pos - tf->buffer.head;
2273
2274 if(tf->event.offset == tf->buf_size - tf->buffer.lost_size) {
2275 ret = ERANGE;
2276 goto found;
2277 }
2278 g_assert(tf->event.offset < tf->buf_size - tf->buffer.lost_size);
2279
2280 found:
2281 return ret;
2282
2283 error:
2284 g_error("Error in ltt_seek_next_event for tracefile %s",
2285 g_quark_to_string(tf->name));
2286 return ENOPROTOOPT;
2287 }
2288
2289 #if 0
2290 /*****************************************************************************
2291 *Function name
2292 * calc_nsecs_per_cycle : calculate nsecs per cycle for current block
2293 *
2294 * 1.0 / (freq(khz) *1000) * 1000000000
2295 *Input Params
2296 * t : tracefile
2297 ****************************************************************************/
2298 /* from timer_tsc.c */
2299 #define CYC2NS_SCALE_FACTOR 10
2300 static guint32 calc_nsecs_per_cycle(LttTracefile * tf)
2301 {
2302 //return 1e6 / (double)tf->buffer.freq;
2303 guint32 cpu_mhz = tf->buffer.freq / 1000;
2304 guint32 cyc2ns_scale = (1000 << CYC2NS_SCALE_FACTOR)/cpu_mhz;
2305
2306 return cyc2ns_scale;
2307 // return 1e6 / (double)tf->buffer.freq;
2308 }
2309
2310 static guint64 cycles_2_ns(LttTracefile *tf, guint64 cycles)
2311 {
2312 return (cycles * tf->buffer.cyc2ns_scale) >> CYC2NS_SCALE_FACTOR;
2313 }
2314 #endif //0
2315
2316 #if 0
2317 void setFieldsOffset(LttTracefile *tf, LttEventType *evT,void *evD)
2318 {
2319 LttField * rootFld = evT->root_field;
2320 // rootFld->base_address = evD;
2321
2322 if(likely(rootFld))
2323 rootFld->field_size = getFieldtypeSize(tf, evT->facility,
2324 evT, 0,0,rootFld, evD);
2325 }
2326 #endif //0
2327 #if 0
2328 /*****************************************************************************
2329 *Function name
2330 * set_fields_offsets : set the precomputable offset of the fields
2331 *Input params
2332 * tracefile : opened trace file
2333 * event_type : the event type
2334 ****************************************************************************/
2335
2336 void set_fields_offsets(LttTracefile *tf, LttEventType *event_type)
2337 {
2338 LttField *field = event_type->root_field;
2339 enum field_status fixed_root = FIELD_FIXED, fixed_parent = FIELD_FIXED;
2340
2341 if(likely(field))
2342 preset_field_type_size(tf, event_type, 0, 0,
2343 &fixed_root, &fixed_parent,
2344 field);
2345
2346 }
2347 #endif //0
2348
2349
2350 /*****************************************************************************
2351 *Function name
2352 * get_alignment : Get the alignment needed for a field.
2353 *Input params
2354 * field : field
2355 *
2356 * returns : The size on which it must be aligned.
2357 *
2358 ****************************************************************************/
2359 off_t get_alignment(LttField *field)
2360 {
2361 LttType *type = &field->field_type;
2362
2363 switch(type->type_class) {
2364 case LTT_INT_FIXED:
2365 case LTT_UINT_FIXED:
2366 case LTT_POINTER:
2367 case LTT_CHAR:
2368 case LTT_UCHAR:
2369 case LTT_SHORT:
2370 case LTT_USHORT:
2371 case LTT_INT:
2372 case LTT_UINT:
2373 case LTT_LONG:
2374 case LTT_ULONG:
2375 case LTT_SIZE_T:
2376 case LTT_SSIZE_T:
2377 case LTT_OFF_T:
2378 case LTT_FLOAT:
2379 case LTT_ENUM:
2380 /* Align offset on type size */
2381 g_assert(field->field_size != 0);
2382 return field->field_size;
2383 break;
2384 case LTT_STRING:
2385 return 1;
2386 break;
2387 case LTT_ARRAY:
2388 g_assert(type->fields->len == 1);
2389 {
2390 LttField *child = &g_array_index(type->fields, LttField, 0);
2391 return get_alignment(child);
2392 }
2393 break;
2394 case LTT_SEQUENCE:
2395 g_assert(type->fields->len == 2);
2396 {
2397 off_t localign = 1;
2398 LttField *child = &g_array_index(type->fields, LttField, 0);
2399
2400 localign = max(localign, get_alignment(child));
2401
2402 child = &g_array_index(type->fields, LttField, 1);
2403 localign = max(localign, get_alignment(child));
2404
2405 return localign;
2406 }
2407 break;
2408 case LTT_STRUCT:
2409 case LTT_UNION:
2410 {
2411 guint i;
2412 off_t localign = 1;
2413
2414 for(i=0; i<type->fields->len; i++) {
2415 LttField *child = &g_array_index(type->fields, LttField, i);
2416 localign = max(localign, get_alignment(child));
2417 }
2418 return localign;
2419 }
2420 break;
2421 case LTT_NONE:
2422 default:
2423 g_error("get_alignment : unknown type");
2424 return -1;
2425 }
2426 }
2427
2428 /*****************************************************************************
2429 *Function name
2430 * field_compute_static_size : Determine the size of fields known by their
2431 * sole definition. Unions, arrays and struct sizes might be known, but
2432 * the parser does not give that information.
2433 *Input params
2434 * tf : tracefile
2435 * field : field
2436 *
2437 ****************************************************************************/
2438
2439 void field_compute_static_size(LttFacility *fac, LttField *field)
2440 {
2441 LttType *type = &field->field_type;
2442
2443 switch(type->type_class) {
2444 case LTT_INT_FIXED:
2445 case LTT_UINT_FIXED:
2446 case LTT_POINTER:
2447 case LTT_CHAR:
2448 case LTT_UCHAR:
2449 case LTT_SHORT:
2450 case LTT_USHORT:
2451 case LTT_INT:
2452 case LTT_UINT:
2453 case LTT_LONG:
2454 case LTT_ULONG:
2455 case LTT_SIZE_T:
2456 case LTT_SSIZE_T:
2457 case LTT_OFF_T:
2458 case LTT_FLOAT:
2459 case LTT_ENUM:
2460 case LTT_STRING:
2461 /* nothing to do */
2462 break;
2463 case LTT_ARRAY:
2464 /* note this : array type size is the number of elements in the array,
2465 * while array field size of the length of the array in bytes */
2466 g_assert(type->fields->len == 1);
2467 {
2468 LttField *child = &g_array_index(type->fields, LttField, 0);
2469 field_compute_static_size(fac, child);
2470
2471 if(child->field_size != 0) {
2472 field->field_size = type->size * child->field_size;
2473 field->dynamic_offsets = g_array_sized_new(FALSE, TRUE,
2474 sizeof(off_t), type->size);
2475 } else {
2476 field->field_size = 0;
2477 }
2478 }
2479 break;
2480 case LTT_SEQUENCE:
2481 g_assert(type->fields->len == 2);
2482 {
2483 off_t local_offset = 0;
2484 LttField *child = &g_array_index(type->fields, LttField, 1);
2485 field_compute_static_size(fac, child);
2486 field->field_size = 0;
2487 type->size = 0;
2488 if(child->field_size != 0) {
2489 field->dynamic_offsets = g_array_sized_new(FALSE, TRUE,
2490 sizeof(off_t), SEQUENCE_AVG_ELEMENTS);
2491 }
2492 }
2493 break;
2494 case LTT_STRUCT:
2495 case LTT_UNION:
2496 {
2497 guint i;
2498 for(i=0;i<type->fields->len;i++) {
2499 LttField *child = &g_array_index(type->fields, LttField, i);
2500 field_compute_static_size(fac, child);
2501 if(child->field_size != 0) {
2502 type->size += ltt_align(type->size, get_alignment(child),
2503 fac->alignment);
2504 type->size += child->field_size;
2505 } else {
2506 /* As soon as we find a child with variable size, we have
2507 * a variable size */
2508 type->size = 0;
2509 break;
2510 }
2511 }
2512 field->field_size = type->size;
2513 }
2514 break;
2515 default:
2516 g_error("field_static_size : unknown type");
2517 }
2518
2519 }
2520
2521
2522
2523 /*****************************************************************************
2524 *Function name
2525 * precompute_fields_offsets : set the precomputable offset of the fields
2526 *Input params
2527 * fac : facility
2528 * field : the field
2529 * offset : pointer to the current offset, must be incremented
2530 *
2531 * return : 1 : found a variable length field, stop the processing.
2532 * 0 otherwise.
2533 ****************************************************************************/
2534
2535
2536 gint precompute_fields_offsets(LttFacility *fac, LttField *field, off_t *offset, gint is_compact)
2537 {
2538 LttType *type = &field->field_type;
2539
2540 if(unlikely(is_compact)) {
2541 g_assert(field->field_size != 0);
2542 /* FIXME THIS IS A HUUUUUGE hack :
2543 * offset is between the compact_data field in struct LttEvent
2544 * and the address of the field root in the memory map.
2545 * ark. Both will stay at the same addresses while the event
2546 * is readable, so it's ok.
2547 */
2548 field->offset_root = 0;
2549 field->fixed_root = FIELD_FIXED;
2550 return 0;
2551 }
2552
2553 switch(type->type_class) {
2554 case LTT_INT_FIXED:
2555 case LTT_UINT_FIXED:
2556 case LTT_POINTER:
2557 case LTT_CHAR:
2558 case LTT_UCHAR:
2559 case LTT_SHORT:
2560 case LTT_USHORT:
2561 case LTT_INT:
2562 case LTT_UINT:
2563 case LTT_LONG:
2564 case LTT_ULONG:
2565 case LTT_SIZE_T:
2566 case LTT_SSIZE_T:
2567 case LTT_OFF_T:
2568 case LTT_FLOAT:
2569 case LTT_ENUM:
2570 g_assert(field->field_size != 0);
2571 /* Align offset on type size */
2572 *offset += ltt_align(*offset, get_alignment(field),
2573 fac->alignment);
2574 /* remember offset */
2575 field->offset_root = *offset;
2576 field->fixed_root = FIELD_FIXED;
2577 /* Increment offset */
2578 *offset += field->field_size;
2579 return 0;
2580 break;
2581 case LTT_STRING:
2582 field->offset_root = *offset;
2583 field->fixed_root = FIELD_FIXED;
2584 return 1;
2585 break;
2586 case LTT_ARRAY:
2587 g_assert(type->fields->len == 1);
2588 {
2589 LttField *child = &g_array_index(type->fields, LttField, 0);
2590
2591 *offset += ltt_align(*offset, get_alignment(field),
2592 fac->alignment);
2593
2594 /* remember offset */
2595 field->offset_root = *offset;
2596 field->array_offset = *offset;
2597 field->fixed_root = FIELD_FIXED;
2598
2599 /* Let the child be variable */
2600 //precompute_fields_offsets(tf, child, offset);
2601
2602 if(field->field_size != 0) {
2603 /* Increment offset */
2604 /* field_size is the array size in bytes */
2605 *offset += field->field_size;
2606 return 0;
2607 } else {
2608 return 1;
2609 }
2610 }
2611 break;
2612 case LTT_SEQUENCE:
2613 g_assert(type->fields->len == 2);
2614 {
2615 LttField *child;
2616 guint ret;
2617
2618 *offset += ltt_align(*offset, get_alignment(field),
2619 fac->alignment);
2620
2621 /* remember offset */
2622 field->offset_root = *offset;
2623 field->fixed_root = FIELD_FIXED;
2624
2625 child = &g_array_index(type->fields, LttField, 0);
2626 ret = precompute_fields_offsets(fac, child, offset, is_compact);
2627 g_assert(ret == 0); /* Seq len cannot have variable len */
2628
2629 child = &g_array_index(type->fields, LttField, 1);
2630 *offset += ltt_align(*offset, get_alignment(child),
2631 fac->alignment);
2632 field->array_offset = *offset;
2633 /* Let the child be variable. */
2634 //ret = precompute_fields_offsets(fac, child, offset);
2635
2636 /* Cannot precompute fields offsets of sequence members, and has
2637 * variable length. */
2638 return 1;
2639 }
2640 break;
2641 case LTT_STRUCT:
2642 {
2643 LttField *child;
2644 guint i;
2645 gint ret=0;
2646
2647 *offset += ltt_align(*offset, get_alignment(field),
2648 fac->alignment);
2649 /* remember offset */
2650 field->offset_root = *offset;
2651 field->fixed_root = FIELD_FIXED;
2652
2653 for(i=0; i< type->fields->len; i++) {
2654 child = &g_array_index(type->fields, LttField, i);
2655 ret = precompute_fields_offsets(fac, child, offset, is_compact);
2656
2657 if(ret) break;
2658 }
2659 return ret;
2660 }
2661 break;
2662 case LTT_UNION:
2663 {
2664 LttField *child;
2665 guint i;
2666 gint ret=0;
2667
2668 *offset += ltt_align(*offset, get_alignment(field),
2669 fac->alignment);
2670 /* remember offset */
2671 field->offset_root = *offset;
2672 field->fixed_root = FIELD_FIXED;
2673
2674 for(i=0; i< type->fields->len; i++) {
2675 *offset = field->offset_root;
2676 child = &g_array_index(type->fields, LttField, i);
2677 ret = precompute_fields_offsets(fac, child, offset, is_compact);
2678
2679 if(ret) break;
2680 }
2681 *offset = field->offset_root + field->field_size;
2682 return ret;
2683 }
2684
2685 break;
2686 case LTT_NONE:
2687 default:
2688 g_error("precompute_fields_offsets : unknown type");
2689 return 1;
2690 }
2691
2692 }
2693
2694
2695 /*****************************************************************************
2696 *Function name
2697 * precompute_offsets : set the precomputable offset of an event type
2698 *Input params
2699 * tf : tracefile
2700 * event : event type
2701 *
2702 ****************************************************************************/
2703 void precompute_offsets(LttFacility *fac, LttEventType *event)
2704 {
2705 guint i;
2706 off_t offset = 0;
2707 gint ret;
2708
2709 /* First, compute the size of fixed size fields. Will determine size for
2710 * arrays, struct and unions, which is not done by the parser */
2711 for(i=0; i<event->fields->len; i++) {
2712 LttField *field = &g_array_index(event->fields, LttField, i);
2713 field_compute_static_size(fac, field);
2714 }
2715
2716 /* Precompute all known offsets */
2717 for(i=0; i<event->fields->len; i++) {
2718 LttField *field = &g_array_index(event->fields, LttField, i);
2719 if(event->has_compact_data && i == 0)
2720 ret = precompute_fields_offsets(fac, field, &offset, 1);
2721 else
2722 ret = precompute_fields_offsets(fac, field, &offset, 0);
2723 if(ret) break;
2724 }
2725 }
2726
2727
2728
2729
2730 /*****************************************************************************
2731 *Function name
2732 * preset_field_type_size : set the fixed sizes of the field type
2733 *Input params
2734 * tf : tracefile
2735 * event_type : event type
2736 * offset_root : offset from the root
2737 * offset_parent : offset from the parent
2738 * fixed_root : Do we know a fixed offset to the root ?
2739 * fixed_parent : Do we know a fixed offset to the parent ?
2740 * field : field
2741 ****************************************************************************/
2742
2743
2744
2745 // preset the fixed size offsets. Calculate them just like genevent-new : an
2746 // increment of a *to value that represents the offset from the start of the
2747 // event data.
2748 // The preset information is : offsets up to (and including) the first element
2749 // of variable size. All subsequent fields must be flagged "VARIABLE OFFSET".
2750 #if 0
2751 void preset_field_type_size(LttTracefile *tf, LttEventType *event_type,
2752 off_t offset_root, off_t offset_parent,
2753 enum field_status *fixed_root, enum field_status *fixed_parent,
2754 LttField *field)
2755 {
2756 enum field_status local_fixed_root, local_fixed_parent;
2757 guint i;
2758 LttType *type;
2759
2760 g_assert(field->fixed_root == FIELD_UNKNOWN);
2761 g_assert(field->fixed_parent == FIELD_UNKNOWN);
2762 g_assert(field->fixed_size == FIELD_UNKNOWN);
2763
2764 type = field->field_type;
2765
2766 field->fixed_root = *fixed_root;
2767 if(field->fixed_root == FIELD_FIXED)
2768 field->offset_root = offset_root;
2769 else
2770 field->offset_root = 0;
2771
2772 field->fixed_parent = *fixed_parent;
2773 if(field->fixed_parent == FIELD_FIXED)
2774 field->offset_parent = offset_parent;
2775 else
2776 field->offset_parent = 0;
2777
2778 size_t current_root_offset;
2779 size_t current_offset;
2780 enum field_status current_child_status, final_child_status;
2781 size_t max_size;
2782
2783 switch(type->type_class) {
2784 case LTT_INT_FIXED:
2785 case LTT_UINT_FIXED:
2786 case LTT_CHAR:
2787 case LTT_UCHAR:
2788 case LTT_SHORT:
2789 case LTT_USHORT:
2790 case LTT_INT:
2791 case LTT_UINT:
2792 case LTT_FLOAT:
2793 case LTT_ENUM:
2794 field->field_size = ltt_type_size(tf->trace, type);
2795 field->fixed_size = FIELD_FIXED;
2796 break;
2797 case LTT_POINTER:
2798 field->field_size = (off_t)event_type->facility->pointer_size;
2799 field->fixed_size = FIELD_FIXED;
2800 break;
2801 case LTT_LONG:
2802 case LTT_ULONG:
2803 field->field_size = (off_t)event_type->facility->long_size;
2804 field->fixed_size = FIELD_FIXED;
2805 break;
2806 case LTT_SIZE_T:
2807 case LTT_SSIZE_T:
2808 case LTT_OFF_T:
2809 field->field_size = (off_t)event_type->facility->size_t_size;
2810 field->fixed_size = FIELD_FIXED;
2811 break;
2812 case LTT_SEQUENCE:
2813 local_fixed_root = FIELD_VARIABLE;
2814 local_fixed_parent = FIELD_VARIABLE;
2815 preset_field_type_size(tf, event_type,
2816 0, 0,
2817 &local_fixed_root, &local_fixed_parent,
2818 field->child[0]);
2819 field->fixed_size = FIELD_VARIABLE;
2820 field->field_size = 0;
2821 *fixed_root = FIELD_VARIABLE;
2822 *fixed_parent = FIELD_VARIABLE;
2823 break;
2824 case LTT_STRING:
2825 field->fixed_size = FIELD_VARIABLE;
2826 field->field_size = 0;
2827 *fixed_root = FIELD_VARIABLE;
2828 *fixed_parent = FIELD_VARIABLE;
2829 break;
2830 case LTT_ARRAY:
2831 local_fixed_root = FIELD_VARIABLE;
2832 local_fixed_parent = FIELD_VARIABLE;
2833 preset_field_type_size(tf, event_type,
2834 0, 0,
2835 &local_fixed_root, &local_fixed_parent,
2836 field->child[0]);
2837 field->fixed_size = field->child[0]->fixed_size;
2838 if(field->fixed_size == FIELD_FIXED) {
2839 field->field_size = type->element_number * field->child[0]->field_size;
2840 } else {
2841 field->field_size = 0;
2842 *fixed_root = FIELD_VARIABLE;
2843 *fixed_parent = FIELD_VARIABLE;
2844 }
2845 break;
2846 case LTT_STRUCT:
2847 current_root_offset = field->offset_root;
2848 current_offset = 0;
2849 current_child_status = FIELD_FIXED;
2850 for(i=0;i<type->element_number;i++) {
2851 preset_field_type_size(tf, event_type,
2852 current_root_offset, current_offset,
2853 fixed_root, &current_child_status,
2854 field->child[i]);
2855 if(current_child_status == FIELD_FIXED) {
2856 current_root_offset += field->child[i]->field_size;
2857 current_offset += field->child[i]->field_size;
2858 } else {
2859 current_root_offset = 0;
2860 current_offset = 0;
2861 }
2862 }
2863 if(current_child_status != FIELD_FIXED) {
2864 *fixed_parent = current_child_status;
2865 field->field_size = 0;
2866 field->fixed_size = current_child_status;
2867 } else {
2868 field->field_size = current_offset;
2869 field->fixed_size = FIELD_FIXED;
2870 }
2871 break;
2872 case LTT_UNION:
2873 current_root_offset = field->offset_root;
2874 current_offset = 0;
2875 max_size = 0;
2876 final_child_status = FIELD_FIXED;
2877 for(i=0;i<type->element_number;i++) {
2878 enum field_status current_root_child_status = FIELD_FIXED;
2879 enum field_status current_child_status = FIELD_FIXED;
2880 preset_field_type_size(tf, event_type,
2881 current_root_offset, current_offset,
2882 &current_root_child_status, &current_child_status,
2883 field->child[i]);
2884 if(current_child_status != FIELD_FIXED)
2885 final_child_status = current_child_status;
2886 else
2887 max_size = max(max_size, field->child[i]->field_size);
2888 }
2889 if(final_child_status != FIELD_FIXED) {
2890 g_error("LTTV does not support variable size fields in unions.");
2891 /* This will stop the application. */
2892 *fixed_root = final_child_status;
2893 *fixed_parent = final_child_status;
2894 field->field_size = 0;
2895 field->fixed_size = current_child_status;
2896 } else {
2897 field->field_size = max_size;
2898 field->fixed_size = FIELD_FIXED;
2899 }
2900 break;
2901 case LTT_NONE:
2902 g_error("unexpected type NONE");
2903 break;
2904 }
2905
2906 }
2907 #endif //0
2908
2909 /*****************************************************************************
2910 *Function name
2911 * check_fields_compatibility : Check for compatibility between two fields :
2912 * do they use the same inner structure ?
2913 *Input params
2914 * event_type1 : event type
2915 * event_type2 : event type
2916 * field1 : field
2917 * field2 : field
2918 *Returns : 0 if identical
2919 * 1 if not.
2920 ****************************************************************************/
2921 // this function checks for equality of field types. Therefore, it does not use
2922 // per se offsets. For instance, an aligned version of a structure is
2923 // compatible with an unaligned version of the same structure.
2924 gint check_fields_compatibility(LttEventType *event_type1,
2925 LttEventType *event_type2,
2926 LttField *field1, LttField *field2)
2927 {
2928 guint different = 0;
2929 LttType *type1;
2930 LttType *type2;
2931
2932 if(field1 == NULL) {
2933 if(field2 == NULL) goto end;
2934 else {
2935 different = 1;
2936 goto end;
2937 }
2938 } else if(field2 == NULL) {
2939 different = 1;
2940 goto end;
2941 }
2942
2943 type1 = &field1->field_type;
2944 type2 = &field2->field_type;
2945
2946 if(type1->type_class != type2->type_class) {
2947 different = 1;
2948 goto end;
2949 }
2950 if(type1->network != type2->network) {
2951 different = 1;
2952 goto end;
2953 }
2954
2955 switch(type1->type_class) {
2956 case LTT_INT_FIXED:
2957 case LTT_UINT_FIXED:
2958 case LTT_POINTER:
2959 case LTT_CHAR:
2960 case LTT_UCHAR:
2961 case LTT_SHORT:
2962 case LTT_USHORT:
2963 case LTT_INT:
2964 case LTT_UINT:
2965 case LTT_LONG:
2966 case LTT_ULONG:
2967 case LTT_SIZE_T:
2968 case LTT_SSIZE_T:
2969 case LTT_OFF_T:
2970 case LTT_FLOAT:
2971 case LTT_ENUM:
2972 if(field1->field_size != field2->field_size)
2973 different = 1;
2974 break;
2975 case LTT_STRING:
2976 break;
2977 case LTT_ARRAY:
2978 {
2979 LttField *child1 = &g_array_index(type1->fields, LttField, 0);
2980 LttField *child2 = &g_array_index(type2->fields, LttField, 0);
2981
2982 if(type1->size != type2->size)
2983 different = 1;
2984 if(check_fields_compatibility(event_type1, event_type2, child1, child2))
2985 different = 1;
2986 }
2987 break;
2988 case LTT_SEQUENCE:
2989 {
2990 LttField *child1 = &g_array_index(type1->fields, LttField, 1);
2991 LttField *child2 = &g_array_index(type2->fields, LttField, 1);
2992
2993 if(check_fields_compatibility(event_type1, event_type2, child1, child2))
2994 different = 1;
2995 }
2996 break;
2997 case LTT_STRUCT:
2998 case LTT_UNION:
2999 {
3000 LttField *child;
3001 guint i;
3002
3003 if(type1->fields->len != type2->fields->len) {
3004 different = 1;
3005 goto end;
3006 }
3007
3008 for(i=0; i< type1->fields->len; i++) {
3009 LttField *child1;
3010 LttField *child2;
3011 child1 = &g_array_index(type1->fields, LttField, i);
3012 child2 = &g_array_index(type2->fields, LttField, i);
3013 different = check_fields_compatibility(event_type1,
3014 event_type2, child1, child2);
3015
3016 if(different) break;
3017 }
3018 }
3019 break;
3020 case LTT_NONE:
3021 default:
3022 g_error("check_fields_compatibility : unknown type");
3023 }
3024
3025 end:
3026 return different;
3027 }
3028
3029
3030 #if 0
3031 gint check_fields_compatibility(LttEventType *event_type1,
3032 LttEventType *event_type2,
3033 LttField *field1, LttField *field2)
3034 {
3035 guint different = 0;
3036 guint i;
3037 LttType *type1;
3038 LttType *type2;
3039
3040 if(field1 == NULL) {
3041 if(field2 == NULL) goto end;
3042 else {
3043 different = 1;
3044 goto end;
3045 }
3046 } else if(field2 == NULL) {
3047 different = 1;
3048 goto end;
3049 }
3050
3051 g_assert(field1->fixed_root != FIELD_UNKNOWN);
3052 g_assert(field2->fixed_root != FIELD_UNKNOWN);
3053 g_assert(field1->fixed_parent != FIELD_UNKNOWN);
3054 g_assert(field2->fixed_parent != FIELD_UNKNOWN);
3055 g_assert(field1->fixed_size != FIELD_UNKNOWN);
3056 g_assert(field2->fixed_size != FIELD_UNKNOWN);
3057
3058 type1 = field1->field_type;
3059 type2 = field2->field_type;
3060
3061 if(type1->type_class != type2->type_class) {
3062 different = 1;
3063 goto end;
3064 }
3065 if(type1->element_name != type2->element_name) {
3066 different = 1;
3067 goto end;
3068 }
3069
3070 switch(type1->type_class) {
3071 case LTT_INT_FIXED:
3072 case LTT_UINT_FIXED:
3073 case LTT_POINTER:
3074 case LTT_CHAR:
3075 case LTT_UCHAR:
3076 case LTT_SHORT:
3077 case LTT_USHORT:
3078 case LTT_INT:
3079 case LTT_UINT:
3080 case LTT_FLOAT:
3081 case LTT_POINTER:
3082 case LTT_LONG:
3083 case LTT_ULONG:
3084 case LTT_SIZE_T:
3085 case LTT_SSIZE_T:
3086 case LTT_OFF_T:
3087 if(field1->field_size != field2->field_size) {
3088 different = 1;
3089 goto end;
3090 }
3091 break;
3092 case LTT_ENUM:
3093 if(type1->element_number != type2->element_number) {
3094 different = 1;
3095 goto end;
3096 }
3097 for(i=0;i<type1->element_number;i++) {
3098 if(type1->enum_strings[i] != type2->enum_strings[i]) {
3099 different = 1;
3100 goto end;
3101 }
3102 }
3103 break;
3104 case LTT_SEQUENCE:
3105 /* Two elements : size and child */
3106 g_assert(type1->element_number != type2->element_number);
3107 for(i=0;i<type1->element_number;i++) {
3108 if(check_fields_compatibility(event_type1, event_type2,
3109 field1->child[0], field2->child[0])) {
3110 different = 1;
3111 goto end;
3112 }
3113 }
3114 break;
3115 case LTT_STRING:
3116 break;
3117 case LTT_ARRAY:
3118 if(field1->field_size != field2->field_size) {
3119 different = 1;
3120 goto end;
3121 }
3122 /* Two elements : size and child */
3123 g_assert(type1->element_number != type2->element_number);
3124 for(i=0;i<type1->element_number;i++) {
3125 if(check_fields_compatibility(event_type1, event_type2,
3126 field1->child[0], field2->child[0])) {
3127 different = 1;
3128 goto end;
3129 }
3130 }
3131 break;
3132 case LTT_STRUCT:
3133 case LTT_UNION:
3134 if(type1->element_number != type2->element_number) {
3135 different = 1;
3136 break;
3137 }
3138 for(i=0;i<type1->element_number;i++) {
3139 if(check_fields_compatibility(event_type1, event_type2,
3140 field1->child[0], field2->child[0])) {
3141 different = 1;
3142 goto end;
3143 }
3144 }
3145 break;
3146 }
3147 end:
3148 return different;
3149 }
3150 #endif //0
3151
3152
3153 /*****************************************************************************
3154 *Function name
3155 * ltt_get_int : get an integer number
3156 *Input params
3157 * reverse_byte_order: must we reverse the byte order ?
3158 * size : the size of the integer
3159 * ptr : the data pointer
3160 *Return value
3161 * gint64 : a 64 bits integer
3162 ****************************************************************************/
3163
3164 gint64 ltt_get_int(gboolean reverse_byte_order, gint size, void *data)
3165 {
3166 gint64 val;
3167
3168 switch(size) {
3169 case 1: val = *((gint8*)data); break;
3170 case 2: val = ltt_get_int16(reverse_byte_order, data); break;
3171 case 4: val = ltt_get_int32(reverse_byte_order, data); break;
3172 case 8: val = ltt_get_int64(reverse_byte_order, data); break;
3173 default: val = ltt_get_int64(reverse_byte_order, data);
3174 g_critical("get_int : integer size %d unknown", size);
3175 break;
3176 }
3177
3178 return val;
3179 }
3180
3181 /*****************************************************************************
3182 *Function name
3183 * ltt_get_uint : get an unsigned integer number
3184 *Input params
3185 * reverse_byte_order: must we reverse the byte order ?
3186 * size : the size of the integer
3187 * ptr : the data pointer
3188 *Return value
3189 * guint64 : a 64 bits unsigned integer
3190 ****************************************************************************/
3191
3192 guint64 ltt_get_uint(gboolean reverse_byte_order, gint size, void *data)
3193 {
3194 guint64 val;
3195
3196 switch(size) {
3197 case 1: val = *((gint8*)data); break;
3198 case 2: val = ltt_get_uint16(reverse_byte_order, data); break;
3199 case 4: val = ltt_get_uint32(reverse_byte_order, data); break;
3200 case 8: val = ltt_get_uint64(reverse_byte_order, data); break;
3201 default: val = ltt_get_uint64(reverse_byte_order, data);
3202 g_critical("get_uint : unsigned integer size %d unknown",
3203 size);
3204 break;
3205 }
3206
3207 return val;
3208 }
3209
3210
3211 /* get the node name of the system */
3212
3213 char * ltt_trace_system_description_node_name (LttSystemDescription * s)
3214 {
3215 return s->node_name;
3216 }
3217
3218
3219 /* get the domain name of the system */
3220
3221 char * ltt_trace_system_description_domain_name (LttSystemDescription * s)
3222 {
3223 return s->domain_name;
3224 }
3225
3226
3227 /* get the description of the system */
3228
3229 char * ltt_trace_system_description_description (LttSystemDescription * s)
3230 {
3231 return s->description;
3232 }
3233
3234
3235 /* get the NTP corrected start time of the trace */
3236 LttTime ltt_trace_start_time(LttTrace *t)
3237 {
3238 return t->start_time;
3239 }
3240
3241 /* get the monotonic start time of the trace */
3242 LttTime ltt_trace_start_time_monotonic(LttTrace *t)
3243 {
3244 return t->start_time_from_tsc;
3245 }
3246
3247 LttTracefile *ltt_tracefile_new()
3248 {
3249 return g_new(LttTracefile, 1);
3250 }
3251
3252 void ltt_tracefile_destroy(LttTracefile *tf)
3253 {
3254 g_free(tf);
3255 }
3256
3257 void ltt_tracefile_copy(LttTracefile *dest, const LttTracefile *src)
3258 {
3259 *dest = *src;
3260 }
3261
3262 /* Before library loading... */
3263
3264 static void __attribute__((constructor)) init(void)
3265 {
3266 LTT_FACILITY_NAME_HEARTBEAT = g_quark_from_string("heartbeat");
3267 LTT_EVENT_NAME_HEARTBEAT = g_quark_from_string("heartbeat");
3268 LTT_EVENT_NAME_HEARTBEAT_FULL = g_quark_from_string("heartbeat_full");
3269
3270 LTT_TRACEFILE_NAME_FACILITIES = g_quark_from_string("/control/facilities");
3271 }
3272
This page took 0.096452 seconds and 4 git commands to generate.