SystemTap: SystemTap Runtime Library

+Maps are created with _stp_map_new(). Each map can hold only one type of data; int64, string, or statistics. Each element belonging to a map can have up to 2 keys and a value. Implemented key types are strings and longs.

+To simplify the implementation, the functions to set the key and the functions to set the data are separated. That means we need only 4 functions to set the key and 3 functions to set the value.

+/* create a map with a max of 100 elements */
+MAP mymap = map_new(100, INT64);
+
+/* mymap[birth year] = 2000 */
+map_key_str (mymap, "birth year");
+map_set_int64 (mymap, 2000);  
+

+All elements have a default value of 0 (or NULL). Elements are only saved to the map when their value is set to something nonzero. This means that querying for the existance of a key is inexpensive because no element is created, just a hash table lookup.

+A list is a special map which has internally ascending long integer keys. Adding a value to a list does not require setting a key first. See _stp_list_add_str() and _stp_list_add_int64().

+Status

+If maps overflow or memory runs out for some reason, globals are set but nothing is done yet. I expect to implement a function to tell the system to either ignore it or unload the module and quit.

+Working sample probe code using the runtime is in tests/test4_probe and tests/shellprobe.

io.c

00001 
+00011 void dlog (const char *fmt, ...)
+00012 {
+00013   va_list args;
+00014   printk("STP: ");
+00015   va_start(args, fmt);
+00016   vprintk(fmt, args);
+00017   va_end(args);
+00018 }
+00019 
+

io.c File Reference

Function Documentation

+ + + + +

+ + + + + + + + + + + + + + + + + + +

void dlog	(	const char *	fmt,
			...
	)

+ + + + + +

+ +

+Logs data. +

+This function is compatible with printk. In fact it currently sends all output to vprintk, after sending "STP: ". This allows us to easily detect SystemTap output in the log file.

Parameters:

+ + +

fmt

A variable number of args.

Bug:: Lines are limited in length by printk buffer.

Todo:: Needs replaced with something much faster that does not use the system log.

+ +

+Definition at line 11 of file io.c. +

+Referenced by _stp_list_clear().

SystemTap Runtime Library

0.1

+Introduction

map.c

