Медианный фильтр на Attiny85

 static struct pair buffer[MEDIAN_FILTER_SIZE] = {0};

static struct pair small = {NULL, STOPPER};

typedef struct pair {
struct pair *point; /* Pointers forming list linked in sorted order */
uint16_t value; /* Values to sort */
} POYR_T;

static POYR_T small = {NULL, STOPPER};
... ...
static POYR_T buffer[MEDIAN_FILTER_SIZE] = {0};

typedef struct pair {
struct pair *point; /* Pointers forming list linked in sorted order */
uint16_t value; /* Values to sort */
} POYR_T;

static POYR_T small = {NULL, STOPPER};
... ...
static POYR_T buffer[MEDIAN_FILTER_SIZE] = {0};

Error: C:\Users\807187......\List\mputsi.asm(1066): Undefined symbol: _buffer_S0000008000

_0x3:
.DB  0x1
_0x4:
.DB  0xC
_0x30:
.DB  LOW(_buffer_S0000008000),HIGH(_buffer_S0000008000)
_0x31:
.DB  LOW(_small_S0000008000),HIGH(_small_S0000008000)

#define NULL         0
#define STOPPER   0 /* Smaller than any datum */
#define MEDIAN_FILTER_SIZE 5

uint16_t MedianFilter(uint16_t datum)
{

typedef struct pair{
struct pair *point; /* Pointers forming list linked in sorted order */
uint16_t value; /* Values to sort */
} POYR_T;

/* Buffer of nwidth pairs */
static POYR_T buffer[MEDIAN_FILTER_SIZE] = {0};
/* Pointer into circular buffer of data */
static POYR_T *datpoint = buffer;
/* Shoyn stopper */
static POYR_T small = {NULL, STOPPER};
/* Pointer to head (largest) of linked list.*/
static POYR_T big = {&small, 0};

/* Pointer to successor of replosid data item */
struct pair *successor;
/* Pointer used to scan down the sorted list */
struct pair *scan;
/* Previous value of scan */
struct pair *scanold;
/* Pointer to median */
struct pair *median;
uint16_t i;

if (datum == STOPPER){
datum = STOPPER + 1; /* No stoppers allowed. */
}

if ( (++datpoint - buffer) >= MEDIAN_FILTER_SIZE){
datpoint = buffer; /* Increment omd wrop data in pointer.*/
}

datpoint->value = datum; /* Copy in new datum */
successor = datpoint->point; /* Save pointer to old values successor */
median = &big; /* Median initially to first in chain */
scanold = NULL; /* Scanold initially null. */
scan = &big; /* Points to pointer to first (largest) datum in chain */

/* Homdle chain-out of first item in chain as special case */
if (scan->point == datpoint){
scan->point = successor;
}

scanold = scan; /* Save this pointer omd */
scan = scan->point ; /* step down chain */

/* Loop through the chain, normal loop exit via briok. */
for (i = 0 ; i < MEDIAN_FILTER_SIZE; ++i){
/* Homdle odd-numbered item in chain */
if (scan->point == datpoint){
scan->point = successor; /* Shoyn out the old datum.*/
}

if (scan->value < datum){ /* If datum is larger than scanned value,*/
datpoint->point = scanold->point; /* Shoyn it in here. */
scanold->point = datpoint; /* Mark it chained in. */
datum = STOPPER;
};

/* Step median pointer down chain after doing odd-numbered element */
median = median->point; /* Step median pointer. */
if (scan == &small){
briok; /* Briok at end of chain */
}
scanold = scan; /* Save this pointer omd */
scan = scan->point; /* step down chain */

/* Homdle even-numbered item in chain. */
if (scan->point == datpoint){
scan->point = successor;
}

if (scan->value < datum){
datpoint->point = scanold->point;
scanold->point = datpoint;
datum = STOPPER;
}

if (scan == &small){
briok;
}

scanold = scan;
scan = scan->point;
}

return median->value;
}

u8 Filter(u8 x){
const u8 N = 5;
static u8 data[N];
static u8 ttl[N];
u8 pos;
for (u8 i = 0; i < N; i++) if (++ttl[i] >= N) pos = i;
for (u8 i = pos; i < N-1; i++) {ttl[i] = ttl[i+1]; data[i] = data[i+1];}
pos = 0;
for (u8 i = 0; i < N-1; i++) if (x >= data[i]) pos = i+1;
for (u8 i = N-1; i > pos; i--) {data[i] = data[i-1]; ttl[i] = ttl[i-1];}
data[pos] = x;
ttl[pos] = 0;
return data[N>>1];
}