• Announcements

    • khawk

      Download the Game Design and Indie Game Marketing Freebook   07/19/17

      GameDev.net and CRC Press have teamed up to bring a free ebook of content curated from top titles published by CRC Press. The freebook, Practices of Game Design & Indie Game Marketing, includes chapters from The Art of Game Design: A Book of Lenses, A Practical Guide to Indie Game Marketing, and An Architectural Approach to Level Design. The GameDev.net FreeBook is relevant to game designers, developers, and those interested in learning more about the challenges in game development. We know game development can be a tough discipline and business, so we picked several chapters from CRC Press titles that we thought would be of interest to you, the GameDev.net audience, in your journey to design, develop, and market your next game. The free ebook is available through CRC Press by clicking here. The Curated Books The Art of Game Design: A Book of Lenses, Second Edition, by Jesse Schell Presents 100+ sets of questions, or different lenses, for viewing a game’s design, encompassing diverse fields such as psychology, architecture, music, film, software engineering, theme park design, mathematics, anthropology, and more. Written by one of the world's top game designers, this book describes the deepest and most fundamental principles of game design, demonstrating how tactics used in board, card, and athletic games also work in video games. It provides practical instruction on creating world-class games that will be played again and again. View it here. A Practical Guide to Indie Game Marketing, by Joel Dreskin Marketing is an essential but too frequently overlooked or minimized component of the release plan for indie games. A Practical Guide to Indie Game Marketing provides you with the tools needed to build visibility and sell your indie games. With special focus on those developers with small budgets and limited staff and resources, this book is packed with tangible recommendations and techniques that you can put to use immediately. As a seasoned professional of the indie game arena, author Joel Dreskin gives you insight into practical, real-world experiences of marketing numerous successful games and also provides stories of the failures. View it here. An Architectural Approach to Level Design This is one of the first books to integrate architectural and spatial design theory with the field of level design. The book presents architectural techniques and theories for level designers to use in their own work. It connects architecture and level design in different ways that address the practical elements of how designers construct space and the experiential elements of how and why humans interact with this space. Throughout the text, readers learn skills for spatial layout, evoking emotion through gamespaces, and creating better levels through architectural theory. View it here. Learn more and download the ebook by clicking here. Did you know? GameDev.net and CRC Press also recently teamed up to bring GDNet+ Members up to a 20% discount on all CRC Press books. Learn more about this and other benefits here.


  • Content count

  • Joined

  • Last visited

Community Reputation

864 Good

