Subversion Repositories Kolibri OS

tl_info_capt_len equ word[edi+78] ;äëèííà òåêñòà ïîäïèñè óçëà (åñëè = 0 òî äî êîíöà ñòðóêòóðû)

tl_list_box_mode equ 100b ;ñòèëü íå îòîáðàæàåò óðîâíè (êàê â ListBox âñå îäíîãî óðîâíÿ)

;êîíñòàíòû äëÿ ôóíêöèé

tl_err_save_memory_size equ  10b ;íå õâàòàåò ïàìÿòè äëÿ ñîõðàíåíèÿ ýëåìåíòà

tl_err_load_caption     equ   1b ;â ïàìÿòè íåò çàãîëîâêà 'tree'

tl_err_load_info_size   equ 100b ;íå ñîâïàäàåò ðàçìåð èíôîðìàöèîííîé ñòðóêòóðû ïðè îòêðûòèè

tl_load_mode_add        equ 0x20000 ;îïöèÿ ñ÷èòûâàíèÿ â ðåæèìå äîáàâëåíèÿ èíôîðìàöèè

  .info_capt_len dw info_capt_len

    je @f

      mov eax,tl_p_scrol

      mov dword[eax+24],0 ;+24 .position

      call tb_scrol_resize

    @@:

    mov ebx,tl_el_focus

    cmp dword[ebx],edi

    jne .no_focus ;ýëåìåíò íå â ôîêóñå

    push eax

    mov eax,66

    mov ebx,2

    int 0x40  ;ïîëó÷èòü ðåæèì ââîäà ñ êëàâèàòóðû

    lea ecx,[tl_key_scan]

    cmp eax,1 ;1 = ñêàíêîäû

    je @f

    jne @f

      push dword edi

      call tl_cur_next

    @@:

    cmp ah,byte[ecx+7] ;Page Up

    jne @f

      push dword edi

      call tl_cur_page_up

    @@:

    cmp ah,byte[ecx+8] ;Page Down

      imul esi,eax

	mov word[edx],cx

 mov cl,byte[ebp+13]

	jge .no_text_data

 cmp tl_info_capt_len,0 ;ïðîâåðÿåì åñòü ëè îãðàíè÷åíèå íà äëèííó ñòðîêè

 je .no_len_ogran

   add cx,tl_info_capt_len

   and ecx,0xffff

   add esi,ecx

   mov cx,tl_info_size

   sub esi,ecx

      jge .no_text_data

        mov ax,tl_info_capt_len ;ïðîâåðÿåì åñòü ëè îãðàíè÷åíèå íà äëèííó òåêñòà

        cmp ax,0

        je .no_limit

        add cx,ax ;cx = tl_info_capt_offs + tl_info_capt_len

        and ecx,0xffff

        xor eax,eax

        mov ax,tl_info_size

        cmp eax,ecx

        jl .no_limit ;ïîëüçîâàòåëü çàäàë ñëèøêîì áîëüøóþ äëèííó òåêñòà

        add esi,ecx

        sub esi,eax

          dec esi

;input:

; edi = pointer 'tl' struct

;output:

; eax = struct index of current node

align 4

tl_get_node_count_all: ;áåðåò ÷èñëî âñåõ âèäèìûõ óçëîâ (ñ÷èòàÿ çàêðûòûå äî÷åðíèå)

  push ecx edx

    ;cycle to nodes

    xor eax,eax

    mov edx,tl_data_nodes

    mov ecx,edx

    add ecx,sizeof.TreeList

    @@:

      call tl_iterat_next_all

      cmp edx,ecx

      jle @f

      inc eax

      jmp @b

    @@:

  pop edx ecx

  ret

align 4

tl_cur_page_up: ;ïåðåíåñòè êóðñîð íà 1 ñòðàíèöó âûøå

  push ebp

  mov ebp,esp

  push eax edi esi

    mov edi,dword[ebp+8]

    cmp tl_p_scrol,0 ;åñëè åñòü óêàçàòåëü íà ñêðîëëèíã

    je .no_redraw

    mov esi,tl_p_scrol

    call tl_get_rows_count ;eax = rows count

    cmp tl_cur_pos,0

    jne @f

    cmp dword[esi+24],0 ;åñëè ñêðîëëèíã íà âåðõó, âûõîäèì

    jne @f

      jmp .no_redraw

    @@:

      cmp tl_cur_pos,eax ;ïðîâåðÿåì ïîçèöèþ êóðñîðà è êîë-âî ñòîê íà ñòðàíèöå

      jl @f ;åñëè ìåíüøå, òî ïðèðàâíèâàåì ê 0, ÷òî-áû íå îòíÿòü áîëüøå ÷åì íàäî

        sub tl_cur_pos,eax

        jmp .cursor

      @@:

        mov tl_cur_pos,0

      .cursor:

      cmp dword[esi+24],eax

      jl @f

        sub dword[esi+24],eax

        jmp .scroll

      @@:

        mov dword[esi+24],0

      .scroll:

      ;ïåðåðèñîâêè îêíà è ñêðîëëèíãà

      push dword edi

      call tl_draw ;draw window

      push dword esi

      mov eax,dword[ebp+8]

      mov eax,tl_sb_draw ;.redraw

      call dword[eax]

    .no_redraw:

  pop esi edi eax

  pop ebp

  ret 4

