sdsykes-ferret 0.11.6.19

data/ext/term_vectors.c

@@ -0,0 +1,352 @@
+#include <string.h>
+#include "index.h"
+#include "array.h"
+#include "helper.h"
+
+/****************************************************************************
+ *
+ * TermVector
+ *
+ ****************************************************************************/
+
+void tv_destroy(TermVector *tv)
+{
+    int i = tv->term_cnt;
+    while (i > 0) {
+        i--;
+        free(tv->terms[i].text);
+        free(tv->terms[i].positions);
+    }
+    free(tv->offsets);
+    free(tv->field);
+    free(tv->terms);
+    free(tv);
+}
+
+int tv_get_tv_term_index(TermVector *tv, const char *term)
+{
+    int lo = 0;                 /* search starts array */
+    int hi = tv->term_cnt - 1;  /* for 1st element < n, return its index */
+    int mid;
+    int cmp;
+    char *mid_term;
+
+    while (hi >= lo) {
+        mid = (lo + hi) >> 1;
+        mid_term = tv->terms[mid].text;
+        cmp = strcmp(term, mid_term);
+        if (cmp < 0) {
+            hi = mid - 1;
+        }
+        else if (cmp > 0) {
+            lo = mid + 1;
+        }
+        else {                  /* found a match */
+            return mid;
+        }
+    }
+    if (hi >= 0 && strcmp(term, tv->terms[hi].text) == 0) {
+        return hi;
+    }
+    else {
+        return -1;
+    }
+    return hi;
+}
+
+extern TVTerm *tv_get_tv_term(TermVector *tv, const char *term)
+{
+    int index = tv_get_tv_term_index(tv, term);
+    if (index >= 0) {
+        return &(tv->terms[index]);
+    }
+    else {
+        return NULL;
+    }
+}
+
+/****************************************************************************
+ *
+ * TermVectorsReader
+ *
+ ****************************************************************************/
+
+TermVectorsReader *tvr_open(Store *store,
+                            const char *segment,
+                            FieldInfos *fis)
+{
+    TermVectorsReader *tvr = ALLOC(TermVectorsReader);
+    char file_name[SEGMENT_NAME_MAX_LENGTH];
+
+    tvr->fis = fis;
+    sprintf(file_name, "%s.tvx", segment);
+    tvr->tvx_in = store->open_input(store, file_name);
+    tvr->size = is_length(tvr->tvx_in) / 12;
+
+    sprintf(file_name, "%s.tvd", segment);
+    tvr->tvd_in = store->open_input(store, file_name);
+    return tvr;
+}
+
+TermVectorsReader *tvr_clone(TermVectorsReader *orig)
+{
+    TermVectorsReader *tvr = ALLOC(TermVectorsReader);
+
+    memcpy(tvr, orig, sizeof(TermVectorsReader));
+    tvr->tvx_in = is_clone(orig->tvx_in);
+    tvr->tvd_in = is_clone(orig->tvd_in);
+    
+    return tvr;
+}
+
+void tvr_close(TermVectorsReader *tvr)
+{
+    is_close(tvr->tvx_in);
+    is_close(tvr->tvd_in);
+    free(tvr);
+}
+
+TermVector *tvr_read_term_vector(TermVectorsReader *tvr, int field_num)
+{
+    TermVector *tv = ALLOC_AND_ZERO(TermVector);
+    InStream *tvd_in = tvr->tvd_in;
+    FieldInfo *fi = tvr->fis->fields[field_num];
+    const int num_terms = is_read_vint(tvd_in);
+    
+    tv->field_num = field_num;
+    tv->field = estrdup(fi->name);
+
+    if (num_terms > 0) {
+        int i, j, delta_start, delta_len, total_len, freq;
+        int store_positions = fi_store_positions(fi);
+        int store_offsets = fi_store_offsets(fi);
+        uchar buffer[MAX_WORD_SIZE];
+        TVTerm *term;
+
+        tv->term_cnt = num_terms;
+        tv->terms = ALLOC_AND_ZERO_N(TVTerm, num_terms);
+
+        for (i = 0; i < num_terms; i++) {
+            term = &(tv->terms[i]);
+            /* read delta encoded term */
+            delta_start = is_read_vint(tvd_in);
+            delta_len = is_read_vint(tvd_in);
+            total_len = delta_start + delta_len;
+            is_read_bytes(tvd_in, buffer + delta_start, delta_len);
+            buffer[total_len++] = '\0';
+            term->text = memcpy(ALLOC_N(char, total_len), buffer, total_len);
+
+            /* read freq */
+            freq = term->freq = is_read_vint(tvd_in);
+
+            /* read positions if necessary */
+            if (store_positions) {
+                int *positions = term->positions = ALLOC_N(int, freq);
+                int pos = 0;
+                for (j = 0; j < freq; j++) {
+                    positions[j] = pos += is_read_vint(tvd_in);
+                }
+            }
+
+            /* read offsets if necessary */
+        }
+        if (store_offsets) {
+            int num_positions = tv->offset_cnt = is_read_vint(tvd_in);
+            Offset *offsets = tv->offsets = ALLOC_N(Offset, num_positions);
+            int offset = 0;
+            for (i = 0; i < num_positions; i++) {
+                offsets[i].start = offset += is_read_vint(tvd_in);
+                offsets[i].end = offset += is_read_vint(tvd_in);
+            }
+        }
+    }
+    return tv;
+}
+
+HashTable *tvr_get_tv(TermVectorsReader *tvr, int doc_num)
+{
+    HashTable *term_vectors = h_new_str((free_ft)NULL, (free_ft)&tv_destroy);
+    int i;
+    InStream *tvx_in = tvr->tvx_in;
+    InStream *tvd_in = tvr->tvd_in;
+    off_t data_ptr, field_index_ptr;
+    int field_cnt;
+    int *field_nums;
+
+    if (doc_num >= 0 && doc_num < tvr->size) {
+        is_seek(tvx_in, 12 * doc_num);
+
+        data_ptr = (off_t)is_read_u64(tvx_in);
+        field_index_ptr = data_ptr + (off_t)is_read_u32(tvx_in);
+
+        /* scan fields to get position of field_num's term vector */
+        is_seek(tvd_in, field_index_ptr);
+
+        field_cnt = is_read_vint(tvd_in);
+        field_nums = ALLOC_N(int, field_cnt);
+
+        for (i = 0; i < field_cnt; i++) {
+            field_nums[i] = is_read_vint(tvd_in);
+            is_read_vint(tvd_in); /* skip space, we don't need it */
+        }
+        is_seek(tvd_in, data_ptr);
+
+        for (i = 0; i < field_cnt; i++) {
+            TermVector *tv = tvr_read_term_vector(tvr, field_nums[i]);
+            h_set(term_vectors, tv->field, tv);
+        }
+        free(field_nums);
+    }
+    return term_vectors;
+}
+
+TermVector *tvr_get_field_tv(TermVectorsReader *tvr,
+                             int doc_num,
+                             int field_num)
+{
+    int i;
+    InStream *tvx_in = tvr->tvx_in;
+    InStream *tvd_in = tvr->tvd_in;
+    off_t data_ptr, field_index_ptr;
+    int field_cnt;
+    int offset = 0;
+    TermVector *tv = NULL;
+
+    if (doc_num >= 0 && doc_num < tvr->size) {
+        is_seek(tvx_in, 12 * doc_num);
+
+        data_ptr = (off_t)is_read_u64(tvx_in);
+        field_index_ptr = data_ptr + (off_t)is_read_u32(tvx_in);
+
+        /* scan fields to get position of field_num's term vector */
+        is_seek(tvd_in, field_index_ptr);
+
+        field_cnt = is_read_vint(tvd_in);
+        for (i = 0; i < field_cnt; i++) {
+            if ((int)is_read_vint(tvd_in) == field_num) {
+                break;
+            }
+            offset += is_read_vint(tvd_in); /* space taken by field */
+        }
+        if (i < field_cnt) {
+            /* field was found */
+            is_seek(tvd_in, data_ptr + offset);
+            tv = tvr_read_term_vector(tvr, field_num);
+        }
+    }
+    return tv;
+}
+
+/****************************************************************************
+ *
+ * TermVectorsWriter
+ *
+ ****************************************************************************/
+
+TermVectorsWriter *tvw_open(Store *store, const char *segment, FieldInfos *fis)
+{
+    TermVectorsWriter *tvw = ALLOC(TermVectorsWriter);
+    char file_name[SEGMENT_NAME_MAX_LENGTH];
+    tvw->fis = fis;
+    tvw->fields = ary_new_type_capa(TVField, TV_FIELD_INIT_CAPA);
+
+    snprintf(file_name, SEGMENT_NAME_MAX_LENGTH, "%s.tvx", segment);
+    tvw->tvx_out = store->new_output(store, file_name);
+
+    snprintf(file_name, SEGMENT_NAME_MAX_LENGTH, "%s.tvd", segment);
+    tvw->tvd_out = store->new_output(store, file_name);
+
+    return tvw;
+}
+
+void tvw_close(TermVectorsWriter *tvw)
+{
+    os_close(tvw->tvx_out);
+    os_close(tvw->tvd_out);
+    ary_free(tvw->fields);
+    free(tvw);
+}
+
+void tvw_open_doc(TermVectorsWriter *tvw)
+{
+    ary_size(tvw->fields) = 0;
+    tvw->tvd_ptr = os_pos(tvw->tvd_out);
+    os_write_u64(tvw->tvx_out, tvw->tvd_ptr);
+}
+
+void tvw_close_doc(TermVectorsWriter *tvw)
+{
+    int i;
+    OutStream *tvd_out = tvw->tvd_out;
+    os_write_u32(tvw->tvx_out, (f_u32)(os_pos(tvw->tvd_out) - tvw->tvd_ptr));
+    os_write_vint(tvd_out, ary_size(tvw->fields));
+    for (i = 0; i < ary_size(tvw->fields); i++) {
+        os_write_vint(tvd_out, tvw->fields[i].field_num);
+        os_write_vint(tvd_out, tvw->fields[i].size);
+    }
+}
+
+void tvw_add_postings(TermVectorsWriter *tvw,
+                      int field_num,
+                      PostingList **plists,
+                      int posting_count,
+                      Offset *offsets,
+                      int offset_count)
+{
+    int i, delta_start, delta_length;
+    const char *last_term = EMPTY_STRING;
+    off_t tvd_start_pos = os_pos(tvw->tvd_out);
+    OutStream *tvd_out = tvw->tvd_out;
+    PostingList *plist;
+    Posting *posting;
+    Occurence *occ;
+    FieldInfo *fi = tvw->fis->fields[field_num];
+    int store_positions = fi_store_positions(fi);
+
+    ary_grow(tvw->fields);
+    ary_last(tvw->fields).field_num = field_num;
+
+    os_write_vint(tvd_out, posting_count);
+    for (i = 0; i < posting_count; i++) {
+        plist = plists[i];
+        posting = plist->last;
+        delta_start = hlp_string_diff(last_term, plist->term);
+        delta_length = plist->term_len - delta_start;
+
+        os_write_vint(tvd_out, delta_start);  /* write shared prefix length */
+        os_write_vint(tvd_out, delta_length); /* write delta length */
+        /* write delta chars */
+        os_write_bytes(tvd_out,
+                       (uchar *)(plist->term + delta_start),
+                       delta_length);
+        os_write_vint(tvd_out, posting->freq);
+        last_term = plist->term;
+
+        if (store_positions) {
+            /* use delta encoding for positions */
+            int last_pos = 0;
+            for (occ = posting->first_occ; occ; occ = occ->next) {
+                os_write_vint(tvd_out, occ->pos - last_pos);
+                last_pos = occ->pos;
+            }
+        }
+
+    }
+
+    if (fi_store_offsets(fi)) {
+        /* use delta encoding for offsets */
+        int last_end = 0;
+        os_write_vint(tvd_out, offset_count);  /* write shared prefix length */
+        for (i = 0; i < offset_count; i++) {
+            int start = offsets[i].start;
+            int end = offsets[i].end;
+            os_write_vint(tvd_out, start - last_end);
+            os_write_vint(tvd_out, end - start);
+            last_end = end;
+        }
+    }
+
+    ary_last(tvw->fields).size = os_pos(tvd_out) - tvd_start_pos;
+}
+
+

