Update our yasm copy to yasm 1.1.0 (Part 1: yasm side)...

third_party/yasm/patched-yasm/libyasm/inttree.c

 #include "util.h"
-/*@unused@*/ RCSID("$Id: inttree.c 1893 2007-07-14 03:11:32Z peter $");
+/*@unused@*/ RCSID("$Id: inttree.c 2262 2010-01-03 02:46:11Z peter $");
 
 #include <stdlib.h>
 #include <stdio.h>
 #include <limits.h>
 #include <math.h>
 #include "coretype.h"
 #include "inttree.h"
 
 #define VERIFY(condition) \
 if (!(condition)) { \
@@ skipping 472 matching lines @@
         TreePrintHelper(it, x->left);
         ITN_print(x, it->nil, it->root);
         TreePrintHelper(it, x->right);
     }
 }
 
 void
 IT_destroy(IntervalTree *it)
 {
     IntervalTreeNode *x = it->root->left;
-    SLIST_HEAD(, nodeent) stuffToFree = SLIST_HEAD_INITIALIZER(stuffToFree);
+    SLIST_HEAD(node_head, nodeent)
+        stuffToFree = SLIST_HEAD_INITIALIZER(stuffToFree);
     struct nodeent {
         SLIST_ENTRY(nodeent) link;
         struct IntervalTreeNode *node;
     } *np;
 
     if (x != it->nil) {
         if (x->left != it->nil) {
             np = yasm_xmalloc(sizeof(struct nodeent));
             np->node = x->left;
             SLIST_INSERT_HEAD(&stuffToFree, np, link);
@@ skipping 376 matching lines @@
     VERIFY(it->root->high == INT_MAX);
     VERIFY(it->root->maxHigh == INT_MAX);
     VERIFY(it->nil->data == NULL);
     VERIFY(it->root->data == NULL);
     VERIFY(it->nil->red == 0);
     VERIFY(it->root->red == 0);
     CheckMaxHighFields(it, it->root->left);
 }
 #endif