home *** CD-ROM | disk | FTP | other *** search
/ OS/2 Shareware BBS: 2 BBS / 02-BBS.zip / BSRC_250.LZH / SB_SAVE.C < prev    next >
C/C++ Source or Header  |  1991-09-15  |  6KB  |  126 lines
  1. /*--------------------------------------------------------------------------*/
  2. /*                                                                          */
  3. /*                                                                          */
  4. /*      ------------         Bit-Bucket Software, Co.                       */
  5. /*      \ 10001101 /         Writers and Distributors of                    */
  6. /*       \ 011110 /          Freely Available<tm> Software.                 */
  7. /*        \ 1011 /                                                          */
  8. /*         ------                                                           */
  9. /*                                                                          */
  10. /*  (C) Copyright 1987-91, Bit Bucket Software Co., a Delaware Corporation. */
  11. /*                                                                          */
  12. /*                                                                          */
  13. /*              Routines for updating the screen within BinkleyTerm         */
  14. /*                                                                          */
  15. /*                                                                          */
  16. /*    For complete  details  of the licensing restrictions, please refer    */
  17. /*    to the License  agreement,  which  is published in its entirety in    */
  18. /*    the MAKEFILE and BT.C, and also contained in the file LICENSE.250.    */
  19. /*                                                                          */
  20. /*    USE  OF THIS FILE IS SUBJECT TO THE  RESTRICTIONS CONTAINED IN THE    */
  21. /*    BINKLEYTERM  LICENSING  AGREEMENT.  IF YOU DO NOT FIND THE TEXT OF    */
  22. /*    THIS  AGREEMENT IN ANY OF THE  AFOREMENTIONED FILES,  OR IF YOU DO    */
  23. /*    NOT HAVE THESE FILES,  YOU  SHOULD  IMMEDIATELY CONTACT BIT BUCKET    */
  24. /*    SOFTWARE CO.  AT ONE OF THE  ADDRESSES  LISTED BELOW.  IN NO EVENT    */
  25. /*    SHOULD YOU  PROCEED TO USE THIS FILE  WITHOUT HAVING  ACCEPTED THE    */
  26. /*    TERMS  OF  THE  BINKLEYTERM  LICENSING  AGREEMENT,  OR  SUCH OTHER    */
  27. /*    AGREEMENT AS YOU ARE ABLE TO REACH WITH BIT BUCKET SOFTWARE, CO.      */
  28. /*                                                                          */
  29. /*                                                                          */
  30. /* You can contact Bit Bucket Software Co. at any one of the following      */
  31. /* addresses:                                                               */
  32. /*                                                                          */
  33. /* Bit Bucket Software Co.        FidoNet  1:104/501, 1:343/491             */
  34. /* P.O. Box 460398                AlterNet 7:491/0                          */
  35. /* Aurora, CO 80046               BBS-Net  86:2030/1                        */
  36. /*                                Internet f491.n343.z1.fidonet.org         */
  37. /*                                                                          */
  38. /* Please feel free to contact us at any time to share your comments about  */
  39. /* our software and/or licensing policies.                                  */
  40. /*                                                                          */
  41. /*                                                                          */
  42. /*   This module is derived from code developed by Augie Hansen in his      */
  43. /*   book "Proficient C" published by Microsoft Press.  Mr. Hansen was      */
  44. /*   kind enough to give us verbal permission to use his routines, and      */
  45. /*   Bob, Vince and Alan (and all our full screen users) are grateful.      */
  46. /*   If you decide to use this code in some package you are doing, give     */
  47. /*   some thought to going out and buying the book. He deserves that.       */
  48. /*                                                                          */
  49. /*--------------------------------------------------------------------------*/
  50.  
  51. /* Include this file before any other includes or defines! */
  52.  
  53. #include "includes.h"
  54.  
  55. extern BUFFER Sbuf;
  56. extern CELLP Scrnbuf;
  57.  
  58. char *pop_malloc (unsigned);
  59. void pop_free (char *);
  60.  
  61. BINK_SAVEP sb_save (int top, int left, int height, int width)
  62. {
  63.    BINK_SAVEP new;
  64.    CELLP c;
  65.    int i, j;
  66.  
  67.    new = calloc (1, sizeof (BINK_SAVE));
  68.    c = new->save_cells = (CELLP) pop_malloc (sizeof(CELL) * height * width);
  69.    new->region = sb_new (top, left, height, width);
  70.    new->save_row = top;
  71.    new->save_col = left;
  72.    new->save_ht  = height;
  73.    new->save_wid = width;
  74.  
  75.    j = top * SB_COLS + left;
  76.    for (i = 0; i < height; i++)
  77.       {
  78. #ifndef MILQ
  79.       (void) memcpy (&c[i * width], &Scrnbuf[j], width * sizeof (CELL));
  80. #endif
  81.       j += SB_COLS;
  82.       }
  83.  
  84.    return (new);
  85. }
  86.  
  87. void sb_restore (BINK_SAVEP save )
  88. {
  89.    int i, j, r;
  90.  
  91. #ifndef MILQ
  92.    j = save->save_row * SB_COLS + save->save_col;
  93.    for (r = save->save_row, i = 0; i < save->save_ht; r++, i++)
  94.       {
  95. #ifndef MILQ
  96.       (void) memcpy (&Scrnbuf[j], &(save->save_cells[i * save->save_wid]), save->save_wid * sizeof (CELL));
  97. #endif
  98.       j += SB_COLS;
  99.       if (save->save_col < Sbuf.lcol[r])
  100.          Sbuf.lcol[r] = save->save_col;
  101.       if (save->save_col + save->save_wid > Sbuf.rcol[r])
  102.          Sbuf.rcol[r] = save->save_col + save->save_wid;
  103.       }
  104.  
  105.    Sbuf.flags |= SB_DELTA;
  106. #endif
  107.  
  108.    pop_free ( (char *)(save->save_cells));
  109.    free (save->region);
  110.    free (save);
  111. }
  112.  
  113. char *pop_malloc (unsigned int s)
  114. {
  115.   char *p;
  116.  
  117.   p = (char *) popbuf;
  118.   popbuf += s;
  119.   return (p);
  120. }
  121.  
  122. void pop_free (char *s)
  123. {
  124.   popbuf = (byte *) s;
  125. }
  126.