00001 /* -*- linux-c -*- */
+00002 
+00003 static int map_sizes[] = {
+00004         sizeof(struct map_node_int64),
+00005         sizeof(struct map_node_stat),
+00006         sizeof(struct map_node_str),
+00007         0
+00008 };
+00009 
+00010 static inline unsigned string_hash(const char *key1, const char *key2)
+00011 {
+00012         int hash = 0, count = 0;
+00013         char *v1 = (char *)key1;
+00014         char *v2 = (char *)key2;
+00015         while (*v1 && count++ < 5) {
+00016                 hash += *v1++;
+00017         }
+00018         while (v2 && *v2 && count++ < 5) {
+00019                 hash += *v2++;
+00020         }
+00021         return hash_long((unsigned long)hash, HASH_TABLE_BITS);
+00022 }
+00023 
+00024 static inline unsigned mixed_hash(const char *key1, long key2)
+00025 {
+00026         int hash = 0, count = 0;
+00027         char *v = (char *)key1;
+00028         while (v && *v && count++ < 5)
+00029                 hash += *v++;
+00030         return hash_long((unsigned long)(hash ^ key2), HASH_TABLE_BITS);
+00031 }
+00032 
+00043 MAP _stp_map_new(unsigned max_entries, enum valtype type)
+00044 {
+00045         size_t size;
+00046         MAP m = (MAP) _stp_valloc(sizeof(struct map_root));
+00047         if (m == NULL)
+00048                 return NULL;
+00049 
+00050         INIT_LIST_HEAD(&m->head);
+00051 
+00052         m->maxnum = max_entries;
+00053         m->type = type;
+00054         if (type >= END) {
+00055                 dbug ("map_new: unknown type %d\n", type);
+00056                 return NULL;
+00057         }
+00058 
+00059         if (max_entries) {
+00060                 void *tmp;
+00061                 int i;
+00062                 struct list_head *e;
+00063 
+00064                 INIT_LIST_HEAD(&m->pool);
+00065                 size = map_sizes[type];
+00066                 tmp = _stp_valloc(max_entries * size);
+00067 
+00068                 for (i = max_entries - 1; i >= 0; i--) {
+00069                         e = i * size + tmp;
+00070                         dbug ("e=%lx\n", (long)e);
+00071                         list_add(e, &m->pool);
+00072                 }
+00073                 m->membuf = tmp;
+00074         }
+00075         return m;
+00076 }
+00077 
+00078 static void map_free_strings(MAP map, struct map_node *n)
+00079 {
+00080         struct map_node_str *m = (struct map_node_str *)n;
+00081         dbug ("n = %lx\n", (long)n);
+00082         if (map->type == STRING) {
+00083                 dbug ("val STRING %lx\n", (long)m->str);
+00084                 if (m->str)
+00085                         _stp_free(m->str);
+00086         }
+00087         if (m->n.key1type == STR) {
+00088                 dbug ("key1 STR %lx\n", (long)key1str(m));
+00089                 if (key1str(m))
+00090                         _stp_free(key1str(m));
+00091         }
+00092         if (m->n.key2type == STR) {
+00093                 dbug ("key2 STR %lx\n", (long)key2str(m));
+00094                 if (key2str(m))
+00095                         _stp_free(key2str(m));
+00096         }
+00097 }
+00098 
+00104 void _stp_map_key_del(MAP map)
+00105 {
+00106         struct map_node *m;
+00107 
+00108         dbug ("create=%d key=%lx\n", map->create, (long)map->key);
+00109         if (map == NULL)
+00110                 return;
+00111 
+00112         if (map->create) {
+00113                 map->create = 0;
+00114                 map->key = NULL;
+00115                 return;
+00116         }
+00117 
+00118         if (map->key == NULL)
+00119                 return;
+00120 
+00121         m = (struct map_node *)map->key;
+00122 
+00123         /* remove node from old hash list */
+00124         hlist_del_init(&m->hnode);
+00125 
+00126         /* remove from entry list */
+00127         list_del(&m->lnode);
+00128 
+00129         /* remove any allocated string storage */
+00130         map_free_strings(map, (struct map_node *)map->key);
+00131 
+00132         if (map->maxnum)
+00133                 list_add(&m->lnode, &map->pool);
+00134         else
+00135                 _stp_free(m);
+00136 
+00137         map->key = NULL;
+00138         map->num--;
+00139 }
+00140 
+00149 struct map_node *_stp_map_start(MAP map)
+00150 {
+00151         if (map == NULL)
+00152                 return NULL;
+00153 
+00154         dbug ("%lx\n", (long)map->head.next);
+00155 
+00156         if (list_empty(&map->head))
+00157                 return NULL;
+00158 
+00159         return (struct map_node *)map->head.next;
+00160 }
+00161 
+00172 struct map_node *_stp_map_iter(MAP map, struct map_node *m)
+00173 {
+00174         if (map == NULL)
+00175                 return NULL;
+00176 
+00177         dbug ("%lx next=%lx  prev=%lx  map->head.next=%lx\n", (long)m, (long)m->lnode.next, (long)m->lnode.prev, (long)map->head.next);
+00178 
+00179         if (m->lnode.next == &map->head)
+00180                 return NULL;
+00181 
+00182         return (struct map_node *)m->lnode.next;
+00183 }
+00184 
+00190 void _stp_map_del(MAP map)
+00191 {
+00192         if (map == NULL)
+00193                 return;
+00194 
+00195         if (!list_empty(&map->head)) {
+00196                 struct map_node *ptr = (struct map_node *)map->head.next;
+00197                 while (ptr && ptr != (struct map_node *)&map->head) {
+00198                         map_free_strings(map, ptr);
+00199                         ptr = (struct map_node *)ptr->lnode.next;
+00200                 }
+00201         }
+00202         _stp_vfree(map->membuf);
+00203         _stp_vfree(map);
+00204 }
+00205 
+00206 /**********************  KEY FUNCTIONS *********************/
+00207 
+00208 
+00218 void _stp_map_key_long_long(MAP map, long key1, long key2)
+00219 {
+00220         unsigned hv;
+00221         struct hlist_head *head;
+00222         struct hlist_node *e;
+00223 
+00224         if (map == NULL)
+00225                 return;
+00226 
+00227         hv = hash_long(key1 ^ key2, HASH_TABLE_BITS);
+00228         head = &map->hashes[hv];
+00229 
+00230         dbug ("hash for %ld,%ld is %d\n", key1, key2, hv);
+00231 
+00232         hlist_for_each(e, head) {
+00233                 struct map_node *n =
+00234                         (struct map_node *)((long)e - sizeof(struct hlist_node));
+00235                 dbug ("n =%lx  key=%ld,%ld\n", (long)n, n->key1.val, n->key2.val);
+00236                 if (key1 == n->key1.val && key2 == n->key2.val) {
+00237                         map->key = n;
+00238                         dbug ("saving key %lx\n", (long)map->key);
+00239                         map->create = 0;
+00240                         return;
+00241                 }
+00242         }
+00243 
+00244         map->c_key1.val = key1;
+00245         map->c_key2.val = key2;
+00246         map->c_key1type = LONG;
+00247         map->c_key2type = LONG;
+00248         map->c_keyhead = head;
+00249         map->create = 1;
+00250 }
+00251 
+00261 void _stp_map_key_str_str(MAP map, char *key1, char *key2)
+00262 {
+00263         unsigned hv;
+00264         struct hlist_head *head;
+00265         struct hlist_node *e;
+00266 
+00267         if (map == NULL)
+00268                 return;
+00269 
+00270         if (key1 == NULL) {
+00271                 map->key = NULL;
+00272                 return;
+00273         }
+00274 
+00275         hv = string_hash(key1, key2);
+00276         head = &map->hashes[hv];
+00277 
+00278         dbug ("hash for %s,%s is %d\n", key1, key2, hv);
+00279 
+00280         hlist_for_each(e, head) {
+00281                 struct map_node *n =
+00282                         (struct map_node *)((long)e - sizeof(struct hlist_node));
+00283                 dbug ("e =%lx  key=%s,%s\n", (long)e, n->key1.str,n->key2.str);
+00284                 if (strcmp(key1, n->key1.str) == 0
+00285                     && (key2 == NULL || strcmp(key2, n->key2.str) == 0)) {
+00286                         map->key = n;
+00287                         dbug ("saving key %lx\n", (long)map->key);
+00288                         map->create = 0;
+00289                         return;
+00290                 }
+00291         }
+00292 
+00293         map->c_key1.str = key1;
+00294         map->c_key2.str = key2;
+00295         map->c_key1type = STR;
+00296         map->c_key2type = STR;
+00297         map->c_keyhead = head;
+00298         map->create = 1;
+00299 }
+00300 
+00310 void _stp_map_key_str_long(MAP map, char *key1, long key2)
+00311 {
+00312         unsigned hv;
+00313         struct hlist_head *head;
+00314         struct hlist_node *e;
+00315 
+00316         if (map == NULL)
+00317                 return;
+00318 
+00319         if (key1 == NULL) {
+00320                 map->key = NULL;
+00321                 return;
+00322         }
+00323 
+00324         hv = mixed_hash(key1, key2);
+00325         head = &map->hashes[hv];
+00326 
+00327         dbug ("hash for %s,%ld is %d\n", key1, key2, hv);
+00328 
+00329         hlist_for_each(e, head) {
+00330                 struct map_node *n =
+00331                         (struct map_node *)((long)e - sizeof(struct hlist_node));
+00332                 dbug ("e =%lx  key=%s,%ld\n", (long)e, n->key1.str,(long)n->key2.val);
+00333                 if (strcmp(key1, n->key1.str) == 0 && key2 == n->key2.val) {
+00334                         map->key = n;
+00335                         dbug ("saving key %lx\n", (long)map->key);
+00336                         map->create = 0;
+00337                         return;
+00338                 }
+00339         }
+00340 
+00341         map->c_key1.str = key1;
+00342         map->c_key2.val = key2;
+00343         map->c_key1type = STR;
+00344         map->c_key2type = LONG;
+00345         map->c_keyhead = head;
+00346         map->create = 1;
+00347 }
+00348 
+00358 void _stp_map_key_long_str(MAP map, long key1, char *key2)
+00359 {
+00360         unsigned hv;
+00361         struct hlist_head *head;
+00362         struct hlist_node *e;
+00363 
+00364         if (map == NULL)
+00365                 return;
+00366 
+00367         hv = mixed_hash(key2, key1);
+00368         head = &map->hashes[hv];
+00369         dbug ("hash for %ld,%s is %d\n", key1, key2, hv);
+00370 
+00371         hlist_for_each(e, head) {
+00372                 struct map_node *n =
+00373                         (struct map_node *)((long)e - sizeof(struct hlist_node));
+00374                 dbug ("e =%lx  key=%ld,%s\n", (long)e, n->key1.val,n->key2.str);
+00375                 if (key1 == n->key1.val && strcmp(key2, n->key2.str) == 0) {
+00376                         map->key = n;
+00377                         dbug ("saving key %lx\n", (long)map->key);
+00378                         map->create = 0;
+00379                         return;
+00380                 }
+00381         }
+00382 
+00383         map->c_key1.val = key1;
+00384         map->c_key2.str = key2;
+00385         map->c_key1type = LONG;
+00386         map->c_key2type = STR;
+00387         map->c_keyhead = head;
+00388         map->create = 1;
+00389 }
+00390 
+00399 void _stp_map_key_str(MAP map, char *key)
+00400 {
+00401         if (map == NULL)
+00402                 return;
+00403         _stp_map_key_str_str(map, key, NULL);
+00404         map->c_key2type = NONE;
+00405 }
+00406 
+00415 void _stp_map_key_long(MAP map, long key)
+00416 {
+00417         if (map == NULL)
+00418                 return;
+00419         _stp_map_key_long_long(map, key, 0);
+00420         map->c_key2type = NONE;
+00421 }
+00422 
+00423 /**********************  SET/GET VALUES *********************/
+00424 
+00425 static void map_copy_keys(MAP map, struct map_node *m)
+00426 {
+00427         m->key1type = map->c_key1type;
+00428         m->key2type = map->c_key2type;
+00429         switch (map->c_key1type) {
+00430         case STR:
+00431                 m->key1.str = _stp_alloc(strlen(map->c_key1.str) + 1);
+00432                 strcpy(m->key1.str, map->c_key1.str);
+00433                 break;
+00434         case LONG:
+00435                 m->key1.val = map->c_key1.val;
+00436                 break;
+00437         case NONE:
+00438                 /* ERROR */
+00439                 break;
+00440         }
+00441         switch (map->c_key2type) {
+00442         case STR:
+00443                 m->key2.str = _stp_alloc(strlen(map->c_key2.str) + 1);
+00444                 strcpy(m->key2.str, map->c_key2.str);
+00445                 break;
+00446         case LONG:
+00447                 m->key2.val = map->c_key2.val;
+00448                 break;
+00449         case NONE:
+00450                 break;
+00451         }
+00452 
+00453         /* add node to new hash list */
+00454         hlist_add_head(&m->hnode, map->c_keyhead);
+00455         
+00456         map->key = m;
+00457         map->create = 0;
+00458         map->num++;
+00459 }
+00460 
+00471 void _stp_map_set_int64(MAP map, int64_t val)
+00472 {
+00473         struct map_node_int64 *m;
+00474 
+00475         if (map == NULL)
+00476                 return;
+00477 
+00478         if (map->create) {
+00479                 if (val == 0)
+00480                         return;
+00481 
+00482                 if (map->maxnum) {
+00483                         if (list_empty(&map->pool)) {
+00484                                 if (map->no_wrap) {
+00485                                         /* ERROR. FIXME */
+00486                                         return;
+00487                                 }
+00488                                 m = (struct map_node_int64 *)map->head.next;
+00489                                 hlist_del_init(&m->n.hnode);
+00490                                 map_free_strings(map, (struct map_node *)m);
+00491                                 dbug ("got %lx off head\n", (long)m);
+00492                         } else {
+00493                                 m = (struct map_node_int64 *)map->pool.next;
+00494                                 dbug ("got %lx off pool\n", (long)m);
+00495                         }
+00496                         list_move_tail(&m->n.lnode, &map->head);
+00497                 } else {
+00498                         m = (struct map_node_int64 *)
+00499                             _stp_calloc(sizeof(struct map_node_int64));
+00500                         /* add node to list */
+00501                         list_add_tail(&m->n.lnode, &map->head);
+00502                 }
+00503 
+00504                 /* copy the key(s) */
+00505                 map_copy_keys(map, &m->n);
+00506 
+00507                 /* set the value */
+00508                 m->val = val;
+00509         } else {
+00510                 if (map->key == NULL)
+00511                         return;
+00512 
+00513                 if (val) {
+00514                         m = (struct map_node_int64 *)map->key;
+00515                         m->val = val;
+00516                 } else {
+00517                         /* setting value to 0 is the same as deleting */
+00518                         _stp_map_key_del(map);
+00519                 }
+00520         }
+00521 }
+00522 
+00528 int64_t _stp_map_get_int64(MAP map)
+00529 {
+00530         struct map_node_int64 *m;
+00531         if (map == NULL || map->create || map->key == NULL)
+00532                 return 0;
+00533         dbug ("%lx\n", (long)map->key);
+00534         m = (struct map_node_int64 *)map->key;
+00535         return m->val;
+00536 }
+00537 
+00548 void _stp_map_set_str(MAP map, char *val)
+00549 {
+00550         struct map_node_str *m;
+00551 
+00552         if (map == NULL)
+00553                 return;
+00554 
+00555         if (map->create) {
+00556                 if (val == NULL)
+00557                         return;
+00558 
+00559                 if (map->maxnum) {
+00560                         if (list_empty(&map->pool)) {
+00561                                 if (map->no_wrap) {
+00562                                         /* ERROR. FIXME */
+00563                                         return;
+00564                                 }
+00565                                 m = (struct map_node_str *)map->head.next;
+00566                                 hlist_del_init(&m->n.hnode);
+00567                                 map_free_strings(map, (struct map_node *)m);
+00568                                 dbug ("got %lx off head\n", (long)m);
+00569                         } else {
+00570                                 m = (struct map_node_str *)map->pool.next;
+00571                                 dbug ("got %lx off pool\n", (long)m);
+00572                         }
+00573                         list_move_tail(&m->n.lnode, &map->head);
+00574                 } else {
+00575                         m = (struct map_node_str *)
+00576                             _stp_calloc(sizeof(struct map_node_str));
+00577                         /* add node to list */
+00578                         list_add_tail(&m->n.lnode, &map->head);
+00579                 }
+00580 
+00581                 /* copy the key(s) */
+00582                 map_copy_keys(map, &m->n);
+00583 
+00584                 /* set the value */
+00585                 m->str = _stp_alloc(strlen(val) + 1);
+00586                 strcpy(m->str, val);
+00587         } else {
+00588                 if (map->key == NULL)
+00589                         return;
+00590 
+00591                 if (val) {
+00592                         m = (struct map_node_str *)map->key;
+00593                         if (m->str)
+00594                                 _stp_free(m->str);
+00595                         m->str = _stp_alloc(strlen(val) + 1);
+00596                         strcpy(m->str, val);
+00597                 } else {
+00598                         /* setting value to 0 is the same as deleting */
+00599                         _stp_map_key_del(map);
+00600                 }
+00601         }
+00602 }
+00603 
+00609 char *_stp_map_get_str(MAP map)
+00610 {
+00611         struct map_node_str *m;
+00612         if (map == NULL || map->create || map->key == NULL)
+00613                 return NULL;
+00614         dbug ("%lx\n", (long)map->key);
+00615         m = (struct map_node_str *)map->key;
+00616         return m->str;
+00617 }
+00618 
+00633 void _stp_map_set_stat(MAP map, stat * stats)
+00634 {
+00635         struct map_node_stat *m;
+00636 
+00637         if (map == NULL)
+00638                 return;
+00639         dbug ("set_stat %lx\n", (long)map->key);
+00640 
+00641         if (map->create) {
+00642                 if (stats == NULL)
+00643                         return;
+00644 
+00645                 if (map->maxnum) {
+00646                         if (list_empty(&map->pool)) {
+00647                                 if (map->no_wrap) {
+00648                                         /* ERROR. FIXME */
+00649                                         return;
+00650                                 }
+00651                                 m = (struct map_node_stat *)map->head.next;
+00652                                 hlist_del_init(&m->n.hnode);
+00653                                 map_free_strings(map, (struct map_node *)m);
+00654                                 dbug ("got %lx off head\n", (long)m);
+00655                         } else {
+00656                                 m = (struct map_node_stat *)map->pool.next;
+00657                                 dbug ("got %lx off pool\n", (long)m);
+00658                         }
+00659                         list_move_tail(&m->n.lnode, &map->head);
+00660                 } else {
+00661                         m = (struct map_node_stat *)
+00662                             _stp_calloc(sizeof(struct map_node_stat));
+00663                         /* add node to list */
+00664                         list_add_tail(&m->n.lnode, &map->head);
+00665                 }
+00666 
+00667                 /* copy the key(s) */
+00668                 map_copy_keys(map, &m->n);
+00669 
+00670                 /* set the value */
+00671                 memcpy(&m->stats, stats, sizeof(stat));
+00672         } else {
+00673                 if (map->key == NULL)
+00674                         return;
+00675 
+00676                 if (stats) {
+00677                         m = (struct map_node_stat *)map->key;
+00678                         memcpy(&m->stats, stats, sizeof(stat));
+00679                 } else {
+00680                         /* setting value to NULL is the same as deleting */
+00681                         _stp_map_key_del(map);
+00682                 }
+00683         }
+00684 }
+00685 
+00692 stat *_stp_map_get_stat(MAP map)
+00693 {
+00694         struct map_node_stat *m;
+00695         if (map == NULL || map->create || map->key == NULL)
+00696                 return NULL;
+00697         dbug ("%lx\n", (long)map->key);
+00698         m = (struct map_node_stat *)map->key;
+00699         return &m->stats;
+00700 }
+00701 
+00713 void _stp_map_stat_add(MAP map, int64_t val)
+00714 {
+00715         struct map_node_stat *m;
+00716         if (map == NULL)
+00717                 return;
+00718 
+00719         if (map->create) {
+00720                 stat st = { 1, val, val, val };
+00721                 /* histogram */
+00722                 _stp_map_set_stat(map, &st);
+00723                 return;
+00724         }
+00725 
+00726         if (map->key == NULL)
+00727                 return;
+00728 
+00729         dbug ("add_stat %lx\n", (long)map->key);
+00730         m = (struct map_node_stat *)map->key;
+00731         m->stats.count++;
+00732         m->stats.sum += val;
+00733         if (val > m->stats.max)
+00734                 m->stats.max = val;
+00735         if (val < m->stats.min)
+00736                 m->stats.min = val;
+00737         /* histogram */
+00738 }
+00739 
+00740 /**********************  List Functions *********************/
+00741 
+00753 MAP _stp_list_new(unsigned max_entries, enum valtype type)
+00754 {
+00755   MAP map = _stp_map_new (max_entries, type);
+00756   map->no_wrap = 1;
+00757   return map;
+00758 }
+00759 
+00765 inline void _stp_list_clear(MAP map)
+00766 {
+00767         if (map == NULL)
+00768                 return;
+00769 
+00770         if (!list_empty(&map->head)) {
+00771                 struct map_node *ptr = (struct map_node *)map->head.next;
+00772 
+00773                 while (ptr && ptr != (struct map_node *)&map->head) {
+00774                         struct map_node *next = (struct map_node *)ptr->lnode.next;
+00775 
+00776                         /* remove node from old hash list */
+00777                         hlist_del_init(&ptr->hnode);
+00778 
+00779                         /* remove from entry list */
+00780                         list_del(&ptr->lnode);
+00781                         
+00782                         /* remove any allocated string storage */
+00783                         map_free_strings(map, ptr);
+00784                         
+00785                         if (map->maxnum)
+00786                                 list_add(&ptr->lnode, &map->pool);
+00787                         else
+00788                                 _stp_free(ptr);
+00789 
+00790                         map->num--;
+00791                         ptr = next;
+00792                 }
+00793         }
+00794 
+00795         if (map->num != 0) {
+00796                 dlog ("ERROR: list is supposed to be empty (has %d)\n", map->num);
+00797         }
+00798 }
+00799 
+00805 inline void _stp_list_add_str(MAP map, char *str)
+00806 {
+00807         _stp_map_key_long(map, map->num);
+00808         _stp_map_set_str(map, str);
+00809 }
+00810 
+00816 inline void _stp_list_add_int64(MAP map, int64_t val)
+00817 {
+00818         _stp_map_key_long(map, map->num);
+00819         _stp_map_set_int64(map, val);
+00820 }
+00821 
+00827 inline int _stp_list_size(MAP map)
+00828 {
+00829         return map->num;
+00830 }
+

