| /dports/multimedia/mkvtoolnix/mkvtoolnix-65.0.0/src/common/ |
| H A D | base64.cpp | 128 unsigned int values_idx; in decode() local
131 for (values_idx = 0; values_idx < in_pos; values_idx++) { in decode()
132 values[values_idx] = in decode()
133 (('A' <= in[values_idx]) && ('Z' >= in[values_idx])) ? in[values_idx] - 'A' in decode()
134 : (('a' <= in[values_idx]) && ('z' >= in[values_idx])) ? in[values_idx] - 'a' + 26 in decode()
135 : (('0' <= in[values_idx]) && ('9' >= in[values_idx])) ? in[values_idx] - '0' + 52 in decode()
136 : ('+' == in[values_idx]) ? 62 in decode()
137 : ('/' == in[values_idx]) ? 63 in decode()
140 if (255 == values[values_idx]) in decode()
|
| /dports/www/node10/node-v10.24.1/deps/v8/src/compiler/ |
| H A D | state-values-utils.cc | 139 WorkingBuffer* node_buffer, size_t* node_count, size_t* values_idx, in FillBufferWithValues() argument
148 while (*values_idx < count && *node_count < kMaxInputCount && in FillBufferWithValues()
150 DCHECK_LE(*values_idx, static_cast<size_t>(INT_MAX)); in FillBufferWithValues()
155 (*node_buffer)[(*node_count)++] = values[*values_idx]; in FillBufferWithValues()
159 (*values_idx)++; in FillBufferWithValues()
171 Node* StateValuesCache::BuildTree(size_t* values_idx, Node** values, in BuildTree() argument
184 while (*values_idx < count && node_count < kMaxInputCount) { in BuildTree()
185 if (count - *values_idx < kMaxInputCount - node_count) { in BuildTree()
196 DCHECK_EQ(*values_idx, count); in BuildTree()
291 size_t values_idx = 0; in GetNodeForValues() local
[all …]
|
| H A D | state-values-utils.h | 60 size_t* values_idx,
65 Node* BuildTree(size_t* values_idx, Node** values, size_t count,
|
| /dports/www/chromium-legacy/chromium-88.0.4324.182/v8/src/compiler/ |
| H A D | state-values-utils.cc | 139 WorkingBuffer* node_buffer, size_t* node_count, size_t* values_idx, in FillBufferWithValues() argument
148 while (*values_idx < count && *node_count < kMaxInputCount && in FillBufferWithValues()
150 DCHECK_LE(*values_idx, static_cast<size_t>(INT_MAX)); in FillBufferWithValues()
155 (*node_buffer)[(*node_count)++] = values[*values_idx]; in FillBufferWithValues()
159 (*values_idx)++; in FillBufferWithValues()
171 Node* StateValuesCache::BuildTree(size_t* values_idx, Node** values, in BuildTree() argument
184 while (*values_idx < count && node_count < kMaxInputCount) { in BuildTree()
185 if (count - *values_idx < kMaxInputCount - node_count) { in BuildTree()
196 DCHECK_EQ(*values_idx, count); in BuildTree()
291 size_t values_idx = 0; in GetNodeForValues() local
[all …]
|
| H A D | state-values-utils.h | 62 size_t* values_idx,
67 Node* BuildTree(size_t* values_idx, Node** values, size_t count,
|
| /dports/lang/v8/v8-9.6.180.12/src/compiler/ |
| H A D | state-values-utils.cc | 139 WorkingBuffer* node_buffer, size_t* node_count, size_t* values_idx, in FillBufferWithValues() argument
148 while (*values_idx < count && *node_count < kMaxInputCount && in FillBufferWithValues()
150 DCHECK_LE(*values_idx, static_cast<size_t>(INT_MAX)); in FillBufferWithValues()
155 (*node_buffer)[(*node_count)++] = values[*values_idx]; in FillBufferWithValues()
159 (*values_idx)++; in FillBufferWithValues()
171 Node* StateValuesCache::BuildTree(size_t* values_idx, Node** values, in BuildTree() argument
184 while (*values_idx < count && node_count < kMaxInputCount) { in BuildTree()
185 if (count - *values_idx < kMaxInputCount - node_count) { in BuildTree()
196 DCHECK_EQ(*values_idx, count); in BuildTree()
291 size_t values_idx = 0; in GetNodeForValues() local
[all …]
|
| H A D | state-values-utils.h | 62 size_t* values_idx,
67 Node* BuildTree(size_t* values_idx, Node** values, size_t count,
|
| /dports/www/qt5-webengine/qtwebengine-everywhere-src-5.15.2/src/3rdparty/chromium/v8/src/compiler/ |
| H A D | state-values-utils.cc | 140 WorkingBuffer* node_buffer, size_t* node_count, size_t* values_idx, in FillBufferWithValues() argument
149 while (*values_idx < count && *node_count < kMaxInputCount && in FillBufferWithValues()
151 DCHECK_LE(*values_idx, static_cast<size_t>(INT_MAX)); in FillBufferWithValues()
156 (*node_buffer)[(*node_count)++] = values[*values_idx]; in FillBufferWithValues()
160 (*values_idx)++; in FillBufferWithValues()
172 Node* StateValuesCache::BuildTree(size_t* values_idx, Node** values, in BuildTree() argument
185 while (*values_idx < count && node_count < kMaxInputCount) { in BuildTree()
186 if (count - *values_idx < kMaxInputCount - node_count) { in BuildTree()
197 DCHECK_EQ(*values_idx, count); in BuildTree()
292 size_t values_idx = 0; in GetNodeForValues() local
[all …]
|
| H A D | state-values-utils.h | 61 size_t* values_idx,
66 Node* BuildTree(size_t* values_idx, Node** values, size_t count,
|
| /dports/devel/p5-Data-Perl/Data-Perl-0.002011/lib/Data/Perl/Role/Collection/ |
| H A D | Hash.pm | 31 my @values_idx = grep { $_ % 2 } 0..$#_;
33 @{$self}{@_[@keys_idx]} = @_[@values_idx];
|
| /dports/textproc/mifluz/mifluz-0.26.0/mifluz/ |
| H A D | WordDBCompress.cc | 180 values_idx[i] = 0; in Clear()
217 if(values_idx[what] >= values_length[what]) { in ShiftValue()
218 …BEncoded::ShiftValue: what = %d, (idx = %d) >= (length = %d)\n", what, values_idx[what], values_le… in ShiftValue()
221 return values[what][values_idx[what]++]; in ShiftValue()
239 int values_idx[WORD_CMPR_VAL_ARRAY_SIZE]; member in WordDBEncoded
|
| /dports/databases/timescaledb/timescaledb-2.5.1/tsl/src/ |
| H A D | chunk_api.c | 755 const int values_idx = AttrNumberGetAttrOffset(Anum_chunk_colstats_slot1_values) + i; in collect_colstat_slots() local
770 nulls[values_idx] = true; in collect_colstat_slots()
826 values[values_idx] = PointerGetDatum(array); in collect_colstat_slots()
831 nulls[values_idx] = true; in collect_colstat_slots()
|
| /dports/sysutils/tracker3/tracker-3.1.2/src/libtracker-data/ |
| H A D | tracker-sparql.c | 149 gint values_idx; member
5518 sparql->current_state->values_idx++; in translate_DataBlock()
5520 sparql->current_state->values_idx); in translate_DataBlock()
5535 sparql->current_state->values_idx); in translate_DataBlock()
|