HomeSort by: relevance | last modified time | path
    Searched defs:components (Results 1 - 25 of 27) sorted by relevancy

1 2

  /src/external/apache2/llvm/dist/llvm/tools/llvm-go/
llvm-go.go 9 // This tool lets us build LLVM components within the tree by setting up a
43 var components = []string{ var
91 args := append([]string{"--ldflags", "--libs", "--system-libs"}, components...)
130 fmt.Println(strings.Join(components, " "))
243 Available subcommands: build get install run test print-components print-config`)
304 case "print-components":
  /src/external/gpl3/gcc/dist/contrib/
gen_autofdo_event.py 107 components = n[0].split("-") variable
108 model = components[2]
  /src/external/gpl3/gcc.old/dist/contrib/
gen_autofdo_event.py 106 components = n[0].split("-") variable
107 model = components[2]
  /src/crypto/external/bsd/heimdal/dist/lib/asn1/
asn1-common.h 47 unsigned *components; member in struct:heim_oid
  /src/external/gpl2/groff/dist/src/include/
color.h 36 unsigned int components[4]; member in class:color
73 // Return the actual color scheme and retrieve the color components
77 // retrieve the components of a color
87 #define Cyan components[0]
88 #define Magenta components[1]
89 #define Yellow components[2]
90 #define Black components[3]
92 #define Red components[0]
93 #define Green components[1]
94 #define Blue components[2
    [all...]
  /src/external/gpl3/gdb.old/dist/gdb/
gdbarch.py 25 # `gdbarch_types.components`.
28 from gdbarch_types import Component, Function, Info, Value, components namespace
42 "Filter function to only allow Info components."
47 "Filter function to omit Info components."
58 # Do Info components first.
59 for c in filter(info, components):
72 # non-Info components.
73 for c in filter(not_info, components):
142 for c in filter(info, components):
149 for c in filter(not_info, components)
    [all...]
  /src/external/gpl3/gdb/dist/gdb/
gdbarch.py 25 # `gdbarch_types.components`.
28 from gdbarch_types import Component, Function, Info, Value, components namespace
42 "Filter function to only allow Info components."
47 "Filter function to omit Info components."
58 # Do Info components first.
59 for c in filter(info, components):
72 # non-Info components.
73 for c in filter(not_info, components):
142 for c in filter(info, components):
149 for c in filter(not_info, components)
    [all...]
  /src/external/mit/isl/dist/doc/
implementation.tex 1422 \subsection{Decomposing $R$ into strongly connected components}
1427 an approximation of each strongly connected components separately.
1432 \label{eq:transitive:components}
1447 strongly connected components in the graph with as vertices
1458 The components can be obtained from the graph by applying
1465 strongly connected components. Simply applying Tarjan's
1466 algorithm will produce topologically sorted strongly connected components.
1471 If the approximation turns out to be inexact for any of the components,
1473 is skipped on the components that still need to be handled.
1475 It should be noted that \eqref{eq:transitive:components}
    [all...]
  /src/external/gpl3/gdb.old/dist/gdb/python/
py-param.c 421 std::vector<std::string> components
423 gdb_assert (components.size () > 1);
424 std::string result = components[1];
425 for (int i = 2; i < components.size (); ++i)
426 result += " " + components[i];
420 std::vector<std::string> components local
  /src/external/gpl3/gdb/dist/gdb/python/
py-param.c 443 std::vector<std::string> components
445 gdb_assert (components.size () > 1);
446 std::string result = components[1];
447 for (int i = 2; i < components.size (); ++i)
448 result += " " + components[i];
442 std::vector<std::string> components local
  /src/sbin/raidctl/
raidctl.c 497 printf("Components:\n");
707 printf("# WARNING: no optimal components; using %s\n",
1259 char *components[RF_MAXCOL]; local
1278 /* remaining args must be components */
1281 components[i-1] = argv[i];
1285 /* Level 0 must have at least two components.
1286 Level 1 must have exactly two components.
1287 Level 5 must have at least three components. */
1301 strlcpy(cfg.devnames[0][i], components[i],
1326 /* 4 components makes 3 data components. No power of 2 i
    [all...]
  /src/external/apache2/llvm/dist/clang/lib/CodeGen/
CGVTables.cpp 755 // with the local symbol. As a temporary solution, fill these components
910 auto components = builder.beginStruct(); local
911 createVTableInitializer(components, *VTLayout, RTTI,
913 components.finishAndSetAsInitializer(VTable);
ItaniumCXXABI.cpp 1751 auto components = builder.beginStruct(); local
1752 CGVT.createVTableInitializer(components, VTLayout, RTTI,
1754 components.finishAndSetAsInitializer(VTable);
MicrosoftCXXABI.cpp 1730 auto components = builder.beginStruct(); local
1731 CGVT.createVTableInitializer(components, VTLayout, RTTI,
1733 components.finishAndSetAsInitializer(VTable);
  /src/external/gpl2/groff/dist/src/devices/grodvi/
dvi.cpp 315 unsigned int components[4]; local
316 color_scheme cs = col->get_components(components);
  /src/external/gpl3/gcc/dist/libstdc++-v3/src/c++17/
fs_path.cc 459 // Nobody should need paths with this many components.
466 size_t components; local
467 if (__builtin_mul_overflow(newcap, sizeof(value_type), &components)
468 || __builtin_add_overflow(sizeof(_Impl), components, &bytes))
  /src/external/gpl3/gdb.old/dist/gdb/cli/
cli-cmds.c 2311 std::vector<std::string> components
2313 std::string full_name = components[0];
2314 for (int i = 1; i < components.size (); ++i)
2315 full_name += " " + components[i];
2305 std::vector<std::string> components local
  /src/external/gpl3/gdb/dist/gdb/cli/
cli-cmds.c 2354 std::vector<std::string> components
2356 std::string full_name = components[0];
2357 for (int i = 1; i < components.size (); ++i)
2358 full_name += " " + components[i];
2348 std::vector<std::string> components local
  /src/external/mpl/bind/dist/lib/ns/
xfrout.c 503 rrstream_t *components[3]; member in struct:compound_rrstream
543 s->components[0] = *soa_stream;
544 s->components[1] = *data_stream;
545 s->components[2] = *soa_stream;
560 rrstream_t *curstream = s->components[s->state];
569 rrstream_t *curstream = s->components[s->state];
581 curstream = s->components[s->state];
594 curstream = s->components[s->state];
603 curstream = s->components[s->state];
610 s->components[0]->methods->destroy(&s->components[0])
    [all...]
  /src/external/gpl3/gcc/dist/gcc/config/rs6000/
rs6000-logue.cc 2613 Components 13..31 are the save/restore of GPR13..GPR31.
2614 Components 46..63 are the save/restore of FPR14..FPR31. */ local
2618 sbitmap components = sbitmap_alloc (cfun->machine->n_components);
2619 bitmap_clear (components);
2636 bitmap_set_bit (components, regno);
2644 bitmap_clear_bit (components, HARD_FRAME_POINTER_REGNUM);
2650 bitmap_clear_bit (components, RS6000_PIC_OFFSET_TABLE_REGNUM);
2663 bitmap_set_bit (components, regno);
2684 bitmap_set_bit (components, 0);
2689 bitmap_set_bit (components, 2)
2700 sbitmap components = sbitmap_alloc (cfun->machine->n_components); local
    [all...]
  /src/external/gpl3/gcc/dist/gcc/
tree-predcom.cc 42 independent groups (i.e., we find components of a data dependence
366 /* Components of the data dependence graph. */
433 /* Splits dependence graph to components. */
436 /* Check the conditions on references inside each of components COMPS,
437 and remove the unsuitable components from the list. */
440 /* Find roots of the values and determine distances in components COMPS,
724 /* Frees list of components COMPS. */
759 components, A and B are components to merge. */
886 components. *
3376 struct component *components; local
    [all...]
  /src/external/gpl3/gcc.old/dist/gcc/config/rs6000/
rs6000-logue.cc 2620 Components 13..31 are the save/restore of GPR13..GPR31.
2621 Components 46..63 are the save/restore of FPR14..FPR31. */ local
2625 sbitmap components = sbitmap_alloc (cfun->machine->n_components);
2626 bitmap_clear (components);
2643 bitmap_set_bit (components, regno);
2651 bitmap_clear_bit (components, HARD_FRAME_POINTER_REGNUM);
2657 bitmap_clear_bit (components, RS6000_PIC_OFFSET_TABLE_REGNUM);
2670 bitmap_set_bit (components, regno);
2691 bitmap_set_bit (components, 0);
2696 bitmap_set_bit (components, 2)
2707 sbitmap components = sbitmap_alloc (cfun->machine->n_components); local
    [all...]
  /src/external/gpl3/gcc.old/dist/gcc/
tree-predcom.cc 42 independent groups (i.e., we find components of a data dependence
366 /* Components of the data dependence graph. */
433 /* Splits dependence graph to components. */
436 /* Check the conditions on references inside each of components COMPS,
437 and remove the unsuitable components from the list. */
440 /* Find roots of the values and determine distances in components COMPS,
724 /* Frees list of components COMPS. */
759 components, A and B are components to merge. */
886 components. *
3345 struct component *components; local
    [all...]
  /src/external/gpl2/groff/dist/src/roff/troff/
node.cpp 1225 unsigned int components[4]; local
1227 cs = col->get_components(components);
1279 unsigned int components[4]; local
1281 cs = col->get_components(components);
  /src/external/gpl3/gcc/dist/gcc/config/loongarch/
loongarch.cc 8046 sbitmap components = sbitmap_alloc (FIRST_PSEUDO_REGISTER); local
8047 bitmap_clear (components);
8065 bitmap_set_bit (components, regno);
8078 bitmap_set_bit (components, regno);
8085 bitmap_clear_bit (components, HARD_FRAME_POINTER_REGNUM);
8087 bitmap_clear_bit (components, RETURN_ADDR_REGNUM);
8089 return components;
8101 sbitmap components = sbitmap_alloc (FIRST_PSEUDO_REGISTER); local
8102 bitmap_clear (components);
8118 bitmap_set_bit (components, regno)
    [all...]

Completed in 56 milliseconds

1 2