427 		   struct store_entry *bse,  in invalidate_element()  argument
430 	if (bse->elem[elem_idx].block != 0) {  in invalidate_element()
435 		bf = (bse->elem[elem_idx].block >> BLOCK_ENTRY_COUNT) &  in invalidate_element()
439 		bi = bse->elem[elem_idx].block & ((1U << BLOCK_ENTRY_COUNT) -1);  in invalidate_element()
447 		fname = store_fname(state, nsurl_hash(bse->url), elem_idx);  in invalidate_element()
455 	state->total_alloc -= bse->elem[elem_idx].size;  in invalidate_element()
468 invalidate_entry(struct store_state *state, struct store_entry *bse)  in invalidate_entry()  argument
473 	bse->flags |= ENTRY_FLAGS_INVALID;  in invalidate_entry()
476 	if (((bse->elem[ENTRY_ELEM_DATA].flags &  in invalidate_entry()
478 	    ((bse->elem[ENTRY_ELEM_META].flags &  in invalidate_entry()
489 	NSLOG(netsurf, VERBOSE, "Removing entry for %s", nsurl_access(bse->url));  in invalidate_entry()
491 	ret = invalidate_element(state, bse, ENTRY_ELEM_META);  in invalidate_entry()
496 	ret = invalidate_element(state, bse, ENTRY_ELEM_DATA);  in invalidate_entry()
502 	hashmap_remove(state->entries, bse->url);  in invalidate_entry()
629 		struct store_entry *bse = estate.elist[ent];  in store_evict()  local
631 		removed += bse->elem[ENTRY_ELEM_DATA].size;  in store_evict()
632 		removed += bse->elem[ENTRY_ELEM_META].size;  in store_evict()
634 		ret = invalidate_entry(state, bse);  in store_evict()
915 get_store_entry(struct store_state *state, nsurl *url, struct store_entry **bse)  in get_store_entry()  argument
925 	*bse = ent;  in get_store_entry()
988 		struct store_entry **bse)  in set_store_entry()  argument
1048 	*bse = se;  in set_store_entry()
1587 			 struct store_entry *bse,  in store_write_block()  argument
1590 	block_index_t bf = (bse->elem[elem_idx].block >> BLOCK_ENTRY_COUNT) &  in store_write_block()
1592 …block_index_t bi = bse->elem[elem_idx].block & ((1U << BLOCK_ENTRY_COUNT) -1); /* block index in f…  in store_write_block()
1612 			bse->elem[elem_idx].data,  in store_write_block()
1613 			bse->elem[elem_idx].size,  in store_write_block()
1615 	if (wr != (ssize_t)bse->elem[elem_idx].size) {  in store_write_block()
1619 		      bse->elem[elem_idx].size,  in store_write_block()
1620 		      bse->elem[elem_idx].data,  in store_write_block()
1622 		      bse->elem[elem_idx].block,  in store_write_block()
1629 	      bse->elem[elem_idx].data, (size_t)offst,  in store_write_block()
1630 	      bse->elem[elem_idx].block);  in store_write_block()
1644 			 struct store_entry *bse,  in store_write_file()  argument
1651 	fd = store_open(state, nsurl_hash(bse->url), elem_idx, O_CREAT | O_WRONLY);  in store_write_file()
1658 	wr = write(fd, bse->elem[elem_idx].data, bse->elem[elem_idx].size);  in store_write_file()
1662 	if (wr != (ssize_t)bse->elem[elem_idx].size) {  in store_write_file()
1666 		      bse->elem[elem_idx].size,  in store_write_file()
1667 		      bse->elem[elem_idx].data,  in store_write_file()
1675 	      bse->elem[elem_idx].data);  in store_write_file()
1698 	struct store_entry *bse;  in store()  local
1714 	ret = set_store_entry(storestate, url, elem_idx, data, datalen, &bse);  in store()
1720 	if (bse->elem[elem_idx].block != 0) {  in store()
1722 		ret = store_write_block(storestate, bse, elem_idx);  in store()
1725 		ret = store_write_file(storestate, bse, elem_idx);  in store()
1757 			 struct store_entry *bse,  in store_read_block()  argument
1760 	block_index_t bf = (bse->elem[elem_idx].block >> BLOCK_ENTRY_COUNT) &  in store_read_block()
1762 …block_index_t bi = bse->elem[elem_idx].block & ((1 << BLOCK_ENTRY_COUNT) -1); /* block index in fi…  in store_read_block()
1782 		       bse->elem[elem_idx].data,  in store_read_block()
1783 		       bse->elem[elem_idx].size,  in store_read_block()
1785 	if (rd != (ssize_t)bse->elem[elem_idx].size) {  in store_read_block()
1789 		      bse->elem[elem_idx].size,  in store_read_block()
1790 		      bse->elem[elem_idx].data,  in store_read_block()
1792 		      bse->elem[elem_idx].block,  in store_read_block()
1799 	      bse->elem[elem_idx].data, (size_t)offst,  in store_read_block()
1800 	      bse->elem[elem_idx].block);  in store_read_block()
1814 			 struct store_entry *bse,  in store_read_file()  argument
1823 	fd = store_open(storestate, nsurl_hash(bse->url), elem_idx, O_RDONLY);  in store_read_file()
1830 	while (tot < bse->elem[elem_idx].size) {  in store_read_file()
1832 			  bse->elem[elem_idx].data + tot,  in store_read_file()
1833 			  bse->elem[elem_idx].size - tot);  in store_read_file()
1848 	      bse->elem[elem_idx].data);  in store_read_file()
1869 	struct store_entry *bse;  in fetch()  local
1879 	ret = get_store_entry(storestate, url, &bse);  in fetch()
1896 	elem = &bse->elem[elem_idx];  in fetch()
1904 		      "Using existing entry (%p) allocation %p refs:%d", bse,  in fetch()
1924 			ret = store_read_block(storestate, bse, elem_idx);  in fetch()
1926 			ret = store_read_file(storestate, bse, elem_idx);  in fetch()
1955 	struct store_entry *bse;  in release()  local
1963 	ret = get_store_entry(storestate, url, &bse);  in release()
1971 		elem = &bse->elem[ENTRY_ELEM_META];  in release()
1973 		elem = &bse->elem[ENTRY_ELEM_DATA];  in release()
1983 	    ((bse->flags & ENTRY_FLAGS_INVALID) != 0)) {  in release()
1984 		ret = invalidate_entry(storestate, bse);  in release()
2004 	struct store_entry *bse;  in invalidate()  local
2011 	ret = get_store_entry(storestate, url, &bse);  in invalidate()
2016 	return invalidate_entry(storestate, bse);  in invalidate()