map.c File Reference

Function Documentation

+ + + + +

+ + + + + + + + + + + + + + + + + + +

void _stp_list_add_int64	(	MAP	map,
		int64_t	val
	)	`[inline]`

+ + + + + +

+ +

+Adds an int64 to a list. +

Parameters:

+ + + +

	map
	val

+ +

+Definition at line 816 of file map.c. +

+References _stp_map_key_long(), _stp_map_set_int64(), MAP, and map_root::num.

+ + + + +

+ + + + + + + + + + + + + + + + + + +

void _stp_list_add_str	(	MAP	map,
		char *	str
	)	`[inline]`

+ + + + + +

+ +

+Adds a string to a list. +

Parameters:

+ + + +

	map
	str

+ +

+Definition at line 805 of file map.c. +

+References _stp_map_key_long(), _stp_map_set_str(), MAP, and map_root::num. +

+Referenced by _stp_copy_argv_from_user().

+ + + + +

+ + + + + + + + + + + + + + + + + + +

MAP _stp_list_new	(	unsigned	max_entries,
		enum valtype	type
	)

+ + + + + +

+ +

+Create a new list. +

+A list is a map that internally has an incrementing long key for each member. Lists do not wrap if elements are added to exceed their maximum size.

Parameters:

+ + + +

	max_entries	The maximum number of entries allowed. Currently that number will be preallocated. If max_entries is 0, there will be no maximum and entries will be allocated dynamically.
	type	Type of values stored in this list.

