link              410 builtin/clone.c 			if (!link(src->buf, dest->buf))
link               12 builtin/merge-tree.c 	struct merge_list *link;	/* other stages for this object */
link               38 builtin/merge-tree.c 		if (entry->link)
link               44 builtin/merge-tree.c 	entry = entry->link;
link               48 builtin/merge-tree.c 	if (entry->link)
link               67 builtin/merge-tree.c 		entry = entry->link;
link               72 builtin/merge-tree.c 		entry = entry->link;
link               86 builtin/merge-tree.c 		entry = entry->link;
link              131 builtin/merge-tree.c 		struct merge_list *link = entry->link;
link              134 builtin/merge-tree.c 		entry = link;
link              194 builtin/merge-tree.c 	final->link = orig;
link              234 builtin/merge-tree.c 	struct merge_list *link;
link              242 builtin/merge-tree.c 	link = create_entry(stage, n->mode, n->sha1, path);
link              243 builtin/merge-tree.c 	link->link = entry;
link              244 builtin/merge-tree.c 	return link;
link              185 compat/mingw.h int link(const char *oldpath, const char *newpath);
link              131 kwset.c          register struct tree *link;
link              150 kwset.c              link = trie->links;
link              155 kwset.c              while (link && label != link->label)
link              157 kwset.c        	  links[depth] = link;
link              158 kwset.c        	  if (label < link->label)
link              159 kwset.c        	    dirs[depth++] = L, link = link->llink;
link              161 kwset.c        	    dirs[depth++] = R, link = link->rlink;
link              167 kwset.c              if (!link)
link              169 kwset.c        	  link = (struct tree *) obstack_alloc(&kwset->obstack,
link              171 kwset.c        	  if (!link)
link              173 kwset.c        	  link->llink = NULL;
link              174 kwset.c        	  link->rlink = NULL;
link              175 kwset.c        	  link->trie = (struct trie *) obstack_alloc(&kwset->obstack,
link              177 kwset.c        	  if (!link->trie)
link              179 kwset.c        	      obstack_free(&kwset->obstack, link);
link              182 kwset.c        	  link->trie->accepting = 0;
link              183 kwset.c        	  link->trie->links = NULL;
link              184 kwset.c        	  link->trie->parent = trie;
link              185 kwset.c        	  link->trie->next = NULL;
link              186 kwset.c        	  link->trie->fail = NULL;
link              187 kwset.c        	  link->trie->depth = trie->depth + 1;
link              188 kwset.c        	  link->trie->shift = 0;
link              189 kwset.c        	  link->label = label;
link              190 kwset.c        	  link->balance = 0;
link              194 kwset.c        	    links[depth]->llink = link;
link              196 kwset.c        	    links[depth]->rlink = link;
link              265 kwset.c              trie = link->trie;
link              302 kwset.c          register struct tree *link;
link              314 kwset.c              link = fail->links;
link              315 kwset.c              while (link && tree->label != link->label)
link              316 kwset.c        	if (tree->label < link->label)
link              317 kwset.c        	  link = link->llink;
link              319 kwset.c        	  link = link->rlink;
link              320 kwset.c              if (link)
link              322 kwset.c        	  tree->trie->fail = link->trie;
link               51 lockfile.c     	static struct strbuf link = STRBUF_INIT;
link               54 lockfile.c     		if (strbuf_readlink(&link, path->buf, path->len) < 0)
link               57 lockfile.c     		if (is_absolute_path(link.buf))
link               67 lockfile.c     		strbuf_addbuf(path, &link);
link               69 lockfile.c     	strbuf_reset(&link);
link             2966 sha1_file.c    	else if (link(tmpfile, filename))