Lines Matching refs:ptr
205 arg_pw = v.ptr;
211 arg_pw->val.ptr = dest;
214 dest->val.ptr = dest; /* make a new simple variable */
219 dest->val.ptr = v.ptr;
224 arg_pw = v.ptr; /* of which we need only the car */
231 dest->val.ptr = top;
233 arg_pw = v.ptr;
241 arg_pw->val.ptr = top;
250 dest->val.ptr = dest;
255 dest->val.ptr = top; /* reference to copied variable */
257 arg_pw = v.ptr;
265 arg_pw->val.ptr = top;
275 dest->val.ptr = dest; /* create a self reference */
282 arg_pw = v.ptr;
294 dest->val.ptr = top;
297 dest[SUSP_LD].val.ptr = (pword *) 0;
305 arg_pw->val.ptr = dest;
318 arg_pw = v.ptr;
331 dest->val.ptr = top; /* make the copy */
337 arg_pw->val.ptr = top;
362 Assert(!(TG_ORIG <= v.ptr && v.ptr < TG));
365 arg_pw = v.ptr;
376 dest->val.ptr = top; /* make the copy */
387 arg_pw->val.ptr = dest->val.ptr;
395 Assert(!(TG_ORIG <= v.ptr && v.ptr < TG));
398 arg_pw = v.ptr;
410 dest->val.ptr = top; /* allocate the cons cell copy */
415 dest->val.ptr = arg_pw->val.ptr; /* use forwarded car */
418 arg_pw->val.ptr = dest; /* update forwarding pointer, no need to trail */
441 arg_pw->val.ptr = top;
444 dest->val.ptr = top; /* allocate the cons cell copy */
458 dest->val.ptr = top; /* allocate the cons cell copy */
469 Assert(!(TG_ORIG <= v.ptr && v.ptr < TG));
472 arg_pw = v.ptr;
479 dest->val.ptr = top; /* begin the copy */
492 arg_pw->val.ptr = dest;
566 v.ptr->tag.kernel |= NEED_FWD;
569 v.ptr->tag.kernel |= ALREADY_SEEN;
575 v.ptr->tag.kernel |= NEED_FWD;
578 v.ptr->tag.kernel |= ALREADY_SEEN;
580 arg_pw = MetaTerm(v.ptr);
585 arg_pw = v.ptr;
601 arg_pw = v.ptr;
631 arg_pw = v.ptr;
644 arg_pw = v.ptr;
658 arg_pw = v.ptr;
718 if (start <= from->val.ptr && from->val.ptr < end) {
735 to[SUSP_LD].val.ptr = LD;
746 to[SUSP_LD].val.ptr = (pword *) 0;
799 pword *pw = root->val.ptr;
804 * information that root->val.ptr points to a complete heap-copy block
818 Assert(start <= pw->val.ptr && pw->val.ptr < end);
875 dest->val.ptr = dest;
877 Trail_(v.ptr);
878 v.ptr->val.ptr = dest;
879 v.ptr->tag.kernel = Tag(TFORWARD);
883 dest->val = v.ptr->val; /* was already copied */
892 dest->val.ptr = TG;
894 Trail_Tag(v.ptr);
895 v.ptr->val.ptr = TG;
896 v.ptr->tag.kernel = Tag(TFORWARD);
899 dest->val.ptr = dest;
907 Trail_Tag(v.ptr); /* make forwarding pointer */
908 v.ptr->tag.kernel = Tag(TFORWARD);
915 arg[0].val.ptr = v.ptr; /* pointer to metaterm */
917 v.ptr->val.ptr =
918 dest->val.ptr =
919 arg[1].val.ptr = &arg[1]; /* free variable */
923 arg[2].val.ptr = arg; /* list cell holding pair */
926 meta->val.ptr = &arg[2];
931 v.ptr->val.ptr =
932 dest->val.ptr = dest; /* free variable */
939 if (SameTypeC(v.ptr->tag, TDE))
941 if (SuspDead(v.ptr))
944 dest->val.ptr = v.ptr;
949 dest->val.ptr = TG;
953 arg[SUSP_LD].val.ptr = LD;
954 arg[SUSP_FLAGS].tag.all = v.ptr[SUSP_FLAGS].tag.all;
955 arg[SUSP_PRI].val.all = v.ptr[SUSP_PRI].val.all;
957 Init_Susp_State(arg, SuspPrio(v.ptr), SuspRunPrio(v.ptr));
959 Trail_Pword(v.ptr);
960 v.ptr->val.ptr = arg;
961 v.ptr->tag.kernel = Tag(TFORWARD);
963 arg_pw = v.ptr += SUSP_GOAL;
969 else if (IsForward(v.ptr->tag)) /* already copied */
971 dest->val.ptr = v.ptr->val.ptr;
982 dest->val.ptr = TG;
987 arg_pw = v.ptr;
992 dest->val.ptr = TG;
994 arg_pw = v.ptr;
1014 dest->val.ptr = v.ptr;
1054 mark_dids_from_pwords(root->val.ptr,
1055 root->val.ptr + HeaptermSize(root->val.ptr)/sizeof(pword));
1081 handle_slot = HeaptermHandleTable(root->val.ptr);
1083 for( count = 0; count < HeaptermNumHandles(root->val.ptr);
1086 Assert(IsTag(handle_slot->ptr->tag.kernel, TEXTERN));
1087 if ( ExternalClass(handle_slot->ptr)->free
1088 && ExternalData(handle_slot->ptr))
1090 ExternalClass(handle_slot->ptr)->free(ExternalData(handle_slot->ptr));
1095 hg_free_size((generic_ptr) HeaptermHeader(root->val.ptr),
1096 HeaptermSize(root->val.ptr) +
1097 HeaptermNumHandles(root->val.ptr) * sizeof(value) +
1147 top = _copy_term_to_heap(v, IsRef(t) ? v.ptr->tag : t, pw, &handle_slot, root);
1187 root->val.ptr = pw;
1215 result->val.ptr = result; /* if free var on heap */
1220 pword *orig = root->val.ptr;
1224 result->val.ptr = dest = TG; /* push complex term */
1245 root_new->val.ptr = root_new;
1305 if (val.ptr->tag.kernel & MARK)
1308 { Trail_(val.ptr) }
1310 { Trail_Tag(val.ptr) }
1311 val.ptr->tag.kernel |= MARK;
1320 arity = DidArity(val.ptr->val.did);
1321 val.ptr++;
1328 arg_i = val.ptr++;
1332 arg_i = val.ptr; /* tail recursion */
1383 size = HeaptermSize(root.val.ptr);