vim-55/src/if_mzsch.c

172 	Scheme_Hash_Table *visited);
174 	Scheme_Hash_Table *visited);
1410     /* hash table to store visited values to avoid infinite loops */
1411     Scheme_Hash_Table	*visited = NULL;
1415     MZ_GC_VAR_IN_REG(0, visited);
1418     visited = scheme_make_hash_table(SCHEME_hash_ptr);
1427     result = vim_to_mzscheme(vim_result, 1, visited);
2619 vim_to_mzscheme(typval_T *vim_value, int depth, Scheme_Hash_Table *visited)
2635     /* Check if we run into a recursive loop.  The item must be in visited
2638     result = scheme_hash_get(visited, (Scheme_Object *)vim_value);
2675 	    obj = vim_to_mzscheme(&curr->li_tv, depth + 1, visited);
2682 		obj = vim_to_mzscheme(&curr->li_tv, depth + 1, visited);
2715 		    obj = vim_to_mzscheme(&di->di_tv, depth + 1, visited);
2732 	scheme_hash_set(visited, (Scheme_Object *)vim_value, result);
2741 	Scheme_Hash_Table *visited)
2753     found = (typval_T *)scheme_hash_get(visited, obj);
2815 		scheme_hash_set(visited, obj, (Scheme_Object *)visited_tv);
2822 			status = mzscheme_to_vim(cval, v, depth + 1, visited);
2838 			status = mzscheme_to_vim(cval, v, depth + 1, visited);
2850 			status = mzscheme_to_vim(cval, v, depth + 1, visited);
2888 	    scheme_hash_set(visited, obj, (Scheme_Object *)visited_tv);
2899 				    &item->di_tv, depth + 1, visited) == FAIL
2926     Scheme_Hash_Table	*visited = NULL;
2930     MZ_GC_VAR_IN_REG(0, visited);
2940     visited = scheme_make_hash_table(SCHEME_hash_ptr);
2944 	mzscheme_to_vim(ret, rettv, 1, visited);
2946     for (i = 0; i < visited->size; ++i)
2949 	if (visited->vals[i] != NULL)
2951 	    free_tv((typval_T *)visited->vals[i]);