Function main

plugins/test/run-route-calc.c:239–450

A -> B -> C -> D -> E * * Each node has two channels with the next, one has worse characteristics. */

 * Each node has two channels with the next, one has worse characteristics.
 */
int main(int argc, char *argv[])
{
	struct payment *p;
	struct payment_modifier **mods;
	struct channel_hint_set *hints;

	common_setup(argv[0]);
	chainparams = chainparams_for_network("regtest");
	hints = channel_hint_set_new(tmpctx);

	mods = tal_arrz(tmpctx, struct payment_modifier *, 1);
	p = payment_new(mods, tal(tmpctx, struct command), NULL, hints, mods);

	/* We want to permute order of channels between each node, to
	 * avoid "it works because it chooses the first one!" */
	for (size_t i = 0; i < 2; i++) {
		const char gossip_version = 10;
		struct gossmap *gossmap;
		char *gossipfilename;
		int store_fd;
		struct short_channel_id_dir scids[2], path[4];
		struct route_hop *r;
		struct node_id src, dst;
		const struct dijkstra *dij;
		const char *errmsg;
		u32 risk_factor = 10;

		store_fd = tmpdir_mkstemp(tmpctx, "run-route-calc.XXXXXX",
					  &gossipfilename);
		assert(write(store_fd, &gossip_version, sizeof(gossip_version))
		       == sizeof(gossip_version));

		/* Cheap base vs expensive base */
		scids[0] = add_connection(store_fd, 'A', 'B',
					  1000 * !i,
					  100,
					  1,
					  AMOUNT_SAT(100000000));
		scids[1] = add_connection(store_fd, 'A', 'B',
					  1000 * !!i,
					  100,
					  1,
					  AMOUNT_SAT(100000000));
		path[0] = scids[!i];

		/* Cheap proportion vs expensive proportion */
		scids[0] = add_connection(store_fd, 'B', 'C',
					  1000,
					  100 * !i,
					  1,
					  AMOUNT_SAT(100000000));
		scids[1] = add_connection(store_fd, 'B', 'C',
					  1000,
					  100 * !!i,
					  1,
					  AMOUNT_SAT(100000000));
		path[1] = scids[!i];