align 4

tl_cur_page_down: ;ïåðåíåñòè êóðñîð íà 1 ñòðàíèöó íèæå

  push ebp

  mov ebp,esp

  push eax ebx ecx edi esi

;eax - êîë-âî ñòðîê íà ñòðàíèöå

;ebx - ìàêñ. ïîçèöèÿ êóðñîðà

;ecx - ìàêñ. ïîçèöèÿ ñêðîëëèíãà

    mov edi,dword[ebp+8]

    cmp tl_p_scrol,0 ;åñëè åñòü óêàçàòåëü íà ñêðîëëèíã

    je .no_redraw

    mov esi,tl_p_scrol

    call tl_get_node_count ;eax = node count

    mov ebx,eax

    call tl_get_rows_count ;eax = rows count

    mov ecx,ebx

    inc ecx ;åñëè íèæíèé óçåë âèäåí íà ïîëîâèíó

    cmp ecx,eax ;if (ecx>eax) { ecx=ecx-eax } else { ecx=0 }

    jl @f

      sub ecx,eax ;óìåíüøàåì ìàêñèìàëüíóþ ïîçèöèþ ñêðîëëèíãà, òàê ÷òî-áû áûëè âèäíû ïîñëåäíèå óçëû

      jmp .control

    @@:

      xor ecx,ecx ;ecx=0 - âñå óçëû âëàçÿò â ýêðàí, ñêðîëëèíã íå íóæåí

    .control:

    cmp tl_cur_pos,ebx ;êóðñîð âíèçó ?

    jl @f

    cmp dword[esi+24],ecx ;ñêðîëëèíã âíèçó ?

    jl @f

      jmp .no_redraw

    @@:

      add tl_cur_pos,eax ;ïåðåìåùàåì êóðñîð

      cmp tl_cur_pos,ebx

      jl @f

        mov tl_cur_pos,ebx

      @@:

      add dword[esi+24],eax ;ïåðåìåùàåì ñêðîëëèíã

      cmp dword[esi+24],ecx

      jl @f

        mov dword[esi+24],ecx

      @@:

      ;ïåðåðèñîâêè îêíà è ñêðîëëèíãà

      push dword edi

      call tl_draw ;draw window

      push dword esi

      mov eax,dword[ebp+8]

      mov eax,tl_sb_draw ;.redraw

      call dword[eax]

    .no_redraw:

  pop esi edi ecx ebx eax

  pop ebp

  ret 4

;input:

;dword[ebp+ 8] - memory size

;dword[ebp+12] - pointer to memory

;dword[ebp+16] - options: 0 - first element, 1 - add next element

;dword[ebp+20] - pointer to 'TreeList' struct

;output:

;dword[ebp+ 8] - error code

align 4

