laumann/ani - Change QYRJIOYPM7SAB3OHMALL67K44U5HPBRQ2AFNWUKATPXM6BUYRKBQC

change: separate decoding and printing of hashed struct

Created by laumann on September 26, 2022

QYRJIOYPM7SAB3OHMALL67K44U5HPBRQ2AFNWUKATPXM6BUYRKBQC

Dependencies

In channels

main

Change contents

Replacement in change.c at line 191 [5.1047]
B:BD[4.1059] → [4.1059:1083]
```
	uint8_t *expected_hash
```
[4.1059]
[4.1083]
```
	uint8_t *expected_hash, struct hashed *hashed
```
Deletion in change.c at line 195 [5.1047]
∅:D[6.632] → [7.872:895]
B:BD[8.1172] → [7.872:895]
```
	struct hashed hashed;
```

Replacement in change.c at line 230 [5.1047]

B:BD[9.81] → [9.81:119]

	dump_buf("hashed", buf, hashed_len);

[9.81]

[6.696]

	/* dump_buf("hashed", buf, hashed_len); */

Replacement in change.c at line 232 [5.1047]
B:BD[6.697] → [9.120:164]
∅:D[10.60] → [6.734:778]
∅:D[9.164] → [6.734:778]
B:BD[6.734] → [6.734:778]
```
	hashed.version = bincode_getu64(&binstat);
	printf("version = %lu\n", hashed.version);
```
[6.697]
[6.802]
```
	hashed->version = bincode_getu64(&binstat);
```

Insertion in change.c at line 235 [5.1047]

[9.198]

[6.853]

	hashed->header.message = bincode_getstr(&binstat, len);

Deletion in change.c at line 237 [5.1047]
B:BD[6.854] → [9.199:255]
∅:D[10.139] → [6.914:967]
∅:D[9.255] → [6.914:967]
B:BD[6.914] → [6.914:967]
```
	hashed.header.message = bincode_getstr(&binstat, len);
	printf("message = '%s'\n", hashed.header.message);
```

Replacement in change.c at line 244 [5.1047]

B:BD[9.322] → [9.322:383]

∅:D[10.223] → [6.1262:1367]

∅:D[9.383] → [6.1262:1367]

B:BD[6.1262] → [6.1262:1367]

		hashed.header.description = bincode_getstr(&binstat, len);
		printf("description = '%s'\n", hashed.header.description);
	} else
		printf("description = (none)\n");

[9.322]

[6.1367]

		hashed->header.description = bincode_getstr(&binstat, len);
	}

Replacement in change.c at line 252 [5.1047]
∅:D[4.1248] → [9.418:476]
B:BD[6.1520] → [9.418:476]
∅:D[10.304] → [6.1583:1639]
∅:D[9.476] → [6.1583:1639]
B:BD[6.1583] → [6.1583:1639]
```
	hashed.header.timestamp = bincode_getstr(&binstat, len);
	printf("timestamp = '%s'\n", hashed.header.timestamp);
```
[4.1248]
[11.354]
```
	hashed->header.timestamp = bincode_getstr(&binstat, len);
```

Replacement in change.c at line 255 [5.1047]

B:BD[11.412] → [11.412:513]

	hashed.header.authors.len = len;
	hashed.header.authors.map = xmalloc(sizeof(struct author) * len);

[11.412]

[11.513]

	hashed->header.authors.len = len;
	hashed->header.authors.map = xmalloc(sizeof(struct author) * len);

Replacement in change.c at line 258 [5.1047]