Returns:: A MAP on success or NULL on failure.

See also:: foreach

+ +

+Definition at line 753 of file map.c. +

+References _stp_map_new(), MAP, and map_root::no_wrap.

+ + + + +

+ + + + + + + + + +

int _stp_list_size ( MAP map ) [inline]

+ + + + + +

+ +

+Get the number of elements in a list. +

Parameters:

+ + +

map

Returns:: The number of elements in a list.

+ +

+Definition at line 827 of file map.c. +

+References MAP, and map_root::num.

+ + + + +

+ + + + + + + + + +

void _stp_map_del

(

MAP

map

)

+ + + + + +

+ +

+Deletes a map. +

+Deletes a map, freeing all memory in all elements. Normally done only when the module exits.

Parameters:

+ + +

map

+ +

+Definition at line 190 of file map.c. +

+References _stp_vfree(), map_root::head, map_node::lnode, MAP, and map_root::membuf.

+ + + + +

+ + + + + + + + + +

int64_t _stp_map_get_int64

(

MAP

map

)

+ + + + + +

+ +

+Gets the current element's value. +

Parameters:

+ + +

map

Returns:: The value. If the current element is not set or doesn't exist, returns 0.

+ +

+Definition at line 528 of file map.c. +

+References map_root::create, dbug, map_root::key, MAP, and map_node_int64::val.

