Searched refs:count (Results 1 - 25 of 7815) sorted by last modified time

1234567891011>>

/external/zlib/src/contrib/blast/
H A Dblast.c93 * Huffman code decoding tables. count[1..MAXBITS] is the number of symbols of
96 * entries is the sum of the counts in count[]. The decoding process can be
100 short *count; /* number of symbols of each length */ member in struct:huffman
130 int count; /* number of codes of length len */ local
140 next = h->count + 1;
145 count = *next++;
146 if (code < first + count) { /* if length len, return symbol */
151 index += count; /* else update for next length */
152 first += count;
172 * count (hig
[all...]
/external/zlib/src/contrib/delphi/
H A DZLib.pas228 procedure _memset(P: Pointer; B: Byte; count: Integer); cdecl;
230 FillChar(P^, count, B);
233 procedure _memcpy(dest, source: Pointer; count: Integer); cdecl;
235 Move(source^, dest^, count);
/external/zlib/src/contrib/dotzlib/DotZLib/
H A DChecksumImpl.cs60 /// <param name="count">The number of bytes from <c>data</c> to use</param>
61 /// <exception cref="ArgumentException">The sum of offset and count is larger than the length of <c>data</c></exception>
63 /// <exception cref="ArgumentOutOfRangeException">Offset or count is negative.</exception>
66 public abstract void Update(byte[] data, int offset, int count); argument
129 /// <param name="count">The number of bytes from <c>data</c> to use</param>
130 /// <exception cref="ArgumentException">The sum of offset and count is larger than the length of <c>data</c></exception>
132 /// <exception cref="ArgumentOutOfRangeException">Offset or count is negative.</exception>
133 public override void Update(byte[] data, int offset, int count) argument
135 if (offset < 0 || count < 0) throw new ArgumentOutOfRangeException();
136 if ((offset+count) > dat
184 Update(byte[] data, int offset, int count) argument
[all...]
H A DCircularBuffer.cs39 public int Put(byte[] source, int offset, int count) argument
41 Debug.Assert( count > 0 );
42 int trueCount = Math.Min(count, _capacity - Size);
61 public int Get(byte[] destination, int offset, int count) argument
63 int trueCount = Math.Min(count,Size);
H A DCodecBase.cs100 /// <param name="count">The number of bytes to add</param>
103 public abstract void Add(byte[] data, int offset, int count); argument
167 /// <param name="count">The number of bytes to copy from <c>data</c></param>
168 protected void copyInput(byte[] data, int startIndex, int count) argument
170 Array.Copy(data, startIndex, _inBuffer,0, count);
173 _ztream.avail_in = (uint)count;
H A DDeflater.cs52 /// <param name="count">The number of bytes to add</param>
54 public override void Add(byte[] data, int offset, int count) argument
57 if (offset < 0 || count < 0) throw new ArgumentOutOfRangeException();
58 if ((offset+count) > data.Length) throw new ArgumentException();
60 int total = count;
H A DDotZLib.cs137 /// <param name="count">The number of bytes from <c>data</c> to use</param>
138 /// <exception cref="ArgumentException">The sum of offset and count is larger than the length of <c>data</c></exception>
140 /// <exception cref="ArgumentOutOfRangeException">Offset or count is negative.</exception>
141 void Update(byte[] data, int offset, int count); argument
165 /// <paramref name="count">The number of processed bytes available</paramref>
169 public delegate void DataAvailableHandler(byte[] data, int startIndex, int count); argument
193 /// <param name="count">The number of bytes to add</param>
195 void Add(byte[] data, int offset, int count); argument
H A DGZipStream.cs147 /// <param name="count">The number of bytes requested</param>
150 /// <exception cref="ArgumentOutOfRangeException">If <c>count</c> or <c>offset</c> are negative</exception>
151 /// <exception cref="ArgumentException">If <c>offset</c> + <c>count</c> is &gt; buffer.Length</exception>
154 public override int Read(byte[] buffer, int offset, int count) argument
158 if (offset < 0 || count < 0) throw new ArgumentOutOfRangeException();
159 if ((offset+count) > buffer.Length) throw new ArgumentException();
166 result = gzread(_gzFile, h.AddrOfPinnedObject().ToInt32() + offset, count);
193 /// <param name="count"></param>
195 /// <exception cref="ArgumentOutOfRangeException">If <c>count</c> or <c>offset</c> are negative</exception>
196 /// <exception cref="ArgumentException">If <c>offset</c> + <c>count</
199 Write(byte[] buffer, int offset, int count) argument
[all...]
H A DInflater.cs52 /// <param name="count">The number of bytes to add</param>
54 public override void Add(byte[] data, int offset, int count) argument
57 if (offset < 0 || count < 0) throw new ArgumentOutOfRangeException();
58 if ((offset+count) > data.Length) throw new ArgumentException();
60 int total = count;
H A DUnitTests.cs186 public void CDataAvail(byte[] data, int startIndex, int count) argument
188 for (int i = 0; i < count; ++i)
220 private void DDataAvail(byte[] data, int startIndex, int count) argument
222 for (int i = 0; i < count; ++i)
/external/zlib/src/contrib/infback9/
H A Dinftree9.c58 unsigned short count[MAXBITS+1]; /* number of codes of each length */ local
95 The codes are sorted by computing a count of codes for each length,
110 count[len] = 0;
112 count[lens[sym]]++;
117 if (count[max] != 0) break;
121 if (count[min] != 0) break;
128 left -= count[len];
137 offs[len + 1] = offs[len] + count[len];
159 counts are used for this, and so count[] is decremented as codes are
245 /* go to next symbol, update count, le
[all...]
/external/zlib/src/contrib/pascal/
H A Dzlibpas.pas266 procedure _memset(P: Pointer; B: Byte; count: Integer); cdecl;
268 FillChar(P^, count, B);
271 procedure _memcpy(dest, source: Pointer; count: Integer); cdecl;
273 Move(source^, dest^, count);
/external/zlib/src/contrib/puff/
H A Dpuff.c200 * Huffman code decoding tables. count[1..MAXBITS] is the number of symbols of
203 * entries is the sum of the counts in count[]. The decoding process can be
207 short *count; /* number of symbols of each length */ member in struct:huffman
240 int count; /* number of codes of length len */ local
246 count = h->count[len];
247 if (code - count < first) /* if length len, return symbol */
249 index += count; /* else update for next length */
250 first += count;
268 int count; /* numbe local
[all...]
/external/zlib/src/examples/
H A Denough.c73 intermediate states are noted by a non-zero count in a saved-results array.
141 count() for the index, and the calculation of size in main() for the size
203 local big_t count(int syms, int len, int left) function
206 big_t got; /* value returned from count() */
237 /* count all possible codes from this juncture and add them up */
240 got = count(syms - use, len + 1, (left - use) << 1);
447 To count and examine Huffman codes that are not length-limited, provide a
462 big_t got; /* return value of count() */
533 /* count possible codes for all numbers of symbols, add up counts */
536 got = count(
[all...]
/external/zlib/src/
H A Dinftrees.c58 unsigned short count[MAXBITS+1]; /* number of codes of each length */ local
93 The codes are sorted by computing a count of codes for each length,
108 count[len] = 0;
110 count[lens[sym]]++;
115 if (count[max] != 0) break;
127 if (count[min] != 0) break;
134 left -= count[len];
143 offs[len + 1] = offs[len] + count[len];
165 counts are used for this, and so count[] is decremented as codes are
252 /* go to next symbol, update count, le
[all...]
H A Dtrees.c54 /* repeat previous bit length 3-6 times (2 bits of repeat count) */
57 /* repeat a zero length 3-10 times (3 bits of repeat count) */
60 /* repeat a zero length 11-138 times (7 bits of repeat count) */
714 int count = 0; /* repeat count of the current code */ local
715 int max_count = 7; /* max repeat count */
716 int min_count = 4; /* min repeat count */
723 if (++count < max_count && curlen == nextlen) {
725 } else if (count < min_count) {
726 s->bl_tree[curlen].Freq += count;
759 int count = 0; /* repeat count of the current code */ local
[all...]
/external/zlib/src/test/
H A Dinfcover.c71 local void *mem_alloc(void *mem, unsigned count, unsigned size) argument
76 size_t len = count * (size_t)size;
148 /* if not found, update the rogue count */
202 int count = 0; local
216 count++;
220 if (count || zone->total)
222 prefix, zone->total, count);
/external/zxing/core/
H A Dcore.jarMETA-INF/ META-INF/MANIFEST.MF com/ com/google/ com/google/zxing/ com/google/zxing/aztec/ ...
/external/webrtc/src/system_wrappers/source/android/
H A Dcpu-features.c152 int count = 0; local
175 count += 1;
181 return count;
/external/webrtc/src/system_wrappers/source/
H A Dcritical_section_unittest.cc71 // Waits a number of cycles for the count to reach a given value.
73 bool WaitForCount(int target, ProtectedCount* count) { argument
78 while (count->Count() < target && loop_counter < 100*target) {
83 return (count->Count() >= target);
102 ProtectedCount count(crit_sect);
104 &LockUnlockThenStopRunFunction, &count);
110 // the lock, even though count.Count() locks and unlocks the critical section
112 // Thus, the thread should not be able to increment the count
113 ASSERT_EQ(0, count.Count());
115 EXPECT_TRUE(WaitForCount(1, &count));
[all...]
H A Ddata_log.cc124 assert(cells_.count(column_name) == 0);
125 if (cells_.count(column_name) > 0)
200 assert(columns_.count(column_name) > 0);
201 if (columns_.count(column_name) == 0)
385 if (tables_.count(table_name) > 0)
397 if (tables_.count(table_name) == 0)
406 assert(tables_.count(table_name) > 0);
407 if (tables_.count(table_name) == 0)
414 if (tables_.count(table_name) == 0)
/external/webrtc/src/system_wrappers/source/spreadsortlib/
H A Dspreadsort.hpp38 //Maintains both a minimum size to recurse and a check of distribution size versus count
41 get_max_count(unsigned log_range, size_t count) argument
43 unsigned divisor = rough_log_2_size(count);
88 get_log_divisor(size_t count, unsigned log_range) argument
92 if((log_divisor = log_range - rough_log_2_size(count)) <= 0 && log_range < MAX_SPLITS)
190 size_t count = bin_cache[u] - lastPos; local
192 if(count < 2)
195 if(count < max_count)
277 size_t count = bin_cache[u] - lastPos; local
278 if(count <
325 size_t count = bin_cache[u] - lastPos; local
518 size_t count = bin_cache[u] - lastPos; local
569 size_t count = bin_cache[ii] - lastPos; local
620 size_t count = bin_cache[ii] - lastPos; local
669 size_t count = bin_cache[ii] - lastPos; local
741 size_t count = bin_cache[ii] - lastPos; local
752 size_t count = bin_cache[u] - lastPos; local
826 size_t count = bin_cache[ii] - lastPos; local
837 size_t count = bin_cache[u] - lastPos; local
910 size_t count = bin_cache[ii] - lastPos; local
921 size_t count = bin_cache[u] - lastPos; local
1176 size_t count = bin_cache[u] - lastPos; local
1266 size_t count = bin_cache[u] - lastPos; local
1353 size_t count = bin_cache[u] - lastPos; local
1440 size_t count = bin_cache[u] - lastPos; local
1531 size_t count = bin_cache[u] - lastPos; local
[all...]
/external/wpa_supplicant_8/hostapd/
H A Dconfig_file.c713 int count; local
720 count = 0;
723 count++;
727 list = os_malloc(sizeof(int) * (count + 2));
731 count = 0;
737 list[count++] = atoi(pos);
742 list[count] = -1;
1290 unsigned int *count, char *pos)
1308 ls = os_realloc_array(*array, *count + 1,
1314 ls = &(*array)[*count];
1289 parse_lang_string(struct hostapd_lang_string **array, unsigned int *count, char *pos) argument
1341 size_t count; local
[all...]
H A Ddump_state.c156 int count = radius_client_get_mib(hapd->radius, buf, 4096); local
157 if (count < 0)
158 count = 0;
159 else if (count > 4095)
160 count = 4095;
161 buf[count] = '\0';
165 count = radius_server_get_mib(hapd->radius_srv, buf, 4096);
166 if (count < 0)
167 count = 0;
168 else if (count > 409
[all...]
H A Dhlr_auc_gw.c617 int count, max_chal, ret; local
644 for (count = 0; count < max_chal; count++) {
659 count = 0;
660 while (count < max_chal && (g = get_gsm_triplet(imsi))) {
673 count++;
676 if (count == 0) {

Completed in 228 milliseconds

1234567891011>>