Searched refs:generator (Results 1 - 14 of 14) sorted by relevance

/haiku/src/system/kernel/device_manager/
H A Did_generator.cpp10 whenever someone messes with the generator.
12 Whenever a generator is searched for, generator_lock is held.
18 sGeneratorLock instead of a generator specific lock during
70 static mutex sLock = MUTEX_INITIALIZER("id generator");
73 /*! Create new generator.
81 id_generator* generator = new(std::nothrow) id_generator(name); local
82 if (generator == NULL)
85 if (generator->name == NULL) {
86 delete generator;
90 sGenerators.Add(generator);
97 create_id_internal(id_generator* generator) argument
132 id_generator* generator = iterator.Next(); local
147 release_generator(id_generator *generator) argument
186 id_generator* generator = get_generator(name); local
214 id_generator* generator = get_generator(name); local
[all...]
/haiku/headers/libs/agg/
H A Dagg_conv_contour.h40 void line_join(line_join_e lj) { base_type::generator().line_join(lj); }
41 void inner_join(inner_join_e ij) { base_type::generator().inner_join(ij); }
42 void width(double w) { base_type::generator().width(w); }
43 void miter_limit(double ml) { base_type::generator().miter_limit(ml); }
44 void miter_limit_theta(double t) { base_type::generator().miter_limit_theta(t); }
45 void inner_miter_limit(double ml) { base_type::generator().inner_miter_limit(ml); }
46 void approximation_scale(double as) { base_type::generator().approximation_scale(as); }
47 void auto_detect_orientation(bool v) { base_type::generator().auto_detect_orientation(v); }
49 line_join_e line_join() const { return base_type::generator().line_join(); }
50 inner_join_e inner_join() const { return base_type::generator()
[all...]
H A Dagg_conv_stroke.h42 void line_cap(line_cap_e lc) { base_type::generator().line_cap(lc); }
43 void line_join(line_join_e lj) { base_type::generator().line_join(lj); }
44 void inner_join(inner_join_e ij) { base_type::generator().inner_join(ij); }
46 line_cap_e line_cap() const { return base_type::generator().line_cap(); }
47 line_join_e line_join() const { return base_type::generator().line_join(); }
48 inner_join_e inner_join() const { return base_type::generator().inner_join(); }
50 void width(double w) { base_type::generator().width(w); }
51 void miter_limit(double ml) { base_type::generator().miter_limit(ml); }
52 void miter_limit_theta(double t) { base_type::generator().miter_limit_theta(t); }
53 void inner_miter_limit(double ml) { base_type::generator()
[all...]
H A Dagg_conv_dash.h43 base_type::generator().remove_all_dashes();
48 base_type::generator().add_dash(dash_len, gap_len);
53 base_type::generator().dash_start(ds);
56 void shorten(double s) { base_type::generator().shorten(s); }
57 double shorten() const { return base_type::generator().shorten(); }
H A Dagg_conv_smooth_poly1.h16 // Smooth polygon generator
43 void smooth_value(double v) { base_type::generator().smooth_value(v); }
44 double smooth_value() const { return base_type::generator().smooth_value(); }
65 void smooth_value(double v) { m_smooth.generator().smooth_value(v); }
66 double smooth_value() const { return m_smooth.generator().smooth_value(); }
H A Dagg_conv_bspline.h35 void interpolation_step(double v) { base_type::generator().interpolation_step(v); }
36 double interpolation_step() const { return base_type::generator().interpolation_step(); }
H A Dagg_conv_marker_adaptor.h39 void shorten(double s) { base_type::generator().shorten(s); }
40 double shorten() const { return base_type::generator().shorten(); }
H A Dagg_conv_shorten_path.h38 void shorten(double s) { base_type::generator().shorten(s); }
39 double shorten() const { return base_type::generator().shorten(); }
H A Dagg_conv_adaptor_vcgen.h54 Generator& generator() { return m_generator; } function in class:agg::conv_adaptor_vcgen
55 const Generator& generator() const { return m_generator; } function in class:agg::conv_adaptor_vcgen
/haiku/src/tests/system/network/tcptester/
H A Dtcptester.cpp2 * A very simple controlable traffic generator for TCP testing.
28 uint8 generator; member in struct:context
100 ptr[i] = ctx->generator + '0';
101 ctx->generator = (ctx->generator + 1) % 10;
/haiku/src/kits/locale/
H A DDateTimeFormat.cpp56 DateTimePatternGenerator* generator local
84 UnicodeString pattern = generator->getBestPattern(
93 delete generator;
/haiku/src/tests/system/kernel/device_manager/playground/
H A Ddevice_manager.h91 int32 (*create_id)(const char *generator);
92 status_t (*free_id)(const char *generator, uint32 id);
/haiku/headers/os/drivers/
H A Ddevice_manager.h87 int32 (*create_id)(const char *generator);
88 status_t (*free_id)(const char *generator, uint32 id);
/haiku/src/apps/sudoku/
H A DSudokuWindow.cpp87 fThread = spawn_thread(_GenerateThread, "sudoku generator",
115 SudokuGenerator generator; local
118 generator.Generate(&fField, 40 - fLevel * 5, fProgress, &fQuit);

Completed in 86 milliseconds