- client (Unix): don't assume that LD_LIBRARY_PATH is defined

svn path=/trunk/boinc/; revision=15944

checkin_notes

@@ -7084,3 +7084,9 @@ David  26 Aug 2008
 	client/
 		gui_rpc_server.C,h
 		gui_rpc_server_ops.C
+
+David  28 Aug 2008
+    - client (Unix): don't assume that LD_LIBRARY_PATH is defined
+
+    client/
+        app_start.C

client/app_start.C

@@ -771,9 +771,12 @@ int ACTIVE_TASK::start(bool first_time) {
         //
         char libpath[8192];
         get_project_dir(wup->project, buf, sizeof(buf));
-        sprintf(libpath, "%s:../../%s:.:../..",
-            getenv("LD_LIBRARY_PATH"), buf
-        );
+        char* p = getenv("LD_LIBRARY_PATH");
+        if (p) {
+            sprintf(libpath, "%s:../../%s:.:../..", p, buf);
+        } else {
+            sprintf(libpath, "../../%s:.:../..", buf);
+        }
         fprintf(stderr, "LD PATH: %s\n", libpath);
         setenv("LD_LIBRARY_PATH", libpath, 1);
 

doc/boinc_news.php

@@ -1,6 +1,13 @@
 <?
 
 $project_news = array(
+array("August 26, 2008",
+    "Welcome to the
+    <a href=\"http://nqueens.ing.udec.cl/\">NQueens@home</a> project,
+    from the Universidad de Concepción in Chile,
+    which seeks to find the solutions to the N Queens problem
+    for values of 26 and greater."
+),
 array("August 19, 2008",
     "LinkedIn users: join a
     <a href=\"http://www.linkedin.com/groups?gid=678497\">BOINC Users group</a>."

doc/projects.inc

@@ -218,6 +218,14 @@ $math = array(
             "This project studies Chess 960, a variant of orthodox chess. In classical chess the starting position of the game never changes.  In Chess 960, just before the start of every game, the initial configuration of the chess pieces is determined randomly.",
             "chess960athome.jpg"
         ),
+        array(
+            "NQueens@home",
+            "http://nqueens.ing.udec.cl/",
+            "Universidad de Concepción, Chile",
+            "Game-playing",
+            "The eight queens problem consists of trying to place eight queens on a chessboard so that no queen attacks any other queen.  I has long been known that there are 92 solutions, of which 12 are distinct. NQueens@home studies the generalization to N queens on an NxN board, for N=19 and greater.",
+            "NQueens-Logo1b.png"
+        ),
     ),
 );
 

html/ops/bolt_admin.php

@@ -24,8 +24,8 @@ function show_course($course) {
             <br>Description: $course->description
             <br>Created: ".date_str($course->create_time)."
     ";
-    $y = "<a href=bolt_map.php?course_id=$course->id>Course map</a>
-        <br><a href=bolt_compare.php?course_id=$course->id>Lesson compare</a>
+    $y = "<a href=bolt_map.php?course_id=$course->id>Map</a>
+        <br><a href=bolt_compare.php?course_id=$course->id>Experiments</a>
         <br>
     ";
     row2_init($x, $y);

sched/sched_plan.C

@@ -67,6 +67,11 @@ bool app_plan(SCHEDULER_REQUEST& sreq, char* plan_class, HOST_USAGE& hu) {
         for (unsigned int i=0; i<sreq.coprocs.coprocs.size(); i++) {
             COPROC* cp = sreq.coprocs.coprocs[i];
             if (!strcmp(cp->type, "CUDA")) {
+                COPROC_CUDA* cp2 = (COPROC_CUDA*) cp;
+                if ((cp2->prop.major)*100 + (cp2->prop.minor) <= 100) {
+                    log_messages.printf(MSG_DEBUG, "Host GPU architecture < 1.1");
+                    return false;
+                } 
                 COPROC* cu = new COPROC (cp->type);
                 cu->count = 1;
                 hu.coprocs.coprocs.push_back(cu);