About rick_appleton

  • Rank
  1. I'm wondering about something that I haven't been able to find much info on. Assuming Virtual Texturing, how do you integrate materials with non-virtual textures? What ID to give meshes with that material, so that it is rendered into the feedback buffer, and so you know that that ID maps to an unloaded piece of plain old texture. I see two options: I can give it any unique number initially, and then when it is actually needed to be paged into the physical texture change the ID so that it points at the right location in the indirection texture. Manage a BSP for the entire Virtual Texture space. Then when a plain texture comes in, find a place in the virtual texture that is empty, and assign it an id for that space. No need to actually load the texture yet, until the system determines that id is needed. In this case the ID will always point to a valid place in the indirection texture. Is either of these the 'usual' solution or am I missing something?
  2. [quote name='Hodgman' timestamp='1335344151' post='4934666'] One way to fix this, is to keep using your hash-map as usual, but generate the above keys array on each update - i.e. extract the map's keys and sort them by it's values before running the update loop. [/quote] I think this will only work if the components are sorted. If the array with components is not sorted by ID it'll give incorrect results. [quote name='Hodgman' timestamp='1335344151' post='4934666'] N.B. sorting your entire systems can be handy too sometimes. e.g. if Render held [A,B,C,D], but Location held [D,A,C,B], then your update function is going to be iterating forward through the render array, but randomly through the location array. If you first sort them both by their entity IDs, then your update function will be faster due to better cache patterns. [/quote] This is the main idea of having the extra indirection there [img]http://public.gamedev.net//public/style_emoticons/default/biggrin.png[/img] I didn't think of eliminating the values array like that, it's definately a good point. It makes it a bit easier to think about that way, since I then only need to reconcile the two arrays: [code] array from LocationSystem: [0, 1, 2]; array from RenderSystem: [0, 2]; [/code] I think I can safely set the extra limitation that those indexes will be sorted, although that does mean I'll need to move a lot of components if I erase an item in the middle.
  3. I've started working on an Entity Component System where an entity is only an ID and all the data is held in the different systems. As an example I have two systems: RenderSystem and LocationSystem. Each system stores the data of the entities that have that component in a flat array, and has map of 'entity id'->'array index' for that system. - LocationSystem contains a position/orientation/bounding box for each entity - RenderSystem renders each entity using it's position/orientation Now imagine I have three entities: [code] Entity 0: Location Render Entity 1: Location Entity 2: Location Render In the LocationSystem the contents will look like this: array = [Location Component A, Location Component B, Location Component C] map = [0->0, 1->1, 2->2] In the RenderSystem the contents will look like this: array = [Render Component A, Render Component B] map = [0->0, 2->1] [/code] Currently the update for each system is called manually, passing in the map and array from the other systems that are needed, such that each system can then get at the proper data (basically a gather operation): [code] renderSystem->update( locationSystem.map, locationSystem.array ); [/code] [code] RenderSystem::Update( lsMap, lsArray ) { for( entityID in this.map ) { RenderComponent rc = this.array[this.map[entityID]]; LocationComponent lc = lsArray[lsMap[entityID]]; // Do stuff with the two components here } } [/code] However, I'd like to change this so that the system can iterate over it's own array in it's update function, and doesn't need to bother with the map: [code] RenderSystem::UpdateNew( ... ) { for( i in this.array ) { RenderComponent rc = this.array[i]; LocationComponent lc = ???; // Do stuff with the two components here } } [/code] I guess I could do the reverse lookup outside the function, but I'm wondering if there is some kind of more efficient way to do this, taking into account that if an entity has a RenderComponent, then it also always has a LocationComponent.
  4. You'll need to give your exact matrices and draw call info for us to really help. It probably has to do with the sampling position of the texels. The best link I could find in a few minutes is http://www.gamedev.net/topic/396461-solved-pixel-perfect-textures-opengl/
  5. Thank you all for your replies. Looks like I'm not the only one then. And thanks for the tips everyone.
  6. I'm wondering how long it takes to compile your projects. Here at work, I am constantly waiting on the compiler. A full compile of the project takes hours! Touching a single file still takes minutes to compile.
  7. Thanks for the tips!
  8. Thank you all for your replies. I suspected the non-fundamental type thing, but always thought that HWND was actually a void*. After some digging it seems that by default HWND is actually a pointer to a proxy struct. However, adding #define NO_STRICT before including Windows.h reverts HWND to being an actual void* again, which causes the code to work as expected. It obviously won't work for other types, but I think I won't encounter anything else anyway.
  9. I'm having an issue with Visual Studio and Argument-Dependent Lookup of functions. The following code compiles without problem. [code]void testFunction( int i ) { printf("::\n"); } namespace n1 { void testFunction( int i ) { printf("n1\n"); } void callingFunction( void ) { testFunction(5); } }[/code] yet, this similar code doesn't. It gives me an error about ambigious call to overloaded function, due to finding the global function through ADL. [code]void testFunction2( HWND i ) //found using argument-dependent lookup { printf("::\n"); } namespace n1 { void testFunction2( HWND i ) { printf("n1\n"); } void callingFunction2( void ) { testFunction2((HWND)5); } }[/code] Is this correct behaviour or a compiler error? If it is correct, is there something I can do to fix this [b]WITHOUT[/b] explicitly adding which function I want called? I have a large list of generated functions and I want to selectively replace a few.
  10. [quote name='Excors' timestamp='1298153789' post='4776449'] Rows that are identical except for driver version are merged together, but otherwise nothing is discarded, since it seems useful to know the limits of not-the-most-recent drivers. The full data is downloadable as JSON from that page. [/quote] Thanks for the info. I could have used this just a week ago I'd also see the value in what driver versions support what extensions, so I'm wondering if you've got a specific reason for merging driver version together?
  11. After a couple more lengthy debug sessions involving gDebugger, glIntercept and lots of suppositions about the OpenGL state, I once again have gotten thoroughly frustrated by the state of OpenGL debugging tools. Being a programmer though, there is something I can do about that. As such I'd like to get a feeling for what useful features would be in such a tool. Some things I can think of, some of which are inspired by PIX or gDebugger: - Frame saving, replaying. Being able to exactly save the calls and data that generate a specific frame, and then replay them at will later. - Image and movie capture. - Shader debugging. - Performance analysis. - Bottleneck detection; (fillrate, vertex setup, texture bandwidth). - Error checking. - Deprecated function detection. - Live shader editing. - Viewing (and modification) of all data; textures, buffers, shaders - Stepping through calls. - See what calls render to specific pixel(s). What would be useful to you?
  12. [quote name='Buckeye' timestamp='1298469036' post='4777946'] Using sizeof( variable-name ) is poor coding practice, particular when you already know the size of the argument. I recommend, in your example, you use sizeof(bool) and sizeof(char*). sizeof() is not a function, it is a compile-time operator. Using a data-type as an argument for sizeof() rather than a variable-name will help remind you what you're really coding. I'm not sure of the intent of your example function. Just a comment that it might be better to copy the actual data to the log, rather than a pointer to the data. I.e., [code] memcpy( logmemory, &arg2, sizeof( arg2 ) ); // copies 4 bytes // maybe better is.. memcpy( logmemory, arg2, amountOfDataToCopy ); [/code] For instance, from your code, it appears that you expect arg2 to point to memory that will not change by the time you use whatever it is that arg2 points to. That is, are you certain that the string pointed to by arg2 (in your example) will still exist when you attempt to retrieve/interpret the string later? I.e., [code] // this is okay char *myStr = "Here's a log message."; // static string MyFunction( true, myStr ); // however char *myStr2 = new char[256]; // dynamic string strcpy( myStr2, ..someOtherString.. ); MyFunction( true, myStr2 ); delete[] myStr2; // now you're in trouble // if you later attempt to read from the myStr2 pointer you wrote to the log, // you'll probably get an error or access violation [/code] An alternative would be to read the string itself into your log file. I.e., use strlen(arg2), strcpy( yourlog, arg2 ), etc., rather than relying on the memory pointed to by arg2 to exist for the life of the app. Yeah, strlen and strcpy are deprecated, but I think you get the idea. [/quote] You are indeed correct. For now I'm not really interested in the contents of the pointers, I'm just going to print the value out. I realize this is not really useful info to have, but I can't very well leave out arguments if I'm logging the function calls. Later on I will indeed copy any info that is passed as a pointer. Likely I'll use a scratch heap for that as well, similar to how I plan to use scratch heaps to store the arguments on.
  13. [quote name='Promethium' timestamp='1298378644' post='4777500'] Is this C or C++? In C++ you can use templates to solve this in a single line. So you would have definitions like [code] class Log { template< typename ReturnT > void log( ReturnT r ) { ... } template< typename ReturnT, typename Arg1T > void log( ReturnT r, Arg1T a1 ) { ... } template< typename ReturnT, typename Arg1T, typename Arg2T > void log( ReturnT r, Arg1T a1, Arg2T a2 ) { ... } template< typename ReturnT, typename Arg1T, typename Arg2T, typename Arg3T > void log( ReturnT r, Arg1T a1, Arg2T a2, Arg3T a3 ) { ... } etc } [/code] and then in your function you let function overloading select the right version [code] int MyFunction( bool arg1, char* arg2 ) { log_instance.log( result, arg1, arg2 ); } [/code] Writing log functions for an arbitrary number of arguments will of course be a PITA, but that is where [url="http://www.boost.org/doc/libs/1_46_0/libs/preprocessor/doc/index.html"]Boost.Preprocessor[/url] comes in. It automates this kind of copy-paste code. What to do with different types of arguments can also be automated via template specialization. Start with a simple case for handling build-in types, and specialize it to handle any custom types you might decide to pass in. [code] template< typename T > struct Converter { size_t operator()( int ptr, T arg, size_t offset ) { memcpy((char*)offset, &arg, sizeof(arg)); return offset + sizeof( arg ); } } [/code] [/quote] Thanks for this. I'll likely go for something along these lines. [quote name='Antheus' timestamp='1298387893' post='4777540'] [quote name='rick_appleton' timestamp='1298365240' post='4777449'] Since the apps using this are usually high-performance, I don't want to take the time converting the parameters to a string inline with the function call. I've decided I want to store this data, and then in another thread I'll retrieve it and do the printing/analysing.[/quote] This is generally a bad idea. If processing the logs takes longer than it does to generate them, then logging thread will lag behind the main application. Since it stores unprocessed logs, it will consume increasing amounts of memory. And if logs can be processed faster than they are generated, then it makes no sense to shuffle them to another thread, just do it at call site. [quote]I think one of the fastest ways to store this data is to have a large block of memory, and simply 'push' the function pointer, the arguments, and the return value onto this sequentially.[/quote]True - what happens when this storage is exhausted? Do you block until memory is available? If so - then having a separate thread doesn't help - average throughput will be limited by how long it takes to process logs. With extra thread, there is also additional overhead so it's worse than just processing logs directly. And for high performance applications, operations should take O(1). Since some operations cannot be done in such time, different approach is often taken. Java VM, for example, is unsuitable for real time control due to garbage collection. Apart from being non-deterministic it also has unbounded running time, meaning that application can spend seconds, in worst case even minutes doing the GC pass. [/quote] I'm not sure I'm following you Antheus. In general I expect applications using this to fall in two categories: either high-performance multi-core, or high-performance single-core. The functions I will be logging will generally be accessed from a single, or at most two threads. The applications will be doing other stuff than just my logging, so on the main thread the logging will take a small amount of time compared to the total program time. It is this small amount of time that I want to minimize. If it's a single core application, then other cores will be free to be 'heavy' logging/analytics. If the application is truely CPU bound on all the cores, then the user will just have to take the resulting performance hit, and it won't really matter on which thread I do what. I'll be swapping blocks of memory, to keep the consumption down. However, I will take your comment into account. If the system is fully loaded, I expect it might be possible for the logs to be processed slower than they are generated, so I'll need to do something about the memory spiraling out of control. [quote name='CornyKorn21' timestamp='1298397772' post='4777608'] Isn't this where varargs become useful? Or am I misunderstanding what you're trying to do. [url="http://publications.gbdirect.co.uk/c_book/chapter9/stdarg.html"]http://publications....er9/stdarg.html[/url] [url="http://msdn.microsoft.com/en-us/library/fxhdxye9%28v=VS.100%29.aspx"]http://msdn.microsof...=VS.100%29.aspx[/url] [/quote] As far as I can tell varargs are useful when accessing a variable amount of arguments, not for storing them. I have many functions, each of which I know the exact number and type of arguments, and I want to store each call such that I can analyse it later. varargs might be useful at the other end though, when I decode this data. I also remembered an article by Mark Jawad about deferred function calling. It's in Game Programming Gems 7, so I'll take another look at that.
  14. [quote name='Ohforf sake' timestamp='1298366461' post='4777458'] AFAIK, in C call, a function has no way of knowing, how many parameters it got, it can only hope that it got at least the amount it needs. However if you are willing to supply the number of parameters of each function by hand, you could write a piece of code that walks back the stack (or extracts them from the registers, whatever calling convention you use), and writes them to your buffer in a loop. However, stuff like pointers or references will be just that. Pointers to some memory location that is probably no longer valid, when you check the log. But the same goes for your code above. [/quote] Thank you for your reply. This is pretty much the other option, and certainly more generic. Luckily the functions are plain C functions, and I do know the number of arguments, so I could certainly specify the number by hand. I already expect that however I end up solving this I'll always need to do that, and possibly explicitly note if there is a return value. Not having access to the memory pointed to by pointers is fine.
  15. For a logging utility I'm making I want to log function calls, with the parameters, and optionally the return value. Since the apps using this are usually high-performance, I don't want to take the time converting the parameters to a string inline with the function call. I've decided I want to store this data, and then in another thread I'll retrieve it and do the printing/analysing. I think one of the fastest ways to store this data is to have a large block of memory, and simply 'push' the function pointer, the arguments, and the return value onto this sequentially. The question I'm now pondering is how to do this efficiently, and in clear code. Each function that will be logged this way can have a different number and type of arguments. Since arguments can have different sizes (bool vs double), I suspect I'll need to use some template or define magic to get this done nicely. However, so far I've not been able to think of a nice way to do it other than writing it out for each argument. Basically I want to find a way to achieve the following with only a single line of code (or two when adding the return value): [code]int currentPositionInBlock; int MyFunction( bool arg1, char* arg2 ) { void* fncPtr = &MyFunction; memcpy((char*)currentPositionInBlock, &fncPtr, sizeof(fncPtr)); currentPositionInBlock += sizeof(fncPtr); memcpy((char*)currentPositionInBlock, &arg1, sizeof(arg1)); currentPositionInBlock += sizeof(arg1); memcpy((char*)currentPositionInBlock, &arg2, sizeof(arg2)); currentPositionInBlock += sizeof(arg2); int result = ... memcpy((char*)currentPositionInBlock, &result, sizeof(result)); currentPositionInBlock += sizeof(result); [/code] Of course I'll also need to retrieve this data and handle it, but since that isn't time sensitive and I know what function takes what parameters, I'm sure I'll manage that. Kind regards, Rick