search for: nonstat

Hi, it's time to start our redundant dhcp server setup and I found some suggestions and tutorials. But all setups I found use either static or nonstatic ip adress management. For the static setup I'd setup two servers and copy the configfile from the 'master' to the secondary server and do a dhcpd restart. For the nonstatic I have to setup pool and failover peer configurations to have the lease information synced. My question: Can...

Daniel, > This is an aggregate type that includes a type compatible > with the effective type of the object. In particular, > x->i is an lvalue expression of type "int" > b->a is an lvalue expression of type "struct A" > "struct A" is an aggregate type that includes "int" among > its members. > Therefore, the b->a

Daniel, Hal, I'm trying to figure out what we would need to do in terms of the current approach, accepting its limitations, to support unions, member arrays, aggregate accesses and type identifiers and what I get looks suspiciously simple. Can you please check it out and let me know if I'm missing something? For unions: TBAA, regardless of a specific approach, cannot guarantee

On Jun 16, 2012, at 8:23 PM, Cesar Mello wrote: > While this will make it compile, the code is not valid to begin with. > It is trying to do a raw memory copy of a non standard-layout type. > nameoffset is not guaranteed to directly follow cmdsize. Are you saying that in: struct A { int f1; // offset 0 int f2; // offset 4 }; struct B : public A { int f3; // offset

"then gcc does the right thing in both cases." There is no way it would ever affect execution semantics except through deletion, so ... On Sat, Aug 19, 2017 at 10:54 AM, Ivan A. Kosarev <ikosarev at accesssoftek.com > wrote: > Can you share the snippets you use? > > Reloading x->i may affect performance, but not necessarily execution > semantics. Sure > So

...split it as you suggest, into foo = *x, foo.i and bar = *b, b.a > > *x contains a struct containing an int. > > *b contains a struct containing a struct containing an int > > " an aggregate or union type that includes one of the aforementioned types > among its elements or nonstatic > data members (including, recursively, an element or non-static data member > of a subaggregate > or contained union)," > > This seems to fall into the "including, recursively" part. > > But, let's assume that is true for a second. > > GIven > str...

...dynamic >> type of the object, >> — a type that is the signed or unsigned type corresponding to a >> cv-qualified version of the dynamic type >> of the object, >> — an aggregate or union type that includes one of the aforementioned >> types among its elements or nonstatic >> data members (including, recursively, an element or non-static data >> member of a subaggregate >> or contained union), >> — a type that is a (possibly cv-qualified) base class type of the dynamic >> type of the object, >> — a char or unsigned char type. &...

OK thanks a lot Michael Spencer! After getting your latest commit now everything compiles on Visual Studio 2012 RC. I'm just playing around to learn. Maybe this is the funniest place to start assessing my possibilities of contributing to llvm in the free time: Writer* createWriterPECOFF(const WriterOptionsPECOFF &options) { assert(0 && "PE/COFF support not implemented

This version over last version: (1) Gets rid of the no_paravirt.h header and leaves native ops in place (with some reshuffling to keep then under one #ifdef). (2) Fixes the "X crashes with CONFIG_PARAVIRT=y" bug. (3) Puts __ex_table entry in paravirt iret. Another followup patch implements binary patching... Rusty. === Create a paravirt.h header for all the critical operations which

This version over last version: (1) Gets rid of the no_paravirt.h header and leaves native ops in place (with some reshuffling to keep then under one #ifdef). (2) Fixes the "X crashes with CONFIG_PARAVIRT=y" bug. (3) Puts __ex_table entry in paravirt iret. Another followup patch implements binary patching... Rusty. === Create a paravirt.h header for all the critical operations which

...::= <unresolved-name> # f(p), N::f(p), ::f(p), // # freestanding dependent name (e.g., T::x), // # objectless nonstatic member reference // ::= <expr-primary> template <class C> const char* parse_expression(const char* first, const char* last, C& db) { if (last - first >= 2) { const char* t = first; bool parsed_gs = false; if (last - first...