Basic Data Structures and Algorithms in the Linux Kernel

Re:Basic Data Structures and Algorithms in the Linux Kernel by octo_t on Monday November 25, 2013 @06:55AM (#6793581)

I'm guessing you mean "can't use GPL'd code" here.

embedded work is different, in that you often embed your container in your data-structure, so you end up with something like:

  typedef struct {
    int x;
    int y;
    Point *next;
  } Point;

this allows you to save on overhead of extra allocations when creating your list (but does mean you need to create extra functions for

  Point* find_list(Point* p, int x, int y);

[ Parent | on HN ]

Re:Basic Data Structures and Algorithms in the Linux Kernel by eps on Monday November 25, 2013 @11:23AM (#6794972)

That's not what he meant.

He meant that GP is so dumb that he is forced to use Linux .h in his project (along with all arch dependencies) rather than to take 5 minutes and code it from scratch. And that he is ignorant of licensing matters of GPL'd code or, more likely, he just doesn't give a f_ck about them. That'd be the gist of what ExpiredLink meant.

[ Parent | on HN ]