Searched defs:order (Results 276 - 300 of 405) sorted by relevance

<<11121314151617

/external/icu/icu4c/source/test/cintltst/
H A Dcitertst.c797 uint32_t order; local
803 order = ucol_previous(iter, &status);
806 if (order == 0)
807 order = ucol_previous(iter, &status);
814 size = ucol_getMaxExpansion(iter, order);
824 uint32_t order; local
827 order = ucol_previous(iter, &status);
828 size = ucol_getMaxExpansion(iter, order);
980 if ((count > 250 && testorders[-- count].order != orders[1].order) ||
[all...]
/external/iproute2/tc/
H A Df_u32.c987 __u32 order = 0; local
1045 } else if (matches(*argv, "order") == 0) {
1047 if (get_u32(&order, *argv, 0)) {
1048 fprintf(stderr, "Illegal \"order\"\n");
1156 if (order) {
1157 if (TC_U32_NODE(t->tcm_handle) && order != TC_U32_NODE(t->tcm_handle)) {
1158 fprintf(stderr, "\"order\" contradicts \"handle\"\n");
1161 t->tcm_handle |= order;
1190 fprintf(f, "order %d ", TC_U32_NODE(handle));
/external/ipsec-tools/src/racoon/
H A Doakley.h163 vchar_t *order; member in struct:dhgroup
/external/libexif/libexif/
H A Dexif-data.c53 ExifByteOrder order; member in struct:_ExifDataPrivate
166 entry->tag = exif_get_short (d + offset + 0, data->priv->order);
167 entry->format = exif_get_short (d + offset + 2, data->priv->order);
168 entry->components = exif_get_long (d + offset + 4, data->priv->order);
189 doff = exif_get_long (d + offset + 8, data->priv->order);
244 data->priv->order, (ExifShort) e->tag);
246 data->priv->order, (ExifShort) e->format);
262 data->priv->order, e->components);
288 exif_set_long (*d + 6 + offset + 8, data->priv->order, doff);
387 n = exif_get_short (d + offset, data->priv->order);
1133 exif_data_set_byte_order(ExifData *data, ExifByteOrder order) argument
[all...]
/external/lzma/CPP/7zip/Archive/Common/
H A DHandlerOut.cpp277 UInt32 order = local
284 SetMethodProp(oneMethodInfo, NCoderPropID::kOrder, order);
/external/opencv/cv/src/
H A Dcvmoments.cpp43 /* The function calculates center of gravity and central second order moments */
573 // x_order - x order of the moment
574 // y_order - y order of the moment
582 int order = x_order + y_order; local
591 if( (x_order | y_order) < 0 || order > 3 )
594 moment = (&(moments->m00))[order + (order >> 1) + (order > 2) * 2 + y_order];
611 // x_order - x order of the moment
612 // y_order - y order o
620 int order = x_order + y_order; local
663 int order = x_order + y_order; local
[all...]
/external/openfst/src/include/fst/
H A Dqueue.h208 // used to compare two StateIds. If a (single) state's order changes,
296 // specialized to use the weight's natural order for the comparison function.
310 // Topological-order queue discipline, templated on the StateId.
317 // This constructor computes the top. order. It accepts an arc filter
334 // This constructor is passed the top. order, useful when we know it
336 TopOrderQueue(const vector<StateId> &order) argument
338 order_(order), state_(order.size(), kNoStateId) {}
382 // State order queue discipline, templated on the StateId.
435 // SCC topological-order met
[all...]
H A Drmepsilon.h252 // States sorted in topological order when (acyclic) or generic
253 // topological order (cyclic).
261 vector<StateId> order; local
263 TopOrderVisitor<Arc> top_order_visitor(&order, &acyclic);
271 states.resize(order.size());
272 for (StateId i = 0; i < order.size(); i++)
273 states[order[i]] = i;
/external/openssl/crypto/ec/
H A Dec_asn1.c178 ASN1_INTEGER *order; member in struct:ec_parameters_st
249 ASN1_SIMPLE(ECPARAMETERS, order, ASN1_INTEGER),
654 /* set the order */
660 ret->order = BN_to_ASN1_INTEGER(tmp, ret->order);
661 if (ret->order == NULL)
940 if (!params->order || !params->base || !params->base->data)
960 /* extract the order */
961 if ((a = ASN1_INTEGER_to_BN(params->order, a)) == NULL)
992 /* set the generator, order an
[all...]
H A Dec_curve.c107 0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF, /* order */
133 0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF, /* order */
169 0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF, /* order */
217 0x01,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF, /* order */
248 0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF, /* order */
274 0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF, /* order */
305 0x7F,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF, /* order */
336 0x7F,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF, /* order */
367 0x7F,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF, /* order */
399 0xFF,0xFF,0xFF,0xFF,0x00,0x00,0x00,0x00,0xFF,0xFF, /* order */
1940 BIGNUM *p=NULL, *a=NULL, *b=NULL, *x=NULL, *y=NULL, *order=NULL; local
[all...]
H A Dec_lib.c103 BN_init(&ret->order);
134 BN_free(&group->order);
157 BN_clear_free(&group->order);
219 if (!BN_copy(&dest->order, &src->order)) return 0;
284 int EC_GROUP_set_generator(EC_GROUP *group, const EC_POINT *generator, const BIGNUM *order, const BIGNUM *cofactor) argument
299 if (order != NULL)
300 { if (!BN_copy(&group->order, order)) return 0; }
302 BN_zero(&group->order);
319 EC_GROUP_get_order(const EC_GROUP *group, BIGNUM *order, BN_CTX *ctx) argument
[all...]
/external/speex/libspeex/
H A Dfilters.c54 void bw_lpc(spx_word16_t gamma, const spx_coef_t *lpc_in, spx_coef_t *lpc_out, int order) argument
58 for (i=0;i<order;i++)
657 int p, /*LPC order*/
/external/srec/tools/thirdparty/OpenFst/fst/lib/
H A Drmepsilon.h207 // States sorted in topological order when (acyclic) or generic
208 // topological order (cyclic).
215 vector<StateId> order; local
217 TopOrderVisitor<Arc> top_order_visitor(&order, &acyclic);
221 states.resize(order.size());
222 for (StateId i = 0; i < (StateId)order.size(); i++)
223 states[order[i]] = i;
/external/zopfli/src/zopfli/
H A Ddeflate.c58 Adds bits, like AddBits, but the order is inverted. The deflate specification
124 /* The order in which code length code lengths are encoded as per deflate. */
125 static const unsigned order[19] = { local
213 while (hclen > 0 && clcounts[order[hclen + 4 - 1]] == 0) hclen--;
221 AddBits(clcl[order[i]], 3, bp, out, outsize);
/external/chromium_org/base/message_loop/
H A Dmessage_loop_unittest.cc160 // Saves the order in which the tasks executed.
231 void MessageBoxFunc(TaskList* order, int cookie, bool is_reentrant) { argument
232 order->RecordStart(MESSAGEBOX, cookie);
236 order->RecordEnd(MESSAGEBOX, cookie);
240 void EndDialogFunc(TaskList* order, int cookie) { argument
241 order->RecordStart(ENDDIALOG, cookie);
247 order->RecordEnd(ENDDIALOG, cookie);
251 void RecursiveFunc(TaskList* order, int cookie, int depth, argument
253 order->RecordStart(RECURSIVE, cookie);
259 Bind(&RecursiveFunc, order, cooki
264 QuitFunc(TaskList* order, int cookie) argument
270 RecursiveFuncWin(MessageLoop* target, HANDLE event, bool expect_window, TaskList* order, bool is_reentrant) argument
326 TaskList order; local
370 TaskList order; local
[all...]
/external/chromium_org/third_party/WebKit/Source/wtf/
H A DPartitionAlloc.cpp166 size_t order; local
167 for (order = 0; order <= kBitsPerSizet; ++order) {
169 if (order < kGenericNumBucketsPerOrderBits + 1)
172 orderIndexShift = order - (kGenericNumBucketsPerOrderBits + 1);
173 root->orderIndexShifts[order] = orderIndexShift;
175 if (order == kBitsPerSizet) {
179 subOrderIndexMask = ((1 << order) - 1) >> (kGenericNumBucketsPerOrderBits + 1);
181 root->orderSubIndexMasks[order]
[all...]
/external/chromium_org/third_party/freetype/src/pshinter/
H A Dpshalgo.h61 FT_Int order; member in struct:PSH_HintRec_
/external/chromium_org/third_party/harfbuzz-ng/src/
H A Dhb-uniscribe.cc259 unsigned int order; member in struct:active_feature_t
263 a->order < b->order ? -1 : a->order > b->order ? 1 :
614 feature.order = i;
638 feature.order = num_features + 1;
879 /* Asking for glyphs in logical order circumvents at least
/external/chromium_org/third_party/icu/source/i18n/
H A Ddtitvfmt.cpp927 * in order to get interval patterns for 'y' differ,
1061 UBool order = fInfo->getDefaultOrder(); local
1062 setIntervalPattern(field, intervalPattern, order);
1071 UBool order = laterDateFirst; local
1077 order = true;
1084 order = false;
1099 setPatternInfo(field, &firstPart, &secondPart, order);
H A Ducal.cpp685 UResourceBundle *order = ures_getByKey(rb, prefRegion, NULL, status); local
688 order = ures_getByKey(rb, "001", NULL, status);
696 for (int i = 0; i < ures_getSize(order); i++) {
698 const UChar *type = ures_getStringByIndex(order, i, &len, status);
731 ures_close(order);
H A Ducol_bld.cpp628 uint32_t order = 0; local
638 order = ucol_getNextCE(UCA, &s, status);
639 if(isContinuation(order)) {
643 if((order&UCOL_CASE_BIT_MASK)== UCOL_UPPER_CASE) {
892 uint32_t order = 0; local
896 order = ucol_getNextCE(src->UCA, &s, status);
897 if(order == UCOL_NO_MORE_CES) {
900 tok->expCEs[tok->noOfExpCEs++] = order;
1381 * in order that they are to be applied as defaults and in synch with the UColReorderCode enum.
/external/chromium_org/third_party/icu/source/test/cintltst/
H A Dcallcoll.c474 int32_t order; local
483 while ((order=ucol_next(iter, &status)) != UCOL_NULLORDER)
496 orders[size].order = order;
541 if (o != orders[idx].order) {
545 while (idx > 0 && orders[-- idx].order == 0) {
549 if (o != orders[idx].order) {
550 log_err("Mismatched order at index %d: 0x%8.8X vs. 0x%8.8X\n", idx,
551 orders[idx].order, o);
567 while (idx != 0 && orders[idx - 1].order
[all...]
/external/chromium_org/third_party/openmax_dl/dl/sp/src/arm/neon/
H A DomxSP_FFTFwd_RToCCS_S16_Sfs_s.S67 #define order r14 define
170 CLZ order,N @ N = 2^order
171 RSB order,order,#31
174 CMP order,#3
175 BGT orderGreaterthan3 @ order > 3
177 CMP order,#1
178 BGE orderGreaterthan0 @ order > 0
179 M_STR scale, diffOnStack,LT @ order
[all...]
/external/chromium_org/v8/src/compiler/
H A Dscheduler.cc33 // Visits the control edges of the graph backwards from end in order to find
400 // rewritten to use a pre-order traversal from the start instead.
618 // Add collected nodes for basic blocks to their blocks in the right order.
832 static void PrintRPO(int num_loops, LoopInfo* loops, BasicBlockVector* order) { argument
844 for (int i = 0; i < static_cast<int>(order->size()); i++) {
845 BasicBlock* block = (*order)[i];
864 BasicBlockVector* order) {
865 DCHECK(order->size() > 0);
866 DCHECK((*order)[0]->id() == 0); // entry should be first.
874 DCHECK(header->rpo_number_ < static_cast<int>(order
863 VerifySpecialRPO(int num_loops, LoopInfo* loops, BasicBlockVector* order) argument
946 BlockList* order = NULL; local
[all...]
/external/chromium_org/v8/src/
H A Dscopes.cc571 VarAndOrder(Variable* var, int order) : var_(var), order_(order) { } argument
573 int order() const { return order_; } function in class:v8::internal::VarAndOrder
620 vars.Add(VarAndOrder(var, p->order), zone());
1273 // order is relevant!
1328 vars.Add(VarAndOrder(var, p->order), zone());

Completed in 428 milliseconds

<<11121314151617