aboutsummaryrefslogtreecommitdiffstats
path: root/src/tools/g2/main.c
blob: a782e17f2ef51bfacc3bbe0e785751ae4889a24e (plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
/* 
 *------------------------------------------------------------------
 * Copyright (c) 2005-2016 Cisco and/or its affiliates.
 * Licensed under the Apache License, Version 2.0 (the "License");
 * you may not use this file except in compliance with the License.
 * You may obtain a copy of the License at:
 *
 *     http://www.apache.org/licenses/LICENSE-2.0
 *
 * Unless required by applicable law or agreed to in writing, software
 * distributed under the License is distributed on an "AS IS" BASIS,
 * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
 * See the License for the specific language governing permissions and
 * limitations under the License.
 */

#include "g2.h"
#include "props.h"
#include <pwd.h>
#include <strings.h>
#include <stdlib.h>
#include <unistd.h>
#include <string.h>

/*
 * globals
 */

GtkWidget *g_mainwindow;        /* The main window */

/* Graphical object heirarchy
 *
 * [main window]
 *   [main vbox]
 *     [main (e.g. file) menubar]
 *     [view hbox] 
 *     [view bottom menu]
 */

GtkWidget *g_mainvbox;
GtkWidget *g_mainhbox;

gint delete_event(GtkWidget *widget, GdkEvent *event, gpointer data)
{
    /* Allow window to be destroyed */
    return(FALSE);
}

void destroy(GtkWidget *widget, gpointer data)
{
    gtk_main_quit();
}

int main (int argc, char **argv)
{
    char tmpbuf [128];
    struct passwd *pw;
    char *event_file = 0;
    char *cpel_file = 0;
    char *clib_file =0;
    char *title = "none";
    int curarg=1;
    char *homedir;
    
    gtk_init(&argc, &argv);

    homedir = getenv ("HOME");
    tmpbuf[0] = 0;

    if (homedir) {
        sprintf(tmpbuf, "%s/.g2", homedir);
    } else {
        pw = getpwuid(geteuid());
        if (pw) {
            sprintf(tmpbuf, "%s/.g2", pw->pw_dir);
        }
    }
    if (tmpbuf[0])
        readprops(tmpbuf);

    g_mainwindow = gtk_window_new (GTK_WINDOW_TOPLEVEL);

    gtk_signal_connect (GTK_OBJECT(g_mainwindow), "delete_event",
                        GTK_SIGNAL_FUNC (delete_event), NULL);

    gtk_signal_connect (GTK_OBJECT(g_mainwindow), "destroy",
                        GTK_SIGNAL_FUNC (destroy), NULL);

    gtk_container_set_border_width(GTK_CONTAINER(g_mainwindow), 5);

    g_mainvbox = gtk_vbox_new(FALSE, 0);
    g_mainhbox = gtk_hbox_new(FALSE, 0);

    /* 
     * init routines
     */

    menu1_init();
    point_selector_init();
    view1_init();
    event_init();

    /* 
     * Now that we're ready to rock 'n roll, see if we've been asked to
     * press a few buttons...
     */
    
    while (curarg < argc) {
        if (!strncmp(argv[curarg], "--cpel-input", 4)) {
            curarg++;
            if (curarg < argc) {
                cpel_file = argv[curarg];
                curarg++;
                break;
            }
            g_error("Missing filename after --cpel-input");
        }
        if (!strncmp(argv[curarg], "--clib-input", 4)) {
            curarg++;
            if (curarg < argc) {
                clib_file = argv[curarg];
                curarg++;
                break;
            }
            g_error("Missing filename after --cpel-input");
        }

        if (!strncmp(argv[curarg], "--pointdefs", 3)) {
            curarg++;
            if (curarg < argc) {
                read_event_definitions(argv[curarg]);
                curarg++;
                continue;
            }
            g_error ("Missing filename after --pointdefs\n");
        }
        if (!strncmp(argv[curarg], "--event-log", 3)) {
            curarg++;
            if (curarg < argc) {
                event_file = argv[curarg];
                curarg++;
                continue;
            }
            g_error ("Missing filename after --event-log\n");
        }

        if (!strncmp(argv[curarg], "--ticks-per-us", 3)) {
            curarg++;
            if (curarg < argc) {
                ticks_per_ns = 0.0;
                ticks_per_ns = atof(argv[curarg]);
                if (ticks_per_ns == 0.0) {
                    g_error("ticks-per-ns (%s) didn't convert properly\n",
                            argv[curarg]);
                }
                ticks_per_ns_set = TRUE;
                curarg++;
                continue;
            }
            g_error ("Missing filename after --event-log\n");
        }

        fprintf(stderr, 
                "g2 [--pointdefs <filename>] [--event-log <filename>]\n");
        fprintf(stderr, "   [--ticks-per-us <value>]\n");
        fprintf(stderr, 
                "   [--cpel-input <filename>] [--clib-input <filename]>\n");
        fprintf(stderr, 
                "%s\n%s\n", version_string, minor_v_string);
        exit(0);
    }

    if (clib_file) {
        read_clib_file (clib_file);
        title = clib_file;
    } else if (cpel_file) {
        read_cpel_file(cpel_file);
        title = cpel_file;
    } else if (event_file) {
        read_events(event_file);
        title = event_file;
    }

    set_window_title(title);

    gtk_signal_connect (GTK_OBJECT (g_mainwindow), "key_press_event",
                        (GtkSignalFunc) view1_handle_key_press_event, NULL);
    gtk_container_add(GTK_CONTAINER(g_mainvbox), g_mainhbox);
    gtk_widget_show(g_mainhbox);
    gtk_container_add(GTK_CONTAINER(g_mainwindow), g_mainvbox);
    gtk_widget_show(g_mainvbox);
    gtk_widget_show(g_mainwindow);

    gtk_main();
    return(0);
}
an> return ret; } /** Number of elements in pool vector. @note You probably want to call pool_elts() instead. */ #define pool_len(p) vec_len(p) /** Number of elements in pool vector (usable as an lvalue) @note You probably don't want to use this macro. */ #define _pool_len(p) _vec_len(p) /** Memory usage of pool header. */ always_inline uword pool_header_bytes (void *v) { pool_header_t *p = pool_header (v); if (!v) return 0; return vec_bytes (p->free_bitmap) + vec_bytes (p->free_indices); } /** Memory usage of pool. */ #define pool_bytes(P) (vec_bytes (P) + pool_header_bytes (P)) /** Local variable naming macro. */ #define _pool_var(v) _pool_##v /** Queries whether pool has at least N_FREE free elements. */ always_inline uword pool_free_elts (void *v) { pool_header_t *p = pool_header (v); uword n_free = 0; if (v) { n_free += vec_len (p->free_indices); /* Space left at end of vector? */ n_free += vec_capacity (v, sizeof (p[0])) - vec_len (v); } return n_free; } /** Allocate an object E from a pool P (general version). First search free list. If nothing is free extend vector of objects. */ #define pool_get_aligned(P,E,A) \ do { \ pool_header_t * _pool_var (p) = pool_header (P); \ uword _pool_var (l); \ \ STATIC_ASSERT(A==0 || ((A % sizeof(P[0]))==0) || ((sizeof(P[0]) % A) == 0), \ "Pool aligned alloc of incorrectly sized object"); \ _pool_var (l) = 0; \ if (P) \ _pool_var (l) = vec_len (_pool_var (p)->free_indices); \ \ if (_pool_var (l) > 0) \ { \ /* Return free element from free list. */ \ uword _pool_var (i) = _pool_var (p)->free_indices[_pool_var (l) - 1]; \ (E) = (P) + _pool_var (i); \ _pool_var (p)->free_bitmap = \ clib_bitmap_andnoti_notrim (_pool_var (p)->free_bitmap, \ _pool_var (i)); \ _vec_len (_pool_var (p)->free_indices) = _pool_var (l) - 1; \ } \ else \ { \ /* fixed-size, preallocated pools cannot expand */ \ if ((P) && _pool_var(p)->max_elts) \ { \ clib_warning ("can't expand fixed-size pool"); \ os_out_of_memory(); \ } \ /* Nothing on free list, make a new element and return it. */ \ P = _vec_resize (P, \ /* length_increment */ 1, \ /* new size */ (vec_len (P) + 1) * sizeof (P[0]), \ pool_aligned_header_bytes, \ /* align */ (A)); \ E = vec_end (P) - 1; \ } \ } while (0) /** Allocate an object E from a pool P (unspecified alignment). */ #define pool_get(P,E) pool_get_aligned(P,E,0) /** See if pool_get will expand the pool or not */ #define pool_get_aligned_will_expand(P,YESNO,A) \ do { \ pool_header_t * _pool_var (p) = pool_header (P); \ uword _pool_var (l); \ \ _pool_var (l) = 0; \ if (P) \ { \ if (_pool_var (p)->max_elts) \ _pool_var (l) = _pool_var (p)->max_elts; \ else \ _pool_var (l) = vec_len (_pool_var (p)->free_indices); \ } \ \ /* Free elements, certainly won't expand */ \ if (_pool_var (l) > 0) \ YESNO=0; \ else \ { \ /* Nothing on free list, make a new element and return it. */ \ YESNO = _vec_resize_will_expand \ (P, \ /* length_increment */ 1, \ /* new size */ (vec_len (P) + 1) * sizeof (P[0]), \ pool_aligned_header_bytes, \ /* align */ (A)); \ } \ } while (0) #define pool_get_will_expand(P,YESNO) pool_get_aligned_will_expand(P,YESNO,0) /** Use free bitmap to query whether given element is free. */ #define pool_is_free(P,E) \ ({ \ pool_header_t * _pool_var (p) = pool_header (P); \ uword _pool_var (i) = (E) - (P); \ (_pool_var (i) < vec_len (P)) ? clib_bitmap_get (_pool_var (p)->free_bitmap, _pool_i) : 1; \ }) /** Use free bitmap to query whether given index is free */ #define pool_is_free_index(P,I) pool_is_free((P),(P)+(I)) /** Free an object E in pool P. */ #define pool_put(P,E) \ do { \ pool_header_t * _pool_var (p) = pool_header (P); \ uword _pool_var (l) = (E) - (P); \ ASSERT (vec_is_member (P, E)); \ ASSERT (! pool_is_free (P, E)); \ \ /* Add element to free bitmap and to free list. */ \ _pool_var (p)->free_bitmap = \ clib_bitmap_ori_notrim (_pool_var (p)->free_bitmap, \ _pool_var (l)); \ \ /* Preallocated pool? */ \ if (_pool_var (p)->max_elts) \ { \ ASSERT(_pool_var(l) < _pool_var (p)->max_elts); \ _pool_var(p)->free_indices[_vec_len(_pool_var(p)->free_indices)] = \ _pool_var(l); \ _vec_len(_pool_var(p)->free_indices) += 1; \ } \ else \ vec_add1 (_pool_var (p)->free_indices, _pool_var (l)); \ } while (0) /** Free pool element with given index. */ #define pool_put_index(p,i) \ do { \ typeof (p) _e = (p) + (i); \ pool_put (p, _e); \ } while (0) /** Allocate N more free elements to pool (general version). */ #define pool_alloc_aligned(P,N,A) \ do { \ pool_header_t * _p; \ \ if ((P)) \ { \ _p = pool_header (P); \ if (_p->max_elts) \ { \ clib_warning ("Can't expand fixed-size pool"); \ os_out_of_memory(); \ } \ } \ \ (P) = _vec_resize ((P), 0, (vec_len (P) + (N)) * sizeof (P[0]), \ pool_aligned_header_bytes, \ (A)); \ _p = pool_header (P); \ vec_resize (_p->free_indices, (N)); \ _vec_len (_p->free_indices) -= (N); \ } while (0) /** Allocate N more free elements to pool (unspecified alignment). */ #define pool_alloc(P,N) pool_alloc_aligned(P,N,0) /** Low-level free pool operator (do not call directly). */ always_inline void * _pool_free (void *v) { pool_header_t *p = pool_header (v); if (!v) return v; clib_bitmap_free (p->free_bitmap); if (p->max_elts) { int rv; rv = munmap (p->mmap_base, p->mmap_size); if (rv) clib_unix_warning ("munmap"); } else { vec_free (p->free_indices); vec_free_h (v, pool_aligned_header_bytes); } return 0; } /** Free a pool. */ #define pool_free(p) (p) = _pool_free(p) /** Optimized iteration through pool. @param LO pointer to first element in chunk @param HI pointer to last element in chunk @param POOL pool to iterate across @param BODY operation to perform Optimized version which assumes that BODY is smart enough to process multiple (LOW,HI) chunks. See also pool_foreach(). */ #define pool_foreach_region(LO,HI,POOL,BODY) \ do { \ uword _pool_var (i), _pool_var (lo), _pool_var (hi), _pool_var (len); \ uword _pool_var (bl), * _pool_var (b); \ pool_header_t * _pool_var (p); \ \ _pool_var (p) = pool_header (POOL); \ _pool_var (b) = (POOL) ? _pool_var (p)->free_bitmap : 0; \ _pool_var (bl) = vec_len (_pool_var (b)); \ _pool_var (len) = vec_len (POOL); \ _pool_var (lo) = 0; \ \ for (_pool_var (i) = 0; \ _pool_var (i) <= _pool_var (bl); \ _pool_var (i)++) \ { \ uword _pool_var (m), _pool_var (f); \ _pool_var (m) = (_pool_var (i) < _pool_var (bl) \ ? _pool_var (b) [_pool_var (i)] \ : 1); \ while (_pool_var (m) != 0) \ { \ _pool_var (f) = first_set (_pool_var (m)); \ _pool_var (hi) = (_pool_var (i) * BITS (_pool_var (b)[0]) \ + min_log2 (_pool_var (f))); \ _pool_var (hi) = (_pool_var (i) < _pool_var (bl) \ ? _pool_var (hi) : _pool_var (len)); \ _pool_var (m) ^= _pool_var (f); \ if (_pool_var (hi) > _pool_var (lo)) \ { \ (LO) = _pool_var (lo); \ (HI) = _pool_var (hi); \ do { BODY; } while (0); \ } \ _pool_var (lo) = _pool_var (hi) + 1; \ } \ } \ } while (0) /** Iterate through pool. @param VAR A variable of same type as pool vector to be used as an iterator. @param POOL The pool to iterate across. @param BODY The operation to perform, typically a code block. See the example below. This macro will call @c BODY with each active pool element. It is a bad idea to allocate or free pool element from within @c pool_foreach. Build a vector of indices and dispose of them later. Or call pool_flush. @par Example @code{.c} proc_t *procs; // a pool of processes. proc_t *proc; // pointer to one process; used as the iterator. pool_foreach (proc, procs, ({ if (proc->state != PROC_STATE_RUNNING) continue; // check a running proc in some way ... })); @endcode @warning Because @c pool_foreach is a macro, syntax errors can be difficult to find inside @c BODY, let alone actual code bugs. One can temporarily split a complex @c pool_foreach into a trivial @c pool_foreach which builds a vector of active indices, and a vec_foreach() (or plain for-loop) to walk the active index vector. */ #define pool_foreach(VAR,POOL,BODY) \ do { \ uword _pool_foreach_lo, _pool_foreach_hi; \ pool_foreach_region (_pool_foreach_lo, _pool_foreach_hi, (POOL), \ ({ \ for ((VAR) = (POOL) + _pool_foreach_lo; \ (VAR) < (POOL) + _pool_foreach_hi; \ (VAR)++) \ do { BODY; } while (0); \ })); \ } while (0) /** Returns pointer to element at given index. ASSERTs that the supplied index is valid. Even though one can write correct code of the form @code p = pool_base + index; @endcode use of @c pool_elt_at_index is strongly suggested. */ #define pool_elt_at_index(p,i) \ ({ \ typeof (p) _e = (p) + (i); \ ASSERT (! pool_is_free (p, _e)); \ _e; \ }) /** Return next occupied pool index after @c i, useful for safe iteration. */ #define pool_next_index(P,I) \ ({ \ pool_header_t * _pool_var (p) = pool_header (P); \ uword _pool_var (rv) = (I) + 1; \ \ _pool_var(rv) = \ (_pool_var (rv) < vec_len (P) ? \ clib_bitmap_next_clear (_pool_var (p)->free_bitmap, _pool_var(rv)) \ : ~0); \ _pool_var(rv) = \ (_pool_var (rv) < vec_len (P) ? \ _pool_var (rv) : ~0); \ _pool_var(rv); \ }) /** Iterate pool by index. */ #define pool_foreach_index(i,v,body) \ for ((i) = 0; (i) < vec_len (v); (i)++) \ { \ if (! pool_is_free_index ((v), (i))) \ do { body; } while (0); \ } /** * @brief Remove all elements from a pool in a safe way * * @param VAR each element in the pool * @param POOL The pool to flush * @param BODY The actions to perform on each element before it is returned to * the pool. i.e. before it is 'freed' */ #define pool_flush(VAR, POOL, BODY) \ { \ uword *_pool_var(ii), *_pool_var(dv) = NULL; \ \ pool_foreach((VAR), (POOL), \ ({ \ vec_add1(_pool_var(dv), (VAR) - (POOL)); \ })); \ vec_foreach(_pool_var(ii), _pool_var(dv)) \ { \ (VAR) = pool_elt_at_index((POOL), *_pool_var(ii)); \ do { BODY; } while (0); \ pool_put((POOL), (VAR)); \ } \ vec_free(_pool_var(dv)); \ } #endif /* included_pool_h */ /* * fd.io coding-style-patch-verification: ON * * Local Variables: * eval: (c-set-style "gnu") * End: */