tl_save_mem:

  push ebp

  mov ebp,esp

    push eax ebx ecx edx edi esi

    mov esi,dword[ebp+12]

    mov edi,dword[ebp+20]

    cmp dword[ebp+16],0 ;add mode

    je @f

      .beg_cycle:

      cmp dword[esi],0x65657274 ;0x65657274 = 'tree'

      jne @f

      xor ebx,ebx

      mov bx,word[esi+4]

      imul ebx,dword[esi+6]

      add ebx,tl_save_load_heder_size

      add esi,ebx

      jmp .beg_cycle

    @@:

    xor ebx,ebx

    mov bx,tl_info_size

    call tl_get_node_count_all ;eax = all node count

    mov ecx,eax  ;âû÷èñëÿåì ñêîëüêî ïàìÿòè äîëæíî áûòü çàïîëíåíî

    imul ecx,ebx ;óìíîæàåì íà ðàçìåð ñòðóêòóðû óçëà

    add ecx,tl_save_load_heder_size+1 ;element header +1 end element sumbol

    add ecx,esi  ;äîáàâëÿåì óêàçàòåëü íà íà÷àëî ïàìÿòè (ñ ó÷åòîì ðàíåå çàïèñàííûõ ñòðóêòóð)

    sub ecx,dword[ebp+12] ;îòíèìàåì óêàçàòåëü íà íà÷àëî ïàìÿòè (áåç ðàíåå çàïèñàííûõ ñòðóêòóð)

    cmp ecx,dword[ebp+8]  ;ecx = element memory size

    jg .err_mem_size

    ;save tree params

    mov dword[esi],0x65657274 ;0x65657274 = 'tree'

    mov word[esi+4],bx

    mov dword[esi+6],eax ;element count

    add esi,10

    mov eax,tl_style

    mov dword[esi],eax

    add esi,4

    mov eax,tl_cur_pos

    mov dword[esi],eax

    add esi,4

    mov ax,tl_info_capt_offs

    mov word[esi],ax

    add esi,2

    mov ax,tl_info_capt_len

    mov word[esi],ax

    add esi,2+4

    ;cycle to nodes

    mov edx,tl_data_nodes

    mov ecx,edx

    add ecx,sizeof.TreeList

    @@:

      call tl_iterat_next_all

      cmp edx,ecx

      jle @f

;save node params

call tl_get_node_index ;eax = index of pointer [edx]

mov dword[esi],eax

add esi,4

mov eax,dword[edx] ;eax = (type; lev; clo)

mov dword[esi],eax

add esi,4

;push dword edi

;call tl_node_get_data

;pop eax

push dword edi

push dword edx

call tl_node_poi_get_data

pop dword eax

;call tl_node_copy_data

push ecx edi

  mov edi,eax

  mov ecx,ebx

  xchg esi,edi

  rep movsb

  mov esi,edi

pop edi ecx

;add esi,ebx

      jmp @b

    @@:

    mov byte[esi],0 ;end of 'treelist'

    mov dword[ebp+20],0 ;return error code

    jmp @f

      .err_mem_size:

      or dword[ebp+20],tl_err_save_memory_size

    @@:

    pop esi edi edx ecx ebx eax

  pop ebp

  ret 12

;input:

;dword[ebp+ 8] - memory size

;dword[ebp+12] - pointer to memory

;word[ebp+16] - options: element index

;word[ebp+18] - options: 2*(add mode)+(init mode)

;dword[ebp+20] - pointer to 'TreeList' struct

;output:

;dword[ebp+ 8] - error code

align 4

tl_load_mem:

  push ebp

  mov ebp,esp

    push eax ebx ecx edx edi esi

    mov esi,dword[ebp+12]

    mov edi,dword[ebp+20]

    mov dword[ebp+20],0 ;return error code

    xor ecx,ecx

    mov cx,word[ebp+16]

    cmp cx,0 ;load in array mode

    je @f

      .beg_cycle:

      cmp dword[esi],0x65657274 ;0x65657274 = 'tree'

      jne .no_tree

      xor ebx,ebx

      mov bx,word[esi+4]

      imul ebx,dword[esi+6]

      add ebx,tl_save_load_heder_size

      add esi,ebx

      loop .beg_cycle

    @@:

    cmp dword[esi],0x65657274 ;0x65657274 = 'tree'

    jne .no_tree

      bt word[ebp+18],1 ;load in add mode

      jc @f

        push dword edi

        call tl_info_clear

      @@:

      xor ebx,ebx

      mov bx,word[esi+4] ;info_size

      cmp bx,tl_info_size

      je @f

        or dword[ebp+20],tl_err_load_info_size

      @@:

      mov ecx,dword[esi+6] ;count nodes

      cmp ecx,1

      jl .end_f

      add esi,tl_save_load_heder_size

      @@:

;load node params

push dword edi

mov eax,dword[esi+4]

ror eax,16

push dword eax ;options (type; lev; clo)

add esi,8

push dword esi

call tl_node_add

push dword edi

call tl_cur_next

;...

add esi,ebx

        loop @b

      jmp .end_f

    .no_tree:

      mov dword[ebp+20],tl_err_load_caption

    .end_f:

    pop esi edi edx ecx ebx eax

  pop ebp

  ret 12

;ascii scan key

;  13    28 Enter

;  32    57 Space

; 178    72 Up

; 177    80 Down

; 176    75 Left

; 179    77 Right

; 182    83 Delete

; 184    73 Pg Up

; 183    81 Pg Dn

tl_key_ascii db 13,32,178,177,176,179,182,184,183

tl_key_scan  db 28,57, 72, 80, 75, 77, 83, 73, 81