Lines Matching defs:entries
101 int i, j, entries = 0, tst = -1, oldtst = -1;
109 tst = track->cluster[i].size/track->cluster[i].entries;
114 entries += track->cluster[i].entries;
117 int sSize = track->cluster[0].size/track->cluster[0].entries;
120 avio_wb32(pb, entries); // sample count
124 avio_wb32(pb, entries); // sample count
126 for (j=0; j<track->cluster[i].entries; j++) {
128 track->cluster[i].entries);
943 uint32_t entries = 0;
951 if (track->cluster[i].cts == ctts_entries[entries].duration) {
952 ctts_entries[entries].count++; /* compress */
954 entries++;
955 ctts_entries[entries].duration = track->cluster[i].cts;
956 ctts_entries[entries].count = 1;
959 entries++; /* last one */
960 atom_size = 16 + (entries * 8);
964 avio_wb32(pb, entries); /* entry count */
965 for (i=0; i<entries; i++) {
977 uint32_t entries = -1;
985 entries = 1;
992 if (i && duration == stts_entries[entries].duration) {
993 stts_entries[entries].count++; /* compress */
995 entries++;
996 stts_entries[entries].duration = duration;
997 stts_entries[entries].count = 1;
1000 entries++; /* last one */
1002 atom_size = 16 + (entries * 8);
1006 avio_wb32(pb, entries); /* entry count */
1007 for (i=0; i<entries; i++) {
2105 trk->cluster[trk->entry].entries = samplesInChunk;