File size: 17,420 Bytes
5aefcf4 |
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 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 387 388 389 390 391 392 393 394 395 396 397 398 399 400 401 402 |
Ticket Name: CCS/TDA2: unresolved symbol vcop_median3x3_char_cn, first referenced in ./vcop_median3x3_tb.obj
Query Text:
Part Number: TDA2 Tool/software: Code Composer Studio SDK_VISION_03_02_00_00\ti_components\algorithms\eve_sw_01_18_00_00\kernels\imgsiglib\vcop_median3x3\inc have vcop_median3x3_uchar_cn and vcop_median3x3_char_cn funcs i am building this sample (SDK_VISION_03_02_00_00\ti_components\algorithms\eve_sw_01_18_00_00\kernels\imgsiglib\vcop_median3x3 ) have this unresolved symbol vcop_median3x3_char_cn, first referenced in ./vcop_median3x3_tb.obj Problem THANKS!
Responses:
Hello, I apologize but it seems like the file vcop_median3x3_cn.c is missing from the release. Please create a directory src_C at the same level as src_kernelC and add the attached file to it. regards, Victor vcop_median3x3_cn.c /*
* module : EVE SW
*
* module description : Software for EVE core targeted for imaging and vision
* applications
*
* Copyright (C) 2009-2017 Texas Instruments Incorporated - http://www.ti.com/
* ALL RIGHTS RESERVED
*
*/
#include <stdio.h>
#include <stdlib.h>
#include <assert.h>
#include <math.h>
#include "vcop_median3x3_cn.h"
#define MAX(a, b) (a > b ? a : b)
#define MIN(a, b) (a < b ? a : b)
void vcop_median3x3_uchar_cn
(
unsigned char *in,
unsigned char *out,
unsigned char *scratch1,
unsigned char *scratch2,
int w_input,
int w_out,
int w_compute,
int h_compute
)
{
int i, j, m, n, k;
int c2l, c2m, c2h;
int in0, in1;
int tmp;
int min_of_max, max_of_min;
int min_in, max_in, med_in, med_max, med_max_nxt;
int min, med, max;
int scratch_w = w_compute + 0;
/*-----------------------------------------------------------------------*/
/* Initialize the output to zeros at the beginning. */
/*-----------------------------------------------------------------------*/
for ( i = 0; i < (int) h_compute * 3; i++) // lpend3
{
for (j = 0; j < scratch_w; j++ ) //lpend4
{
scratch1[( i * scratch_w) + j ] = 0;
}
}
for ( i = 0; i < w_compute; i++ )
for ( j = 0; j < h_compute; j++ )
out[j * w_compute + i ] = 0;
/*-----------------------------------------------------------------------*/
/* This is the first loop where sets of three consecutive rows are */
/* re ordered as min, med and max rows. Thus, the output of this loop */
/* has a height of 3x that of the input array. */
/*-----------------------------------------------------------------------*/
for ( j = 0; j < (int) w_compute; j++) // lpend3
{
/*-------------------------------------------------------------------*/
/* Initialize the columns to get started. */
/*-------------------------------------------------------------------*/
c2l = c2m = c2h = 0;
in0 = in1 = 0;
m = 0;
for (i = 0; i < (int) h_compute; i++ ) //lpend4
{
/*-----------------------------------------------------------*/
/* Read in the latest column. */
/*-----------------------------------------------------------*/
c2l = in0;
c2m = in1;
c2h = in[( ( i + 0 ) * (w_input + 0) ) + j ];
#ifdef __PRINT__
printf("column values read in are:\n %x, %x, %x\n", c2l, c2m, c2h);
#endif
/*-----------------------------------------------------------*/
/* Sort the latest column into low, middle and high values. */
/*-----------------------------------------------------------*/
in0 = c2m;
in1 = c2h;
if ( c2l > c2h ) { tmp = c2l; c2l = c2h; c2h = tmp; }
if ( c2l > c2m ) { tmp = c2l; c2l = c2m; c2m = tmp; }
if ( c2m > c2h ) { tmp = c2m; c2m = c2h; c2h = tmp; }
/*-----------------------------------------------------------*/
/* Write the values out. */
/*-----------------------------------------------------------*/
m = (i * 3);
scratch1[( (m + 0) * scratch_w) + j] = c2l;
scratch1[( (m + 1) * scratch_w) + j] = c2m;
scratch1[( (m + 2) * scratch_w) + j] = c2h;
}
}
/*-----------------------------------------------------------------------*/
/* This is the second loop where the max_of_min, min_of_max and */
/* med_of_med values are evaluated in the horizontal direction taking */
/* three consecutive values at a time and moving the pointer by one each */
/* time in the horizontal direction. */
/*-----------------------------------------------------------------------*/
for ( i = 0; i < (int) (h_compute * 3); i+=3) // lpend3
{
for (j = 0; j < (int) scratch_w; j++ ) //lpend4
{
med_max = 0;
med_max_nxt = 0;
min_of_max = 255;
max_of_min = 0;
for ( k = 0; k < 3; k++)
{
/*----------------------------------------------------------*/
/* Read in the latest column and copy previous values as */
/* current values. */
/*----------------------------------------------------------*/
min_in = scratch1[( ( i + 6 + 0 ) * scratch_w) + j + k];
med_in = scratch1[( ( i + 6 + 1 ) * scratch_w) + j + k];
max_in = scratch1[( ( i + 6 + 2 ) * scratch_w) + j + k];
/*-----------------------------------------------------------*/
/* Obtain the min_of_max, max_of_min and median of median */
/* values, taking three at a time. */
/*-----------------------------------------------------------*/
max_of_min = MAX(max_of_min, min_in);
min_of_max = MIN(min_of_max, max_in);
if (med_in > med_max) { tmp = med_max; med_max = med_in; med_in = tmp; }
if (med_in > med_max_nxt) { tmp = med_max_nxt; med_max_nxt = med_in; med_in = tmp; }
}
/*-----------------------------------------------------------*/
/* Write the values out. */
/*-----------------------------------------------------------*/
scratch2[( (i + 0) * scratch_w) + j] = max_of_min;
scratch2[( (i + 1) * scratch_w) + j] = med_max_nxt;
scratch2[( (i + 2) * scratch_w) + j] = min_of_max;
}
}
/*-----------------------------------------------------------------------*/
/* This is the third loop where the true median is computed from the */
/* previous result by taking the max_of_min, med_of_med and min_of_max */
/* values in the vertical order. The resultant array has the same height */
/* as that of the input. */
/*-----------------------------------------------------------------------*/
n = 0;
for ( i = 0; i < (int) h_compute * 3; i+=3) // lpend1
{
for (j = 0; j < (int) w_compute; j++) //lpend2
{
/*----------------------------------------------------------*/
/* Read in the latest column. */
/*----------------------------------------------------------*/
min = scratch2[( ( i + 0 ) * scratch_w) + j];
med = scratch2[( ( i + 1 ) * scratch_w) + j];
max = scratch2[( ( i + 2 ) * scratch_w) + j];
/*-----------------------------------------------------------*/
/* Sort the latest column into low, middle and high values. */
/*-----------------------------------------------------------*/
if ( min > max ) { tmp = min; min = max; max = tmp; }
if ( min > med ) { tmp = min; min = med; med = tmp; }
if ( med > max ) { tmp = med; med = max; max = tmp; }
/*-----------------------------------------------------------*/
/* Write the values out. */
/*-----------------------------------------------------------*/
n = (int) (i/3);
out[( n * w_compute) + j] = med;
}
}
return;
}
void vcop_median3x3_char_cn
(
signed char *in,
signed char *out,
signed char *scratch1,
signed char *scratch2,
int w_input,
int w_out,
int w_compute,
int h_compute
)
{
int i, j, m, n, k;
int c2l, c2m, c2h;
int in0, in1;
int tmp;
int min_of_max, max_of_min;
int min_in, max_in, med_in, med_max, med_max_nxt;
int min, med, max;
int scratch_w = w_compute + 0;
/*-----------------------------------------------------------------------*/
/* Initialize the output to zeros at the beginning. */
/*-----------------------------------------------------------------------*/
for ( i = 0; i < (int) h_compute * 3; i++) // lpend3
{
for (j = 0; j < scratch_w; j++ ) //lpend4
{
scratch1[( i * scratch_w) + j ] = 0;
}
}
for ( i = 0; i < w_compute; i++ )
for ( j = 0; j < h_compute; j++ )
out[j * w_compute + i ] = 0;
/*-----------------------------------------------------------------------*/
/* This is the first loop where sets of three consecutive rows are */
/* re ordered as min, med and max rows. Thus, the output of this loop */
/* has a height of 3x that of the input array. */
/*-----------------------------------------------------------------------*/
for ( j = 0; j < (int) w_compute; j++) // lpend3
{
/*-------------------------------------------------------------------*/
/* Initialize the columns to get started. */
/*-------------------------------------------------------------------*/
c2l = c2m = c2h = 0;
in0 = in1 = 0;
m = 0;
for (i = 0; i < (int) h_compute; i++ ) //lpend4
{
/*-----------------------------------------------------------*/
/* Read in the latest column. */
/*-----------------------------------------------------------*/
c2l = in0;
c2m = in1;
c2h = in[( i * w_input ) + j ];
#ifdef __PRINT__
printf("column values read in are:\n %x, %x, %x\n", c2l, c2m, c2h);
#endif
/*-----------------------------------------------------------*/
/* Sort the latest column into low, middle and high values. */
/*-----------------------------------------------------------*/
in0 = c2m;
in1 = c2h;
if ( c2l > c2h ) { tmp = c2l; c2l = c2h; c2h = tmp; }
if ( c2l > c2m ) { tmp = c2l; c2l = c2m; c2m = tmp; }
if ( c2m > c2h ) { tmp = c2m; c2m = c2h; c2h = tmp; }
/*-----------------------------------------------------------*/
/* Write the values out. */
/*-----------------------------------------------------------*/
m = (i * 3);
scratch1[( (m + 0) * scratch_w) + j] = c2l;
scratch1[( (m + 1) * scratch_w) + j] = c2m;
scratch1[( (m + 2) * scratch_w) + j] = c2h;
}
}
/*-----------------------------------------------------------------------*/
/* This is the second loop where the max_of_min, min_of_max and */
/* med_of_med values are evaluated in the horizontal direction taking */
/* three consecutive values at a time and moving the pointer by one each */
/* time in the horizontal direction. */
/*-----------------------------------------------------------------------*/
for ( i = 0; i < (int) (h_compute * 3); i+=3) // lpend3
{
for (j = 0; j < (int) scratch_w; j++ ) //lpend4
{
med_max = -128;
med_max_nxt = -128;
min_of_max = 127;
max_of_min = -128;
for ( k = 0; k < 3; k++)
{
/*----------------------------------------------------------*/
/* Read in the latest column and copy previous values as */
/* current values. */
/*----------------------------------------------------------*/
min_in = scratch1[( ( i + 6 + 0 ) * scratch_w) + j + k];
med_in = scratch1[( ( i + 6 + 1 ) * scratch_w) + j + k];
max_in = scratch1[( ( i + 6 + 2 ) * scratch_w) + j + k];
/*-----------------------------------------------------------*/
/* Obtain the min_of_max, max_of_min and median of median */
/* values, taking three at a time. */
/*-----------------------------------------------------------*/
max_of_min = MAX(max_of_min, min_in);
min_of_max = MIN(min_of_max, max_in);
if (med_in > med_max) { tmp = med_max; med_max = med_in; med_in = tmp; }
if (med_in > med_max_nxt) { tmp = med_max_nxt; med_max_nxt = med_in; med_in = tmp; }
}
/*-----------------------------------------------------------*/
/* Write the values out. */
/*-----------------------------------------------------------*/
scratch2[( (i + 0) * scratch_w) + j] = max_of_min;
scratch2[( (i + 1) * scratch_w) + j] = med_max_nxt;
scratch2[( (i + 2) * scratch_w) + j] = min_of_max;
}
}
/*-----------------------------------------------------------------------*/
/* This is the third loop where the true median is computed from the */
/* previous result by taking the max_of_min, med_of_med and min_of_max */
/* values in the vertical order. The resultant array has the same height */
/* as that of the input. */
/*-----------------------------------------------------------------------*/
n = 0;
for ( i = 0; i < (int) h_compute * 3; i+=3) // lpend1
{
for (j = 0; j < (int) w_compute; j++) //lpend2
{
/*----------------------------------------------------------*/
/* Read in the latest column. */
/*----------------------------------------------------------*/
min = scratch2[( ( i + 0 ) * scratch_w) + j];
med = scratch2[( ( i + 1 ) * scratch_w) + j];
max = scratch2[( ( i + 2 ) * scratch_w) + j];
/*-----------------------------------------------------------*/
/* Sort the latest column into low, middle and high values. */
/*-----------------------------------------------------------*/
if ( min > max ) { tmp = min; min = max; max = tmp; }
if ( min > med ) { tmp = min; min = med; med = tmp; }
if ( med > max ) { tmp = med; med = max; max = tmp; }
/*-----------------------------------------------------------*/
/* Write the values out. */
/*-----------------------------------------------------------*/
n = (int) (i/3);
out[( n * w_compute) + j] = med;
}
}
return;
}
Hi Victor thanks! but i think samples in SDK_VISION_03_04_00_00\ti_components\algorithms\eve_sw_01_19_00_00 all miss the .c file . can you share them at a site we can download if need. shuai
Shuai, You already asked a similar question in another thread and we have already mentioned that we don't release natural C. Please refer the following thread to see our answer https://e2e.ti.com/support/arm/automotive_processors/f/1021/p/723811/2670469#2670469 Regards, Anshu
|