hurd/

2008-06-27  Neal H. Walfield  <neal@gnu.org>

	* activity.h (RM_activity_stats): Don't define.
	(RM_activity_info): Replace with this.
	(struct activity_stats): Add field pressure_local.  Make field
	pressure an 8 bit integer.
	(struct activity_stats_buffer): Remove structure.
	(struct activity_info): Replace with this structure.
	(activity_info_stats): Define.
	(activity_info_pressure): Likewise.
	(activity_stats): Remove method.
	(activity_info): Replace with this.

viengoos/

2008-06-27  Neal H. Walfield  <neal@gnu.org>

	* activity.h (struct activity): Add fields free_bad_karma,
	free_goal, free_allocations and free_initial_allocation.
	* rm.h (rm_method_id_string): Replace RM_activity_stats handling
	with RM_activity_info handling.
	* thread.h (THREAD_WAIT_STATS): Remove.
	(THREAD_WAIT_ACTIVITY_INFO): Replace with this.
	(struct thread): Add field wait_reason_arg2.
	* ager.c (update_stats): Account for local pressure when
	calculating availability.  Don't use activity_stats to inform
	threads of new statistics but activity_info.
	* object.c (object_desc_claim): Adjust the activity's FREE_GOAL,
	FREE_ALLOCATIONS, and FRAMES_EXCLUDED fields as appropriate.
	* pager.c (pager_collect): When selecting a victim, don't include
	an activity's excluded frames in its allocation.  Don't even
	consider activities for which FREE_ALLOCATIONS is non-zero.
	Having selected a victim, don't increase the pressure do
	drastically.  Update the local pressure.  Having selected a victim
	from which to revoke pages, send any waiting threads a message to
	free memory.  If VICTIM->FREE_BAD_KARMA is 0, assume that the
	memory will be freed and give the activity 100 claims to do it.
	If the activity has bad karma, decrease it by one.
	* server.c (server_loop): Replace activity_stats implementation
	with implementation appropriate for activity_info.

hieronymus/

2008-06-27  Neal H. Walfield  <neal@gnu.org>

	* hieronymus.c (do_gather_stats): Change to use activity_info
	instead of activity_stats.

	(main): Introduce code to delay process creation.

ruth/

2008-06-27  Neal H. Walfield  <neal@gnu.org>

	* ruth.c (main): Update to use activity_info instead of
	activity_stats.

benchmarks/

2008-06-27  Neal H. Walfield  <neal@gnu.org>

	* shared-memory-distribution.c (main): Update to use activity_info
	instead of activity_status.
	* activity-distribution.c (main): Likewise.

	* GCbench.c: Include <stdint.h> and <stdbool.h>.
	(now): New function.
	(struct stats): Add fields time, gcs and iter.
	(have_a_hog): New variable.
	(mem_hog) [__gnu_hurd_viengoos__]: Rename from this...
	(helper) [__gnu_hurd_viengoos__]: ... to this.  Use activity_info,
	not activity_stats.  Gather more data.
	(helper) [! __gnu_hurd_viengoos__]: New function.
	(tid): Rename from this...
	(helper_tid): ... to this.
	(helper_fork) [__gnu_hurd_viengoos__]: Name activities.
	(main): Improve output.

benchmarks/boehm-gc/

2008-06-27  Neal H. Walfield  <neal@gnu.org>

	* patches/05-viengoos-scheduler.patch: Update to use activity_info
	in place of activity_stats.  Listen for pressure messages and act
	appropriately.  Tighten adaptive code.  Improve profiling code.

1 files changed, 36 insertions, 19 deletions

diff --git a/benchmarks/shared-memory-distribution.c b/benchmarks/shared-memory-distribution.c
index 4043718..04b37c2 100644
--- a/benchmarks/shared-memory-distribution.c
+++ b/benchmarks/shared-memory-distribution.c
@@ -62,14 +62,24 @@ main (int argc, char *argv[])
     int count = 0;
     while (! terminate)
       {
-	uintptr_t *p = buffer + (rand () % PAGES) * PAGESIZE;
-	t = *p;
-
-	count ++;
-	if (count % 100000 == 0)
-	  debug (0, DEBUG_BOLD ("Read %d pages so far"), count);
-
+	int i;
+	for (i = 0; i < 1; i ++)
+	  {
+	    uintptr_t *p = buffer + (rand () % PAGES) * PAGESIZE;
+	    t += *p;
+
+	    count ++;
+
+	    if (count % 100000 == 0)
+	      debug (0, DEBUG_BOLD ("Read %d pages so far"), count);
+	  }
+
+#if 0
+	/* ~128Hz.  */
+	l4_sleep (l4_time_period (1 << 13));
+#elif 1
 	l4_thread_switch (tids[rand () % THREADS]);
+#endif
       }
 
     printf ("Thread %d: %d operations\n", w, count);
@@ -98,24 +108,26 @@ main (int argc, char *argv[])
     {
       debug (0, DEBUG_BOLD ("starting iteration %d (%x)"), i, l4_myself ());
 
-      int count;
-      struct activity_stats_buffer buffer;
+      struct activity_info info;
 
-      rm_activity_stats (activity, next_period, &buffer, &count);
-      assert (count > 0);
+      rm_activity_info (activity, activity_info_stats, next_period, &info);
+      assert (info.event == activity_info_stats);
+      assert (info.stats.count > 0);
       if (i != 0)
-	assertx (buffer.stats[0].period != stats[i - 1][0].period,
+	assertx (info.stats.stats[0].period != stats[i - 1][0].period,
 		 "%x != %x",
-		 buffer.stats[0].period, stats[i - 1][0].period);
+		 info.stats.stats[0].period, stats[i - 1][0].period);
 
-      stats[i][0] = buffer.stats[0];
+      stats[i][0] = info.stats.stats[0];
 
       int j;
       for (j = 0; j < THREADS; j ++)
 	{
-	  rm_activity_stats (activities[j], next_period, &buffer, &count);
-	  assert (count > 0);
-	  stats[i][1 + j] = buffer.stats[0];
+	  rm_activity_info (activity, activity_info_stats, next_period,
+			    &info);
+	  assert (info.event == activity_info_stats);
+	  assert (info.stats.count > 0);
+	  stats[i][1 + j] = info.stats.stats[0];
 	}
 
       next_period = stats[i][0].period + 1;
@@ -137,10 +149,15 @@ main (int argc, char *argv[])
     {
       int j;
 
-      printf ("%d ", (int) stats[i][0].period);
+      printf ("%d", (int) stats[i][0].period);
 
       for (j = 0; j < 1 + THREADS; j ++)
-	printf ("%d ", (int) stats[i][j].clean + (int) stats[i][j].dirty);
+	printf ("\t%d\t%d\t%d\t%d\t%d\t%d", (int) stats[i][j].clean,
+		(int) stats[i][j].dirty,
+		(int) stats[i][j].pending_eviction,
+		(int) stats[i][j].discarded,
+		(int) stats[i][j].freeloading,
+		(int) stats[i][j].freeloaded);
       printf ("\n");
     }