+ + + + +

+ + + + + + + + + +

stat* _stp_map_get_stat

(

MAP

map

)

+ + + + + +

+ +

+Gets the current element's value. +

Parameters:

+ + +

map

Returns:: A pointer to the stats struct. If the current element is not set or doesn't exist, returns NULL.

+ +

+Definition at line 692 of file map.c. +

+References map_root::create, dbug, map_root::key, MAP, and map_node_stat::stats.

+ + + + +

+ + + + + + + + + +

char* _stp_map_get_str

(

MAP

map

)

+ + + + + +

+ +

+Gets the current element's value. +

Parameters:

+ + +

map

Returns:: A string pointer. If the current element is not set or doesn't exist, returns NULL.

+ +

+Definition at line 609 of file map.c. +

+References map_root::create, dbug, map_root::key, MAP, and map_node_str::str.

+ + + + +

+ + + + + + + + + + + + + + + + + + +

struct map_node* _stp_map_iter	(	MAP	map,
		struct map_node *	m
	)

+ + + + + +

+ +

+Get the next element in a map. +

Parameters:

+ + + +

	map
	m	a pointer to the current element, returned from _stp_map_start() or _stp_map_iter().

Returns:: a pointer to the next element. This is typically used with _stp_map_start(). See the foreach() macro for typical usage. It probably does what you want anyway.

See also:: foreach

+ +

+Definition at line 172 of file map.c. +

+References dbug, map_root::head, map_node::lnode, and MAP.

+ + + + +

+ + + + + + + + + + + + + + + + + + +

void _stp_map_key_long	(	MAP	map,
		long	key
	)

+ + + + + +

+ +

+Set the map's key to a long. +

+This sets the current element based on a long key. If the key is not found, a new element will not be created until a _stp_map_set_xxx call.

Parameters:

+ + + +

	map
	key

+ +

+Definition at line 415 of file map.c. +

+References _stp_map_key_long_long(), and MAP. +

+Referenced by _stp_list_add_int64(), and _stp_list_add_str().

+ + + + +

+ + + + + + + + + + + + + + + + + + + + + + + + +

void _stp_map_key_long_long	(	MAP	map,
		long	key1,
		long	key2
	)

+ + + + + +

+ +

+Set the map's key to two longs. +

+This sets the current element based on a key of two strings. If the keys are not found, a new element will not be created until a _stp_map_set_xxx call.

Parameters:

+ + + + +

	map
	key1	first key
	key2	second key

+ +

+Definition at line 218 of file map.c. +

+References map_root::c_key1, map_root::c_key2, map_root::c_keyhead, map_root::create, dbug, map_root::hashes, map_root::key, map_node::key1, MAP, and key_data::val. +

+Referenced by _stp_map_key_long().

+ + + + +

+ + + + + + + + + + + + + + + + + + +

void _stp_map_key_str	(	MAP	map,
		char *	key
	)

+ + + + + +

+ +

+Set the map's key to a string. +

+This sets the current element based on a string key. If the key is not found, a new element will not be created until a _stp_map_set_xxx call.

Parameters:

+ + + +

	map
	key

+ +

+Definition at line 399 of file map.c. +

+References _stp_map_key_str_str(), and MAP.

+ + + + +

+ + + + + + + + + + + + + + + + + + +

MAP _stp_map_new	(	unsigned	max_entries,
		enum valtype	type
	)

+ + + + + +

+ +

+Create a new map. +

+Maps must be created at module initialization time.

Parameters:

+ + + +

	max_entries	The maximum number of entries allowed. Currently that number will be preallocated. If more entries are required, the oldest ones will be deleted. This makes it effectively a circular buffer. If max_entries is 0, there will be no maximum and entries will be allocated dynamically.
	type	Type of values stored in this map.

Returns:: A MAP on success or NULL on failure.

+ +

+Definition at line 43 of file map.c. +

