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