/haiku-fatelf/src/libs/compat/freebsd_network/compat/sys/ |
H A D | kernel.h | 41 #define SYSINIT(uniquifier, subsystem, order, func, ident) \ 44 #define SYSUNINIT(uniquifier, subsystem, order, func, ident) \
|
H A D | module.h | 18 #define DECLARE_MODULE(name, data, sub, order)
|
H A D | haiku-module.h | 259 #define DRIVER_MODULE_ORDERED(name, busname, driver, devclass, evh, arg, order) \
|
/haiku-fatelf/headers/build/host/sunos/ |
H A D | endian.h | 17 #error Unable to determine byte order!
|
/haiku-fatelf/src/system/libroot/posix/glibc/include/arch/ppc/bits/ |
H A D | endian.h | 34 # warning Cannot determine current byte order, assuming big-endian.
|
/haiku-fatelf/src/bin/coreutils/src/ |
H A D | comm.c | 87 {"check-order", no_argument, NULL, CHECK_ORDER_OPTION}, 88 {"nocheck-order", no_argument, NULL, NOCHECK_ORDER_OPTION}, 127 --check-order check that the input is correctly sorted, even\n\ 129 --nocheck-order do not check that the input is correctly sorted\n\ 191 WHATFILE are presented in order. 193 If the user specified --nocheck-order, the check is not made. 194 If the user specified --check-order, the problem is fatal. 212 int order; 215 order = xmemcoll (prev->buffer, prev->length - 1, 218 order 210 int order; local 283 int order; local [all...] |
/haiku-fatelf/src/add-ons/accelerants/radeon_hd/ |
H A D | ringqueue.cpp | 37 int order; local 39 for (order = 0, tmp = size; tmp >>= 1; ++order); 40 if (size & ~(1 << order)) 41 ++order; 42 return order;
|
/haiku-fatelf/src/bin/gdb/opcodes/ |
H A D | d10v-dis.c | 29 struct disassemble_info *info, int order)); 233 dis_2_short (insn, memaddr, info, order) 237 int order; 279 switch (order) 283 order = -1; 287 order = -1; 291 order = -1;
|
H A D | ia64-gen.c | 121 /* Remember the order encountered in the opcode tables. */ 122 int order; member in struct:completer_entry 161 alphabetical order. */ 1699 add_dis_table_ent (which, insn, order, completer_index) 1702 int order; 1728 ent->priority = order; 1757 opcodenum, order, completer_index) 1763 int order; 1773 opcodenum, order, 1792 insert_bit_table_ent (next, bit - 1, opcode, mask, opcodenum, order, [all...] |
/haiku-fatelf/src/bin/coreutils/lib/ |
H A D | filevercmp.c | 61 order (unsigned char c) function 94 int s1_c = (s1_pos == s1_len) ? 0 : order (s1[s1_pos]); 95 int s2_c = (s2_pos == s2_len) ? 0 : order (s2[s2_pos]);
|
/haiku-fatelf/src/add-ons/translators/hpgs/lib/ |
H A D | hpgsscanline.c | 92 \c order 1 is the intersection order 96 \c order2 is the intersection order 100 the edge is inserted twice with an opposite sign in order to draw 144 using merge sort. Merge sort is used in order to preserve 145 the order of two equal x positions with opposite sign. 604 c->scanlines[iscan].points[j].order); 648 int order = x > d->x_last ? 1 : -1; local 650 if (hpgs_paint_scanline_add_point(d->c->scanlines+d->iscan_last,d->x_last,order)) 653 if (hpgs_paint_scanline_add_point(d->c->scanlines+d->iscan_last,x,-order)) 849 int iscan0,iscan1,order; local 1007 int order = x1 > d.x_last ? 1 : -1; local 1237 hpgs_bezier_clipper_alpha_cut_data_push(hpgs_bezier_clipper_alpha_cut_data *d, double t, double x, int iscan, int order, int o) argument 1330 int order = (int)((dscan-rdscan)*256.0+0.5); local 1425 int order = (int)((dscan1-rdscan1)*256.0+0.5); local 1443 int order = (int)((dscan1-rdscan1)*256.0+0.5); local 1515 int iscan0,iscan1,o,order; local 1774 int order = local 1795 int order = local 1815 int order = local [all...] |
H A D | hpgspaint.h | 174 int order; member in struct:hpgs_scanline_point_st 175 /*!< The order of the intersection. 176 An \c order of 1 means an upward intersection, -1 means a downward intersection. 178 x coordinate. If antialiasing is used, the order represents a delta of a broken down 179 winding value. A order of 256 means that the scanline is intersected from the bottom 181 point. if The order is smaller than 256, the physical row is not touched in its whole 210 more than one scanline per physical image row in order to caclulate
|
/haiku-fatelf/src/bin/gdb/libiberty/ |
H A D | floatformat.c | 100 /* floatformat for IEEE double, little endian byte order, with big endian word 224 get_field (data, order, total_len, start, len) 226 enum floatformat_byteorders order; 237 if (order == floatformat_little) 243 if (order == floatformat_little) 260 if (order == floatformat_little) 395 put_field (data, order, total_len, start, len, stuff_to_put) 397 enum floatformat_byteorders order; 408 if (order == floatformat_little) 417 if (order [all...] |
/haiku-fatelf/src/bin/gdb/gdb/ |
H A D | doublest.c | 50 get_field (unsigned char *data, enum floatformat_byteorders order, argument 58 if (order == floatformat_little || order == floatformat_littlebyte_bigword) 84 if (order == floatformat_little || order == floatformat_littlebyte_bigword) 94 switch (order) 131 source bytes that is in the right order since the unpacking 233 put_field (unsigned char *data, enum floatformat_byteorders order, 241 if (order == floatformat_little || order 232 put_field(unsigned char *data, enum floatformat_byteorders order, unsigned int total_len, unsigned int start, unsigned int len, unsigned long stuff_to_put) argument [all...] |
/haiku-fatelf/src/libs/print/libgutenprint/src/main/ |
H A D | xmlppd.c | 33 int order; member in struct:__anon5175 42 if (aa->order < bb->order) 44 else if (aa->order > bb->order) 212 order_t *order_array; /* Precedence order of options */ 237 * <option name="..." text="..." default="..." section="..." order="..." 437 * Get order and section for option 440 char order[256], /* Order number */ local 444 if (sscanf(value, "%255s%255s", order, sectio [all...] |
/haiku-fatelf/3rdparty/qtcreator/ |
H A D | create_project_files.pl | 9 files in order to make the haiku sources available within the qt-creator IDE.
|
/haiku-fatelf/src/add-ons/translators/exr/openexr/imath/ |
H A D | ImathEuler.h | 67 // must order the angles according to their priorities. So, the 79 // If instead, the order was YXZ for instance you would have to 90 // Notice how the order you put the angles into the three slots 93 // ijk vector order is the same as the enum. If you treat the 101 // that order, you can do this: 238 Order order() const; 270 // - reshuffles the xyz to match the order 289 // the order must be provided. 293 // might not make sense for Eulers with different order 304 Order order 753 legal(typename Euler<T>::Order order) argument 760 Euler<T>::order() const function in class:Imath::Euler 856 nearestRotation(Vec3<T> &xyzRot, const Vec3<T> &targetXyzRot, Order order) argument [all...] |
/haiku-fatelf/src/libs/print/libgutenprint/test/ |
H A D | pixma_parse.c | 32 1. change color loops to search for each named color rather than using a predefined order. 475 /* usual order */ 476 char order[]="CMYKcmykHRGABDEFIJLMNOPQSTUVWXZabdef"; local 478 /* char order[]="CMYkcmyKHRGABDEFIJLMNOPQSTUVWXZabdef";*/ 480 /*char order[]="CMYKcmkyHRGABDEFIJLMNOPQSTUVWXZabdef";*/ 482 /*char order[]="KCcMmYykRHGABDEFIJLMNOPQSTUVWXZabdef";*/ 484 /* char order[]="KCcMmYykRHGABDEFIJLMNOPQSTUVWXZabdef"; */ 509 img->color[i].name=order[i]; 531 if((order[i] == 'K' || order[ 560 const char order[]="CMYKcmykHRGABDEFIJLMNOPQSTUVWXZabdef"; local [all...] |
/haiku-fatelf/src/bin/gawk/ |
H A D | profile.c | 726 } order = NA; local 731 order = PRE; 736 order = PRE; 741 order = POST; 746 order = POST; 753 if (order == PRE) { 757 } else if (order == POST) {
|
/haiku-fatelf/headers/posix/netinet/ |
H A D | in.h | 46 # error Unknown byte order.
|
/haiku-fatelf/src/libs/print/libgutenprint/src/foomatic/ |
H A D | foomatic-generator.in | 393 my $order = 1000; 537 $numoptionorders{$1} = $order; 538 $template =~ s!\@\@ORDER\@\@!$order!g; 539 $order += 10; 547 $template =~ s!\@\@ORDER\@\@!$order!g; 548 $order += 10;
|
/haiku-fatelf/src/libs/zlib/ |
H A D | infback.c | 260 static const unsigned short order[19] = /* permutation of code lengths */ local 371 state->lens[order[state->have++]] = (unsigned short)BITS(3); 375 state->lens[order[state->have++]] = 0;
|
/haiku-fatelf/src/tools/docbook/libxslt/libxslt/ |
H A D | xsltutils.c | 901 * reorder the current node list @list accordingly to the document order 973 /* TODO: xsl:sort case-order attribute */ 1115 if ((comp->order == NULL) && (comp->has_order != 0)) { 1116 comp->order = xsltEvalAttrValueTemplate(ctxt, sorts[j], 1117 (const xmlChar *) "order", 1119 if (comp->order != NULL) { 1121 if (xmlStrEqual(comp->order, (const xmlChar *) "ascending")) 1123 else if (xmlStrEqual(comp->order, 1128 "xsltDoSortFunction: invalid value %s for order\n", 1129 comp->order); [all...] |
/haiku-fatelf/src/preferences/shortcuts/clv/ |
H A D | ColumnListView.h | 78 //Sets the display order: each int32 in the Order list specifies the column index of the 84 virtual void DisplayOrderChanged(const int32* order); 85 //Override this if you want to find out when the display order changed. 86 int32* DisplayOrder() const; //Gets the display order in the same format as that used by 96 //by column index and sort modes, in priority order. The pointers should point to an array
|
/haiku-fatelf/src/tools/ |
H A D | hta_committer.sh | 9 Options - in order of intended workflow:
|