--- deliantra/server/socket/image.C	2007/03/14 18:25:18	1.34
+++ deliantra/server/socket/image.C	2007/07/01 04:08:14	1.43
@@ -1,25 +1,25 @@
 /*
- * CrossFire, A Multiplayer game
- *
- * Copyright (C) 2005, 2006, 2007 Marc Lehmann & Crossfire+ Development Team
- * Copyright (C) 2001 Mark Wedel
- * Copyright (C) 1992 Frank Tore Johansen
- *
- * This program is free software; you can redistribute it and/or modify
- * it under the terms of the GNU General Public License as published by
- * the Free Software Foundation; either version 2 of the License, or
- * (at your option) any later version.
- *
- * This program is distributed in the hope that it will be useful,
- * but WITHOUT ANY WARRANTY; without even the implied warranty of
- * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
- * GNU General Public License for more details.
- *
- * You should have received a copy of the GNU General Public License
- * along with this program; if not, write to the Free Software
- * Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.
- *
- * The author can be reached via e-mail to <crossfire@schmorp.de>
+ * This file is part of Crossfire TRT, the Multiplayer Online Role Playing Game.
+ * 
+ * Copyright (©) 2005,2006,2007 Marc Alexander Lehmann / Robin Redeker / the Crossfire TRT team
+ * Copyright (©) 2001,2007 Mark Wedel
+ * Copyright (©) 1992,2007 Frank Tore Johansen
+ * 
+ * Crossfire TRT is free software; you can redistribute it and/or modify it
+ * under the terms of the GNU General Public License as published by the Free
+ * Software Foundation; either version 2 of the License, or (at your option)
+ * any later version.
+ * 
+ * This program is distributed in the hope that it will be useful, but
+ * WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY
+ * or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
+ * for more details.
+ * 
+ * You should have received a copy of the GNU General Public License along
+ * with Crossfire TRT; if not, write to the Free Software Foundation, Inc. 51
+ * Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
+ * 
+ * The authors can be reached via e-mail to <crossfire@schmorp.de>
  */
 
 /** \file
@@ -193,14 +193,46 @@
 }
 
 /**
- * Client has requested pixmap that it somehow missed getting.
- * This will be called often if the client is
- * caching images.
+ * client requested an image. send it rate-limited
+ * before flushing.
  */
 void
-SendFaceCmd (char *buf, int len, client *ns)
+AskFaceCmd (char *buf, int len, client *ns)
 {
-  ns->send_image (atoi (buf));
+  int idx = 0, pri = 0;
+
+  sscanf (buf, "%d %d", &idx, &pri);
+
+  const facedata *d = face_data (idx, ns->faceset);
+
+  if (!d)
+    return; // doh
+
+  client::ixsend ix;
+
+  ix.pri = pri;
+  ix.idx = idx;
+  ix.ofs = d->data.size ();
+
+  // the by far most common case will be to insert
+  // right at the end, so no looping.
+  auto (i, ns->ixface.end ());
+  for (; i != ns->ixface.begin (); )
+    if (pri >= (--i)->pri)
+      break;
+
+  ns->ixface.insert (i, ix);
+}
+
+/**
+ * Tells client the picture it has to use 
+ * to smooth a picture number given as argument.
+ */
+void
+AskSmooth (char *buf, int len, client *ns)
+{
+  ns->send_face (atoi (buf));
+  ns->flush_fx ();
 }
 
 // how lame
@@ -257,13 +289,15 @@
 
   faces_sent[facenum] = true;
 
+  // if for some reason we let a client without face caching connect,
+  // we better support that decision here and implement it.
   if (!facecache)
+    return send_image (facenum);
+
+  if (fxix)
     {
-      send_drawinfo (
-         "*** Please enable image/face caching in preferences or use a client that supports it.\n",
-         NDI_RED
-      );
-      return send_image (facenum);
+      fxface.push_back (facenum);
+      return;
     }
 
   packet sl;
@@ -279,17 +313,62 @@
   print_facename (sl, *d);
   send_packet (sl);
 
-  faceinfo *f = face_info (facenum);
-  if (f->smooth && EMI_smooth)
+  if (EMI_smooth)
+    {
+      faceinfo *f = face_info (facenum);
+
+      if (f->smooth)
+        {
+          send_face (f->smooth);
+
+          packet sl ("smooth");
+
+          sl << uint16 (facenum)
+             << uint16 (f->smooth);
+
+          send_packet (sl);
+        }
+    }
+}
+
+void client::flush_fx ()
+{
+  while (!fxface.empty ())
     {
-      send_face (f->smooth);
+      packet fx ("fx");
+      packet sx ("sx");
 
-      packet sl ("smooth");
+      do
+        {
+          faceidx facenum = fxface.back (); fxface.pop_back ();
 
-      sl << uint16 (facenum)
-         << uint16 (f->smooth);
+          const facedata *d = face_data (facenum, faceset);
 
-      send_packet (sl);
+          if (d)
+            {
+              fx << ber32 (facenum)
+                 << data8 (d->chksum, CHKSUM_SIZE);
+
+              if (smoothing)
+                {
+                  faceinfo *f = face_info (facenum);
+
+                  if (f->smooth)
+                    {
+                      send_face (f->smooth);
+                      sx << ber32 (facenum)
+                         << ber32 (f->smooth)
+                         << ber32 (f->smoothlevel);
+                    }
+                }
+            }
+        }
+      while (!fxface.empty ()
+             && fx.room () > ber32::size + CHKSUM_SIZE + 1
+             && sx.room () > ber32::size * 3);
+
+      send_packet (fx);
+      if (sx.length () > 3) send_packet (sx);
     }
 }
 
@@ -302,13 +381,18 @@
 
   const facedata *d = face_data (facenum, faceset);
 
+  faces_sent[facenum] = true;
+
   if (!d)
     {
       LOG (llevError, "client::send_image (%d) out of bounds??\n", facenum);
       return;
     }
+  
+  //TODO: check type here?
 
-  faces_sent[facenum] = true;
+  if (force_image_newmap)
+    force_newmap = true;
 
   packet sl;
 
@@ -356,7 +440,7 @@
    * are added in contigous order, so if the number is in the valid
    * range, it must be a valid animation.
    */
-  if (anim_num < 0 || anim_num > num_animations)
+  if (anim_num < 0 || anim_num >= animations.size ())
     {
       LOG (llevError, "esrv_send_anim (%d) out of bounds??\n", anim_num);
       return;