Lines Matching refs:markPtr

108     TkTextSegment *markPtr;  local
133 markPtr = (TkTextSegment *) Tcl_GetHashValue(hPtr);
135 if (markPtr->typePtr == &tkTextRightMarkType) {
153 TkTextMarkSegToIndex(textPtr, markPtr, &index);
154 TkBTreeUnlinkSegment(textPtr->tree, markPtr,
155 markPtr->body.mark.linePtr);
156 markPtr->typePtr = newTypePtr;
157 TkBTreeLinkSegment(markPtr, &index);
197 markPtr = (TkTextSegment *) Tcl_GetHashValue(hPtr);
198 if ((markPtr == textPtr->insertMarkPtr)
199 || (markPtr == textPtr->currentMarkPtr)) {
202 TkBTreeUnlinkSegment(textPtr->tree, markPtr,
203 markPtr->body.mark.linePtr);
205 ckfree((char *) markPtr);
241 TkTextSegment *markPtr; local
246 markPtr = (TkTextSegment *) Tcl_GetHashValue(hPtr);
255 if (markPtr == textPtr->insertMarkPtr) {
266 TkBTreeUnlinkSegment(textPtr->tree, markPtr,
267 markPtr->body.mark.linePtr);
269 markPtr = (TkTextSegment *) ckalloc(MSEG_SIZE);
270 markPtr->typePtr = &tkTextRightMarkType;
271 markPtr->size = 0;
272 markPtr->body.mark.textPtr = textPtr;
273 markPtr->body.mark.linePtr = indexPtr->linePtr;
274 markPtr->body.mark.hPtr = hPtr;
275 Tcl_SetHashValue(hPtr, markPtr);
277 TkBTreeLinkSegment(markPtr, indexPtr);
284 if (markPtr == textPtr->insertMarkPtr) {
290 return markPtr;
312 TkTextMarkSegToIndex(textPtr, markPtr, indexPtr) in TkTextMarkSegToIndex() argument
314 TkTextSegment *markPtr; /* Mark segment. */
320 indexPtr->linePtr = markPtr->body.mark.linePtr;
322 for (segPtr = indexPtr->linePtr->segPtr; segPtr != markPtr;
414 MarkCleanupProc(markPtr, linePtr) in MarkCleanupProc() argument
415 TkTextSegment *markPtr; /* Mark segment that's being moved. */ in MarkCleanupProc()
418 markPtr->body.mark.linePtr = linePtr;
419 return markPtr;
600 MarkCheckProc(markPtr, linePtr) in MarkCheckProc() argument
601 TkTextSegment *markPtr; /* Segment to check. */ in MarkCheckProc()
607 if (markPtr->body.mark.linePtr != linePtr) {
616 for (hPtr = Tcl_FirstHashEntry(&markPtr->body.mark.textPtr->markTable,
617 &search); hPtr != markPtr->body.mark.hPtr;