comparison mercurial/parsers.c @ 26043:f2f0a3ab6e41

reachableroots: rename "seen" array to "revstates" for future extension

It will be an array of bit flags, SEEN | ROOT | REACHABLE.

26042:2a3010ba6f52

	int minidx;
	int parents[2];

	/* Internal data structure:
	 * tovisit: array of length len+1 (all revs + nullrev), filled upto lentovisit
	 * seen: array of length len+1 (all revs + nullrev) 0: not seen, 1 seen*/
	int *tovisit = NULL;
	long lentovisit = 0;
	char *seen = NULL;

	/* Get arguments */
	if (!PyArg_ParseTuple(args, "lO!O!O!", &minroot, &PyList_Type, &heads,
				&PySet_Type, &roots, &PyBool_Type, &includepatharg))
		goto bail;

	if (tovisit == NULL) {
		PyErr_NoMemory();
		goto bail;
	}

	seen = (char *)calloc(len+1, 1);
	if (seen == NULL) {
		PyErr_NoMemory();
		goto bail;
	}

	/* Populate tovisit with all the heads */

			goto bail;
		if (revnum + 1 < 0 || revnum + 1 >= len + 1) {
			PyErr_SetString(PyExc_IndexError, "head out of range");
			goto bail;
		}
		if (seen[revnum+1] == 0) {
			tovisit[lentovisit++] = revnum;
			seen[revnum+1]=1;
		}
	}

	/* Visit the tovisit list and find the reachable roots */
	k = 0;

			continue;
		r = index_get_parents(self, revnum, parents, (int)len - 1);
		if (r < 0)
			goto bail;
		for (i = 0; i < 2; i++) {
			if (seen[parents[i] + 1] == 0
			    && parents[i] >= minroot) {
				tovisit[lentovisit++] = parents[i];
				seen[parents[i] + 1] = 1;
			}
		}
	}

	/* Find all the nodes in between the roots we found and the heads

	if (includepath == 1) {
		minidx = minroot;
		if (minidx < 0)
			minidx = 0;
		for (i = minidx; i < len; i++) {
			if (seen[i + 1] != 1)
				continue;
			r = index_get_parents(self, i, parents, (int)len - 1);
			/* Corrupted index file, error is set from
			 * index_get_parents */
			if (r < 0)

				Py_DECREF(p);
			}
		}
	}

	free(seen);
	free(tovisit);
	return reachable;
bail:
	Py_XDECREF(reachable);
	free(seen);
	free(tovisit);
	return NULL;
}

static PyObject *compute_phases_map_sets(indexObject *self, PyObject *args)

26043:f2f0a3ab6e41

	int minidx;
	int parents[2];

	/* Internal data structure:
	 * tovisit: array of length len+1 (all revs + nullrev), filled upto lentovisit
	 * revstates: array of length len+1 (all revs + nullrev) 0: not seen, 1 seen*/
	int *tovisit = NULL;
	long lentovisit = 0;
	char *revstates = NULL;

	/* Get arguments */
	if (!PyArg_ParseTuple(args, "lO!O!O!", &minroot, &PyList_Type, &heads,
				&PySet_Type, &roots, &PyBool_Type, &includepatharg))
		goto bail;

	if (tovisit == NULL) {
		PyErr_NoMemory();
		goto bail;
	}

	revstates = (char *)calloc(len + 1, 1);
	if (revstates == NULL) {
		PyErr_NoMemory();
		goto bail;
	}

	/* Populate tovisit with all the heads */

			goto bail;
		if (revnum + 1 < 0 || revnum + 1 >= len + 1) {
			PyErr_SetString(PyExc_IndexError, "head out of range");
			goto bail;
		}
		if (revstates[revnum+1] == 0) {
			tovisit[lentovisit++] = revnum;
			revstates[revnum+1]=1;
		}
	}

	/* Visit the tovisit list and find the reachable roots */
	k = 0;

			continue;
		r = index_get_parents(self, revnum, parents, (int)len - 1);
		if (r < 0)
			goto bail;
		for (i = 0; i < 2; i++) {
			if (revstates[parents[i] + 1] == 0
			    && parents[i] >= minroot) {
				tovisit[lentovisit++] = parents[i];
				revstates[parents[i] + 1] = 1;
			}
		}
	}

	/* Find all the nodes in between the roots we found and the heads

	if (includepath == 1) {
		minidx = minroot;
		if (minidx < 0)
			minidx = 0;
		for (i = minidx; i < len; i++) {
			if (revstates[i + 1] != 1)
				continue;
			r = index_get_parents(self, i, parents, (int)len - 1);
			/* Corrupted index file, error is set from
			 * index_get_parents */
			if (r < 0)

				Py_DECREF(p);
			}
		}
	}

	free(revstates);
	free(tovisit);
	return reachable;
bail:
	Py_XDECREF(reachable);
	free(revstates);
	free(tovisit);
	return NULL;
}

static PyObject *compute_phases_map_sets(indexObject *self, PyObject *args)