From b49fdc9edee4bfbb28326437c224ab8c30670a3c Mon Sep 17 00:00:00 2001
From: Chris Hanson <org/chris-hanson/cph>
Date: Thu, 23 Jul 1987 21:53:19 +0000
Subject: [PATCH] Add new C procedures for allocating vectors.

---
 v7/src/microcode/vector.c | 64 +++++++++++++++++++++++++++++----------
 1 file changed, 48 insertions(+), 16 deletions(-)

diff --git a/v7/src/microcode/vector.c b/v7/src/microcode/vector.c
index def55a2d3..24233b0bc 100644
--- a/v7/src/microcode/vector.c
+++ b/v7/src/microcode/vector.c
@@ -30,7 +30,7 @@ Technology nor of any adaptation thereof in any advertising,
 promotional, or sales literature without prior written consent from
 MIT in each case. */
 
-/* $Header: /Users/cph/tmp/foo/mit-scheme/mit-scheme/v7/src/microcode/vector.c,v 9.25 1987/07/07 21:03:26 cph Rel $
+/* $Header: /Users/cph/tmp/foo/mit-scheme/mit-scheme/v7/src/microcode/vector.c,v 9.26 1987/07/23 21:53:19 cph Rel $
  *
  * This file contains procedures for handling vectors and conversion
  * back and forth to lists.
@@ -38,6 +38,53 @@ MIT in each case. */
 
 #include "scheme.h"
 #include "primitive.h"
+
+Pointer
+allocate_non_marked_vector (type_code, length, gc_check_p)
+     int type_code;
+     fast long length;
+     Boolean gc_check_p;
+{
+  fast Pointer result;
+
+  if (gc_check_p)
+    Primitive_GC_If_Needed (length + 1);
+  result = (Make_Pointer (type_code, Free));
+  (*Free++) = (Make_Non_Pointer (TC_MANIFEST_NM_VECTOR, length));
+  Free += length;
+  return (result);
+}
+
+Pointer
+allocate_marked_vector (type_code, length, gc_check_p)
+     int type_code;
+     fast long length;
+     Boolean gc_check_p;
+{
+  fast Pointer result;
+
+  if (gc_check_p)
+    Primitive_GC_If_Needed (length + 1);
+  result = (Make_Pointer (type_code, Free));
+  (*Free++) = (Make_Non_Pointer (TC_MANIFEST_VECTOR, length));
+  Free += length;
+  return (result);
+}
+
+Pointer
+make_vector (length, contents)
+     fast long length;
+     fast Pointer contents;
+{
+  fast Pointer result;
+
+  Primitive_GC_If_Needed (length + 1);
+  result = (Make_Pointer (TC_VECTOR, Free));
+  (*Free++) = (Make_Non_Pointer (TC_MANIFEST_VECTOR, length));
+  while ((length--) > 0)
+    (*Free++) = contents;
+  return (result);
+}
 
                        /*********************/
                        /* VECTORS <-> LISTS */
@@ -126,21 +173,6 @@ Built_In_Primitive(Prim_Subvector_To_List, 3, "SUBVECTOR->LIST", 0x7D)
   return Subvector_To_List();
 }
 
-Pointer
-make_vector (length, contents)
-     fast long length;
-     fast Pointer contents;
-{
-  fast Pointer result;
-
-  Primitive_GC_If_Needed (length + 1);
-  result = (Make_Pointer (TC_VECTOR, Free));
-  *Free++ = (Make_Non_Pointer (TC_MANIFEST_VECTOR, length));
-  while (length-- > 0)
-    *Free++ = contents;
-  return (result);
-}
-
 /* (VECTOR_CONS LENGTH CONTENTS)
    Create a new vector to hold LENGTH entries, all of which are
    initialized to CONTENTS. */
-- 
2.25.1