1. 21 Sep, 2003 1 commit
    • Roger Dingledine's avatar
      bugfixes and note missing features · ed51df74
      Roger Dingledine authored
      deal with content-length headers better when reading http
      don't assume struct socks4_info is a packed struct
      fail the socks handshake if destip is zero
      flesh out conn_state_to_string() for dir conn
      fix typo (bug) in connection_handle_read()
      directory get is now called fetch, post is now upload
      reopen logs on sighup
      
      
      svn:r475
      ed51df74
  2. 18 Sep, 2003 1 commit
    • Roger Dingledine's avatar
      leave the socks handshake on the inbuf until it's complete · 078c5ab6
      Roger Dingledine authored
      this paves the way for supporting socks5 and other handshakes
      it also removes those pesky AP-only variables from connection_t
      
      also hacked a fix for a bug where some streams weren't ending properly --
      maybe because marked connections weren't flushing properly?
      
      
      svn:r472
      078c5ab6
  3. 17 Sep, 2003 1 commit
  4. 08 Sep, 2003 1 commit
  5. 07 Sep, 2003 1 commit
  6. 05 Sep, 2003 1 commit
  7. 04 Sep, 2003 1 commit
  8. 14 Aug, 2003 1 commit
  9. 05 Jul, 2003 1 commit
  10. 25 Jun, 2003 1 commit
  11. 17 Jun, 2003 1 commit
  12. 13 Jun, 2003 1 commit
  13. 20 May, 2003 1 commit
  14. 01 May, 2003 1 commit
  15. 16 Apr, 2003 1 commit
  16. 15 Apr, 2003 1 commit
  17. 07 Apr, 2003 1 commit
  18. 24 Mar, 2003 1 commit
  19. 19 Mar, 2003 3 commits
  20. 17 Mar, 2003 1 commit
  21. 10 Mar, 2003 1 commit
  22. 04 Mar, 2003 1 commit
  23. 26 Jan, 2003 1 commit
    • Roger Dingledine's avatar
      major overhaul: dns slave subsystem, topics · c35373a2
      Roger Dingledine authored
      on startup, it forks off a master dns handler, which forks off dns
      slaves (like the apache model). slaves as spawned as load increases,
      and then reused. excess slaves are not ever killed, currently.
      
      implemented topics. each topic has a receive window in each direction
      at each edge of the circuit, and sends sendme's at the data level, as
      per before. each circuit also has receive windows in each direction at
      each hop; an edge sends a circuit-level sendme as soon as enough data
      cells have arrived (regardless of whether the data cells were flushed
      to the exit conns). removed the 'connected' cell type, since it's now
      a topic command within data cells.
      
      at the edge of the circuit, there can be multiple connections associated
      with a single circuit. you find them via the linked list conn->next_topic.
      
      currently each new ap connection starts its own circuit, so we ought
      to see comparable performance to what we had before. but that's only
      because i haven't written the code to reattach to old circuits. please
      try to break it as-is, and then i'll make it reuse the same circuit and
      we'll try to break that.
      
      
      svn:r152
      c35373a2
  24. 28 Sep, 2002 1 commit
  25. 24 Aug, 2002 1 commit
  26. 23 Aug, 2002 1 commit
  27. 18 Jul, 2002 1 commit
    • Roger Dingledine's avatar
      Implemented congestion control · 267434bd
      Roger Dingledine authored
      Servers are allowed to send 100 cells initially, and can't send more until
      they receive a 'sendme' cell from that direction, indicating that they
      can send 10 more cells. As it currently stands, the exit node quickly
      runs out of window, and sends bursts of 10 whenever a sendme cell gets
      to him. This is much much much faster (and more flexible) than the old
      "give each circuit 1 kB/s and hope nothing overflows" approach.
      
      Also divided out the connection_watch_events into stop_reading,
      start_writing, etc. That way we can control them separately.
      
      
      svn:r54
      267434bd
  28. 16 Jul, 2002 2 commits
    • Roger Dingledine's avatar
      new config files, some bugfixes · c951c6f1
      Roger Dingledine authored
      
      svn:r51
      c951c6f1
    • Roger Dingledine's avatar
      Implemented link padding and receiver token buckets · 117cbeea
      Roger Dingledine authored
      Each socket reads at most 'bandwidth' bytes per second sustained, but
      can handle bursts of up to 10*bandwidth bytes.
      
      Cells are now sent out at evenly-spaced intervals, with padding sent
      out otherwise. Set Linkpadding=0 in the rc file to send cells as soon
      as they're available (and to never send padding cells).
      
      Added license/copyrights statements at the top of most files.
      
      router->min and router->max have been merged into a single 'bandwidth'
      value. We should make the routerinfo_t reflect this (want to do that,
      Mat?)
      
      As the bandwidth increases, and we want to stop sleeping more and more
      frequently to send a single cell, cpu usage goes up. At 128kB/s we're
      pretty much calling poll with a timeout of 1ms or even 0ms. The current
      code takes a timeout of 0-9ms and makes it 10ms. prepare_for_poll()
      handles everything that should have happened in the past, so as long as
      our buffers don't get too full in that 10ms, we're ok.
      
      Speaking of too full, if you run three servers at 100kB/s with -l debug,
      it spends too much time printing debugging messages to be able to keep
      up with the cells. The outbuf ultimately fills up and it kills that
      connection. If you run with -l err, it works fine up through 500kB/s and
      probably beyond. Down the road we'll want to teach it to recognize when
      an outbuf is getting full, and back off.
      
      
      svn:r50
      117cbeea
  29. 02 Jul, 2002 1 commit
  30. 30 Jun, 2002 1 commit
  31. 26 Jun, 2002 1 commit