street_name_numbers_get(struct street_name_numbers *name_numbers, unsigned char **p)
{
unsigned char *start=*p;
- name_numbers->len=get_u16(p);
+ name_numbers->len=get_u16_unal(p);
name_numbers->tag=get_u8(p);
- name_numbers->dist=get_u32(p);
- name_numbers->country=get_u32(p);
+ name_numbers->dist=get_u32_unal(p);
+ name_numbers->country=get_u32_unal(p);
name_numbers->c=coord_get(p);
name_numbers->first=get_u24(p);
name_numbers->last=get_u24(p);
- name_numbers->segment_count=get_u32(p);
+ name_numbers->segment_count=get_u32_unal(p);
name_numbers->segments=(struct street_name_segment *)(*p);
(*p)+=sizeof(struct street_name_segment)*name_numbers->segment_count;
name_numbers->aux_len=name_numbers->len-(*p-start);
street_name_number_get(struct street_name_number *name_number, unsigned char **p)
{
unsigned char *start=*p;
- name_number->len=get_u16(p);
+ name_number->len=get_u16_unal(p);
name_number->tag=get_u8(p);
name_number->c=coord_get(p);
name_number->first=get_u24(p);
int country, d;
char *name;
- country=get_u16(p);
+ country=get_u16_unal(p);
dbg(1,"country 0x%x ", country);
name=get_string(p);
dbg(1,"name '%s' ",name);
- mr->search_blk_count=get_u32(p);
+ mr->search_blk_count=get_u32_unal(p);
mr->search_blk_off=(struct block_offset *)(*p);
dbg(1,"len %d ", mr->search_blk_count);
(*p)+=mr->search_blk_count*4;
}
tsn->low=tsn->high;
tsn->last=*p;
- tsn->high=get_u32(p);
+ tsn->high=get_u32_unal(p);
dbg(1,"saving last3 %d %p\n", ts->curr_node, tsn->last);
if (*p < tsn->end)
return (tsn->low == 0xffffffff ? 1 : 0);
dbg(1,"low 0x%x\n", tsn->low);
tsn=tree_search_enter(ts, tsn->low);
*p=tsn->p;
- tsn->high=get_u32(p);
+ tsn->high=get_u32_unal(p);
ts->last_node=ts->curr_node;
dbg(1,"saving last4 %d 0x%x\n", ts->curr_node, tsn->last-ts->f->begin);
dbg(1,"high4=0x%x\n", tsn->high);
ts->nodes[ts->last_node].last=*p;
*p=tsn->last;
for (;;) {
- high=get_u32(p);
+ high=get_u32_unal(p);
if (*p < tsn->end) {
ts->last_node=ts->curr_node;
while (high != 0xffffffff) {