subversion/libsvn_fs_x/index.c

1932       apr_uint64_t item_count;
1956       item_count = full_page_count * header->page_size
1959       APR_ARRAY_PUSH(*max_ids, apr_uint64_t) = item_count;
1975   if (new_entry->item_count)
1978                                    entry->item_count * sizeof(*entry->items));
2027   SVN_ERR(write_uint64_to_proto_index(proto_index, entry->item_count,
2031   for (i = 0; i < entry->item_count; ++i)
2082   SVN_ERR(read_uint32_from_proto_index(proto_index, &entry->item_count,
2095   for (i = 0; i < entry->item_count; ++i)
2222       if (entry.item_count && !eof)
2225                                    entry.item_count * sizeof(*entry.items));
2248           entry.item_count = 0;
2252       for (sub_item = 0; sub_item < entry.item_count; ++sub_item)
2286                                                      + entry.item_count * 16),
2293       for (sub_item = 0; sub_item < entry.item_count; ++sub_item)
2304       for (sub_item = 0; sub_item < entry.item_count; ++sub_item)
2591   entry.item_count = (apr_uint32_t)(value / 16);
2613         || entry.item_count != 0)
2617   if (entry.item_count == 0)
2624         = apr_pcalloc(result->pool, entry.item_count * sizeof(*entry.items));
2626       if (   entry.item_count > 1
2631       for (sub_item = 0; sub_item < entry.item_count; ++sub_item)
2639       for (sub_item = 0; sub_item < entry.item_count; ++sub_item)
2908       if (entry->item_count)
2917                                     entry->item_count * sizeof(*items));
3097               entry->item_count = 0;
3313          && entry->item_count > lookup_baton->sub_item
3357       if (entry && entry->item_count > sub_item)
3564   if (lhs->entry->item_count == 0)
3565     return rhs->entry->item_count == 0 ? 0 : -1;
3566   if (rhs->entry->item_count == 0)
3569   lhs_part = lhs->order ? lhs->order[lhs->entry->item_count - 1]
3571   rhs_part = rhs->order ? rhs->order[rhs->entry->item_count - 1]
3621       if (entry->item_count == 0)
3629       count += entry->item_count;
3631       if (entry->item_count > 1)
3635                          sizeof(*ordered->order) * entry->item_count);
3636           for (k = 0; k < entry->item_count; ++k)
3639           qsort(ordered->order, entry->item_count, sizeof(*ordered->order),
3655       if (ordered->entry->item_count > 0)
3660                    ? ordered->order[ordered->entry->item_count - 1]
3678           --ordered->entry->item_count;
3682       if (ordered->entry->item_count)
3893                                     entries[i].item_count