src/rt/rust_log.cpp - rust - Git at Google

 /*
  * Logging infrastructure that aims to support multi-threading
  */

 #include "rust_internal.h"
 #include "util/array_list.h"
 #include <stdarg.h>
 #include <stdlib.h>
 #include <string.h>
 #include "rust_util.h"

 /**
  * Synchronizes access to the underlying logging mechanism.
  */
 static lock_and_signal _log_lock;
 /**
  * Indicates whether we are outputing to the console.
  * Protected by _log_lock;
  */
 static bool _log_to_console = true;

 /*
  * Request that console logging be turned on.
  */
 void
 log_console_on() {
     scoped_lock with(_log_lock);
     _log_to_console = true;
 }

 /*
  * Request that console logging be turned off. Can be
  * overridden by the environment.
  */
 void
 log_console_off(rust_env *env) {
     scoped_lock with(_log_lock);
     if (env->logspec == NULL) {
         _log_to_console = false;
     }
 }

 rust_log::rust_log(rust_srv *srv, rust_scheduler *sched) :
     _srv(srv),
     _sched(sched) {
 }

 rust_log::~rust_log() {

 }

 const uint16_t
 hash(uintptr_t ptr) {
 #   if(ULONG_MAX == 0xFFFFFFFF)
     // Robert Jenkins' 32 bit integer hash function
     ptr = (ptr + 0x7ed55d16) + (ptr << 12);
     ptr = (ptr ^ 0xc761c23c) ^ (ptr >> 19);
     ptr = (ptr + 0x165667b1) + (ptr << 5);
     ptr = (ptr + 0xd3a2646c) ^ (ptr << 9);
     ptr = (ptr + 0xfd7046c5) + (ptr << 3);
     ptr = (ptr ^ 0xb55a4f09) ^ (ptr >> 16);
 #   elif(ULONG_MAX == 0xFFFFFFFFFFFFFFFF)
     // "hash64shift()" from http://www.concentric.net/~Ttwang/tech/inthash.htm
     ptr = (~ptr) + (ptr << 21); // ptr = (ptr << 21) - ptr - 1;
     ptr = ptr ^ (ptr >> 24);
     ptr = (ptr + (ptr << 3)) + (ptr << 8); // ptr * 265
     ptr = ptr ^ (ptr >> 14);
     ptr = (ptr + (ptr << 2)) + (ptr << 4); // ptr * 21
     ptr = ptr ^ (ptr >> 28);
     ptr = ptr + (ptr << 31);
 #   else
 #   error "hash() not defined for this pointer size"
 #   endif
     return (uint16_t) ptr;
 }

 char *
 copy_string(char *dst, const char *src, size_t length) {
     return strncpy(dst, src, length) + length;
 }

 char *
 append_string(char *buffer, const char *format, ...) {
     if (buffer != NULL && format) {
         va_list args;
         va_start(args, format);
         size_t off = strlen(buffer);
         vsnprintf(buffer + off, BUF_BYTES - off, format, args);
         va_end(args);
     }
     return buffer;
 }

 void
 rust_log::trace_ln(char *prefix, char *message) {
     char buffer[BUF_BYTES] = "";
     _log_lock.lock();
     append_string(buffer, "%s", prefix);
     append_string(buffer, "%s", message);
     if (_log_to_console) {
         _srv->log(buffer);
     }
     _log_lock.unlock();
 }

 void
 rust_log::trace_ln(rust_task *task, uint32_t level, char *message) {


     // FIXME: The scheduler and task names used to have meaning,
     // but they are always equal to 'main' currently
 #if 0

 #if defined(__WIN32__)
     uint32_t thread_id = 0;
 #else
     uint32_t thread_id = hash((uintptr_t) pthread_self());
 #endif

     char prefix[BUF_BYTES] = "";
     if (_sched && _sched->name) {
         append_string(prefix, "%04" PRIxPTR ":%.10s:",
                       thread_id, _sched->name);
     } else {
         append_string(prefix, "%04" PRIxPTR ":0x%08" PRIxPTR ":",
                       thread_id, (uintptr_t) _sched);
     }
     if (task) {
         if (task->name) {
             append_string(prefix, "%.10s:", task->name);
         } else {
             append_string(prefix, "0x%08" PRIxPTR ":", (uintptr_t) task);
         }
     }
 #else
     char prefix[BUF_BYTES] = "";
 #endif

     trace_ln(prefix, message);
 }

 // Reading log directives and setting log level vars

 struct mod_entry {
     const char* name;
     uint32_t* state;
 };

 struct cratemap {
     const mod_entry* entries;
     const cratemap* children[1];
 };

 struct log_directive {
     char* name;
     size_t level;
 };

 const size_t max_log_directives = 255;
 const size_t max_log_level = 255;
 const size_t default_log_level = 0;

 // This is a rather ugly parser for strings in the form
 // "crate1,crate2.mod3,crate3.x=1". Log levels are 0-255,
 // with the most likely ones being 0-3 (defined in core::).
 size_t parse_logging_spec(char* spec, log_directive* dirs) {
     size_t dir = 0;
     while (dir < max_log_directives && *spec) {
         char* start = spec;
         char cur;
         while (true) {
             cur = *spec;
             if (cur == ',' || cur == '=' || cur == '\0') {
                 if (start == spec) {spec++; break;}
                 if (*spec != '\0') {
                     *spec = '\0';
                     spec++;
                 }
                 size_t level = max_log_level;
                 if (cur == '=' && *spec != '\0') {
                     level = *spec - '0';
                     if (level > max_log_level) level = max_log_level;
                     if (*spec) ++spec;
                 }
                 dirs[dir].name = start;
                 dirs[dir++].level = level;
                 break;
             } else {
                 spec++;
             }
         }
     }
     return dir;
 }

 void update_module_map(const mod_entry* map, log_directive* dirs,
                        size_t n_dirs, size_t *n_matches) {
     for (const mod_entry* cur = map; cur->name; cur++) {
         size_t level = default_log_level, longest_match = 0;
         for (size_t d = 0; d < n_dirs; d++) {
             if (strstr(cur->name, dirs[d].name) == cur->name &&
                 strlen(dirs[d].name) > longest_match) {
                 longest_match = strlen(dirs[d].name);
                 level = dirs[d].level;
             }
         }
         *cur->state = level;
         (*n_matches)++;
     }
 }

 void update_crate_map(const cratemap* map, log_directive* dirs,
                       size_t n_dirs, size_t *n_matches) {
     // First update log levels for this crate
     update_module_map(map->entries, dirs, n_dirs, n_matches);
     // Then recurse on linked crates
     // FIXME this does double work in diamond-shaped deps. could keep
     //   a set of visited addresses, if it turns out to be actually slow
     for (size_t i = 0; map->children[i]; i++) {
         update_crate_map(map->children[i], dirs, n_dirs, n_matches);
     }
 }

 void print_crate_log_map(const cratemap* map) {
     for (const mod_entry* cur = map->entries; cur->name; cur++) {
         printf("  %s\n", cur->name);
     }
     for (size_t i = 0; map->children[i]; i++) {
         print_crate_log_map(map->children[i]);
     }
 }

 // These are pseudo-modules used to control logging in the runtime.

 uint32_t log_rt_mem;
 uint32_t log_rt_comm;
 uint32_t log_rt_task;
 uint32_t log_rt_dom;
 uint32_t log_rt_trace;
 uint32_t log_rt_cache;
 uint32_t log_rt_upcall;
 uint32_t log_rt_timer;
 uint32_t log_rt_gc;
 uint32_t log_rt_stdlib;
 uint32_t log_rt_kern;
 uint32_t log_rt_backtrace;
 uint32_t log_rt_callback;

 static const mod_entry _rt_module_map[] =
     {{"::rt::mem", &log_rt_mem},
      {"::rt::comm", &log_rt_comm},
      {"::rt::task", &log_rt_task},
      {"::rt::dom", &log_rt_dom},
      {"::rt::trace", &log_rt_trace},
      {"::rt::cache", &log_rt_cache},
      {"::rt::upcall", &log_rt_upcall},
      {"::rt::timer", &log_rt_timer},
      {"::rt::gc", &log_rt_gc},
      {"::rt::stdlib", &log_rt_stdlib},
      {"::rt::kern", &log_rt_kern},
      {"::rt::backtrace", &log_rt_backtrace},
      {"::rt::callback", &log_rt_callback},
      {NULL, NULL}};

 void update_log_settings(void* crate_map, char* settings) {
     char* buffer = NULL;
     log_directive dirs[256];
     size_t n_dirs = 0;

     if (settings) {

         if (strcmp(settings, "::help") == 0 ||
             strcmp(settings, "?") == 0) {
             printf("\nCrate log map:\n\n");
             print_crate_log_map((const cratemap*)crate_map);
             printf("\n");
             exit(1);
         }

         size_t buflen = strlen(settings) + 1;
         buffer = (char*)malloc(buflen);
         strncpy(buffer, settings, buflen);
         n_dirs = parse_logging_spec(buffer, &dirs[0]);
     }

     size_t n_matches = 0;
     update_module_map(_rt_module_map, &dirs[0], n_dirs, &n_matches);
     update_crate_map((const cratemap*)crate_map, &dirs[0],
                      n_dirs, &n_matches);

     if (n_matches < n_dirs) {
         printf("warning: got %" PRIdPTR " RUST_LOG specs, "
                "enabled %" PRIdPTR " flags.",
                (uintptr_t)n_dirs, (uintptr_t)n_matches);
     }

     free(buffer);
 }

 //
 // Local Variables:
 // mode: C++
 // fill-column: 78;
 // indent-tabs-mode: nil
 // c-basic-offset: 4
 // buffer-file-coding-system: utf-8-unix
 // compile-command: "make -k -C $RBUILD 2>&1 | sed -e 's/\\/x\\//x:\\//g'";
 // End:
 //
	/*
	* Logging infrastructure that aims to support multi-threading
	*/

	#include "rust_internal.h"
	#include "util/array_list.h"
	#include <stdarg.h>
	#include <stdlib.h>
	#include <string.h>
	#include "rust_util.h"

	/**
	* Synchronizes access to the underlying logging mechanism.
	*/
	static lock_and_signal _log_lock;
	/**
	* Indicates whether we are outputing to the console.
	* Protected by _log_lock;
	*/
	static bool _log_to_console = true;

	/*
	* Request that console logging be turned on.
	*/
	void
	log_console_on() {
	scoped_lock with(_log_lock);
	_log_to_console = true;
	}

	/*
	* Request that console logging be turned off. Can be
	* overridden by the environment.
	*/
	void
	log_console_off(rust_env *env) {
	scoped_lock with(_log_lock);
	if (env->logspec == NULL) {
	_log_to_console = false;
	}
	}

	rust_log::rust_log(rust_srv srv, rust_scheduler sched) :
	_srv(srv),
	_sched(sched) {
	}

	rust_log::~rust_log() {

	}

	const uint16_t
	hash(uintptr_t ptr) {
	# if(ULONG_MAX == 0xFFFFFFFF)
	// Robert Jenkins' 32 bit integer hash function
	ptr = (ptr + 0x7ed55d16) + (ptr << 12);
	ptr = (ptr ^ 0xc761c23c) ^ (ptr >> 19);
	ptr = (ptr + 0x165667b1) + (ptr << 5);
	ptr = (ptr + 0xd3a2646c) ^ (ptr << 9);
	ptr = (ptr + 0xfd7046c5) + (ptr << 3);
	ptr = (ptr ^ 0xb55a4f09) ^ (ptr >> 16);
	# elif(ULONG_MAX == 0xFFFFFFFFFFFFFFFF)
	// "hash64shift()" from http://www.concentric.net/~Ttwang/tech/inthash.htm
	ptr = (~ptr) + (ptr << 21); // ptr = (ptr << 21) - ptr - 1;
	ptr = ptr ^ (ptr >> 24);
	ptr = (ptr + (ptr << 3)) + (ptr << 8); // ptr * 265
	ptr = ptr ^ (ptr >> 14);
	ptr = (ptr + (ptr << 2)) + (ptr << 4); // ptr * 21
	ptr = ptr ^ (ptr >> 28);
	ptr = ptr + (ptr << 31);
	# else
	# error "hash() not defined for this pointer size"
	# endif
	return (uint16_t) ptr;
	}

	char *
	copy_string(char dst, const char src, size_t length) {
	return strncpy(dst, src, length) + length;
	}

	char *
	append_string(char buffer, const char format, ...) {
	if (buffer != NULL && format) {
	va_list args;
	va_start(args, format);
	size_t off = strlen(buffer);
	vsnprintf(buffer + off, BUF_BYTES - off, format, args);
	va_end(args);
	}
	return buffer;
	}

	void
	rust_log::trace_ln(char prefix, char message) {
	char buffer[BUF_BYTES] = "";
	_log_lock.lock();
	append_string(buffer, "%s", prefix);
	append_string(buffer, "%s", message);
	if (_log_to_console) {
	_srv->log(buffer);
	}
	_log_lock.unlock();
	}

	void
	rust_log::trace_ln(rust_task task, uint32_t level, char message) {


	// FIXME: The scheduler and task names used to have meaning,
	// but they are always equal to 'main' currently
	#if 0

	#if defined(__WIN32__)
	uint32_t thread_id = 0;
	#else
	uint32_t thread_id = hash((uintptr_t) pthread_self());
	#endif

	char prefix[BUF_BYTES] = "";
	if (_sched && _sched->name) {
	append_string(prefix, "%04" PRIxPTR ":%.10s:",
	thread_id, _sched->name);
	} else {
	append_string(prefix, "%04" PRIxPTR ":0x%08" PRIxPTR ":",
	thread_id, (uintptr_t) _sched);
	}
	if (task) {
	if (task->name) {
	append_string(prefix, "%.10s:", task->name);
	} else {
	append_string(prefix, "0x%08" PRIxPTR ":", (uintptr_t) task);
	}
	}
	#else
	char prefix[BUF_BYTES] = "";
	#endif

	trace_ln(prefix, message);
	}

	// Reading log directives and setting log level vars

	struct mod_entry {
	const char* name;
	uint32_t* state;
	};

	struct cratemap {
	const mod_entry* entries;
	const cratemap* children[1];
	};

	struct log_directive {
	char* name;
	size_t level;
	};

	const size_t max_log_directives = 255;
	const size_t max_log_level = 255;
	const size_t default_log_level = 0;

	// This is a rather ugly parser for strings in the form
	// "crate1,crate2.mod3,crate3.x=1". Log levels are 0-255,
	// with the most likely ones being 0-3 (defined in core::).
	size_t parse_logging_spec(char* spec, log_directive* dirs) {
	size_t dir = 0;
	while (dir < max_log_directives && *spec) {
	char* start = spec;
	char cur;
	while (true) {
	cur = *spec;
	if (cur == ',' \|\| cur == '=' \|\| cur == '\0') {
	if (start == spec) {spec++; break;}
	if (*spec != '\0') {
	*spec = '\0';
	spec++;
	}
	size_t level = max_log_level;
	if (cur == '=' && *spec != '\0') {
	level = *spec - '0';
	if (level > max_log_level) level = max_log_level;
	if (*spec) ++spec;
	}
	dirs[dir].name = start;
	dirs[dir++].level = level;
	break;
	} else {
	spec++;
	}
	}
	}
	return dir;
	}

	void update_module_map(const mod_entry* map, log_directive* dirs,
	size_t n_dirs, size_t *n_matches) {
	for (const mod_entry* cur = map; cur->name; cur++) {
	size_t level = default_log_level, longest_match = 0;
	for (size_t d = 0; d < n_dirs; d++) {
	if (strstr(cur->name, dirs[d].name) == cur->name &&
	strlen(dirs[d].name) > longest_match) {
	longest_match = strlen(dirs[d].name);
	level = dirs[d].level;
	}
	}
	*cur->state = level;
	(*n_matches)++;
	}
	}

	void update_crate_map(const cratemap* map, log_directive* dirs,
	size_t n_dirs, size_t *n_matches) {
	// First update log levels for this crate
	update_module_map(map->entries, dirs, n_dirs, n_matches);
	// Then recurse on linked crates
	// FIXME this does double work in diamond-shaped deps. could keep
	// a set of visited addresses, if it turns out to be actually slow
	for (size_t i = 0; map->children[i]; i++) {
	update_crate_map(map->children[i], dirs, n_dirs, n_matches);
	}
	}

	void print_crate_log_map(const cratemap* map) {
	for (const mod_entry* cur = map->entries; cur->name; cur++) {
	printf(" %s\n", cur->name);
	}
	for (size_t i = 0; map->children[i]; i++) {
	print_crate_log_map(map->children[i]);
	}
	}

	// These are pseudo-modules used to control logging in the runtime.

	uint32_t log_rt_mem;
	uint32_t log_rt_comm;
	uint32_t log_rt_task;
	uint32_t log_rt_dom;
	uint32_t log_rt_trace;
	uint32_t log_rt_cache;
	uint32_t log_rt_upcall;
	uint32_t log_rt_timer;
	uint32_t log_rt_gc;
	uint32_t log_rt_stdlib;
	uint32_t log_rt_kern;
	uint32_t log_rt_backtrace;
	uint32_t log_rt_callback;

	static const mod_entry _rt_module_map[] =
	{{"::rt::mem", &log_rt_mem},
	{"::rt::comm", &log_rt_comm},
	{"::rt::task", &log_rt_task},
	{"::rt::dom", &log_rt_dom},
	{"::rt::trace", &log_rt_trace},
	{"::rt::cache", &log_rt_cache},
	{"::rt::upcall", &log_rt_upcall},
	{"::rt::timer", &log_rt_timer},
	{"::rt::gc", &log_rt_gc},
	{"::rt::stdlib", &log_rt_stdlib},
	{"::rt::kern", &log_rt_kern},
	{"::rt::backtrace", &log_rt_backtrace},
	{"::rt::callback", &log_rt_callback},
	{NULL, NULL}};

	void update_log_settings(void* crate_map, char* settings) {
	char* buffer = NULL;
	log_directive dirs[256];
	size_t n_dirs = 0;

	if (settings) {

	if (strcmp(settings, "::help") == 0 \|\|
	strcmp(settings, "?") == 0) {
	printf("\nCrate log map:\n\n");
	print_crate_log_map((const cratemap*)crate_map);
	printf("\n");
	exit(1);
	}

	size_t buflen = strlen(settings) + 1;
	buffer = (char*)malloc(buflen);
	strncpy(buffer, settings, buflen);
	n_dirs = parse_logging_spec(buffer, &dirs[0]);
	}

	size_t n_matches = 0;
	update_module_map(_rt_module_map, &dirs[0], n_dirs, &n_matches);
	update_crate_map((const cratemap*)crate_map, &dirs[0],
	n_dirs, &n_matches);

	if (n_matches < n_dirs) {
	printf("warning: got %" PRIdPTR " RUST_LOG specs, "
	"enabled %" PRIdPTR " flags.",
	(uintptr_t)n_dirs, (uintptr_t)n_matches);
	}

	free(buffer);
	}

	//
	// Local Variables:
	// mode: C++
	// fill-column: 78;
	// indent-tabs-mode: nil
	// c-basic-offset: 4
	// buffer-file-coding-system: utf-8-unix
	// compile-command: "make -k -C $RBUILD 2>&1 \| sed -e 's/\\/x\\//x:\\//g'";
	// End:
	//