Searched refs:pCursor (Results 1 – 4 of 4) sorted by relevance
38 rfbCursorPtr pCursor; in rfbSendCursorShape() local49 pCursor = cl->screen->getCursorPtr(cl); in rfbSendCursorShape()53 if(pCursor && !pCursor->richSource) in rfbSendCursorShape()54 rfbMakeRichCursorFromXCursor(cl->screen,pCursor); in rfbSendCursorShape()57 if(pCursor && !pCursor->source) in rfbSendCursorShape()58 rfbMakeXCursorFromRichCursor(cl->screen,pCursor); in rfbSendCursorShape()64 if ( pCursor && pCursor->width == 1 && in rfbSendCursorShape()65 pCursor->height == 1 && in rfbSendCursorShape()66 pCursor->mask[0] == 0 ) { in rfbSendCursorShape()67 pCursor = NULL; in rfbSendCursorShape()[all …]
126 const char* pCursor = c_pszString; in MakeHash() local127 while(*pCursor) pCursor++; in MakeHash()128 return MakeHash(c_pszString, sizeof(char), (unsigned int) (pCursor - c_pszString)); in MakeHash()
12415 BtCursor *pCursor /* Space to write cursor structure */18016 BtCursor *pCursor; /* CURTYPE_BTREE. Btree cursor */ member58371 BtCursor *pCursor; /* A list of all open cursors */59187 for(p=pBtree->pBt->pCursor; p; p=p->pNext){59439 for(p=pBt->pCursor; p; p=p->pNext){59467 for(p=pBtree->pBt->pCursor; p; p=p->pNext){59665 for(p=pBt->pCursor; p; p=p->pNext){61307 pBt->pCursor = 0;61528 pCur = pBt->pCursor;61555 assert( !pBt->pCursor );[all …]