| /src/sys/arch/ia64/stand/ia64/ski/ |
| efi_stub.c | 138 uint32_t comps[8]; local
140 ssc((uint64_t)comps, 0, 0, 0, SSC_GET_RTC);
141 time->tm_year = comps[0] + 1900;
142 time->tm_mon = comps[1] + 1;
143 time->tm_mday = comps[2];
144 time->tm_hour = comps[3];
145 time->tm_min = comps[4];
146 time->tm_sec = comps[5];
|
| /src/external/gpl3/binutils/dist/libiberty/ |
| cp-demint.c | 211 di.comps = ((struct demangle_component *)
215 if (di.comps == NULL || di.subs == NULL)
217 free (di.comps);
235 *mem = di.comps;
237 free (di.comps);
|
| cp-demangle.h | 103 struct demangle_component *comps; member in struct:d_info
|
| cp-demangle.c | 960 p = &di->comps[di->next_comp];
6881 compare the sizes of the di.comps and di.subs arrays against the
6893 __extension__ struct demangle_component comps[di.num_comps]; local
6896 di.comps = comps;
6899 di.comps = alloca (di.num_comps * sizeof (*di.comps));
7181 __extension__ struct demangle_component comps[di.num_comps]; local
7184 di.comps = comps;
[all...] |
| /src/external/gpl3/binutils.old/dist/libiberty/ |
| cp-demint.c | 211 di.comps = ((struct demangle_component *)
215 if (di.comps == NULL || di.subs == NULL)
217 free (di.comps);
235 *mem = di.comps;
237 free (di.comps);
|
| cp-demangle.h | 103 struct demangle_component *comps; member in struct:d_info
|
| cp-demangle.c | 958 p = &di->comps[di->next_comp];
6832 compare the sizes of the di.comps and di.subs arrays against the
6844 __extension__ struct demangle_component comps[di.num_comps]; local
6847 di.comps = comps;
6850 di.comps = alloca (di.num_comps * sizeof (*di.comps));
7132 __extension__ struct demangle_component comps[di.num_comps]; local
7135 di.comps = comps;
[all...] |
| /src/external/gpl3/gcc.old/dist/libiberty/ |
| cp-demint.c | 211 di.comps = ((struct demangle_component *)
215 if (di.comps == NULL || di.subs == NULL)
217 free (di.comps);
235 *mem = di.comps;
237 free (di.comps);
|
| cp-demangle.h | 103 struct demangle_component *comps; member in struct:d_info
|
| cp-demangle.c | 945 p = &di->comps[di->next_comp];
6450 compare the sizes of the di.comps and di.subs arrays against the
6462 __extension__ struct demangle_component comps[di.num_comps]; local
6465 di.comps = comps;
6468 di.comps = alloca (di.num_comps * sizeof (*di.comps));
6750 __extension__ struct demangle_component comps[di.num_comps]; local
6753 di.comps = comps;
[all...] |
| /src/external/gpl3/gcc.old/dist/contrib/legacy/ |
| mklog | 297 comps = []
303 comps.append(l)
305 if not comps:
308 comps.reverse()
309 filename = '/'.join(comps)
|
| /src/external/bsd/openldap/dist/libraries/liblunicode/ucdata/ |
| ucgendat.c | 161 static _comp_t *comps; variable
1262 comps = (_comp_t *) malloc(comps_used * sizeof(_comp_t));
1267 comps[cu].comp = decomps[i].code;
1268 comps[cu].count = 2;
1269 comps[cu].code1 = decomps[i].decomp[0];
1270 comps[cu].code2 = decomps[i].decomp[1];
1274 qsort(comps, comps_used, sizeof(_comp_t), cmpcomps);
1518 * Now, if comps exist, write them out.
1524 (unsigned long) comps[i].comp, (unsigned long) comps[i].count
[all...] |
| /src/external/gpl3/gcc.old/dist/gcc/ |
| tree-predcom.cc | 436 /* Check the conditions on references inside each of components COMPS,
438 struct component *filter_suitable_components (struct component *comps);
440 /* Find roots of the values and determine distances in components COMPS,
442 void determine_roots (struct component *comps);
677 /* Dumps COMPS to FILE. */
681 dump_components (FILE *file, struct component *comps)
685 for (comp = comps; comp; comp = comp->next)
724 /* Frees list of components COMPS. */
727 release_components (struct component *comps)
731 for (act = comps; act; act = next
1021 auto_vec<struct component *> comps; local
[all...] |
| /src/external/gpl3/gcc.old/dist/gcc/cp/ |
| method.cc | 1264 comparisons COMPS, calculate the overall comparison category for
1268 common_comparison_type (vec<tree> &comps)
1272 for (unsigned i = 0; i < comps.length(); ++i)
1274 tree comp = comps[i];
1508 auto_vec<tree> comps;
1529 comps.safe_push (comp);
1626 comps.safe_push (comp);
1630 rettype = common_comparison_type (comps);
1638 for (unsigned i = 0; i < comps.length(); ++i)
1640 tree comp = comps[i]
[all...] |
| /src/dist/pf/sbin/pfctl/ |
| pfctl_optimize.c | 1197 } comps[] = PF_SKIP_COMPARITORS; local
1201 for (i = 0; i < sizeof(comps)/sizeof(*comps); i++)
1202 if (comps[i].skipnum == skipnum) {
1203 skip_comparitors[skipnum] = comps[i].func;
1204 skip_comparitors_names[skipnum] = comps[i].name;
|
| /src/external/apache2/llvm/dist/clang/lib/AST/ |
| Expr.cpp | 1517 ArrayRef<OffsetOfNode> comps,
1521 totalSizeToAlloc<OffsetOfNode, Expr *>(comps.size(), exprs.size()));
1523 return new (Mem) OffsetOfExpr(C, type, OperatorLoc, tsi, comps, exprs,
1536 ArrayRef<OffsetOfNode> comps, ArrayRef<Expr *> exprs,
1540 NumComps(comps.size()), NumExprs(exprs.size()) {
1541 for (unsigned i = 0; i != comps.size(); ++i)
1542 setComponent(i, comps[i]);
|
| /src/external/gpl3/gcc.old/dist/libphobos/src/std/algorithm/ |
| sorting.d | 2011 static uint comps;
2012 static bool less(int a, int b) { ++comps; return a < b; }
2026 assert(comps <= watermark, text("You seem to have pessimized sort! ",
2027 watermark, " < ", comps));
2028 assert(comps >= watermark, text("You seem to have improved sort!",
2029 " Please update watermark from ", watermark, " to ", comps));
|
| /src/external/apache2/llvm/dist/clang/include/clang/AST/ |
| Expr.h | 2393 ArrayRef<OffsetOfNode> comps, ArrayRef<Expr*> exprs,
2404 ArrayRef<OffsetOfNode> comps,
|