+References _stp_valloc(), dbug, map_root::head, MAP, map_root::maxnum, map_root::membuf, and map_root::pool. +

+Referenced by _stp_list_new().

+ + + + +

+ + + + + + + + + + + + + + + + + + +

void _stp_map_set_stat	(	MAP	map,
		stat *	stats
	)

+ + + + + +

+ +

+Set the current element's value to a stat. +

+This sets the current element's value to an stat struct. The map must have been created to hold stats using _stp_map_new(xxx, STAT). This function would only be used if we wanted to set stats to something other than the normal initial values (count = 0, sum = 0, etc). It may be deleted if it doesn't turn out to be useful.

See also:: _stp_map_stat_add

+If the element doesn't exist, it is created. If no current element (key) is set for the map, this function does nothing.

Parameters:

+ + + +

	map
	stats	pointer to stats struct.

Todo:: Histograms don't work yet.

+ +

+Definition at line 633 of file map.c. +

+References _stp_calloc(), _stp_map_key_del(), map_root::create, dbug, map_root::head, map_node::hnode, map_root::key, map_node::lnode, MAP, map_root::maxnum, map_node_stat::n, map_root::no_wrap, map_root::pool, and map_node_stat::stats. +

+Referenced by _stp_map_stat_add().

+ + + + +

+ + + + + + + + + +

struct map_node* _stp_map_start

(

MAP

map

)

+ + + + + +

+ +

+Get the first element in a map. +

Parameters:

+ + +

map

Returns:: a pointer to the first element. This is typically used with _stp_map_iter(). See the foreach() macro for typical usage. It probably does what you want anyway.

See also:: foreach

+ +

+Definition at line 149 of file map.c. +

+References dbug, map_root::head, and MAP.

+ + + + +

+ + + + + + + + + + + + + + + + + + +

void _stp_map_stat_add	(	MAP	map,
		int64_t	val
	)

+ + + + + +

+ +

+Add to the current element's statistics. +

+Increments the statistics counter by one and the sum by val. Adjusts minimum, maximum, and histogram.

+If the element doesn't exist, it is created. If no current element (key) is set for the map, this function does nothing.

Parameters:

+ + + +

	map
	val	value to add to the statistics

Todo:: Histograms don't work yet.

+ +

+Definition at line 713 of file map.c. +

+References _stp_map_set_stat(), stat::count, map_root::create, dbug, map_root::key, MAP, stat::max, stat::min, map_node_stat::stats, and stat::sum.

map.h

00001 /* -*- linux-c -*- */
+00002 #include <linux/types.h>
+00003 
+00004 typedef struct {
+00005         int64_t count;
+00006         int64_t sum;
+00007         int64_t min, max;
+00008         int64_t histogram[BUCKETS];
+00009 } stat;
+00010 
+00011 union key_data {
+00012         long val;
+00013         char *str;
+00014 };
+00015 
+00016 enum keytype { NONE, LONG, STR } __attribute__ ((packed));
+00017 enum valtype { INT64, STAT, STRING, END };
+00018 
+00019 /* all map nodes have the following structure */
+00020 struct map_node {
+00021         struct list_head lnode;
+00022         struct hlist_node hnode;
+00023         union key_data key1;
+00024         union key_data key2;
+00025         enum keytype key1type;
+00026         enum keytype key2type;
+00027 };
+00028 
+00029 /* specific map nodes with data attached */
+00030 struct map_node_int64 {
+00031         struct map_node n;
+00032         int64_t val;
+00033 };
+00034 
+00035 struct map_node_str {
+00036         struct map_node n;
+00037         char *str;
+00038 };
+00039 
+00040 struct map_node_stat {
+00041         struct map_node n;
+00042         stat stats;
+00043 };
+00044 
+00045 struct map_root {
+00046         /* type of the values stored in the array */
+00047         enum valtype type;
+00048 
+00049         /* maximum number of elements allowed in the array. */
+00050         int maxnum;
+00051 
+00052         /* current number of elements */
+00053         int num;
+00054 
+00055         /* when more than maxnum elements, wrap or discard */
+00056         int no_wrap;
+00057 
+00058         /* linked list of current entries */
+00059         struct list_head head;
+00060 
+00061         /* pool of unused entries.  Used only when entries are statically allocated */
+00062         /* at startup. */
+00063         struct list_head pool;
+00064 
+00065         /* saved key entry for lookups */
+00066         struct map_node *key;
+00067 
+00068         /* this is the creation data saved between the key functions and the */
+00069         /* set/get functions */
+00070         u_int8_t create;
+00071         enum keytype c_key1type;
+00072         enum keytype c_key2type;
+00073         struct hlist_head *c_keyhead;
+00074         union key_data c_key1;
+00075         union key_data c_key2;
+00076 
+00077         /* the hash table for this array */
+00078         struct hlist_head hashes[HASH_TABLE_SIZE];
+00079 
+00080         /* pointer to allocated memory space */
+00081         void *membuf;
+00082 };
+00083 
+00084 typedef struct map_root *MAP;
+00085 
+00086 #define key1str(ptr) (ptr->n.key1.str)
+00087 #define key2str(ptr) (ptr->n.key2.str)
+00088 #define key1int(ptr) (ptr->n.key1.val)
+00089 #define key2int(ptr) (ptr->n.key2.val)
+00090 
+00091 #define _stp_map_key2(map, key1, key2)                          \
+00092   ({                                                            \
+00093     if (__builtin_types_compatible_p (typeof (key1), char[]))   \
+00094       if (__builtin_types_compatible_p (typeof (key2), char[])) \
+00095         _stp_map_key_str_str (map, (char *)(key1), (char *)(key2));     \
+00096       else                                                      \
+00097         _stp_map_key_str_long (map, (char *)(key1), (long)(key2));      \
+00098     else                                                        \
+00099       if (__builtin_types_compatible_p (typeof (key2), char[])) \
+00100         _stp_map_key_long_str (map, (long)(key1), (char *)(key2));      \
+00101       else                                                      \
+00102         _stp_map_key_long_long (map, (long)(key1), (long)(key2));       \
+00103   })
+00104 
+00105 #define _stp_map_key(map, key)                          \
+00106   ({                                                            \
+00107     if (__builtin_types_compatible_p (typeof (key), char[]))    \
+00108       _stp_map_key_str (map, (char *)(key));                            \
+00109     else                                                        \
+00110       _stp_map_key_long (map, (long)(key));                             \
+00111   })
+00112 
+00113 #define _stp_map_set(map, val)                          \
+00114   ({                                                            \
+00115     if (__builtin_types_compatible_p (typeof (val), char[]))    \
+00116       _stp_map_set_str (map, (char *)(val));                            \
+00117     else                                                        \
+00118       _stp_map_set_int64 (map, (int64_t)(val));                 \
+00119   })
+00120 
+00121 #define _stp_list_add(map, val)                         \
+00122   ({                                                            \
+00123     if (__builtin_types_compatible_p (typeof (val), char[]))    \
+00124       _stp_list_add_str (map, (char *)(val));                           \
+00125     else                                                        \
+00126       _stp_list_add_int64 (map, (int64_t)(val));                        \
+00127   })
+00128 
+00129 
+00138 #define foreach(map, ptr)                               \
+00139   for (ptr = (typeof(ptr))_stp_map_start(map); ptr; \
+00140        ptr = (typeof(ptr))_stp_map_iter (map, (struct map_node *)ptr))
+00141 
+

