laumann/ani - Change XTVLIC243WZF52NVTNRA3SV3WLE2ZZ5GTFQOK45IOLMXYQMTLOSAC

change: refactor to print_change()

Created by laumann on November 23, 2022

XTVLIC243WZF52NVTNRA3SV3WLE2ZZ5GTFQOK45IOLMXYQMTLOSAC

Dependencies

In channels

main

Change contents

Replacement in hunk.c at line 42 [4.1372]
B:BD[4.2135] → [4.2135:2146]
```
		abort();
```
[4.2135]
[4.2146]
```
		abort(); // FIXME Replace with die()
```
Insertion in hash.h at line 21 [6.31]
[5.604]
[6.320]
```
void hashlist_free(Hashlist *h);
```

Insertion in hash.c at line 34 [6.360]

[6.699]

}
void
hashlist_free(Hashlist *h)
{
	free(h->entries);

Deletion in change.c at line 357 [7.1047]

B:BD[2.5020] → [2.5020:5096]

		/* printf("%d. %s\n", i + 1, hunk_basehunk_type_str(bhunk->hunktype)); */

Replacement in change.c at line 526 [7.1047]

B:BD[8.2599] → [3.239:339]

 * TODO To properly print EDGE_MAP types we need access to referenced changes to pull deleted lines

[8.2599]

[3.339]

 * TODO To properly print EDGE_MAP types we need access to referenced changes to
 * pull deleted lines.

Replacement in change.c at line 534 [7.1047]
B:BD[3.417] → [3.417:430]
```
	char *c, x;
```
[3.417]
[3.430]
```
	char x;
```

Insertion in change.c at line 569 [7.1047]

[3.992]

	}
}
void
print_change(Hashed *hashed, uint8_t *contents)
{
	int i;
	printf("message = %s\n", hashed->header.message);
	if (hashed->header.description)
		printf("description = '%s'\n", hashed->header.description);
	printf("timestamp = '%s'\n\n", hashed->header.timestamp);
	printf("[[authors]]\n");
	for (i = 0; i < hashed->header.authors.len; i++) {
		int j;
		for (j = 0; j < hashed->header.authors.map[i].len; j++) {
			printf("%s = '%s'\n",
			       hashed->header.authors.map[i].entries[j].key,
			       hashed->header.authors.map[i].entries[j].value);
		}
	}
	printf("\n");
	printf("# Dependencies\n");
	for (i = 0; i < hashed->dependencies.len; i++) {
		printf(" ");
		hashprintln(&hashed->dependencies.entries[i]);
	}
	for (i = 0; i < hashed->extraknown.len; i++) {
		printf("+");
		hashprintln(&hashed->extraknown.entries[i]);
	}
	printf("\n#Hunks\n\n");
	/* FIXME: Put all the hashes of dependencies in a big list, and number them from 2 */
	for (i = 0; i < hashed->hunks.len; i++) {
		Basehunk *hunk = &hashed->hunks.entries[i];
		printf("%d. %s", i + 1, hunk_basehunk_type_str(hunk->hunktype));
		switch (hunk->hunktype) {
		case EDIT:
			Edit *e = &hunk->edit;
			Atom *c = &e->change;
			printf(" in %s:%u (%s)", e->local.path, e->local.line,
			       e->encoding);
			printf("\n");
			print_atom(c, contents);
			break;
		case REPLACEMENT:
			Replacement *r = &hunk->replacement;
			printf(" in %s:%u (%s)", r->local.path, r->local.line,
			       r->encoding);
			print_atom(c, contents);
			printf("\n");
			break;
		default:
			printf(" [not yet implemented]\n");
			break;
		}

Insertion in change.c at line 632 [7.1047]
[3.997]
[3.997]

Replacement in change.c at line 693 [7.1047]

∅:D[3.1313] → [9.1473:1674]

B:BD[9.1473] → [9.1473:1674]

	printf("message = %s\n", hashed.header.message);
	if (hashed.header.description)
		printf("description = '%s'\n", hashed.header.description);
	printf("timestamp = '%s'\n\n", hashed.header.timestamp);

[3.1313]

[9.1674]

	print_change(&hashed, contents);

Deletion in change.c at line 695 [7.1047]

B:BD[9.1675] → [9.1675:1962]

∅:D[9.1962] → [7.2584:2587]

B:BD[7.2584] → [7.2584:2587]

B:BD[7.2587] → [9.1963:1978]

∅:D[9.1978] → [8.2621:2622]

B:BD[7.2587] → [8.2621:2622]

B:BD[8.2622] → [9.1979:2072]

B:BD[9.2072] → [2.5675:5723]

∅:D[5.3391] → [9.2119:2122]

∅:D[2.5723] → [9.2119:2122]

B:BD[9.2119] → [9.2119:2122]

B:BD[9.2122] → [5.3392:3439]

∅:D[5.3439] → [9.2170:2185]

B:BD[9.2170] → [9.2170:2185]

B:BD[9.2185] → [2.5724:5770]

∅:D[5.3484] → [9.2231:2234]

∅:D[2.5770] → [9.2231:2234]

B:BD[9.2231] → [9.2231:2234]

B:BD[9.2234] → [3.1314:1339]

∅:D[3.1339] → [9.2249:2250]

B:BD[9.2249] → [9.2249:2250]

B:BD[9.2250] → [3.1340:2045]

∅:D[3.2045] → [8.2866:2870]

B:BD[8.2866] → [8.2866:2870]

	printf("[[authors]]\n");
	for (i = 0; i < hashed.header.authors.len; i++) {
		int j;
		for (j = 0; j < hashed.header.authors.map[i].len; j++) {
			printf("%s = '%s'\n",
			       hashed.header.authors.map[i].entries[j].key,
			       hashed.header.authors.map[i].entries[j].value);
		}
	}
	printf("\n");
	printf("# Dependencies\n");
	for (i = 0; i < hashed.dependencies.len; i++) {
		printf(" ");
		hashprintln(&hashed.dependencies.entries[i]);
	}
	for (i = 0; i < hashed.extraknown.len; i++) {
		printf("+");
		hashprintln(&hashed.extraknown.entries[i]);
	}
	printf("\n#Hunks\n\n");
	/* FIXME: Put all the hashes of dependencies in a big list, and number them from 2 */
	for (i = 0; i < hashed.hunks.len; i++) {
		Basehunk *hunk = &hashed.hunks.entries[i];
		printf("%d. %s", i + 1, hunk_basehunk_type_str(hunk->hunktype));
		switch (hunk->hunktype) {
		case EDIT:
			Edit *e = &hunk->edit;
			Atom *c = &e->change;
			printf(" in %s:%u (%s)", e->local.path, e->local.line,
			       e->encoding);
			printf("\n");
			print_atom(c, contents);
			break;
		case REPLACEMENT:
			Replacement *r = &hunk->replacement;
			printf(" in %s:%u (%s)", r->local.path, r->local.line,
			       r->encoding);
			printf("\n");
			break;
		default:
			printf(" [not yet implemented]\n");
			break;
		}
	}