mirror of
https://github.com/netsurf-browser/netsurf
synced 2024-12-28 06:49:41 +03:00
3276ce5db9
svn path=/trunk/netsurf/; revision=12359
146 lines
4.8 KiB
C
Executable File
146 lines
4.8 KiB
C
Executable File
/*
|
|
* Copyright 2010 Ole Loots <ole@monochrom.net>
|
|
*
|
|
* This file is part of NetSurf, http://www.netsurf-browser.org/
|
|
*
|
|
* NetSurf 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; version 2 of the License.
|
|
*
|
|
* NetSurf 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, see <http://www.gnu.org/licenses/>.
|
|
*/
|
|
|
|
#ifndef NS_ATARI_BROWSER_H
|
|
#define NS_ATARI_BROWSER_H
|
|
|
|
/*
|
|
Each browser_window in the Atari Port is represented by an struct s_browser,
|
|
which cosnist mainly of an WinDom COMPONENT.
|
|
*/
|
|
|
|
/*
|
|
BROWSER_SCROLL_SVAL
|
|
The small scroll inc. value (used by scroll-wheel, arrow click):
|
|
*/
|
|
#define BROWSER_SCROLL_SVAL 64
|
|
|
|
/*
|
|
MAX_REDRW_SLOTS
|
|
This is the number of redraw requests that an browser window can queue.
|
|
If a redraw is scheduled and all slots are used, the rectangle will
|
|
be merged to one of the existing slots.
|
|
*/
|
|
#define MAX_REDRW_SLOTS 32
|
|
|
|
enum browser_type
|
|
{
|
|
BT_ROOT=1,
|
|
BT_FRAME=2,
|
|
BT_FRAMESET=3,
|
|
BT_IFRAME=4
|
|
};
|
|
|
|
enum browser_rect
|
|
{
|
|
BR_CONTENT = 1,
|
|
BR_FULL = 2,
|
|
BR_HSLIDER = 3,
|
|
BR_VSLIDER = 4
|
|
};
|
|
|
|
|
|
/*
|
|
This struct contains info of current browser viewport scroll
|
|
and the scroll which is requested. If a scroll is requested,
|
|
the field required is set to true.
|
|
*/
|
|
struct s_scroll_info
|
|
{
|
|
POINT requested;
|
|
POINT current;
|
|
bool required;
|
|
};
|
|
|
|
/*
|
|
This struct holds information of the cursor within the browser
|
|
viewport.
|
|
*/
|
|
struct s_caret
|
|
{
|
|
GRECT requested;
|
|
GRECT current;
|
|
bool redraw;
|
|
};
|
|
|
|
/*
|
|
This struct holds scheduled redraw requests.
|
|
*/
|
|
struct s_browser_redrw_info
|
|
{
|
|
BBOX areas[MAX_REDRW_SLOTS];
|
|
short areas_used;
|
|
BBOX area; /* used for clipping of content redraw */
|
|
};
|
|
|
|
/*
|
|
This is the actual browser widget, containings GUI elements and
|
|
the current state of the browser widget.
|
|
*/
|
|
struct s_browser
|
|
{
|
|
int type;
|
|
COMPONENT * comp;
|
|
WINDOW * compwin;
|
|
struct browser_window * bw;
|
|
struct s_scroll_info scroll;
|
|
struct s_browser_redrw_info redraw;
|
|
struct s_caret caret;
|
|
bool attached;
|
|
};
|
|
|
|
struct s_browser * browser_create( struct gui_window * gw, struct browser_window * clone, struct browser_window *bw, enum browser_type, int lt, int w, int flex );
|
|
bool browser_destroy( struct s_browser * b );
|
|
void browser_get_rect( struct gui_window * gw, enum browser_rect type, LGRECT * out);
|
|
bool browser_input( struct gui_window * gw, unsigned short nkc ) ;
|
|
void browser_redraw( struct gui_window * gw );
|
|
void browser_set_content_size(struct gui_window * gw, int w, int h);
|
|
void browser_scroll( struct gui_window * gw, short MODE, int value, bool abs );
|
|
bool browser_attach_frame( struct gui_window * container, struct gui_window * frame );
|
|
struct gui_window * browser_find_root( struct gui_window * gw );
|
|
static void browser_process_scroll( struct gui_window * gw, LGRECT bwrect );
|
|
bool browser_redraw_required( struct gui_window * gw);
|
|
|
|
/*
|
|
This queues an redraw to one of the slots.
|
|
The following strategy is used:
|
|
1. It checks if the rectangle to be scheduled is within one of the
|
|
already queued bboxes. If yes, it will return.
|
|
2. It checks for an intersection, and it will merge the rectangle to
|
|
already queued rectangle where it fits best.
|
|
3. it tries to put the rectangle into one available slot.
|
|
4. if no slot is available, it will search for the nearest rectangle
|
|
and summarize it within that slot.
|
|
*/
|
|
void browser_redraw_caret( struct gui_window * gw, GRECT * area );
|
|
static void browser_redraw_content( struct gui_window * gw, int xoff, int yoff );
|
|
|
|
/* update loc / size of the browser widgets: */
|
|
void browser_update_rects(struct gui_window * gw );
|
|
void browser_schedule_redraw_rect(struct gui_window * gw, short x, short y, short w, short h);
|
|
void browser_schedule_redraw(struct gui_window * gw, short x, short y, short w, short h );
|
|
static void __CDECL browser_evnt_resize( COMPONENT * c, long buff[8], void * data);
|
|
static void __CDECL browser_evnt_destroy( COMPONENT * c, long buff[8], void * data);
|
|
static void __CDECL browser_evnt_mbutton( WINDOW * c, short buff[8], void * data);
|
|
static void __CDECL browser_evnt_arrowed( WINDOW *win, short buff[8], void * data);
|
|
static void __CDECL browser_evnt_slider( WINDOW *win, short buff[8], void * data);
|
|
static void __CDECL browser_evnt_redraw( COMPONENT * c, long buff[8], void * data);
|
|
static void __CDECL browser_evnt_redraw_x( WINDOW * c, short buff[8], void * data);
|
|
|
|
#endif
|