map.h File Reference

Define Documentation

+ + + + +

+ + + + + + + + + + + + +

#define _stp_list_add	(	map,
		val		)

+ + + + + +

+ +	+ + +Value: ({ \ + if (__builtin_types_compatible_p (typeof (val), char[])) \ + _stp_list_add_str (map, (char *)(val)); \ + else \ + _stp_list_add_int64 (map, (int64_t)(val)); \ + }) + + +Definition at line 121 of file map.h.

+ + + + +

+ + + + + + + + + + + + +

#define _stp_map_key	(	map,
		key		)

+ + + + + +

+ +	+ + +Value: ({ \ + if (__builtin_types_compatible_p (typeof (key), char[])) \ + _stp_map_key_str (map, (char *)(key)); \ + else \ + _stp_map_key_long (map, (long)(key)); \ + }) + + +Definition at line 105 of file map.h.

+ + + + +

+ + + + + + + + + + + + + + + +

#define _stp_map_key2	(	map,
		key1,
		key2	)

+ + + + + +

+ +

+Value:

({                                                              \
+    if (__builtin_types_compatible_p (typeof (key1), char[]))   \
+      if (__builtin_types_compatible_p (typeof (key2), char[])) \
+        _stp_map_key_str_str (map, (char *)(key1), (char *)(key2));     \
+      else                                                      \
+        _stp_map_key_str_long (map, (char *)(key1), (long)(key2));      \
+    else                                                        \
+      if (__builtin_types_compatible_p (typeof (key2), char[])) \
+        _stp_map_key_long_str (map, (long)(key1), (char *)(key2));      \
+      else                                                      \
+        _stp_map_key_long_long (map, (long)(key1), (long)(key2));       \
+  })
+

+Definition at line 91 of file map.h.

+ + + + +

+ + + + + + + + + + + + +

#define _stp_map_set	(	map,
		val		)

+ + + + + +

+ +	+ + +Value: ({ \ + if (__builtin_types_compatible_p (typeof (val), char[])) \ + _stp_map_set_str (map, (char *)(val)); \ + else \ + _stp_map_set_int64 (map, (int64_t)(val)); \ + }) + + +Definition at line 113 of file map.h.

+ + + + +

+ + + + + + + + + + + + +

#define foreach	(	map,
		ptr		)

+ + + + + +

+ +

+Value:

for (ptr = (typeof(ptr))_stp_map_start(map); ptr; \
+       ptr = (typeof(ptr))_stp_map_iter (map, (struct map_node *)ptr))
+

Loop through all elements of a map. +

Parameters:

+ + + +

	map
	ptr	pointer to a map_node_stat, map_node_int64 or map_node_str

+Example:

/* example showing how to print all the stats in a map using foreach() */
+
+struct map_node_stat *ptr;
+
+foreach (map, ptr)
+     printf ("map[%s,%ld] = [c=%lld s=%lld min=%lld max=%lld]\n", key1str(ptr), 
+             key2int(ptr), ptr->stats.count, ptr->stats.sum, ptr->stats.min, 
+             ptr->stats.max);
+
+

+Definition at line 138 of file map.h.

+ + + + +

+ + + + + + + + + +

#define key1int

(

ptr

)

(ptr->n.key1.val)

+ + + + + +

+ +	+ + + + +Definition at line 88 of file map.h.

+ + + + +

+ + + + + + + + + +

#define key1str

(

ptr

)

(ptr->n.key1.str)

+ + + + + +

+ +	+ + + + +Definition at line 86 of file map.h.

+ + + + +

+ + + + + + + + + +

#define key2int

(

ptr

)

(ptr->n.key2.val)

+ + + + + +

+ +	+ + + + +Definition at line 89 of file map.h.

+ + + + +

+ + + + + + + + + +

#define key2str

(

ptr

)

(ptr->n.key2.str)

+ + + + + +

+ +	+ + + + +Definition at line 87 of file map.h.

Typedef Documentation

Enumeration Type Documentation

+ + + + +

enum keytype

+ + + + + +

+ +

Enumeration values:

+ + + + +

NONE	+
LONG	+
STR	+

+ +

+Definition at line 16 of file map.h.

+ + + + +

enum valtype

+ + + + + +

+ +

Enumeration values:

+ + + + + +

INT64	+
STAT	+
STRING	+
END	+

+ +

+Definition at line 17 of file map.h.

Variable Documentation

SystemTap Related Pages

runtime.h

00001 
+00002 #include <linux/module.h>
+00003 #include <linux/miscdevice.h>
+00004 #include <linux/init.h>
+00005 #include <linux/hash.h>
+00006 #include <linux/string.h>
+00007 #include <linux/kprobes.h>
+00008 #include <linux/proc_fs.h>
+00009 #include <linux/vmalloc.h>
+00010 #include <linux/time.h>
+00011 #include <linux/spinlock.h>
+00012 #include <asm/uaccess.h>
+00013 
+00014 #include "alloc.h"
+00015 #include "map.h"
+00016 
+00017 #define dbug(args...) ;
+00018 
+

runtime.h File Reference

Define Documentation

map_node Struct Reference

Field Documentation

map_node_int64 Struct Reference

Field Documentation

map_node_stat Struct Reference

Field Documentation

map_node_str Struct Reference

Field Documentation

map_root Struct Reference

Field Documentation

stat Struct Reference

+ + + + + + + + + + + + + +


Data Fields
int64_t	count
int64_t	sum
int64_t	min
int64_t	max
int64_t	histogram [BUCKETS]

