Lines Matching defs:top
172 * using the top pointer. top is incremented and the new value is the
183 #define Copy_Term_To_Heap(v, t, top, handle_slot, dest) \
188 top = _copy_term_to_heap(v, t, top, handle_slot, dest);\
189 if (!top) return top;\
193 _copy_term_to_heap(value v, type t, register pword *top, value **handle_slot, register pword *dest)
216 return top;
221 return top;
227 return top;
231 dest->val.ptr = top;
241 arg_pw->val.ptr = top;
249 dest = top++;
252 return top;
255 dest->val.ptr = top; /* reference to copied variable */
265 arg_pw->val.ptr = top;
273 dest = top;
274 top += 2;
288 return top;
294 dest->val.ptr = top;
295 dest = top;
296 top += SUSP_HEADER_SIZE;
309 return top;
310 top += SUSP_SIZE - SUSP_HEADER_SIZE;
324 return top;
331 dest->val.ptr = top; /* make the copy */
333 handle_copy_anchor(arg_pw, top, 0);
337 arg_pw->val.ptr = top;
340 return top + HANDLE_ANCHOR_SIZE;
353 return top;
371 return top;
376 dest->val.ptr = top; /* make the copy */
378 Set_Buffer_Size(top, BufferSize(arg_pw));
379 top++->tag.kernel = TBUFFER;
382 *top++ = *pw++;
390 return top;
405 return top;
410 dest->val.ptr = top; /* allocate the cons cell copy */
412 dest = top;
413 top += 2;
441 arg_pw->val.ptr = top;
444 dest->val.ptr = top; /* allocate the cons cell copy */
447 dest = top; /* copy car (already overwritten) */
448 top += 2;
449 Copy_Term_To_Heap(v, t, top, handle_slot, dest);
458 dest->val.ptr = top; /* allocate the cons cell copy */
460 dest = top; /* go copy car + cdr */
461 top += 2;
477 return top;
479 dest->val.ptr = top; /* begin the copy */
483 dest = top;
484 top += arity +1;
501 break; /* (arg_pw,arity,top,dest) */
508 top = tag_desc[TagType(t)].copy_to_heap(v, t, top, dest);
509 return top;
521 Copy_Term_To_Heap(pw->val, pw->tag, top, handle_slot, dest);
1116 pword *pw = (pword*) 0, *top;
1147 top = _copy_term_to_heap(v, IsRef(t) ? v.ptr->tag : t, pw, &handle_slot, root);
1164 if ((int8*)top - (int8*)pw != size)