File: cedictad.c

package info (click to toggle)
virtuoso-opensource 7.2.5.1%2Bdfsg1-0.3
  • links: PTS, VCS
  • area: main
  • in suites: bookworm
  • size: 285,240 kB
  • sloc: ansic: 641,220; sql: 490,413; xml: 269,570; java: 83,893; javascript: 79,900; cpp: 36,927; sh: 31,653; cs: 25,702; php: 12,690; yacc: 10,227; lex: 7,601; makefile: 7,129; jsp: 4,523; awk: 1,697; perl: 1,013; ruby: 1,003; python: 326
file content (163 lines) | stat: -rw-r--r-- 4,255 bytes parent folder | download | duplicates (2)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
/*
 *  cedictad.c
 *
 *  $Id$
 *
 *  Decode of any type dict
 *
 *  This file is part of the OpenLink Software Virtuoso Open-Source (VOS)
 *  project.
 *
 *  Copyright (C) 1998-2018 OpenLink Software
 *
 *  This project 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; only version 2 of the License, dated June 1991.
 *
 *  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.,
 *  51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA
 *
 */



int
name (col_pos_t * cpo, db_buf_t ce_first, int n_values, int n_bytes)
{
  data_col_t *dc = cpo->cpo_dc;
  db_buf_t values;
  db_buf_t value_ptr[256];
  dtp_t n_distinct = ce_first[0];
  int fill = dc->dc_n_values, last_row = cpo->cpo_ce_row_no;
  int last = MIN (n_values, cpo->cpo_to - last_row);
  int len, row = cpo->cpo_skip, v_inx;
  db_buf_t val, array, dict = ce_first + 1;
  VARS;
  if (DCT_BOXES & dc->dc_type)
    return 0;
  CE_ANY_NTH (dict, n_distinct, n_distinct - 1, array, len);
  array += len;
  v_inx = VEC_INX (array, row);
  CE_ANY_NTH (dict, n_distinct, v_inx, val, len);
  if (0 == dc->dc_n_values && DV_ANY == dc->dc_sqt.sqt_col_dtp && DV_DB_NULL != *val)
    dc_convert_empty (dc, dv_ce_dtp[*val]);
  if (DV_ANY != dc->dc_dtp && dc->dc_dtp != dtp_canonical[*val] && DV_DB_NULL != *val && DV_ANY == dc->dc_sqt.sqt_col_dtp)
    {
      dc_heterogenous (dc);
    }
  values = dc->dc_values;

  switch (dc->dc_dtp)
    {
    case DV_LONG_INT:
    case DV_IRI_ID:
    case DV_DOUBLE_FLOAT:
      for (;;)
	{
	  int64 n64 = 0;
	  switch (*val)
	    {
	    case DV_SHORT_INT:
	      n64 = *(signed char *) (val + 1);
	      break;
	    case DV_IRI_ID:
	      n64 = (uint32) LONG_REF_NA (val + 1);
	      break;
	    case DV_LONG_INT:
	      n64 = LONG_REF_NA (val + 1);
	      break;
	    case DV_DOUBLE_FLOAT:
	    case DV_INT64:
	    case DV_IRI_ID_8:
	      n64 = INT64_REF_NA (val + 1);
	      break;
	    case DV_DB_NULL:
	      dc_set_null (dc, fill);
	      break;
	    }
	  ((int64 *) values)[fill++] = n64;
	  END_TEST;
	  CE_ANY_NTH (dict, n_distinct, v_inx, val, len);
	  if (dc->dc_dtp != dtp_canonical[*val] && DV_DB_NULL != *val && DV_ANY == dc->dc_sqt.sqt_col_dtp)
	    {
	      dc->dc_n_values = fill;
	      dc_heterogenous (dc);
	      goto any_case;
	    }
	}
    case DV_SINGLE_FLOAT:
      for (;;)
	{
	  int32 f;
	  if (DV_DB_NULL == *val)
	    dc_set_null (dc, fill++);
	  else
	    {
	      f = LONG_REF_NA (val + 1);
	      ((int32 *) values)[fill++] = f;
	    }
	  END_TEST;
	  CE_ANY_NTH (dict, n_distinct, v_inx, val, len);
	  if (DV_SINGLE_FLOAT != *val && DV_DB_NULL != *val && DV_ANY == dc->dc_sqt.sqt_col_dtp)
	    {
	      dc->dc_n_values = fill;
	      dc_heterogenous (dc);
	      goto any_case;
	    }
	}

    case DV_DATETIME:
    case DV_DATE:
    case DV_TIME:
      for (;;)
	{
	  if (DV_DB_NULL == *val)
	    dc_set_null (dc, fill);
	  else
	    {
	      db_buf_t tgt = values + fill * DT_LENGTH;
	      memcpy_dt (tgt, val + 1);
	    }
	  fill++;
	  END_TEST;
	  CE_ANY_NTH (dict, n_distinct, v_inx, val, len);
	  if (DV_DATETIME != *val && DV_DB_NULL != *val && DV_ANY == dc->dc_sqt.sqt_col_dtp)
	    {
	      dc->dc_n_values = fill;
	      dc_heterogenous (dc);
	      goto any_case;
	    }
	}

    case DV_ANY:
    any_case:
      memset (value_ptr, 0, n_distinct * sizeof (caddr_t));
      values = dc->dc_values;
      for (;;)
	{
	  if (value_ptr[v_inx])
	    ((db_buf_t *) values)[fill++] = value_ptr[v_inx];
	  else
	    {
	      CE_ANY_NTH (dict, n_distinct, v_inx, val, len);
	      dc->dc_n_values = fill;
	      dc_append_bytes (dc, val, len, NULL, 0);
	      fill = dc->dc_n_values;
	      value_ptr[v_inx] = ((db_buf_t *) dc->dc_values)[fill - 1];
	    }
	  END_TEST;
	}
    }
  GPF_T1 ("supposed to have returned");
  return 0;
}

#undef END_TEST
#undef VARS
#undef name