Field Documentation

+ + + + +

int64_t stat::histogram[BUCKETS]

+ + + + + +

+ +	+ + + + +Definition at line 8 of file map.h.

+ + + + +

int64_t stat::max

+ + + + + +

+ +	+ + + + +Definition at line 7 of file map.h. + +Referenced by _stp_map_stat_add().

+ + + + +

int64_t stat::min

+ + + + + +

+ +	+ + + + +Definition at line 7 of file map.h. + +Referenced by _stp_map_stat_add().

+ + + + +

int64_t stat::sum

+ + + + + +

+ +	+ + + + +Definition at line 6 of file map.h. + +Referenced by _stp_map_stat_add().


Enumerations
enum	errorcode { ERR_NONE = 0, +ERR_NO_MEM + }
Functions
void *	_stp_alloc (size_t len)
	Allocates memory within a probe.
void *	_stp_calloc (size_t len)
	Allocates and clears memory within a probe.
void *	_stp_valloc (size_t len)
	Allocates and clears memory outside a probe.
void	_stp_free (void *ptr)
	Frees memory allocated by _stp_alloc or _stp_calloc.
void	_stp_vfree (void *ptr)
	Frees memory allocated by _stp_valloc.

	list	A list.
	argv	Source argv, in user space.


Functions
long	_stp_strncpy_from_user (char dst, const char __user src, long count)
	Copy a NULL-terminated string from userspace.
unsigned long	_stp_copy_from_user (char dst, const char __user src, unsigned long count)
	Copy a block of data from user space.
int	_stp_copy_argv_from_user (MAP list, char __user __user argv)
	Copy an argv from user space to a List.

	list	A list.
	argv	Source argv, in user space.

alloc.h [code]
copy.c [code]
io.c [code]
map.c [code]
map.h [code]
README [code]
runtime.h [code]

key_data
map_node
map_node_int64
map_node_stat
map_node_str
map_root
stat


Functions
MAP	_stp_map_new (unsigned max_entries, enum valtype type)
	Create a new map.
void	_stp_map_key_del (MAP map)
	Deletes the current element.
map_node *	_stp_map_start (MAP map)
	Get the first element in a map.
map_node *	_stp_map_iter (MAP map, struct map_node *m)
	Get the next element in a map.
void	_stp_map_del (MAP map)
	Deletes a map.
void	_stp_map_key_long_long (MAP map, long key1, long key2)
	Set the map's key to two longs.
void	_stp_map_key_str_str (MAP map, char key1, char key2)
	Set the map's key to two strings.
void	_stp_map_key_str_long (MAP map, char *key1, long key2)
	Set the map's key to a string and a long.
void	_stp_map_key_long_str (MAP map, long key1, char *key2)
	Set the map's key to a long and a string.
void	_stp_map_key_str (MAP map, char *key)
	Set the map's key to a string.
void	_stp_map_key_long (MAP map, long key)
	Set the map's key to a long.
void	_stp_map_set_int64 (MAP map, int64_t val)
	Set the current element's value to an int64.
int64_t	_stp_map_get_int64 (MAP map)
	Gets the current element's value.
void	_stp_map_set_str (MAP map, char *val)
	Set the current element's value to a string.
char *	_stp_map_get_str (MAP map)
	Gets the current element's value.
void	_stp_map_set_stat (MAP map, stat *stats)
	Set the current element's value to a stat.
stat *	_stp_map_get_stat (MAP map)
	Gets the current element's value.
void	_stp_map_stat_add (MAP map, int64_t val)
	Add to the current element's statistics.
MAP	_stp_list_new (unsigned max_entries, enum valtype type)
	Create a new list.
void	_stp_list_clear (MAP map)
	Clears a list.
void	_stp_list_add_str (MAP map, char *str)
	Adds a string to a list.
void	_stp_list_add_int64 (MAP map, int64_t val)
	Adds an int64 to a list.
int	_stp_list_size (MAP map)
	Get the number of elements in a list.


Data Structures
struct	stat
union	key_data
struct	map_node
struct	map_node_int64
struct	map_node_str
struct	map_node_stat
struct	map_root
Defines
#define	key1str(ptr) (ptr->n.key1.str)
#define	key2str(ptr) (ptr->n.key2.str)
#define	key1int(ptr) (ptr->n.key1.val)
#define	key2int(ptr) (ptr->n.key2.val)
#define	_stp_map_key2(map, key1, key2)
#define	_stp_map_key(map, key)
#define	_stp_map_set(map, val)
#define	_stp_list_add(map, val)
#define	foreach(map, ptr)
	Loop through all elements of a map.
Typedefs
typedef map_root *	MAP
Enumerations
enum	keytype { NONE, +LONG, +STR + }
enum	valtype { INT64, +STAT, +STRING, +END + }
Variables
enum keytype	packed


Data Fields
list_head	lnode
hlist_node	hnode
key_data	key1
key_data	key2


Data Fields
int	maxnum
int	num
int	no_wrap
list_head	head
list_head	pool
map_node *	key
u_int8_t	create
hlist_head *	c_keyhead
key_data	c_key1
key_data	c_key2
hlist_head	hashes [HASH_TABLE_SIZE]
void *	membuf

MAP

README

README File Reference

alloc.h

alloc.h File Reference

Enumerations

Functions

Enumeration Type Documentation

Function Documentation

SystemTap Data Structures

argv_example.c

copy.c

copy.c File Reference

Functions

Function Documentation

docs/argv_example.c

SystemTap Examples

SystemTap File List

foreach.c

SystemTap Runtime Library

0.1

io.c

io.c File Reference

Functions

Function Documentation

SystemTap Runtime Library

0.1

map.c

map.c File Reference

Functions

Function Documentation

map.h

map.h File Reference

Data Structures

Defines

Typedefs

Enumerations

Variables

Define Documentation

Typedef Documentation

Enumeration Type Documentation

Variable Documentation

SystemTap Related Pages

runtime.h

runtime.h File Reference

Defines

Define Documentation

map_node Struct Reference

Data Fields

Field Documentation

map_node_int64 Struct Reference

Data Fields

Field Documentation

map_node_stat Struct Reference

Data Fields

Field Documentation

map_node_str Struct Reference

Data Fields

Field Documentation

map_root Struct Reference

Data Fields

Field Documentation

stat Struct Reference

Data Fields

Field Documentation

SystemTap

key_data Union Reference

Data Fields

Field Documentation