B:BD[11.514] → [11.514:591]

	printf("[[authors]]\n");
	for (i = 0; i < hashed.header.authors.len; i++) {

[11.514]

[11.591]

	for (i = 0; i < hashed->header.authors.len; i++) {

Replacement in change.c at line 261 [5.1047]
B:BD[11.634] → [4.1249:1290]
```
		hashed.header.authors.map[i].entries =
```
[11.634]
[4.1290]
```
		hashed->header.authors.map[i].entries =
```

Replacement in change.c at line 263 [5.1047]

∅:D[4.1331] → [11.713:814]

B:BD[11.713] → [11.713:814]

		hashed.header.authors.map[i].len = len;
		for (j = 0; j < hashed.header.authors.map[i].len; j++) {

[4.1331]

[11.814]

		hashed->header.authors.map[i].len = len;
		for (j = 0; j < hashed->header.authors.map[i].len; j++) {

Replacement in change.c at line 266 [5.1047]

B:BD[11.849] → [4.1332:1381]

			hashed.header.authors.map[i].entries[j].key =

[11.849]

[4.1381]

			hashed->header.authors.map[i].entries[j].key =

Replacement in change.c at line 269 [5.1047]

B:BD[11.964] → [4.1417:1468]

			hashed.header.authors.map[i].entries[j].value =

[11.964]

[4.1468]

			hashed->header.authors.map[i].entries[j].value =

Deletion in change.c at line 271 [5.1047]

∅:D[4.1503] → [11.1046:1071]

B:BD[11.1046] → [11.1046:1071]

B:BD[11.1071] → [4.1504:1617]

			printf("%s = '%s'\n",
			       hashed.header.authors.map[i].entries[j].key,
			       hashed.header.authors.map[i].entries[j].value);

Deletion in change.c at line 274 [5.1047]
B:BD[12.842] → [2.627:656]
```
	printf("# Dependencies\n");
```

Replacement in change.c at line 275 [5.1047]

B:BD[12.881] → [2.657:714]

	change_decode_hashlist(&binstat, &hashed.dependencies);

[12.881]

[11.1176]

	change_decode_hashlist(&binstat, &hashed->dependencies);

Replacement in change.c at line 278 [5.1047]

B:BD[12.1575] → [2.715:771]

∅:D[2.771] → [13.0:1]

B:BD[12.2219] → [13.0:1]

B:BD[13.1] → [3.0:226]

	change_decode_hashlist(&binstat, &hashed.extra_known);
	for (i = 0; i < hashed.dependencies.len; i++) {
		printf(" ");
		hash_print(&hashed.dependencies.entries[i]);
	}
	for (i = 0; i < hashed.extra_known.len; i++) {
		printf("+");
		hash_print(&hashed.extra_known.entries[i]);
	}

[12.1575]

[3.226]

	change_decode_hashlist(&binstat, &hashed->extra_known);

Replacement in change.c at line 288 [5.1047]

B:BD[13.183] → [3.228:280]

	/* dump_buf("buf", binstat.buf, binstat.avail); */

[13.183]

[13.229]

	dump_buf("buf", binstat.buf, binstat.avail);

Insertion in change.c at line 328 [5.1047]
[4.2126]
[5.2254]
```
	struct hashed hashed;
```
Replacement in change.c at line 353 [5.1047]
B:BD[4.2211] → [4.2211:2227]
```
		contents_hash
```
[4.2211]
[4.2227]
```
		contents_hash, &hashed
```

Insertion in change.c at line 358 [5.1047]

[5.2584]

	}
	printf("--------------------------------------------------------------------------------\n"
	);
	printf("version = %lu\n", off.version);
	printf("hashed_len = %lu\n", off.hashed_len);
	printf("unhashed_off = %lu\n", off.unhashed_off);
	printf("unhashed_len = %lu\n", off.unhashed_len);
	printf("contents_off = %lu\n", off.contents_off);
	printf("contents_len = %lu\n", off.contents_len);
	printf("total = %lu\n", off.total);
	printf("--------------------------------------------------------------------------------\n"
	);
	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);
		}

Insertion in change.c at line 386 [5.1047]
[5.2587]
[14.2621]
```
	printf("\n");
```

Insertion in change.c at line 388 [5.1047]

[14.2622]

	printf("# Dependencies\n");
	for (i = 0; i < hashed.dependencies.len; i++) {
		printf(" ");
		hash_print(&hashed.dependencies.entries[i]);
	}
	for (i = 0; i < hashed.extra_known.len; i++) {
		printf("+");
		hash_print(&hashed.extra_known.entries[i]);
	}
	printf("\n");

Deletion in change.c at line 412 [5.1047]

∅:D[15.256] → [14.2907:2908]

B:BD[14.2907] → [14.2907:2908]

∅:D[14.2908] → [5.2587:2966]

B:BD[5.2587] → [5.2587:2966]


	printf("version           : %lu\n", off.version);
	printf("hashed_len        : %lu\n", off.hashed_len);
	printf("unhashed_off      : %lu\n", off.unhashed_off);
	printf("unhashed_len      : %lu\n", off.unhashed_len);
	printf("contents_off      : %lu\n", off.contents_off);
	printf("contents_len      : %lu\n", off.contents_len);
	printf("total             : %lu\n", off.total);

change: separate decoding and printing of hashed struct

Dependencies

In channels

Change contents

Replacement in change.c at line 191 [5.1047]

Deletion in change.c at line 195 [5.1047]

Replacement in change.c at line 230 [5.1047]

Replacement in change.c at line 232 [5.1047]

Insertion in change.c at line 235 [5.1047]

Deletion in change.c at line 237 [5.1047]

Replacement in change.c at line 244 [5.1047]

Replacement in change.c at line 252 [5.1047]