data/ext/threading.h

@@ -0,0 +1,31 @@
+#ifndef FRT_THREADING_H
+#define FRT_THREADING_H
+
+#include "hash.h"
+#define UNTHREADED 1
+
+typedef void * mutex_t;
+typedef struct HashTable *thread_key_t;
+typedef int thread_once_t;
+#define MUTEX_INITIALIZER NULL
+#define MUTEX_RECURSIVE_INITIALIZER NULL
+#define THREAD_ONCE_INIT 1;
+#define mutex_init(a, b)
+#define mutex_lock(a)
+#define mutex_trylock(a)
+#define mutex_unlock(a)
+#define mutex_destroy(a)
+#define thread_key_create(a, b) frt_thread_key_create(a, b)
+#define thread_key_delete(a) frt_thread_key_delete(a)
+#define thread_setspecific(a, b) frt_thread_setspecific(a, b)
+#define thread_getspecific(a) frt_thread_getspecific(a)
+#define thread_exit(a)
+#define thread_once(a, b) frt_thread_once(a, b)
+
+void frt_thread_once(int *once_control, void (*init_routine)(void));
+void frt_thread_key_create(thread_key_t *key, void (*destr_function)(void *));
+void frt_thread_key_delete(thread_key_t key);
+void frt_thread_setspecific(thread_key_t key, const void *pointer);
+void *frt_thread_getspecific(thread_key_t key);
+
+#endif

data/ext/utilities.c

@@ -0,0 +1,446 @@
+
+#include <stdio.h>
+#include <stdlib.h>
+#include <string.h>
+
+#include "header.h"
+
+#define unless(C) if(!(C))
+
+#define CREATE_SIZE 1
+
+extern symbol * create_s(void) {
+    symbol * p;
+    void * mem = malloc(HEAD + (CREATE_SIZE + 1) * sizeof(symbol));
+    if (mem == NULL) return NULL;
+    p = (symbol *) (HEAD + (char *) mem);
+    CAPACITY(p) = CREATE_SIZE;
+    SET_SIZE(p, CREATE_SIZE);
+    return p;
+}
+
+extern void lose_s(symbol * p) {
+    if (p == NULL) return;
+    free((char *) p - HEAD);
+}
+
+/*
+   new_p = X_skip_utf8(p, c, lb, l, n); skips n characters forwards from p + c
+   if n +ve, or n characters backwards from p +c - 1 if n -ve. new_p is the new
+   position, or 0 on failure.
+
+   -- used to implement hop and next in the utf8 case.
+*/
+
+extern int skip_utf8(const symbol * p, int c, int lb, int l, int n) {
+    int b;
+    if (n >= 0) {
+        for (; n > 0; n--) {
+            if (c >= l) return -1;
+            b = p[c++];
+            if (b >= 0xC0) {   /* 1100 0000 */
+                while (c < l) {
+                    b = p[c];
+                    if (b >= 0xC0 || b < 0x80) break;
+                    /* break unless b is 10------ */
+                    c++;
+                }
+            }
+        }
+    } else {
+        for (; n < 0; n++) {
+            if (c <= lb) return -1;
+            b = p[--c];
+            if (b >= 0x80) {   /* 1000 0000 */
+                while (c > lb) {
+                    b = p[c];
+                    if (b >= 0xC0) break; /* 1100 0000 */
+                    c--;
+                }
+            }
+        }
+    }
+    return c;
+}
+
+/* Code for character groupings: utf8 cases */
+
+static int get_utf8(const symbol * p, int c, int l, int * slot) {
+    int b0, b1;
+    if (c >= l) return 0;
+    b0 = p[c++];
+    if (b0 < 0xC0 || c == l) {   /* 1100 0000 */
+        * slot = b0; return 1;
+    }
+    b1 = p[c++];
+    if (b0 < 0xE0 || c == l) {   /* 1110 0000 */
+        * slot = (b0 & 0x1F) << 6 | (b1 & 0x3F); return 2;
+    }
+    * slot = (b0 & 0xF) << 12 | (b1 & 0x3F) << 6 | (*p & 0x3F); return 3;
+}
+
+static int get_b_utf8(const symbol * p, int c, int lb, int * slot) {
+    int b0, b1;
+    if (c <= lb) return 0;
+    b0 = p[--c];
+    if (b0 < 0x80 || c == lb) {   /* 1000 0000 */
+        * slot = b0; return 1;
+    }
+    b1 = p[--c];
+    if (b1 >= 0xC0 || c == lb) {   /* 1100 0000 */
+        * slot = (b1 & 0x1F) << 6 | (b0 & 0x3F); return 2;
+    }
+    * slot = (*p & 0xF) << 12 | (b1 & 0x3F) << 6 | (b0 & 0x3F); return 3;
+}
+
+extern int in_grouping_U(struct SN_env * z, unsigned char * s, int min, int max) {
+    int ch;
+    int w = get_utf8(z->p, z->c, z->l, & ch);
+    unless (w) return 0;
+    if (ch > max || (ch -= min) < 0 || (s[ch >> 3] & (0X1 << (ch & 0X7))) == 0) return 0;
+    z->c += w; return 1;
+}
+
+extern int in_grouping_b_U(struct SN_env * z, unsigned char * s, int min, int max) {
+    int ch;
+    int w = get_b_utf8(z->p, z->c, z->lb, & ch);
+    unless (w) return 0;
+    if (ch > max || (ch -= min) < 0 || (s[ch >> 3] & (0X1 << (ch & 0X7))) == 0) return 0;
+    z->c -= w; return 1;
+}
+
+extern int out_grouping_U(struct SN_env * z, unsigned char * s, int min, int max) {
+    int ch;
+    int w = get_utf8(z->p, z->c, z->l, & ch);
+    unless (w) return 0;
+    unless (ch > max || (ch -= min) < 0 || (s[ch >> 3] & (0X1 << (ch & 0X7))) == 0) return 0;
+    z->c += w; return 1;
+}
+
+extern int out_grouping_b_U(struct SN_env * z, unsigned char * s, int min, int max) {
+    int ch;
+    int w = get_b_utf8(z->p, z->c, z->lb, & ch);
+    unless (w) return 0;
+    unless (ch > max || (ch -= min) < 0 || (s[ch >> 3] & (0X1 << (ch & 0X7))) == 0) return 0;
+    z->c -= w; return 1;
+}
+
+/* Code for character groupings: non-utf8 cases */
+
+extern int in_grouping(struct SN_env * z, unsigned char * s, int min, int max) {
+    int ch;
+    if (z->c >= z->l) return 0;
+    ch = z->p[z->c];
+    if (ch > max || (ch -= min) < 0 || (s[ch >> 3] & (0X1 << (ch & 0X7))) == 0) return 0;
+    z->c++; return 1;
+}
+
+extern int in_grouping_b(struct SN_env * z, unsigned char * s, int min, int max) {
+    int ch;
+    if (z->c <= z->lb) return 0;
+    ch = z->p[z->c - 1];
+    if (ch > max || (ch -= min) < 0 || (s[ch >> 3] & (0X1 << (ch & 0X7))) == 0) return 0;
+    z->c--; return 1;
+}
+
+extern int out_grouping(struct SN_env * z, unsigned char * s, int min, int max) {
+    int ch;
+    if (z->c >= z->l) return 0;
+    ch = z->p[z->c];
+    unless (ch > max || (ch -= min) < 0 || (s[ch >> 3] & (0X1 << (ch & 0X7))) == 0) return 0;
+    z->c++; return 1;
+}
+
+extern int out_grouping_b(struct SN_env * z, unsigned char * s, int min, int max) {
+    int ch;
+    if (z->c <= z->lb) return 0;
+    ch = z->p[z->c - 1];
+    unless (ch > max || (ch -= min) < 0 || (s[ch >> 3] & (0X1 << (ch & 0X7))) == 0) return 0;
+    z->c--; return 1;
+}
+
+extern int eq_s(struct SN_env * z, int s_size, symbol * s) {
+    if (z->l - z->c < s_size || memcmp(z->p + z->c, s, s_size * sizeof(symbol)) != 0) return 0;
+    z->c += s_size; return 1;
+}
+
+extern int eq_s_b(struct SN_env * z, int s_size, symbol * s) {
+    if (z->c - z->lb < s_size || memcmp(z->p + z->c - s_size, s, s_size * sizeof(symbol)) != 0) return 0;
+    z->c -= s_size; return 1;
+}
+
+extern int eq_v(struct SN_env * z, symbol * p) {
+    return eq_s(z, SIZE(p), p);
+}
+
+extern int eq_v_b(struct SN_env * z, symbol * p) {
+    return eq_s_b(z, SIZE(p), p);
+}
+
+extern int find_among(struct SN_env * z, struct among * v, int v_size) {
+
+    int i = 0;
+    int j = v_size;
+
+    int c = z->c; int l = z->l;
+    symbol * q = z->p + c;
+
+    struct among * w;
+
+    int common_i = 0;
+    int common_j = 0;
+
+    int first_key_inspected = 0;
+
+    while(1) {
+        int k = i + ((j - i) >> 1);
+        int diff = 0;
+        int common = common_i < common_j ? common_i : common_j; /* smaller */
+        w = v + k;
+        {
+            int i; for (i = common; i < w->s_size; i++) {
+                if (c + common == l) { diff = -1; break; }
+                diff = q[common] - w->s[i];
+                if (diff != 0) break;
+                common++;
+            }
+        }
+        if (diff < 0) { j = k; common_j = common; }
+                 else { i = k; common_i = common; }
+        if (j - i <= 1) {
+            if (i > 0) break; /* v->s has been inspected */
+            if (j == i) break; /* only one item in v */
+
+            /* - but now we need to go round once more to get
+               v->s inspected. This looks messy, but is actually
+               the optimal approach.  */
+
+            if (first_key_inspected) break;
+            first_key_inspected = 1;
+        }
+    }
+    while(1) {
+        w = v + i;
+        if (common_i >= w->s_size) {
+            z->c = c + w->s_size;
+            if (w->function == 0) return w->result;
+            {
+                int res = w->function(z);
+                z->c = c + w->s_size;
+                if (res) return w->result;
+            }
+        }
+        i = w->substring_i;
+        if (i < 0) return 0;
+    }
+}
+
+/* find_among_b is for backwards processing. Same comments apply */
+
+extern int find_among_b(struct SN_env * z, struct among * v, int v_size) {
+
+    int i = 0;
+    int j = v_size;
+
+    int c = z->c; int lb = z->lb;
+    symbol * q = z->p + c - 1;
+
+    struct among * w;
+
+    int common_i = 0;
+    int common_j = 0;
+
+    int first_key_inspected = 0;
+
+    while(1) {
+        int k = i + ((j - i) >> 1);
+        int diff = 0;
+        int common = common_i < common_j ? common_i : common_j;
+        w = v + k;
+        {
+            int i; for (i = w->s_size - 1 - common; i >= 0; i--) {
+                if (c - common == lb) { diff = -1; break; }
+                diff = q[- common] - w->s[i];
+                if (diff != 0) break;
+                common++;
+            }
+        }
+        if (diff < 0) { j = k; common_j = common; }
+                 else { i = k; common_i = common; }
+        if (j - i <= 1) {
+            if (i > 0) break;
+            if (j == i) break;
+            if (first_key_inspected) break;
+            first_key_inspected = 1;
+        }
+    }
+    while(1) {
+        w = v + i;
+        if (common_i >= w->s_size) {
+            z->c = c - w->s_size;
+            if (w->function == 0) return w->result;
+            {
+                int res = w->function(z);
+                z->c = c - w->s_size;
+                if (res) return w->result;
+            }
+        }
+        i = w->substring_i;
+        if (i < 0) return 0;
+    }
+}
+
+
+/* Increase the size of the buffer pointed to by p to at least n symbols.
+ * If insufficient memory, returns NULL and frees the old buffer.
+ */
+static symbol * increase_size(symbol * p, int n) {
+    symbol * q;
+    int new_size = n + 20;
+    void * mem = realloc((char *) p - HEAD,
+                         HEAD + (new_size + 1) * sizeof(symbol));
+    if (mem == NULL) {
+        lose_s(p);
+        return NULL;
+    }
+    q = (symbol *) (HEAD + (char *)mem);
+    CAPACITY(q) = new_size;
+    return q;
+}
+
+/* to replace symbols between c_bra and c_ket in z->p by the
+   s_size symbols at s.
+   Returns 0 on success, -1 on error.
+   Also, frees z->p (and sets it to NULL) on error.
+*/
+extern int replace_s(struct SN_env * z, int c_bra, int c_ket, int s_size, const symbol * s, int * adjptr)
+{
+    int adjustment;
+    int len;
+    if (z->p == NULL) {
+        z->p = create_s();
+        if (z->p == NULL) return -1;
+    }
+    adjustment = s_size - (c_ket - c_bra);
+    len = SIZE(z->p);
+    if (adjustment != 0) {
+        if (adjustment + len > CAPACITY(z->p)) {
+            z->p = increase_size(z->p, adjustment + len);
+            if (z->p == NULL) return -1;
+        }
+        memmove(z->p + c_ket + adjustment,
+                z->p + c_ket,
+                (len - c_ket) * sizeof(symbol));
+        SET_SIZE(z->p, adjustment + len);
+        z->l += adjustment;
+        if (z->c >= c_ket)
+            z->c += adjustment;
+        else
+            if (z->c > c_bra)
+                z->c = c_bra;
+    }
+    unless (s_size == 0) memmove(z->p + c_bra, s, s_size * sizeof(symbol));
+    if (adjptr != NULL)
+        *adjptr = adjustment;
+    return 0;
+}
+
+static int slice_check(struct SN_env * z) {
+
+    if (z->bra < 0 ||
+        z->bra > z->ket ||
+        z->ket > z->l ||
+        z->p == NULL ||
+        z->l > SIZE(z->p)) /* this line could be removed */
+    {
+#if 0
+        fprintf(stderr, "faulty slice operation:\n");
+        debug(z, -1, 0);
+#endif
+        return -1;
+    }
+    return 0;
+}
+
+extern int slice_from_s(struct SN_env * z, int s_size, symbol * s) {
+    if (slice_check(z)) return -1;
+    return replace_s(z, z->bra, z->ket, s_size, s, NULL);
+}
+
+extern int slice_from_v(struct SN_env * z, symbol * p) {
+    return slice_from_s(z, SIZE(p), p);
+}
+
+extern int slice_del(struct SN_env * z) {
+    return slice_from_s(z, 0, 0);
+}
+
+extern int insert_s(struct SN_env * z, int bra, int ket, int s_size, symbol * s) {
+    int adjustment;
+    if (replace_s(z, bra, ket, s_size, s, &adjustment))
+        return -1;
+    if (bra <= z->bra) z->bra += adjustment;
+    if (bra <= z->ket) z->ket += adjustment;
+    return 0;
+}
+
+extern int insert_v(struct SN_env * z, int bra, int ket, symbol * p) {
+    int adjustment;
+    if (replace_s(z, bra, ket, SIZE(p), p, &adjustment))
+        return -1;
+    if (bra <= z->bra) z->bra += adjustment;
+    if (bra <= z->ket) z->ket += adjustment;
+    return 0;
+}
+
+extern symbol * slice_to(struct SN_env * z, symbol * p) {
+    if (slice_check(z)) {
+        lose_s(p);
+        return NULL;
+    }
+    {
+        int len = z->ket - z->bra;
+        if (CAPACITY(p) < len) {
+            p = increase_size(p, len);
+            if (p == NULL)
+                return NULL;
+        }
+        memmove(p, z->p + z->bra, len * sizeof(symbol));
+        SET_SIZE(p, len);
+    }
+    return p;
+}
+
+extern symbol * assign_to(struct SN_env * z, symbol * p) {
+    int len = z->l;
+    if (CAPACITY(p) < len) {
+        p = increase_size(p, len);
+        if (p == NULL)
+            return NULL;
+    }
+    memmove(p, z->p, len * sizeof(symbol));
+    SET_SIZE(p, len);
+    return p;
+}
+
+#if 0
+extern void debug(struct SN_env * z, int number, int line_count) {
+    int i;
+    int limit = SIZE(z->p);
+    /*if (number >= 0) printf("%3d (line %4d): '", number, line_count);*/
+    if (number >= 0) printf("%3d (line %4d): [%d]'", number, line_count,limit);
+    for (i = 0; i <= limit; i++) {
+        if (z->lb == i) printf("{");
+        if (z->bra == i) printf("[");
+        if (z->c == i) printf("|");
+        if (z->ket == i) printf("]");
+        if (z->l == i) printf("}");
+        if (i < limit)
+        {   int ch = z->p[i];
+            if (ch == 0) ch = '#';
+            printf("%c", ch);
+        }
+    }
+    printf("'\n");
+}
+#endif